The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Identifier Search Mechanisms: A Survey and Generalized Model
ACM Computing Surveys (CSUR)
Communications of the ACM
Communications of the ACM
Analysis of a file addressing method
Communications of the ACM
Random access file organization for indirectly addressed records
ACM '69 Proceedings of the 1969 24th national conference
On the selection of efficient record segmentations and backup strategies for large shared databases
ACM Transactions on Database Systems (TODS)
Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
A Physical Database Design Evaluation System for CODASYL Databases
IEEE Transactions on Software Engineering
A compendium of key search references
ACM SIGIR Forum
ACM Transactions on Database Systems (TODS)
Optimal file designs and reorganization points
ACM Transactions on Database Systems (TODS)
A unifying model of physical databases
ACM Transactions on Database Systems (TODS)
A practical guide to the design of differential files for recovery of on-line databases
ACM Transactions on Database Systems (TODS)
Design of a balanced multiple-valued file-organization scheme with the least redundancy
ACM Transactions on Database Systems (TODS)
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Relational Data-Base Management Systems
ACM Computing Surveys (CSUR)
CODASYL Data-Base Management Systems
ACM Computing Surveys (CSUR)
A Practical Approach to Selecting Record Access Paths
ACM Computing Surveys (CSUR)
The Logical Record Access Approach to Database Design
ACM Computing Surveys (CSUR)
Database cost analysis: a top-down approach
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Analysis of an inverted data base structure
SIGIR '78 Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval
A design aids data base for digital components
DAC '79 Proceedings of the 16th Design Automation Conference
A survey of physical database design methodology and techniques
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Data base system performance prediction using an analytical model (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Data structures and data accessing in data base systems past, present, future
IBM Systems Journal
| Hi-index | 48.22 |
This paper consolidates a number of popular rules of thumb which have been suggested for the design of record addressing algorithms, and discusses the applicability of these rules to large commercial databases. Guidelines for selecting identifier transformations, overflow techniques, loading factors, bucket sizes, and loading order are considered. Particular attention is focused on the reasonableness of common heuristics for determining primary or secondary bucket sizes. A mathematical model which explicitly considers storage device characteristics and time/space cost tradeoffs is used to analyze the effect of design parameters on overall system costs. A specific design example is presented and solved.