Non-uniform partial-match file designs
- 31 August 1977
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 5 (1) , 1-23
- https://doi.org/10.1016/0304-3975(77)90040-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Hashing and trie algorithms for partial match retrievalACM Transactions on Database Systems, 1976
- Partial match retrievalBIT Numerical Mathematics, 1976
- Partial-Match Retrieval AlgorithmsSIAM Journal on Computing, 1976
- Heuristics for partial-match retrieval data base designInformation Processing Letters, 1976
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Partial-match queries and file designsPublished by Association for Computing Machinery (ACM) ,1975
- On hash-coding algorithms for partial-match retrievalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974
- A formal system for information retrieval from filesCommunications of the ACM, 1970
- Trie memoryCommunications of the ACM, 1960