The BANG file: A new kind of grid file
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Gray Codes for Partial Match and Range Queries
IEEE Transactions on Software Engineering
Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The design and analysis of spatial data structures
The design and analysis of spatial data structures
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Advanced database indexing
Searching Multimedia Databases by Content
Searching Multimedia Databases by Content
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd 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
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
G-Tree: A New Data Structure for Organizing Multidimensional Data
IEEE Transactions on Knowledge and Data Engineering
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The Universal B-Tree for Multidimensional Indexing: general Concepts
WWCA '97 Proceedings of the International Conference on Worldwide Computing and Its Applications
The Gr_Tree: The Use of Active Regions in G-Trees
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
Proceedings of the Sixth International Conference on Data Engineering
| Hi-index | 0.00 |
In this paper we present a novel symmetric and dynamic access method, the Arc-tree, for organizing multidimensional data. The Arc-tree uses a new space-filling curve and a partition scheme that is based on bit interleaving. It divides the data space into non-overlapping arc partitions through splits imposed by meeting planes and co-centric spheres that alternate in a fixed order. The proposed structure is k-d-cut, fixed and brickwall. The Arc-tree inco rporates the properties of metric spaces and B-trees, is independent of data distribution and excludes the storage of empty partitions. Moreover, for a given data space the partitions are identical regardless of the order of insertions and deletions. The Arc-tree arranges partitions around a starting point and this makes the method especially suitable for applications where distance queries and searches on planes that intersect this point are concerned. We present the Arc-tree, describe its dynamic behavior and provide algorithms that prune the set of candidates to qualify partitions for several types of queries.