Modern Database Management
13th Edition
ISBN: 9780134773650
Author: Hoffer
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 8, Problem 8.56PAE
(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
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?
Consider 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 respectively
3. 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?
Chapter 8 Solutions
Modern Database Management
Ch. 8 - Prob. 8.1RQCh. 8 - Prob. 8.2RQCh. 8 - Prob. 8.3RQCh. 8 - Prob. 8.4RQCh. 8 - Prob. 8.5RQCh. 8 - Prob. 8.6RQCh. 8 - Prob. 8.7RQCh. 8 - Prob. 8.8RQCh. 8 - Explain why you sometimes have to reserve much...Ch. 8 - Why are field values sometimes coded?
Ch. 8 - Prob. 8.11RQCh. 8 - Prob. 8.12RQCh. 8 - Explain why normalized relations may not comprise...Ch. 8 - Prob. 8.14RQCh. 8 - List three common situations that suggest that...Ch. 8 - Explain the reasons why some experts are against...Ch. 8 - Prob. 8.17RQCh. 8 - Prob. 8.18RQCh. 8 - Prob. 8.19RQCh. 8 - Prob. 8.20RQCh. 8 - Prob. 8.21RQCh. 8 - Prob. 8.22RQCh. 8 - One of the strongest recommendations regarding...Ch. 8 - Explain why an index is useful only if there is...Ch. 8 - Indexing can clearly be very beneficial. Why...Ch. 8 - Prob. 8.26RQCh. 8 - Prob. 8.27RQCh. 8 - Describe the role of data dictionary in the...Ch. 8 - Prob. 8.29RQCh. 8 - Prob. 8.30RQCh. 8 - Explain how creating a view may increase data...Ch. 8 - Prob. 8.32RQCh. 8 - Prob. 8.33RQCh. 8 - Prob. 8.34RQCh. 8 - Prob. 8.35RQCh. 8 - Prob. 8.36RQCh. 8 - Prob. 8.37RQCh. 8 - Prob. 8.38RQCh. 8 - Prob. 8.39RQCh. 8 - How can views be used as part of data security?...Ch. 8 - Prob. 8.41RQCh. 8 - Prob. 8.42RQCh. 8 - Consider the following two relations for...Ch. 8 - Prob. 8.44PAECh. 8 - Prob. 8.45PAECh. 8 - Prob. 8.46PAECh. 8 - Prob. 8.47PAECh. 8 - Suppose you are designing a default value for the...Ch. 8 - When a student has not chosen a major at a...Ch. 8 - Prob. 8.50PAECh. 8 - Prob. 8.51PAECh. 8 - Consider the relations in Problem and Exercise...Ch. 8 - Prob. 8.53PAECh. 8 - Prob. 8.54PAECh. 8 - Prob. 8.55PAECh. 8 - Prob. 8.56PAECh. 8 - Prob. 8.57PAECh. 8 - Consider the relations specified in Problem and...Ch. 8 - Prob. 8.59PAECh. 8 - Prob. 8.60PAECh. 8 - Prob. 8.61PAECh. 8 - Prob. 8.62PAECh. 8 - Prob. 8.63PAECh. 8 - Prob. 8.64PAECh. 8 - Problems and Exercises 8-65 through 8-68 refer to...Ch. 8 - Prob. 8.66PAECh. 8 - Problems and Exercises 8-65i5 through 8-68 refer...Ch. 8 - Refer to Figure 4-5 0. For each of the following...Ch. 8 - Prob. 8.69PAECh. 8 - Prob. 8.70PAECh. 8 - Prob. 8.71PAECh. 8 - Prob. 8.72PAECh. 8 - Prob. 8.73PAECh. 8 - Prob. 8.74PAECh. 8 - Prob. 8.75PAECh. 8 - Prob. 8.76PAECh. 8 - Prob. 8.77PAE
Knowledge Booster
Similar questions
- Explain the five different file structures (Pile, Sequential file, Indexed Sequential file, Indexed file, and hashed file). And analyze the components, attributes, structure, and operations or implementation guidelines of each file organization.arrow_forwardWhat compromises must be made when creating widely distributed data environments, according to computer science?arrow_forwardCompare and contrast the file-oriented approach and the database approach.arrow_forward
- Chapter 7 homework 1. It is easier to organize data and retrieve it when there is little or no dependence between pro- grams and data. Why is there more such depen- dence in a file approach and less in the database approach?2. Spreadsheets have become quite powerful for data management. What can be done with database management systems that cannot be done with spreadsheet applications? Give several examples.3. What is the difference between a database and a database management system?4. DBMSs are usually bundled with powerful pro- gramming language modules. Why?5. DBMSs are a component of every enterprise application, such as a supply chain manage- ment system. Why?6. What are the advantages and disadvantages of object-oriented databases?7. What is the relationship between a Web site’s local search engines and online databases?8. When constructing a database, the designer must know what types of relationships exist between records in different data sets, such as one-to-many or…arrow_forwardDiscuss the reasons for the shift from file-based (flat file model) systems to databases.arrow_forwardDiscuss the factors that led to the transition from file-based (flat file model) systems to database-based systems.arrow_forward
- Assume that a relation is kept in a B+-tree file structure. Assume secondary indices keep track of record IDs that are pointers to disc records. What is the additional cost of using logical record identifiers?arrow_forwardWhat's the difference between Scripts and Stored Procedures? In what ways are stored procedures beneficial to a database?arrow_forwardConsider the following traditional file system, which shows a number of index cards stored in two separate databases (and possibly in two different locations/ departments). Student information for Jane Blue is shown below: Compare the data found in each index card. State any discrepancies which may be found and explain what problems can occur because of the discrepancy.arrow_forward
- How are Scripts and Stored Procedures different? How are stored procedures advantageous to a database?arrow_forwardFor the aviation industry, "snapshot isolation" serves as an example of a database design. In the case that airlines improve their overall performance, is it appropriate to choose a strategy that does not lend itself to serialization?arrow_forwardAn 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_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