MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Ranking in spatial databases (1995) [150 citations — 20 self]

Download:
Download as a PDF
by G Sli R. Hjaltason, Hanan Samet
http://www.cs.umd.edu/users/grh/incnear.pdf
Add To MetaCart

Abstract:

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. Itiswell suited for k nearest neighbor queries, and has the property that k needs not be xed in advance. 1

Citations

1651 R-trees: A dynamic index structure for spatial searching – Guttman - 1984
1014 The Design and Analysis of Spatial Data Structures – Samet - 1989
455 The ubiquitous B-tree – Comer - 1979
442 ÂȘAn Optimal Algorithm for Approximate Nearest Neighbor Searching – Arya, Mount, et al. - 1994
347 Nearest Neighbor Queries – Roussopoulos, Kelley, et al. - 1995
300 The K-D-B Tree: A Search Structure for Large Multidimensional Indexes – Robinson - 1981
40 Neighbor finding techniques for images represented by quadtrees – Samet - 1982
35 H.: Extending a DBMS with spatial operations – Aref, Samet - 1991
32 An analysis of rule indexing implementations in data base systems – Stonebraker, Sellis, et al. - 1986
25 Efficient processing of spatial queries in line segment databases – Hoel, Samet - 1991
25 A population analysis for hierarchical data structures – NELSON, SAMET - 1987
17 Uniquely reporting spatial objects: yet another operation for comparing spatial data structures – Aref, Samet - 1992
5 A probabilistic analysis of trie-based sorting of large collections of line segments – Lindenbaum, Samet - 1995
5 Short algorithms for space-filling curves – Goldschlager - 1981
3 Short algorithms for space- lling curves – Goldschlager - 1981
1 Neighbor nding techniques for images represented by quadtrees – Samet - 1982