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
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
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
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
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
Efficient diversity-aware search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Ranking with uncertain scoring functions: semantics and sensitivity measures
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
Evaluation and user preference study on spatial diversity
ECIR'2010 Proceedings of the 32nd European conference on Advances in Information Retrieval
DisC diversity: result diversification based on dissimilarity and coverage
Proceedings of the VLDB Endowment
Proceedings of the twenty-ninth annual symposium on Computational geometry
Top-k diversity queries over bounded regions
ACM Transactions on Database Systems (TODS)
Spatial search for K diverse-near neighbors
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
POIKILO: a tool for evaluating the results of diversification models and algorithms
Proceedings of the VLDB Endowment
On the complexity of query result diversification
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
This paper investigates diversity queries over objects embedded in a low-dimensional vector space. 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 arise also in trip planning, news analysis, and real estate scenarios. The targeted queries aim at retrieving the best set of objects relevant to given user criteria and well distributed over a region of interest. Such queries are a particular case of diversified top-k queries, for which existing methods are too costly, as they evaluate diversity by accessing and scanning all relevant objects, even if only a small subset is needed. We therefore introduce Space Partitioning and Probing (SPP), an algorithm that minimizes the number of accessed objects while finding exactly the same result as MMR, the most popular diversification algorithm. SPP belongs to a family of algorithms that rely only on score-based and distance-based access methods, which are available in most geo-referenced Web data sources, and do not require retrieving all the relevant objects. Experiments show that SPP significantly reduces the number of accessed objects while incurring a very low computational overhead.