Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Multidimensional access methods
ACM Computing Surveys (CSUR)
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Modern Information Retrieval
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Hybrid index structures for location-based web search
Proceedings of the 14th ACM international conference on Information and knowledge management
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Efficient query processing in geographic web search engines
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Processing Spatial-Keyword (SK) Queries in Geographic Information Retrieval (GIR) Systems
SSDBM '07 Proceedings of the 19th International Conference on Scientific and Statistical Database Management
Efficient document retrieval in main memory
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Performance of compressed inverted list caching in search engines
Proceedings of the 17th international conference on World Wide Web
Geographical information retrieval
International Journal of Geographical Information Science
Inverted index compression and query processing with optimized document ordering
Proceedings of the 18th international conference on World wide web
Keyword Search on Spatial Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Efficient retrieval of the top-k most relevant spatial web objects
Proceedings of the VLDB Endowment
Retrieving top-k prestige-based relevant spatial web objects
Proceedings of the VLDB Endowment
Hyper-local, directions-based ranking of places
Proceedings of the VLDB Endowment
IR-Tree: An Efficient Index for Geographic Document Search
IEEE Transactions on Knowledge and Data Engineering
Spatio-textual indexing for geographical search on the web
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Spatial keyword query processing: an experimental evaluation
Proceedings of the VLDB Endowment
Scalable top-k spatial keyword search
Proceedings of the 16th International Conference on Extending Database Technology
Collective spatial keyword queries: a distance owner-driven approach
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
An efficient query indexing mechanism for filtering geo-textual data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Map search via a factor graph model
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Context-aware top-K processing using views
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Spatial keyword querying of geo-tagged web content
Proceedings of the 7th International Workshop on Ranking in Databases
Top-K nearest keyword search on large graphs
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Many web search services allow users to constrain text queries to a geographic location (e.g., yoga classes near Santa Monica). Important examples include local search engines such as Google Local and location-based search services for smart phones. Several research groups have studied the efficient execution of queries mixing text and geography; their approaches usually combine inverted lists with a spatial access method such as an R-tree or space-filling curve. In this paper, we take a fresh look at this problem. We feel that previous work has often focused on the spatial aspect at the expense of performance considerations in text processing, such as inverted index access, compression, and caching. We describe new and existing approaches and discuss their different perspectives. We then compare their performance in extensive experiments on large document collections. Our results indicate that a query processor that combines state-of-the-art text processing techniques with a simple coarse-grained spatial structure can outperform existing approaches by up to two orders of magnitude. In fact, even a naive approach that first uses a simple inverted index and then filters out any documents outside the query range outperforms many previous methods.