Article

Free access

Simple QSF-trees: an efficient and scalable spatial access method

Authors:

Ratko Orlandic,

Martha EvensAuthors Info & Claims

CIKM '99: Proceedings of the eighth international conference on Information and knowledge management

Pages 5 - 14

https://doi.org/10.1145/319950.319953

Published: 01 November 1999 Publication History

Abstract

The development of high-performance spatial access methods that can support complex operations of large spatial databases continues to attract considerable attention. This paper introduces QSF-trees, an efficient and scalable structure for indexing spatial objects, which has some important advantages over R^*-trees. QSF-trees eliminate overlapping of index regions without forcing object clipping or sacrificing the selectivity of spatial operations. The method exploits the semantics of topological relations between spatial objects to further reduce the number of index nodes visited during the search. A series of experiments involving randomly-generated spatial objects was conducted to compare the structure with two variations of R^*-trees. The experiments show QSF-trees to be more efficient and more scalable to the increase in the data-set size, the size of spatial objects, and the number of dimensions of the spatial universe.

References

[1]

N. Beckmann, H. Kriegcl, R. Schneider and B. Seeger, "The R*-tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD Int. Conf. on Management of Data, 322--331, 1990.

Digital Library

[2]

S. Berchtold, D.A. Keim and H. Kriegel, "The X-tree: An Index Structure for High-Dimensional Data," Proc. 22th Int. Conf. on Very Large Data Bases, 28---39, 1996.

Digital Library

[3]

C. Faloutsos, R. Sellis and N. Roussopoulos, "Analysis of Object-Oriented Spatial Access Methods," Proc. ACM SIGMOD Int, Conf. on Management of Data, 426---439, 1987.

Digital Library

[4]

M. Freeston, "The BANG file: A New Kind of Grid File," Proc. ACM S IGMOD Int. Conf. on Management of Data, 260----269, 1987.

Digital Library

[5]

M. Freeston, "A General Solution of the N-dimensional B- tree Problem," Proc. ACM SIGMOD Int. Conf. on Management of Data, 80---91, 1995.

Digital Library

[6]

V. Gaede and O. Gunther, "Multidimensional Access Methods," ACM Computing Surveys, 30(2):170---231, I998.

Digital Library

[7]

D. Greene, "An Implementation and Performance Analysis of Spatial Data Access Methods," Proc. 5th IEEE Int. Conf. on Data Engineering, 606--615, 1989.

Digital Library

[8]

O. Gunther and J. Bilmes, "Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation," lEEE Trans. Knowledge and Data Engineering, 3(3):342--356, 1991.

Digital Library

[9]

A. Guttman, "R-trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD Int. Conf. on Management of Data, 47--54, 1984.

Digital Library

[10]

A. Henrich, H.W. Six and P. Widmayer, "The LSD-tree: Spatial Access to Multidimensional Point and Non-point Objects," Proc. 15th Int. Conf. on Very Large Data Bases, 45--53, 1989.

Digital Library

[11]

A. Henrich, and H.W. Six, "How to Split Buckets in Spatial Data Structures," in Geographic Database Management Systems, G. Gambosi, M. Scholl, and H.W. Six eds., Springer-Verlag, Berlin, 212--244, 1991.

[12]

K. Hinrichs, "Implementation of the Grid File: Design Concepts and Experience," BIT, 25:569m592, 1985.

Digital Library

[13]

I. Kamel and C. Faloutsos, "Hilbert R-tree: An Improved R- tree Using Fractals," Proc. 20th Int. Conf. on Very Large Data Bases, 500---509, 1994.

Digital Library

[14]

J. Kuan and P. Lewis, "A Study on Data Point Search for HG-trees," SIGMOD Record, 28(1):90--96, 1999.

Digital Library

[15]

J. Nievergelt, H. Hinterberger and K.C. Sevcik, "The Grid File: An Adaptable, Symmetric Multikey File Structure," ACM Trans. Database Syst., 9(1):38--7 I, 1984.

Digital Library

[16]

P. Oosterom, Reactive Data Structures for Geographic Information Systems, Ph.D. Thesis, University of Leiden, Netherlands, 1990.

[17]

J. Orenstein and T.H. Merrett, "A Class of Data Structures for Associative Searching," Proc, 3rd ACM SIGACT- SIGMOD Symposium on Principles of Database Systems, 181--190, 1984.

Digital Library

[18]

R. Orlandic, "A High-Precision Spatial Access Method Based on a New Linear Representation of Quadtrees," Proc. 1st Conf. on Information and Knowledge Management CIKM-92, 499---508, 1992.

[19]

B.U. Pagel, H.W. Six and H. Toben, '`The Transformation Technique for Spatial Objects Revisited," in Advances in Spatial Databases, D. Abel and B.C. Ooi, eds., Lecture Notes in Computer Science 692, Springer-Verlag, Berlin, 73--88, 1993.

Digital Library

[20]

D. Papadias, Y. Theodoridis, T. Sellis and M.J. Egenhofer, "Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-trees," Proc. ACM SIGMOD Int. Conf. on Management of Data, 92---103, 1995.

Digital Library

[21]

J.T. Robinson, "The K-D-B Tree: A Search Structure for Large Multidimensional Dynamic Indexes," Proc. ACM SIGMOD Int. Conf. on Management of Data, 10--18, 1981.

Digital Library

[22]

B. Seeger and H.P. Kriegel, "Techniques for Design and Implementation of Efficient Spatial Access Methods," Proc. 14th Int. Conf. on Very Large Data Bases, 10---17, 1988.

Digital Library

[23]

B. Seeger and H.P. Kriegel, "The Buddy-tree: An Efficient and Robust Access Method for Spatial Data Base Systems," Proc. 16th Int. Conf. on Very Large Data Bases, 590---601, 1990.

Digital Library

[24]

T. Sellis, N. Roussopoulos, and C. Faloutsos, "The R+-Tree: A Dynamic Index for Multi-Dimensional Objects," Proc. 13th Int. Conf. on Very Large Data Bases, 507--518, 1987.

Digital Library

[25]

D.A. White and R. Jain, "Similarity Indexing with the SS- tree," Proc. 12th IEEE Int. Conf. on Data Engineering, 516-- 523, 1996.

Digital Library

Cited By

Yu BBailey T(2007)Processing partially specified queries over high-dimensional databasesData & Knowledge Engineering10.1016/j.datak.2006.08.00162:1(177-197)Online publication date: 1-Jul-2007
https://dl.acm.org/doi/10.1016/j.datak.2006.08.001
Cho KHan YLee YPark EPu C(2001)Dynamic and hierarchical spatial access method using integer searchingProceedings of the tenth international conference on Information and knowledge management10.1145/502585.502643(341-348)Online publication date: 5-Oct-2001
https://dl.acm.org/doi/10.1145/502585.502643
Orlandic RByunggu Yu (2001)Inverted-space storage organization for persistent data of very high dimensionalityProceedings International Conference on Information Technology: Coding and Computing10.1109/ITCC.2001.918865(616-621)Online publication date: 2001
https://doi.org/10.1109/ITCC.2001.918865
Show More Cited By

Index Terms

Simple QSF-trees: an efficient and scalable spatial access method

Recommendations

Efficient query processing on large spatial databases

A spatial index, called xBR+-tree, is compared against the R*-tree and the R+-tree.Performance of tree building and processing of common spatial queries is studied.Existing and new algorithms for processing these queries are utilized.Extensive ...
Research on Control of the Data Quality in Digital Land Spatial Database Based on GIS
DBTA '09: Proceedings of the 2009 First International Workshop on Database Technology and Applications

GIS as the platform is beingwidely used in current construction of geoscience spatial database in China, and the quality ofits spatial data directly influences the quality of the spatial database of geoscience. Precision of spatial data, validity and ...
Modelling spatial video as part of a GIS video analysis framework
GIS '10: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems

It is now common for video; real-time and collected, mobile and static, to be georeferenced and stored in large archives for users of expert systems to access and interact with. In the ground-based terrestrial context georeferenced video is also ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CIKM '99: Proceedings of the eighth international conference on Information and knowledge management

November 1999

564 pages

ISBN:1581131461

DOI:10.1145/319950

Editor:
Susan Gauch

Copyright © 1999 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CIKM99

Sponsor:

CIKM99: Conference on Information and Knowledge Management

November 2 - 6, 1999

Missouri, Kansas City, USA

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
633
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)7

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Yu BBailey T(2007)Processing partially specified queries over high-dimensional databasesData & Knowledge Engineering10.1016/j.datak.2006.08.00162:1(177-197)Online publication date: 1-Jul-2007
https://dl.acm.org/doi/10.1016/j.datak.2006.08.001
Cho KHan YLee YPark EPu C(2001)Dynamic and hierarchical spatial access method using integer searchingProceedings of the tenth international conference on Information and knowledge management10.1145/502585.502643(341-348)Online publication date: 5-Oct-2001
https://dl.acm.org/doi/10.1145/502585.502643
Orlandic RByunggu Yu (2001)Inverted-space storage organization for persistent data of very high dimensionalityProceedings International Conference on Information Technology: Coding and Computing10.1109/ITCC.2001.918865(616-621)Online publication date: 2001
https://doi.org/10.1109/ITCC.2001.918865
Orlandic RYu B(2001)Implementing KDB-trees to support high-dimensional dataProceedings 2001 International Database Engineering and Applications Symposium10.1109/IDEAS.2001.938071(58-67)Online publication date: 2001
https://doi.org/10.1109/IDEAS.2001.938071
Yu BOrlandic RAgah ACallan JRundensteiner EGauch S(2000)Object and query transformationProceedings of the ninth international conference on Information and knowledge management10.1145/354756.354812(141-149)Online publication date: 6-Nov-2000
https://dl.acm.org/doi/10.1145/354756.354812
Orlandic RByunggu Yu (2000)A study of MBR-based spatial access methods: how well they perform in high-dimensional spacesProceedings 2000 International Database Engineering and Applications Symposium (Cat. No.PR00789)10.1109/IDEAS.2000.880594(306-315)Online publication date: 2000
https://doi.org/10.1109/IDEAS.2000.880594
Pfaltz JOrlandic R(2000)A scalable DBMS for large scientific simulationsProceedings 1999 International Symposium on Database Applications in Non-Traditional Environments (DANTE'99) (Cat. No.PR00496)10.1109/DANTE.1999.844970(271-275)Online publication date: 2000
https://doi.org/10.1109/DANTE.1999.844970

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents