tutorial

Applications of Top-k Representative Queries

Authors:

Sayan Ranu,

Minh Hoang,

Ambuj SinghAuthors Info & Claims

SWIM'14: Proceedings of Semantic Web Information Management on Semantic Web Information Management

Pages 1 - 2

https://doi.org/10.1145/2630602.2630609

Published: 21 June 2014 Publication History

Get Access

Abstract

Top-k queries find a list of k objects that have the largest scores based on some user-provided relevance function. In practice, objects in the top-k list are often similar to each other and are thus informationally redundant. This possibility of information redundancy has ignited much interest in the problem of diversity-aware top-k queries. In diversity-aware queries, the goal is to maximize the diversity of the answer set, which in turn enhances the overall information content by representing a wider spectrum of the high scoring objects. In this paper, we demonstrate that the information content in the top-k answer set can be further enhanced by favoring the representative power of the answer set instead of diversity.

References

[1]

A. Angel and N. Koudas. Efficient diversity-aware search. In SIGMOD Conference, pages 781--792, 2011.

Digital Library

Google Scholar

[2]

G. Capannini, F. M. Nardini, R. Perego, and F. Silvestri. Efficient diversification of web search results. PVLDB, 4, 2011.

Digital Library

Google Scholar

[3]

M. Drosou and E. Pitoura. Disc diversity: result diversification based on dissimilarity and coverage. PVLDB, 6(1):13--24, 2012.

Digital Library

Google Scholar

[4]

DUD. http://dud.docking.org/r2/.

Google Scholar

[5]

S. Ranu, M. Hoang, and A. Singh. Answering top-k representative queries on graph databases. In SIGMOD, 2014.

Digital Library

Google Scholar

[6]

S. Ranu and A. K. Singh. Answering top-k queries over a mixture of attractive and repulsive dimensions. PVLDB, 5(3):169--180, 2011.

Digital Library

Google Scholar

Cited By

View all

Lan LWang PShi RLiu TZeng JSun FRen YTao JGuan XHui Yang GWang HHan SHauff CZuccon GZhang Y(2024)Grand: A Fast and Accurate Graph Retrieval Framework via Knowledge DistillationProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3626772.3657773(1639-1648)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1145/3626772.3657773
Wang YLi YFan JYe CChai M(2020)A survey of typical attributed graph queriesWorld Wide Web10.1007/s11280-020-00849-024:1(297-346)Online publication date: 20-Nov-2020
https://doi.org/10.1007/s11280-020-00849-0

Index Terms

Applications of Top-k Representative Queries
1. Information systems
  1. Information retrieval

Recommendations

Answering top-k representative queries on graph databases
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data

Given a function that classifies a data object as relevant or irrelevant, we consider the task of selecting k objects that best represent all relevant objects in the underlying database. This problem occurs naturally when analysts want to familiarize ...
Probabilistic top-k and ranking-aggregate queries

Ranking and aggregation queries are widely used in data exploration, data analysis, and decision-making scenarios. While most of the currently proposed ranking and aggregation techniques focus on deterministic data, several emerging applications involve ...
A pruning-based approach for supporting Top-K join queries
WWW '06: Proceedings of the 15th international conference on World Wide Web

An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. This paper resolves this issue by proposing an efficient pruning-based ...

Comments

Information & Contributors

Information

Published In

SWIM'14: Proceedings of Semantic Web Information Management on Semantic Web Information Management

June 2014

45 pages

ISBN:9781450329941

DOI:10.1145/2630602

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 June 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Tutorial
Research
Refereed limited

Conference

SIGMOD/PODS'14

Sponsor:

SIGMOD

SIGMOD/PODS'14: International Conference on Management of Data

June 22 - 27, 2014

UT, Snowbird, USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
104
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lan LWang PShi RLiu TZeng JSun FRen YTao JGuan XHui Yang GWang HHan SHauff CZuccon GZhang Y(2024)Grand: A Fast and Accurate Graph Retrieval Framework via Knowledge DistillationProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3626772.3657773(1639-1648)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1145/3626772.3657773
Wang YLi YFan JYe CChai M(2020)A survey of typical attributed graph queriesWorld Wide Web10.1007/s11280-020-00849-024:1(297-346)Online publication date: 20-Nov-2020
https://doi.org/10.1007/s11280-020-00849-0

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Answering top-k representative queries on graph databases

Probabilistic top-k and ranking-aggregate queries

A pruning-based approach for supporting Top-K join queries

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations