R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Algorithms and applications for answering ranked queries using ranked views
The VLDB Journal — The International Journal on Very Large Data Bases
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Answering top-k queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Performance of compressed inverted list caching in search engines
Proceedings of the 17th international conference on World Wide Web
Efficient top-k querying over social-tagging networks
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Top-k aggregation using intersections of ranked inputs
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Inverted index compression and query processing with optimized document ordering
Proceedings of the 18th international conference on World wide web
Efficient retrieval of the top-k most relevant spatial web objects
Proceedings of the VLDB Endowment
A unified approach to ranking in probabilistic databases
Proceedings of the VLDB Endowment
Supporting ranking queries on uncertain and incomplete data
The VLDB Journal — The International Journal on Very Large Data Bases
Retrieving top-k prestige-based relevant spatial web objects
Proceedings of the VLDB Endowment
Efficient processing of top-k spatial preference queries
Proceedings of the VLDB Endowment
Collective spatial keyword querying
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Text vs. space: efficient geo-search query processing
Proceedings of the 20th ACM international conference on Information and knowledge management
Taagle: efficient, personalized search in collaborative tagging networks
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Network-aware search in social tagging applications: instance optimality versus efficiency
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.00 |
Search applications where queries are dependent on their context are becoming increasingly relevant in today's online applications. For example, the context may be the location of the user in location- aware search or the social network of the query initiator in social-aware search. Processing such queries efficiently is inherently difficult, and requires techniques that go beyond the existing, context-agnostic ones. A promising direction for efficient, online answering -- especially in the case of top-k queries -- is to materialize and exploit previous query results (views). We consider context-aware query optimization based on views, focusing on two important sub-problems. First, handling the possible differences in context between the various views and an input query leads to view results having uncertain scores, i.e., score ranges valid for the new context. As a consequence, current top-k algorithms are no longer directly applicable and need to be adapted to handle such uncertainty in object scores. Second, adapted view selection techniques are needed, which can leverage both the descriptions of queries and statistics over their results. We present algorithms that address these two problems, and illustrate their practical use in two important application scenarios: location-aware search and social-aware search. We validate our approaches via extensive experiments, using both synthetic and real-world datasets.