Expected behaviour of B+-trees under random insertions
Acta Informatica
The buddy tree: an efficient and robust access method for spatial data base
Proceedings of the sixteenth international conference on Very large databases
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
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
Simple QSF-trees: an efficient and scalable spatial access method
Proceedings of the eighth international conference on Information and knowledge management
Efficient indexing of high-dimensional data through dimensionality reduction
Data & Knowledge Engineering
ACM Computing Surveys (CSUR)
Analysis and performance of inverted data base structures
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
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
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd 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
Integrating the UB-Tree into a Database System Kernel
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
Implementing KDB-Trees to Support High-Dimensional Data
IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
Multidimensional Indexing and Query Coordination for Tertiary Storage Management
SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
Optimizing Selections over Datacubes
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Coordinating Simultaneous Caching of File Bundles from Tertiary Storage
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Effective Management of Hierarchical Storage Using Two Levels of Data Clustering
MSS '03 Proceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)
Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
A novel feature selection method for large-scale data sets
Intelligent Data Analysis
Processing partially specified queries over high-dimensional databases
Data & Knowledge Engineering
Information and Software Technology
Zoned-partitioning of tree-like access methods
Information Systems
WSEAS Transactions on Computers
Indexing the fully evolvement of spatiotemporal objects
WSEAS Transactions on Information Science and Applications
Variable granularity space filling curve for indexing multidimensional data
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Processing generalized k-nearest neighbor queries on a wireless broadcast stream
Information Sciences: an International Journal
An efficient zoning technique for multi-dimensional access methods
TEAA'05 Proceedings of the 31st VLDB conference on Trends in Enterprise Application Architecture
Indexing RFID data using the VG-curve
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
| Hi-index | 0.00 |
While the persistent data of many advanced database applications, such as OLAP and scientific studies, are characterized by very high dimensionality, typical queries posed on these data appeal to a small number of relevant dimensions. Unfortunately, the multi-dimensional access methods designed for high-dimensional data perform rather poorly for these partially specified queries. The retrieval technique proposed in this paper uses a combination of two complementary measures to support efficient processing of partial queries over high-dimensional data. First, an elaborate storage organization, called the inverted space, allows the system administrator to control the size of individual indexes in order to avoid the negative impact of extremely high data dimensionality on the retrieval performance. Second, a new indexing structure, which is designed to support the inverted-space storage organization, enables efficient query processing in projected spaces with moderate dimensionality. This indexing mechanism is a general-purpose point access method that effectively attacks the limitations of KDB-trees in spaces with many dimensions, while preserving the simplicity and relatively good performance of the later structure in low-dimensional spaces. The analytical and experimental results show that the new indexing scheme outperforms two other variants of KDB-trees investigated in the paper for both fully and partially specified queries.