Multidimensional tries used for associative searching
- 1 June 1982
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 14 (4) , 150-157
- https://doi.org/10.1016/0020-0190(82)90027-8
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A note on the average depth of triesComputing, 1982
- Quintary treesACM Transactions on Database Systems, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Multidimensional Binary Search Trees in Database ApplicationsIEEE Transactions on Software Engineering, 1979
- Multi-dimensional clustering for data base organizationsInformation Systems, 1977
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad treesActa Informatica, 1977
- Heuristics for partial-match retrieval data base designInformation Processing Letters, 1976
- A technique for implementing a set processorPublished by Association for Computing Machinery (ACM) ,1976
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975