Partial-match hash coding
- 1 June 1979
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 4 (2) , 228-239
- https://doi.org/10.1145/320071.320079
Abstract
File designs suitable for retrieval from a file of k -field records when queries may be partially specified are examined. Storage redundancy is introduced to obtain improved worst-case and average-case performances. The resulting storage schemes are appropriate for replicated distributed database environments; it is possible to improve the overall average and worst-case behavior for query response as well as provide an environment with very high reliability. Within practical systems it will be possible to improve the query response time performance as well as reliability over comparable systems without replication.Keywords
This publication has 11 references indexed in Scilit:
- Optimal partial-match retrieval when fields are independently specifiedACM Transactions on Database Systems, 1979
- Optimality Properties of Multiple-Key Hashing FunctionsJournal of the ACM, 1979
- Non-uniform partial-match file designsTheoretical Computer Science, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- 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
- Efficient string matchingCommunications of the ACM, 1975
- Implementation of the substring test by hashingCommunications of the ACM, 1971
- Optimal File Allocation in a Multiple Computer SystemIEEE Transactions on Computers, 1969