Advertisement

Ranking in spatial databases

  • Gísli R. Hjaltason
  • Hanan Samet
Spatial Query Processing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 951)

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.

Keywords

Locational Attribute Access Structure Priority Queue Spatial Database Query Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. 4.
    D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121–137, June 1979.Google Scholar
  5. 5.
    L. M. Goldschlager. Short algorithms for space-filling curves. Software — Practice and Experience, 11(1):99, January 1981.Google Scholar
  6. 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. 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. 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. 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. 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. 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. 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. 13.
    H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA, 1990.Google Scholar
  14. 14.
    H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.Google Scholar
  15. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Gísli R. Hjaltason
    • 1
  • Hanan Samet
    • 1
  1. 1.Computer Science Department, Center for Automation Research, and Institute for Advanced Computer StudiesUniversity of MarylandCollege ParkUSA

Personalised recommendations