The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Performance analysis of linear hashing with partial expansions
ACM Transactions on Database Systems (TODS)
Partial-match retrieval using hashing and descriptors
ACM Transactions on Database Systems (TODS)
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Partial-match retrieval using indexed descriptor files
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
Attribute based file organization in a paged memory environment
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Interpolation-based index maintenance
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Superjoin Algorithm for Deductive Databases
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
DAC '84 Proceedings of the 21st Design Automation Conference
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Multiattribute hashing using Gray codes
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
On finding the closest bitwise matches in a fixed set
ACM Transactions on Mathematical Software (TOMS)
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Multi-step processing of spatial joins
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
Object-oriented retrieval mechanism for semistructured image collections
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
IEEE Transactions on Parallel and Distributed Systems
Snakes and sandwiches: optimal clustering strategies for a data warehouse
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Irregularity in multi-dimensional space-filling curves with applications in multimedia databases
Proceedings of the tenth international conference on Information and knowledge management
ACM Computing Surveys (CSUR)
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
B-trees: bearing fruits of all kinds
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
Window Query Processing in Linear Quadtrees
Distributed and Parallel Databases
Performance of multi-dimensional space-filling curves
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
A New Indexing Scheme for Content-Based Image Retrieval
Multimedia Tools and Applications
Semantic Data Broadcast for a Mobile Environment Based on Dynamic and Adaptive Chunking
IEEE Transactions on Computers
Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperrectangles
IEEE Transactions on Knowledge and Data Engineering
A Stochastic Programming Approach for Range Query Retrieval Problems
IEEE Transactions on Knowledge and Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The Arc-Tree: A Novel Symmetric Access Method for Multidimensional Data
ADBIS '01 Proceedings of the 5th East European Conference on Advances in Databases and Information Systems
Indexing Values in Continuous Field Databases
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Analysis of Multi-Dimensional Space-Filling Curves
Geoinformatica
Neighbor-finding based on space-filling curves
Information Systems
Browsing mixed structured and unstructured data
Information Processing and Management: an International Journal
A new range query algorithm for universal B-trees
Information Systems
IEEE Transactions on Knowledge and Data Engineering
Information Sciences: an International Journal
Data space mapping for efficient I/O in large multi-dimensional databases
Information Systems
On the (n,t)-antipodal Gray codes
Theoretical Computer Science
Mixed-Radix Gray Codes in Lee Metric
IEEE Transactions on Computers
Pattern Discovery for High-Dimensional Binary Datasets
Neural Information Processing
Approximate minimum spanning tree clustering in high-dimensional space
Intelligent Data Analysis
Browsing mixed structured and unstructured data
Information Processing and Management: an International Journal
Adaptive value function approximations in classifier systems
IWLCS'03-05 Proceedings of the 2003-2005 international conference on Learning classifier systems
Density-based data clustering algorithms for lower dimensions using space-filling curves
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
Irregularity in high-dimensional space-filling curves
Distributed and Parallel Databases
An efficient location encoding method based on hierarchical administrative district
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
On the optimality of clustering properties of space filling curves
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Effectively indexing the multi-dimensional uncertain objects for range searching
Proceedings of the 15th International Conference on Extending Database Technology
Approximate covering detection among content-based subscriptions using space filling curves
Journal of Parallel and Distributed Computing
Hi-index | 0.01 |
It is suggested that Gray codes be used to improve the performance of methods for partial match and range queries. Specifically, the author illustrates the improved clustering of similar records that Gray codes can achieve with multiattribute hashing. Gray codes are used instead of binary codes to map record signatures to buckets. In Gray codes, successive codewords differ in the value of exactly one bit position; thus, successive buckets hold records with similar record signatures. The proposed method achieves better clustering of similar records, thus reducing the I/O time. A mathematical model is developed to derive formulas giving the average performance of both methods, and it is shown that the proposed method achieves 0-50% relative savings over the binary codes. The author also discusses how Gray codes could be applied to some retrieval methods designed for range queries, such as the grid file and the approach based on the so-called z-ordering. Gray codes are also used to design good distance-preserving functions, which map a k-dimensional (k-D) space into a one-dimensional one, in such a way that points are close in the k-D space are likely to be close in the 1-D space.