Skip to main content
SpringerLink
Log in

Ranking in spatial databases

  • Spatial Query Processing
  • Conference paper
  • First Online:
Advances in Spatial Databases (SSD 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 951))

Included in the following conference series:

Abstract

An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatial data structure. The intended application area is a database environment, where the spatial data structure serves as an index. The algorithm is incremental in the sense that objects are reported one by one, so that a query processor can use the algorithm in a pipelined fashion for complex queries involving proximity. It is well suited for k nearest neighbor queries, and has the property that k needs not be fixed in advance.

This work was supported in part by the National Science Foundation under grants IRI-92-16970 and ASC-93-18183.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. G. Aref and H. Samet. Extending a DBMS with spatial operations. In O. Günther and H. J. Schek, editors, Advances in Spatial Databases — 2nd Symposium, SSD'91, pages 299–318, Berlin, 1991. Springer-Verlag. (also Lecture Notes in Computer Science 525).

    Google Scholar 

  2. W. G. Aref and H. Samet. Uniquely reporting spatial objects: yet another operation for comparing spatial data structures. In Proceedings of the Fifth International Symposium on Spatial Data Handling, pages 178–189, Charleston, South Carolina, August 1992.

    Google Scholar 

  3. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 573–582, Arlington, VA., January 1994.

    Google Scholar 

  4. D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121–137, June 1979.

    Google Scholar 

  5. L. M. Goldschlager. Short algorithms for space-filling curves. Software — Practice and Experience, 11(1):99, January 1981.

    Google Scholar 

  6. A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proceedings of the SIGMOD Conference, pages 47–57, Boston, June 1984.

    Google Scholar 

  7. E. G. Hoel and H. Samet. Efficient processing of spatial queries in line segment databases. In O. Günther and H. J. Schek, editors, Advances in Spatial Databases — 2nd Symposium, SSD'91, pages 237–256. Springer-Verlag, Berlin, 1991. (also Lecture Notes in Computer Science 525).

    Google Scholar 

  8. M. Lindenbaum and H. Samet. A probabilistic analysis of trie-based sorting of large collections of line segments. Department of Computer Science CS-TR-3455, University of Maryland, College Park, MD, April 1995.

    Google Scholar 

  9. R. C. Nelson and H. Samet. A population analysis for hierarchical data structures. In Proceedings of the SIGMOD Conference, pages 270–277, San Francisco, May 1987.

    Google Scholar 

  10. J. T. Robinson. The k-d-b-tree: a search structure for large multidimensional dynamic indexes. In Proceedings of the SIGMOD Conference, pages 10–18, Ann Arbor, MI, April 1981.

    Google Scholar 

  11. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pages 71–79, San Jose, CA, May 1995.

    Google Scholar 

  12. H. Samet. Neighbor finding techniques for images represented by quadtrees. Computer Graphics and Image Processing, 18(1):37–57, January 1982.

    Google Scholar 

  13. H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA, 1990.

    Google Scholar 

  14. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.

    Google Scholar 

  15. M. Stonebraker, T. Sellis, and E. Hanson. An analysis of rule indexing implementations in data base systems. In Proceedings of the First International Conference on Expert Database Systems, pages 353–364, Charleston, SC., April 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Center for Automation Research, and Institute for Advanced Computer Studies, University of Maryland, 20742, College Park, MD, USA

    Gísli R. Hjaltason & Hanan Samet

Authors
  1. Gísli R. Hjaltason
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanan Samet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Max J. Egenhofer John R. Herring

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hjaltason, G.R., Samet, H. (1995). Ranking in spatial databases. In: Egenhofer, M.J., Herring, J.R. (eds) Advances in Spatial Databases. SSD 1995. Lecture Notes in Computer Science, vol 951. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60159-7_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-60159-7_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60159-3

  • Online ISBN: 978-3-540-49536-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation