The use of MMR, diversity-based reranking for reordering documents and producing summaries
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Combining fuzzy information: an overview
ACM SIGMOD Record
Fast Nearest Neighbor Search in High-Dimensional Space
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Evaluating top-k queries over web-accessible databases
ACM Transactions on Database Systems (TODS)
Efficient query processing in geographic web search engines
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Supporting top-K join queries in relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Evaluating rank joins with optimal cost
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Proceedings of the Second ACM International Conference on Web Search and Data Mining
An axiomatic approach for result diversification
Proceedings of the 18th international conference on World wide web
Efficient Computation of Diverse Query Results
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
Structured search result differentiation
Proceedings of the VLDB Endowment
Efficient retrieval of the top-k most relevant spatial web objects
Proceedings of the VLDB Endowment
Diversifying web search results
Proceedings of the 19th international conference on World wide web
DivQ: diversification for keyword search over structured databases
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
ACM SIGMOD Record
Approximation algorithms for diversified search ranking
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Proceedings of the VLDB Endowment
Retrieving top-k prestige-based relevant spatial web objects
Proceedings of the VLDB Endowment
Regret-minimizing representative databases
Proceedings of the VLDB Endowment
Multi-dimensional search result diversification
Proceedings of the fourth ACM international conference on Web search and data mining
Real understanding of real estate forms
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Efficient diversification of web search results
Proceedings of the VLDB Endowment
Collective spatial keyword querying
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient diversity-aware search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
On query result diversification
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Subject-oriented top-k hot region queries in spatial dataset
Proceedings of the 20th ACM international conference on Information and knowledge management
Evaluation and user preference study on spatial diversity
ECIR'2010 Proceedings of the 32nd European conference on Advances in Information Retrieval
Max-Sum diversification, monotone submodular functions and dynamic updates
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Dynamic diversification of continuous data
Proceedings of the 15th International Conference on Extending Database Technology
Proceedings of the VLDB Endowment
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
| Hi-index | 0.00 |
Top-k diversity queries over objects embedded in a low-dimensional vector space aim to retrieve the best k objects that are both relevant to given user's criteria and well distributed over a designated region. An interesting case is provided by spatial Web objects, which are produced in great quantity by location-based services that let users attach content to places and are found also in domains like trip planning, news analysis, and real estate. In this article we present a technique for addressing such queries that, unlike existing methods for diversified top-k queries, does not require accessing and scanning all relevant objects in order to find the best k results. Our Space Partitioning and Probing (SPP) algorithm works by progressively exploring the vector space, while keeping track of the already seen objects and of their relevance and position. The goal is to provide a good quality result set in terms of both relevance and diversity. We assess quality by using as a baseline the result set computed by MMR, one of the most popular diversification algorithms, while minimizing the number of accessed objects. In order to do so, SPP exploits score-based and distance-based access methods, which are available, for instance, in most geo-referenced Web data sources. Experiments with both synthetic and real data show that SPP produces results that are relevant and spatially well distributed, while significantly reducing the number of accessed objects and incurring a very low computational overhead.