The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The determination of efficient record segmentations and blocking factors for shared data files
ACM Transactions on Database Systems (TODS)
A Practical Approach to Selecting Record Access Paths
ACM Computing Surveys (CSUR)
A practitioner's guide to addressing algorithms
Communications of the ACM
A preliminary system for the design of DBTG data structures
Communications of the ACM
A new technique for compression and storage of data
Communications of the ACM
The quadratic quotient method: a hash code eliminating secondary clustering
Communications of the ACM
Introduction to “feature analysis of generalized data base management systems”
Communications of the ACM
A mathematical modeling approach to the automatic selection of database designs
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Models of storage structures and the design of database records based upon a user characterization.
Models of storage structures and the design of database records based upon a user characterization.
Modeling the storage architectures of commercial database systems
ACM Transactions on Database Systems (TODS)
Panel: Extensible database systems
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
GENESIS: An Extensible Database Management System
IEEE Transactions on Software Engineering
Techniques for Structuring Database Records
ACM Computing Surveys (CSUR)
Current practice in the evaluation of multikey search algorithms
SIGIR '83 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval
Conceptual-to-internal mappings in commercial database systems
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
| Hi-index | 0.00 |
Frame memory is a virtual view of secondary storage that can be implemented with reasonable overhead to support database record storage and accessing requirements. Frame memory is designed so that its operating characteristics can be easily manipulated by either designers or design algorithms, while performance effects of such changes can be accurately predicted. Automated design procedures exist to generate and evaluate alternative database designs built upon frame memory, and the existence of these procedures establishes frames as an attractive memory management architecture for future database management systems.