A New Method for Fast Data Searches with Keys
- 1 March 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Software
- Vol. 4 (2), 16-24
- https://doi.org/10.1109/ms.1987.230092
Abstract
Bounded disorder uses hashing and tree indexing to speed key-associative access to data. It supports range searches and is robust, coping well with arbitrary key distributions.Keywords
This publication has 8 references indexed in Scilit:
- Trie hashing with controlled loadIEEE Transactions on Software Engineering, 1991
- Implementation techniques for main memory database systemsPublished by Association for Computing Machinery (ACM) ,1984
- Bounded index exponential hashingACM Transactions on Database Systems, 1983
- A high performance, universal, key associative access methodPublished by Association for Computing Machinery (ACM) ,1983
- Performance analysis of linear hashing with partial expansionsACM Transactions on Database Systems, 1982
- Prefix B -treesACM Transactions on Database Systems, 1977
- Organization and maintenance of large ordered indexesActa Informatica, 1972
- File Organization: On the Selection of Random Access Index Points for Sequential FilesJournal of the ACM, 1969