Expected behaviour of B+-trees under random insertions
Acta Informatica
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
Searching for geometric molecular shape complementarity using bidimensional surface profiles
Journal of Molecular Graphics
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Improved histograms for selectivity estimation of range predicates
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Adapting a spatial access structure for document representations in vector space
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
S3: similarity search in CAD database systems
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
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
An alternative storage organization for ROLAP aggregate views based on cubetrees
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Bitmap index design and evaluation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Simple QSF-trees: an efficient and scalable spatial access method
Proceedings of the eighth international conference on Information and knowledge management
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Approximating block accesses in database organizations
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
Databases and Transaction Processing: An Application-Oriented Approach
Databases and Transaction Processing: An Application-Oriented Approach
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 retrieval technique for high-dimensional data and partially specified queries
Data & Knowledge Engineering
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
The Effect of Buffering on the Performance of R-Trees
IEEE Transactions on Knowledge and Data Engineering
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
VLDB '97 Proceedings of the 23rd 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
MIL primitives for querying a fragmented world
The VLDB Journal — The International Journal on Very Large Data Bases
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
KDBKD-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data
ITCC '03 Proceedings of the International Conference on Information Technology: Computers and Communications
Inverted-Space Storage Organization for Persistent Data of Very High Dimensionality
ITCC '01 Proceedings of the International Conference on Information Technology: Coding and Computing
Approximating sliding windows by cyclic tree-like histograms for efficient range queries
Data & Knowledge Engineering
Dealing with complex queries in decision-support systems
Data & Knowledge Engineering
Processing generalized k-nearest neighbor queries on a wireless broadcast stream
Information Sciences: an International Journal
On Managing Very Large Sensor-Network Data Using Bigtable
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
| Hi-index | 0.00 |
In recent years, high-dimensional database applications deal with multidimensional ad hoc queries that refer to an arbitrary number of arbitrarily (unpredictably) chosen dimensions of high-dimensional data. This paper thoroughly and systematically investigates possible secondary-storage based solutions to the problems of processing multidimensional ad hoc query in transactional or semi-transactional environments. Then a complementary solution called the indexed and transposed access method (ITAM) is proposed. This method is based on two complementary measures - a multidimensional access method and a proposed access method called the Opus-path. The performance of multidimensional access methods deteriorates rapidly as the ratio of query dimensionality to data dimensionality decreases. On the other hand, the Opus-path shows retrieval performance that is actually better when the ratio is low.