Database Paper Browser

Back to papers

Spatial Priority Search: An Access Technique for Scaleless Maps

Summary: Spatial Priority Search provides an adaptive index for scaleless maps, supporting inserts, deletes, updates, and location-based queries at arbitrary scales. It uses priority-based generalization to ignore low-priority points, partitions polygon corners with minimal redundancy, and enables fast proximity queries under a threshold. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2521
Venue
SIGMOD
Year
1991
Pagerank
4.4442316e-05
Overall Rank
8,810 | 38.72%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
5,458 V-Trees - A Storage Method for Long Vector Data 1994 VLDB 5.496829e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0032169493
6 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0016162015
1,008 The BANG file: a new kind of grid file 1987 SIGMOD 0.00014666726
Previous Page 1 / 1 Next

Semantically Similar Papers