2010 · 39 citations · 12 references
ComputingComputer ScienceData StructuresDatabasesInformation RetrievalNearest Neighbor SearchQuery ProcessingSearching AlgorithmsSpatial Data StructuresSpatial Database SystemsSpatial DatabasesGeographic Query ProcessingGeospatial Information RetrievalLocation-based Information RetrievalLocation-based Query ProcessingSpatial Indexing
Many Web sites support keyword search on their spatial data, such as business listings and photos. In these systems, inconsistencies and errors can exist in both queries and the data. To bridge the gap between queries and data, it is important to support approximate keyword search on spatial data. In this paper we study how to answer such queries efficiently. We focus on a natural index structure that augments a tree-based spatial index with capabilities for approximate keyword search. We systematically study how to efficiently combine these two types of indexes, and how to search the resulting index to find answers. We develop three algorithms for constructing the index, successively improving the time and space efficiency by exploiting the textual and spatial properties of the data. We experimentally demonstrate the efficiency of our techniques on real, large datasets.
12
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · 1990 · 4.2K citations · Full text
Keyword Search on Spatial Databases
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe · 2008 · 485 citations
Efficient query processing in geographic web search engines
Yen‐Yu Chen, Torsten Suel, Alexander Markowetz · 2006 · 291 citations