Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
An encoding method for multifield sorting and indexing
Communications of the ACM
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
A high performance, universal, key associative access method
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Interpolation-based index maintenance
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Storage mappings for multidimensional linear dynamic hashing
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
The Grid File: An Adaptable, Symmetric Multi-Key File Structure
Proceedings of the 3rd Conference of the European Cooperation in Informatics on Trends in Information Processing Systems
Algorithms for Multidimensional Partitioning of Static Files
IEEE Transactions on Software Engineering
Managing complex objects in an extensible relational DBMS
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Join processing in relational databases
ACM Computing Surveys (CSUR)
Towards DBMSs for Supporting New Applications
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A Reliable Backend Using Multiattribute Clustering and Select-Join Operator
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
A new method for multikey access suitable for dynamic files is proposed that transforms multiple key values into a logical address This method is based on a new structure, called predicate tree, that represents the function applied to several keys A predicate tree permits to specify in a unified way various hashing schemes by allowing for different definitions of predicates A logical address qualifies a space partition of a file according to its predicate tree This address is seen as a single key by a digital hashing method which transforms it into a physical address This method is used to address records in a file and to transform a retrieval qualification on a file into a set of partitions to access Finally, a qualitative analysis of the behavior of the method is given which exhibits its value