Linear hashing with overflow-handling by linear probing
ACM Transactions on Database Systems (TODS)
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Analysis of dynamic hashing with deferred splitting
ACM Transactions on Database Systems (TODS)
Analysis of index-sequential files with overflow chaining
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)
Performance analysis of linear hashing with partial expansions
ACM Transactions on Database Systems (TODS)
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
Minimum cost selection of secondary indexes for formatted files
ACM Transactions on Database Systems (TODS)
The determination of efficient record segmentations and blocking factors for shared data files
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Approximating block accesses in database organizations
Communications of the ACM
A practitioner's guide to addressing algorithms
Communications of the ACM
Design of Database Structures
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
An access path model for physical database design
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
B+ trees and indexed sequential files: a performance comparison
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
ATTRIBUTE PARTITIONING IN A SELF-ADAPTIVE RELATIONAL DATA BASE SYSTEM
ATTRIBUTE PARTITIONING IN A SELF-ADAPTIVE RELATIONAL DATA BASE SYSTEM
A clustering approach to the generation of subfiles for the design of a computer data base.
A clustering approach to the generation of subfiles for the design of a computer data base.
Index configuration in object-oriented databases
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
An interactive design tool for designing CODASYL databases is described. The system is composed of three main modules: a user interface, a transaction analyzer, and a core module. The user interface allows a designer to enter interactively information concerning a database design which is to be evaluated. The transaction analyzer allows the designer to specify the processing requirements in terms of typical logical transactions to be executed against the database and translates these logical transaction into physical transaction which access and manipulate the physical databases. The core module is the implementation of a set of analytical models and cost formulas developed for the manipulation of indexed sequential and hash-based files and CODASYL sets. These models and formulas account for the situation in which occurrences of multiple record types are stored in the same area. Also presented are the results of a series of experiments in which key design parameters are varied. The system is implemented in UCSD Pascal running on IBM PCs.