Hierarchical grid for spatial querying

作者: Rupesh Verma , Anuj Trivedi , Jay J. Zhu , Subramanian Venkateswaran

DOI:

关键词:

摘要: Techniques are provided for improving performance of spatial queries by defining a grid that divides the domain space into cells, and then using cell-to-item mapping to determine which items do not have be individually evaluated against location criteria queries. Based on cell an item belongs, may automatically qualify as match, disqualified, or require item-specific evaluation. To account with size, query window expanded. limit degree is expanded, plurality grids established space, where each has differently sized assigned based size items.

参考文章(11)
Ian Barry Crabtree, Method of indexing entities ,(2001)
Seejo Pylappan, Christopher Blumenberg, Richard Williamson, Michael Matas, Map service with network-based query for search ,(2016)
Matthew W. Baker, Irfan Rashid, Benjamin J. Bowers, Paul M. Steinmetz, Anthony Correale, Hierarchy reassembler for 1×N VLSI design ,(2008)
Hanan Samet, Robert E. Webber, Storing a collection of polygons using quadtrees ACM Transactions on Graphics. ,vol. 4, pp. 182- 222 ,(1985) , 10.1145/282957.282966
Antonin Guttman, R-trees Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84. ,vol. 14, pp. 47- 57 ,(1984) , 10.1145/602259.602266
Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger, The R*-tree: an efficient and robust access method for points and rectangles international conference on management of data. ,vol. 19, pp. 322- 331 ,(1990) , 10.1145/93597.98741
Jon Louis Bentley, Multidimensional binary search trees used for associative searching Communications of the ACM. ,vol. 18, pp. 509- 517 ,(1975) , 10.1145/361002.361007