Modern Database Management (12th Edition)
12th Edition
ISBN: 9780133544619
Author: Jeffrey A. Hoffer, Ramesh Venkataraman, Heikki Topi
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 5, Problem 5.40PAE
(a)
Program Plan Intro
Advantages of using pointers in file organization as compare to sequential file organization.
(b)
Program Plan Intro
Would it be possible to keep the records in multiple sequences in contrast to sequence file organization? Why or why not?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
A record company wishes to use a computer database to help with its operations regarding its performers, recordings and song catalogue.• Songs have a unique song number, a non-unique title and a composition date. A song can be written by a number of composers; the composer’s full name is required. Songs are recorded by recording artists (bands or solo performers). A song is recorded as a track of a CD. A CD has many songs on it, called tracks. CDs have a unique record catalogue number, a title and must have a producer(the full name of the producer is required). Each track must have the recording date and the track number of the CD.• A song can appear on many (or no) CDs, and be recorded by many different recording artists. The same recording artist might re-record the same song on different CDs. A CD must have only 1 recording artist appearing on it. CDs can be released a number of times, and each time the release date and associated number of sales is required?
I understand the intentions of a database, being to streamline the data record-keeping of any organizations. And I understand the hardware needed to do such. The area I find myself the most lost in is the idea of programming the rules and structure of a database. In my head a database is a chart (or multiple charts) with fields that is used to store records. And then those records stored in one chart intertwine with other charts of course so we need to have relationships between the charts. Where I get lost is in the thought of programming a structure for the data to fit in. Are we making metaphysical locations to store data or are we just writing relationshipds between data that is stored on a plethora of different options?
Give Advantages of using pointers in file organization as compare to sequential file organization.
Chapter 5 Solutions
Modern Database Management (12th Edition)
Ch. 5 - Prob. 5.1RQCh. 5 - Prob. 5.2RQCh. 5 - Prob. 5.3RQCh. 5 - Prob. 5.4RQCh. 5 - Prob. 5.5RQCh. 5 - Prob. 5.6RQCh. 5 - Prob. 5.7RQCh. 5 - Prob. 5.8RQCh. 5 - Explain why you sometimes have to reserve much...Ch. 5 - Why are field values sometimes coded?
Ch. 5 - Prob. 5.11RQCh. 5 - Prob. 5.12RQCh. 5 - Explain why normalized relations may not comprise...Ch. 5 - Prob. 5.14RQCh. 5 - List three common situations that suggest that...Ch. 5 - Explain the reasons why some experts are against...Ch. 5 - Prob. 5.17RQCh. 5 - Prob. 5.18RQCh. 5 - Prob. 5.19RQCh. 5 - Prob. 5.20RQCh. 5 - Prob. 5.21RQCh. 5 - State nine rules of thumb for choosing indexes.Ch. 5 - One of the strongest recommendations regarding...Ch. 5 - Explain why an index is useful only if there is...Ch. 5 - Indexing can clearly be very beneficial. Why...Ch. 5 - Consider the following two relations for...Ch. 5 - Prob. 5.28PAECh. 5 - Prob. 5.29PAECh. 5 - Prob. 5.30PAECh. 5 - Prob. 5.31PAECh. 5 - Suppose you are designing a default value for the...Ch. 5 - When a student has not chosen a major at a...Ch. 5 - Prob. 5.34PAECh. 5 - Prob. 5.35PAECh. 5 - Consider the relations in Problem and Exercise...Ch. 5 - Prob. 5.37PAECh. 5 - Prob. 5.38PAECh. 5 - Prob. 5.39PAECh. 5 - Prob. 5.40PAECh. 5 - Prob. 5.41PAECh. 5 - Consider the relations specified in Problem and...Ch. 5 - Prob. 5.43PAECh. 5 - Prob. 5.44PAECh. 5 - Prob. 5.45PAECh. 5 - Prob. 5.46PAECh. 5 - Prob. 5.47PAECh. 5 - Problems and Exercises 8-65 through 8-68 refer to...Ch. 5 - Refer to the large Pine Valley Furniture Company...Ch. 5 - Problems and Exercises 8-65i5 through 8-68 refer...Ch. 5 - Refer to Figure 4-5 0. For each of the following...
Knowledge Booster
Similar questions
- Suppose each record in a file were connected to the prior record and the next record in key sequence using pointers. Thus, each record might have the following format: Primary key, other attributes, pointer to prior record,pointer to next recorda. What would be the advantages of this file organization compared with a sequential file organization?b. In contrast with a sequential file organization, would it be possible to keep the records in multiple sequences? Why or why not?arrow_forward3. Index records comprise search-key values and data pointers. Multilevel index is stored on the disk along with the actual database files. As the size of the database grows, so does the size of the indices. If single-level index is used, then a large size index cannot be kept in memory which leads to multiple disk accesses. Multi-level Index helps in breaking down the index into several smaller indices in order to make the outermost level so small that it can be saved in a single disk block, which can easily be accommodated anywhere in the main memory. Why is there an immense need to keep the index records in the main memory?arrow_forwardConsider a file of 16384 records. Each record is 32 bytes long and its key field is of size 6 bytes. The file is ordered on a non-key field, and the file organization is unspanned. The file is stored in a file system with block size 1024 bytes, and the size of a block pointer is 10 bytes. If the secondary index is built on the key field of the file, and a multilevel index scheme is used to store the secondary index, the number of first-level and second-level blocks in the multilevel index are respectivelyarrow_forward
- Discuss the various file allocation methods used in file systems, such as contiguous allocation, linked allocation, and indexed allocation, highlighting their pros and cons.arrow_forward4. Given 200000 records, what is the average number of searches for a record stored in 1-level index-and-sequential structure (40 content files) and 2-level index-and-sequential structure (40 level-1 index files with 250 records in each)? Iarrow_forwardI understand the purpose of a database, which is to make data record-keeping easier for any company. And I'm aware of the hardware requirements. The concept of programming the rules and structure of a database is the area in which I am most confused. A database, in my mind, is a chart (or many charts) containing fields that are used to hold records. Then, of course, those records in one chart interweave with those in other charts, necessitating the creation of chart linkages. The concept of developing a framework for the data to fit into is where I get stuck. Are we creating metaphysical venues to store data, or are we just recording relationships between data saved on a variety of platforms?arrow_forward
- Design a Microsoft Access database file for managing project & employee data with tables, fields, relationships, and queries as given below. 1) Tables: Fields (keys in yellow, foreign keys in blue) Account: id (number), customer (number), balance (number), limit (number), status (short text, maximum length 10) Customer: id (number), last name (short text, maximum length 20), first name (short text, maximum length 20), title (short text, maximum length 4), address (short text, maximum length 40), zip code (short text, input mask 00000-0000), email (short text, maximum length 30), agent (number), birthday (short date format, mm/dd/yyyy) Agent: id (number), last name (short text, maximum length 20), first name (short text, maximum length 20), title (short text, maximum length 4), email (short text, maximum length 30), phone (short text with 000-000-0000 input mask), location (number) Location: id (number), code (number), name (short text, maximum length 20), address (short text,…arrow_forwardScripts and stored procedures are two distinct types of objects. In what manners do they exhibit differences from each other? Each of them engages in different activities. Is it more advantageous to utilize a database for the installation of Stored Procedures as opposed to employing an alternative method?arrow_forwardThe Database Technique is the preferred approach in the business sector nowadays when it comes to database construction. Take into account the following three justifications for why this approach is better than the File Approach:arrow_forward
- An advantage of the database management approach is O a. data is integrated and can be accessed by multiple programs O b. data is dependent on programs All choices are incorrect O d. data redundancy increasesarrow_forwardSuppose a file with 65536 records is organized using multi-level indexing as the file is ordered on a non-key field. Each record is 48 bytes long and the size of its key field is 4 bytes. The indexing is built on the key field of the file. The size of the disk block is 2 KB, and the block pointer size is 12 bytes. The file organization is unspanned. How many blocks will be required for the inner and outer index respectively in a multi-level index? 512 and 2 b) 512 and 4 e) 1024 and 4 d) 1024 and 8arrow_forwardWhy is an overflow block utilized in sequential file organization when there is only one overflow record at the moment?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning