Performance guarantees for B-trees with different-sized atomic keys
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
| Hi-index | 0.00 |
This paper deals with the structure and use of indexes that facuitate the retrieval and storage of records based on a specific value, value range, or value sequence of a given field of a record within one or more data sets. Specifically, it examines general index structures, maintenance, index entry compression, and complex indexes as considered in the basic design of VSAM (Virtual Storage Access Method). Under complex indexes, indirect secondary indexes and indexes to multiple data sets are considered.