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
Multidimensional access methods
ACM Computing Surveys (CSUR)
The Asilomar report on database research
ACM SIGMOD Record
Making B+- trees cache conscious in main memory
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Optimizing multidimensional index trees for main memory access
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
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
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
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
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
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree
MDM '02 Proceedings of the Third International Conference on Mobile Data Management
Q+Rtree: Efficient Indexing for Moving Object Databases
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Improved partition method for tracking moving objects in road networks
International Journal of Advanced Intelligence Paradigms
Survey of indexing schemes for information retrieval on flash memory based wireless sensor networks
Proceedings of the 2009 conference on Information Science, Technology and Applications
The weighted shortest path search in mobile GIS services
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Hi-index | 0.00 |
As random access memory chips get cheaper, it becomes affordable to realize main memory-based database systems. The most important issues in main memory database indexing techniques for mobile GIS applications are to improve update performances – since numerous update operations can arise for tracking continuously moving objects – and to reduce cache misses for improving search performances. In this paper, we propose MR-tree, a cache-conscious version of the R-tree for main memory databases. To increase fan-out, the MR-tree applies a novel compression scheme to entry MBRs (Minimum Bounding Rectangles). This scheme represents entry MBRs by relative coordinates in a node. To improve update performance, the MR-tree can become an unbalanced tree as follows: it propagates node splits upward only if one of the internal nodes on the insertion path has empty space, or all height differences between the consecutive nodes on the insertion path are 1 and one of the height differences among its subtrees is equal to some unbalance parameter. Because of this feature, the MR-tree can reduce the number of internal nodes splits and reinsertions significantly. In the case where all internal nodes on the insertion path do not meet the above conditions, a newly created leaf node simply becomes the child of the split leaf, when a leaf node split occurs. This split leaf is called the half-leaf node. Our experimental result shows that the search speed of the proposed two-dimensional MR-tree increases by almost a factor of two compared to the CR-tree and the R-tree variant, which are also main memory based R-trees, while maintaining better update performance.