An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Hashing and trie algorithms for partial match retrieval
ACM Transactions on Database Systems (TODS)
Optimality Properties of Multiple-Key Hashing Functions
Journal of the ACM (JACM)
Attribute based file organization in a paged memory environment
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Implementation of the substring test by hashing
Communications of the ACM
Programming Techniques: Regular expression search algorithm
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
MATCH—a new high-level relational operator for pattern matching
Communications of the ACM
Multiattribute hashing using Gray codes
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Optimal file distribution for partial match retrieval
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Gray Codes for Partial Match and Range Queries
IEEE Transactions on Software Engineering
Algorithms for Multidimensional Partitioning of Static Files
IEEE Transactions on Software Engineering
Clustered multiattribute hash files
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Declustering using error correcting codes
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A compendium of key search references
ACM SIGIR Forum
Optimal sample cost residues for differential database batch query problems
Journal of the ACM (JACM)
Disk Allocation Methods Using Error Correcting Codes
IEEE Transactions on Computers
Optimal disk allocation for partial match queries
ACM Transactions on Database Systems (TODS)
Optimal signature extraction and information loss
ACM Transactions on Database Systems (TODS)
Document ranking on weight-partitioned signature files
ACM Transactions on Information Systems (TOIS)
Data structures for efficient broker implementation
ACM Transactions on Information Systems (TOIS)
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
A multidimensional digital hashing scheme for files with composite keys
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Disk allocation for Cartesian product files on multiple-disk systems
ACM Transactions on Database Systems (TODS)
On the complexity of designing optimal partial-match retrieval systems
ACM Transactions on Database Systems (TODS)
Partial-match retrieval using hashing and descriptors
ACM Transactions on Database Systems (TODS)
Partial-match hash coding: benefits of redundancy
ACM Transactions on Database Systems (TODS)
Parallel searching for binary Cartesian product files
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
Optimality Properties of Multiple-Key Hashing Functions
Journal of the ACM (JACM)
Partial-match retrieval using indexed descriptor files
Communications of the ACM
Current practice in the evaluation of multikey search algorithms
SIGIR '83 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval
A dynamic clustering technique for physical database design
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
An Efficient File Structure for Document Retrieval in the Automated Office Environment
IEEE Transactions on Knowledge and Data Engineering
Multilevel Extendible Hashing: A File Structure for Very Large Databases
IEEE Transactions on Knowledge and Data Engineering
Optimal Bucket Allocation Design of k-ary MKH Files for Partial Match Retrieval
IEEE Transactions on Knowledge and Data Engineering
A Stochastic Programming Approach for Range Query Retrieval Problems
IEEE Transactions on Knowledge and Data Engineering
A Mapping Function for the Directory of a Multidimensional Extendible Hashing
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
A Superjoin Algorithm for Deductive Databases
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Serving Datacube Tuples from Main Memory
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Orthogonal range retrieval using bucket address hashing
SSDBM'1988 Proceedings of the 4th international conference on Statistical and Scientific Database Management
Optimal chunking of large multidimensional arrays for data warehousing
Proceedings of the ACM tenth international workshop on Data warehousing and OLAP
A cache invalidation scheme for continuous partial match queries in mobile computing environments
Distributed and Parallel Databases
Index tuning for parameterized streaming groupby queries
SSPS '08 Proceedings of the 2nd international workshop on Scalable stream processing system
The optimal size of a signature
Mathematical and Computer Modelling: An International Journal
Optimizing adaptive multi-route query processing via time-partitioned indices
Journal of Computer and System Sciences
TSum: fast, principled table summarization
Proceedings of the Seventh International Workshop on Data Mining for Online Advertising
| Hi-index | 0.03 |
This paper considers the design of a system to answer partial-match queries from a file containing a collection of records, each record consisting of a sequence of fields. A partial-match query is a specification of values for zero or more fields of a record, and the answer to a query is a listing of all records in the file whose fields match the specified values.A design is considered in which the file is stored in a set of bins. A formula is derived for the optimal number of bits in a bin address to assign to each field, assuming the probability that a given field is specified in a query is independent of what other fields are specified. Implications of the optimality criterion on the size of bins are also discussed.