Adaptive Segmentation Schemes for Large Relational Database Machines
- 1 January 1983
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Adaptive Segmentation Schemes for Large Relational Database MachinesPublished by Springer Nature ,1983
- Extended K-d Tree Database Organization: A Dynamic Multiattribute Clustering MethodIEEE Transactions on Software Engineering, 1981
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Dynamic hashingBIT Numerical Mathematics, 1978
- Partial-Match Retrieval AlgorithmsSIAM Journal on Computing, 1976
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Organization and maintenance of large ordered indexesActa Informatica, 1972
- A relational model of data for large shared data banksCommunications of the ACM, 1970
- File organization schemes based on finite geometriesInformation and Control, 1968
- Trie memoryCommunications of the ACM, 1960