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
Is Huffman coding dead? (extended abstract)
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
CIKM '93 Proceedings of the second international conference on Information and knowledge management
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
Multi-step processing of spatial joins
SIGMOD '94 Proceedings of the 1994 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)
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
Making B+- trees cache conscious in main memory
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Index research (panel session): forest or trees?
SIGMOD '00 Proceedings of the 2000 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
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Compressing Relations and Indexes
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Cache Conscious Indexing for Decision-Support in Main Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Database Architecture Optimized for the New Bottleneck: Memory Access
VLDB '99 Proceedings of the 25th 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
DBMSs on a Modern Processor: Where Does Time Go?
VLDB '99 Proceedings of the 25th 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
Compacting discriminator information for spatial trees
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
Implementing database operations using SIMD instructions
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Trajectory queries and octagons in moving object databases
Proceedings of the eleventh international conference on Information and knowledge management
Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient Evaluation of Continuous Range Queries on Moving Objects
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Effect of node size on the performance of cache-conscious B+-trees
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Contorting high dimensional data for efficient main memory KNN processing
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Main Memory Evaluation of Monitoring Queries Over Moving Objects
Distributed and Parallel Databases
Buffering databse operations for enhanced instruction cache performance
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
An efficient cache conscious multi-dimensional index structure
Information Processing Letters
Indexing High-Dimensional Data for Efficient In-Memory Similarity Search
IEEE Transactions on Knowledge and Data Engineering
Exploring bit-difference for approximate KNN search in high-dimensional databases
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Improving database performance on simultaneous multithreading processors
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Self-tuning cost modeling of user-defined functions in an object-relational DBMS
ACM Transactions on Database Systems (TODS)
Maintaining Sliding Window Skylines on Data Streams
IEEE Transactions on Knowledge and Data Engineering
Fast similarity join for multi-dimensional data
Information Systems
Adaptive Index Utilization in Memory-Resident Structural Joins
IEEE Transactions on Knowledge and Data Engineering
Efficient execution of multiple queries on deep memory hierarchy
Journal of Computer Science and Technology
Buffering accesses to memory-resident index structures
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
P*TIME: highly scalable OLTP DBMS for managing update-intensive stream workload
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A general framework for improving query processing performance on multi-level memory hierarchies
DaMoN '07 Proceedings of the 3rd international workshop on Data management on new hardware
An Extended R-Tree Indexing Method Using Selective Prefetching in Main Memory
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
The Optimization of In-Memory Space Partitioning Trees for Cache Utilization
IEICE - Transactions on Information and Systems
The RUM-tree: supporting frequent updates in R-trees using memos
The VLDB Journal — The International Journal on Very Large Data Bases
Towards Location-Based Real-Time Monitoring Systems in u-LBS
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
Trees or grids?: indexing moving objects in main memory
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
An efficient cache conscious multi-dimensional index structure
Information Processing Letters
An efficient compression technique for a multi-dimensional index in main memory
VISUAL'07 Proceedings of the 9th international conference on Advances in visual information systems
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
Indexing high-dimensional data for main-memory similarity search
Information Systems
Range queries over a compact representation of minimum bounding rectangles
ER'10 Proceedings of the 2010 international conference on Advances in conceptual modeling: applications and challenges
Thread-level parallel indexing of update intensive moving-object workloads
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
TMOM: a moving object main memory-based DBMS for telematics services
W2GIS'06 Proceedings of the 6th international conference on Web and Wireless Geographical Information Systems
MBR compression in spatial databases using semi-approximation scheme
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
CLUR-Tree for supporting frequent updates of data stream over sensor networks
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Performance analysis of the cache conscious-generalized search tree
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Spatial indexing based on the semi-approximation scheme of MBR
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Spatial index compression for location-based services based on a MBR semi-approximation scheme
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
MiniTasking: improving cache performance for multiple query workloads
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
MR-Tree: a cache-conscious main memory spatial index structure for mobile GIS
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
A spatial index using MBR compression and hashing technique for mobile map service
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Evaluation of a dynamic tree structure for indexing query regions on streaming geospatial data
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Development of an embedded spatial MMDBMS for spatial mobile devices
W2GIS'05 Proceedings of the 5th international conference on Web and Wireless Geographical Information Systems
Parallel main-memory indexing for moving-object query and update workloads
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Retrieving large-scale high density video target tracks from spatial database
Proceedings of the 3rd International Conference on Computing for Geospatial Research and Applications
An experimental analysis of iterated spatial joins in main memory
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Recent studies have shown that cache-conscious indexes such as the CSB+-tree outperform conventional main memory indexes such as the T-tree. The key idea of these cache-conscious indexes is to eliminate most of child pointers from a node to increase the fanout of the tree. When the node size is chosen in the order of the cache block size, this pointer elimination effectively reduces the tree height, and thus improves the cache behavior of the index. However, the pointer elimination cannot be directly applied to multidimensional index structures such as the R-tree, where the size of a key, typically, an MBR (minimum bounding rectangle), is much larger than that of a pointer. Simple elimination of four-byte pointers does not help much to pack more entries in a node.This paper proposes a cache-conscious version of the R-tree called the CR-tree. To pack more entries in a node, the CR-tree compresses MBR keys, which occupy almost 80% of index data in the two-dimensional case. It first represents the coordinates of an MBR key relatively to the lower left corner of its parent MBR to eliminate the leading O's from the relative coordinate representation. Then, it quantizes the relative coordinates with a fixed number of bits to further cut off the trailing less significant bits. Consequently, the CR-tree becomes significantly wider and smaller than the ordinary R-tree. Our experimental and analytical study shows that the two-dimensional CR-tree performs search up to 2.5 times faster than the ordinary R-tree while maintaining similar update performance and consuming about 60% less memory space.