Schemes for SR-Tree packing

Authors:
Jayendra Venkateswaran;S. R. Subramanya
Affiliations:
University of Florida;LG Electronics Mobile Research
Venue:
Proceedings of the 2006 ACM symposium on Applied computing
Year:
2006

Citing 7
Cited 0

The design and analysis of spatial data structures

The design and analysis of spatial data structures
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
The SR-tree: an index structure for high-dimensional nearest neighbor queries

SIGMOD '97 Proceedings of the 1997 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
Similarity Indexing with the SS-tree

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Hilbert R-tree: An Improved R-tree using Fractals

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
STR: A simple and efficient algorithm for R-tree packing

STR: A simple and efficient algorithm for R-tree packing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modern database applications like geographic information systems, multimedia databases, and digital libraries dealing with huge volumes of high dimensional data, make use of multidimensional index structures. Among them, SR-tree has been shown to outperform the R-Tree and its variants and the SS-Tree. For static datasets, packed index structures provide better retrieval performance. This paper presents schemes for SR-Tree packing based on different pre-processing techniques. The results show that these schemes consistently outperform packed R-Tree and conventional SR-Tree structures in terms of storage space and query performance.