Optimal file distribution for partial match retrieval
- 1 June 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 17 (3) , 173-182
- https://doi.org/10.1145/971701.50221
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Performance Analysis of Disk Modulo Allocation Method for Cartesian Product FilesIEEE Transactions on Software Engineering, 1987
- Parallel searching for binary Cartesian product filesPublished by Association for Computing Machinery (ACM) ,1985
- Disk allocation for Cartesian product files on multiple-disk systemsACM Transactions on Database Systems, 1982
- Some properties of Cartesian product filesPublished by Association for Computing Machinery (ACM) ,1980
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Partial-match hash codingACM Transactions on Database Systems, 1979
- 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
- Hashing and trie algorithms for partial match retrievalACM Transactions on Database Systems, 1976
- Attribute based file organization in a paged memory environmentCommunications of the ACM, 1974