Information Systems
Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
The BANG file: A new kind of grid file
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Quintary trees: a file structure for multidimensional datbase sytems
ACM Transactions on Database Systems (TODS)
Concurrent operations on B-trees with overtaking
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
ACM Computing Surveys (CSUR)
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
A comparison of spatial query processing techniques for native and parameter spaces
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Tree visualization with tree-maps: 2-d space-filling approach
ACM Transactions on Graphics (TOG)
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Access method concurrency with recovery
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
A review of recent work on multi-attribute access methods
ACM SIGMOD Record
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
The SEQUOIA 2000 storage benchmark
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
Path caching (extended abstract): a technique for optimal external searching
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A general solution of the n-dimensional B-tree problem
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
OODB indexing by class-division
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
The PML-tree: an efficient parallel spatial index structure for spatial databases
CSC '96 Proceedings of the 1996 ACM 24th annual conference on Computer science
Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Simple Algorithm for Nearest Neighbor Search in High Dimensions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Supporting similarity queries in MARS
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Tight bounds for 2-dimensional indexing schemes
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient searching with linear constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dimensionality reduction for similarity searching in dynamic databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Efficient disk allocation for fast similarity searching
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Multidimensional access methods
ACM Computing Surveys (CSUR)
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The P-range tree: a new data structure for range searching in secondary memory
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Indexing schemes for random points
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
SMR-tree: an efficient index structure for spatial databases
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Clustering declustered data for efficient retrieval
Proceedings of the eighth international conference on Information and knowledge management
Vector approximation based indexing for non-uniform high dimensional data sets
Proceedings of the ninth international conference on Information and knowledge management
Modeling high-dimensional index structures using sampling
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Scalable integrated region-based image retrieval using IRM and statistical clustering
Proceedings of the 1st ACM/IEEE-CS joint conference on Digital libraries
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
ACM Transactions on Database Systems (TODS)
Storing spatial data on a network of workstations
Cluster Computing
A New Indexing Scheme for Content-Based Image Retrieval
Multimedia Tools and Applications
Optimizing Sort Order Query Execution in Balanced and Nested Grid Files
IEEE Transactions on Knowledge and Data Engineering
Efficient Differential Timeslice Computation
IEEE Transactions on Knowledge and Data Engineering
Fast and Effective Retrieval of Medical Tumor Shapes
IEEE Transactions on Knowledge and Data Engineering
Querying Time Series Data Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
High-Dimensional Similarity Joins
IEEE Transactions on Knowledge and Data Engineering
VQ-index: an index structure for similarity searching in multimedia databases
Proceedings of the tenth ACM international conference on Multimedia
Energy-performance trade-offs for spatial access methods on memory-resident data
The VLDB Journal — The International Journal on Very Large Data Bases
Dynamic Queries over Mobile Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Optimal Dynamic Range Searching in Non-replicating Index Structures
ICDT '99 Proceedings of the 7th International Conference on Database Theory
A Region Splitting Strategy for Physical Database Design of Multidimensional File Organizations
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
High-Performance Extensible Indexing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
An Evaluation of Generic Bulk Loading Techniques
Proceedings of the 27th 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
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Online Data Structures in External Memory
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
High-Concurrency Locking in R-Trees
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Efficient Search of Multi-Dimensional B-Trees
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient Similarity Search in Feature Spaces with the Q-Tree
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
Online Data Structures in External Memory
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Framework for Index Bulk Loading and Dynamization
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Algorithm for Incremental Nearest Neighbor Search in High-Dimensional Data Spaces
Proceedings of the First International Conference on The Human Society and the Internet - Internet Related Socio-Economic Issues
Astronomical Tables, 2-D Indexing, and Fuzzy-joins
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Querying Mobile Objects in Spatio-Temporal Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Constrained Nearest Neighbor Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
The SH-tree: A Super Hybrid Index Structure for Multidimensional Data
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Boolean Bounding Predicates for Spatial Access Methods
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances
The VLDB Journal — The International Journal on Very Large Data Bases
Indexing very high-dimensional sparse and quasi-sparse vectors for similarity searches
The VLDB Journal — The International Journal on Very Large Data Bases
The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation
The VLDB Journal — The International Journal on Very Large Data Bases
Concurrency and recovery for index trees
The VLDB Journal — The International Journal on Very Large Data Bases
A configurable type hierarchy index for OODB
The VLDB Journal — The International Journal on Very Large Data Bases
External memory data structures
Handbook of massive data sets
Multikey index support for tuple sets on parallel mass storage systems
MSS '95 Proceedings of the 14th IEEE Symposium on Mass Storage Systems
Improving OLAP Performance by Multidimensional Hierarchical Clustering
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Disk Allocation for Fast Range and Nearest-Neighbor Queries
Distributed and Parallel Databases
VIS '93 Proceedings of the 4th conference on Visualization '93
An Efficient Technique for Nearest-Neighbor Query Processing on the SPY-TEC
IEEE Transactions on Knowledge and Data Engineering
High dimensional reverse nearest neighbor queries
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Incorporating Updates in Domain Indexes: Experiences with Oracle Spatial R-trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing
ACM Transactions on Database Systems (TODS)
Compressing Bitmap Indices by Data Reorganization
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
The PN-tree: a parallel and distributed multidimensional index
Distributed and Parallel Databases
Self-tuning cost modeling of user-defined functions in an object-relational DBMS
ACM Transactions on Database Systems (TODS)
A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces
ACM Transactions on Information Systems (TOIS)
High dimensional nearest neighbor searching
Information Systems
A practical approach for efficiently answering top-k relational queries
Decision Support Systems
Indexing moving objects based on 2 n index tree
AIKED'07 Proceedings of the 6th Conference on 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases - Volume 6
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Reasoning about B+ Trees with Operational Semantics and Separation Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
A flexible framework to ease nearest neighbor search in multidimensional data spaces
Data & Knowledge Engineering
Gchord: indexing for multi-attribute query in p2p system with low maintenance cost
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
Indexing non-uniform spatial data
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
A fast and robust bulk-loading algorithm for indexing very large digital elevation datasets
Computers & Geosciences
Search support in data management systems
Data Management in a Connected World
Graph based k-means clustering
Signal Processing
| Hi-index | 0.00 |
A new multiattribute index structure called the hB-tree is introduced. It is derived from the K-D-B-tree of Robinson [15] but has additional desirable properties. The hB-tree internode search and growth processes are precisely analogous to the corresponding processes in B-trees [1]. The intranode processes are unique. A k-d tree is used as the structure within nodes for very efficient searching. Node splitting requires that this k-d tree be split. This produces nodes which no longer represent brick-like regions in k-space, but that can be characterized as holey bricks, bricks in which subregions have been extracted. We present results that guarantee hB-tree users decent storage utilization, reasonable size index terms, and good search and insert performance. These results guarantee that the hB-tree copes well with arbitrary distributions of keys.