A signature access method for the Starburst database system
VLDB '89 Proceedings of the 15th international conference on Very large data bases
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Inverted files versus signature files for text indexing
ACM Transactions on Database Systems (TODS)
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
An Enhanced Technique for k-Nearest Neighbor Queries with Non-Spatial Selection Predicates
Multimedia Tools and Applications
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Optimizing bitmap indices with efficient compression
ACM Transactions on Database Systems (TODS)
Inverted files for text search engines
ACM Computing Surveys (CSUR)
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
P-Cube: Answering Preference Queries in Multi-Dimensional Space
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
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
SpSJoin: parallel spatial similarity joins
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Keyword-based k-nearest neighbor search in spatial databases
Proceedings of the 21st ACM international conference on Information and knowledge management
Spatial keyword query processing: an experimental evaluation
Proceedings of the VLDB Endowment
Collective spatial keyword queries: a distance owner-driven approach
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
In this paper, we present a novel method to efficiently process top-k spatial queries with conjunctive Boolean constraints on textual content. Our method combines an R-tree with an inverted index by the inclusion of spatial references in posting lists. The result is a disk-resident, dual-index data structure that is used to proactively prune the search space. R-tree nodes are visited in best-first order. A node entry is placed in the priority queue if there exists at least one object that satisfies the Boolean condition in the subtree pointed by the entry; otherwise, the subtree is not further explored. We show via extensive experimentation with real spatial databases that our method has increased performance over alternate techniques while scaling to large number of objects.