research-article

Branch-and-bound algorithm for reverse top-k queries

Authors:

Akrivi Vlachou,

Christos Doulkeridis,

Kjetil Nørvåg,

Yannis KotidisAuthors Info & Claims

SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data

Pages 481 - 492

https://doi.org/10.1145/2463676.2465278

Published: 22 June 2013 Publication History

Abstract

Top-k queries return to the user only the k best objects based on the individual user preferences and comprise an essential tool for rank-aware query processing. Assuming a stored data set of user preferences, reverse top-k queries have been introduced for retrieving the users that deem a given database object as one of their top-k results. Reverse top-k queries have already attracted significant interest in research, due to numerous real-life applications such as market analysis and product placement. Currently, the most efficient algorithm for computing the reverse top-k set is RTA. RTA has two main drawbacks when processing a reverse top-k query: (i) it needs to access all stored user preferences, and (ii) it cannot avoid executing a top-k query for each user preference that belongs to the result set. To address these limitations, in this paper, we identify useful properties for processing reverse top-k queries without accessing each user's individual preferences nor executing the top-k query. We propose an intuitive branch-and-bound algorithm for processing reverse top-k queries efficiently and discuss novel optimizations to boost its performance. Our experimental evaluation demonstrates the efficiency of the proposed algorithm that outperforms RTA by a large margin.

References

[1]

R. Akbarinia, E. Pacitti, and P. Valduriez. Best position algorithms for top-k queries. In Proc. of Int. Conf. on Very Large Data Bases (VLDB), pages 495--506, 2007.

Digital Library

[2]

A. Arvanitis, A. Deligiannakis, and Y. Vassiliou. Efficient influence-based processing of market research queries. In Proc. of Conf. on Information and Knowledge Management (CIKM), pages 1193--1202, 2012.

Digital Library

[3]

T. Bernecker, T. Emrich, H.-P. Kriegel, N. Mamoulis, M. Renz, S. Zhang, and A. Züfle. Inverse queries for multidimensional spaces. In Proc. of Int. Symposium on Spatial and Temporal Databases (SSTD), pages 330--347, 2011.

Digital Library

[4]

Y.-C. Chang, L. D. Bergman, V. Castelli, C.-S. Li, M.-L. Lo, and J. R. Smith. The Onion technique: Indexing for linear optimization queries. In Proc. of Int. Conference on Management of Data (SIGMOD), pages 391--402, 2000.

Digital Library

[5]

S. Chaudhuri and L. Gravano. Evaluating top-k selection queries. In Proc. of Int. Conf. on Very Large Data Bases (VLDB), pages 397--410, 1999.

Digital Library

[6]

E. Dellis and B. Seeger. Efficient computation of reverse skyline queries. In Proc. of Int. Conf. on Very Large Data Bases (VLDB), pages 291--302, 2007.

Digital Library

[7]

R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In Proc. of Symposium on Principles of Database Systems (PODS), pages 102--113, 2001.

Digital Library

[8]

S. Ge, L. H. U, N. Mamoulis, and D. W. Cheung. Efficient all top-k computation: A unified solution for all top-k, reverse top-k and top-m influential queries. IEEE Transactions on Knowledge and Data Engineering (TKDE), 25(5):1015--1027, 2013.

Digital Library

[9]

U. Güntzer, W.-T. Balke, and W. Kießling. Optimizing multi-feature queries for image databases. In Proc. of Int. Conf. on Very Large Data Bases (VLDB), pages 419--428, 2000.

Digital Library

[10]

V. Hristidis, N. Koudas, and Y. Papakonstantinou. PREFER: a system for the efficient execution of multi-parametric ranked queries. In Proc. of Int. Conference on Management of Data (SIGMOD), pages 259--270, 2001.

Digital Library

[11]

F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In Proc. of Int. Conference on Management of Data (SIGMOD), pages 201--212, 2000.

Digital Library

[12]

C. Li, B. C. Ooi, A. K. H. Tung, and S. Wang. DADA: a data cube for dominant relationship analysis. In Proc. of Int. Conference on Management of Data (SIGMOD), pages 659--670, 2006.

Digital Library

[13]

X. Lian and L. Chen. Monochromatic and bichromatic reverse skyline search over uncertain databases. In Proc. of Int. Conference on Management of Data (SIGMOD), pages 213--226, 2008.

Digital Library

[14]

A. Marian, N. Bruno, and L. Gravano. Evaluating top-k queries over web-accessible databases. ACM Transactions on Database Systems, 29(2):319--362, 2004.

Digital Library

[15]

M. Miah, G. Das, V. Hristidis, and H. Mannila. Standing out in a crowd: Selecting attributes for maximum visibility. In Proc. of Int. Conf. on Data Engineering (ICDE), pages 356--365, 2008.

Digital Library

[16]

D. Papadias, P. Kalnis, J. Zhang, and Y. Tao. Efficient OLAP operations in spatial data warehouses. In Proc. of Int. Symposium on Spatial and Temporal Databases (SSTD), pages 443--459, 2001.

Digital Library

[17]

Y. Tao, V. Hristidis, D. Papadias, and Y. Papakonstantinou. Branch-and-bound processing of ranked queries. Information Systems, 32(3):424--445, 2007.

Digital Library

[18]

Y. Tao, X. Xiao, and J. Pei. SUBSKY: efficient computation of skylines in subspaces. In Proc. of Int. Conf. on Data Engineering (ICDE), page 65, 2006.

Digital Library

[19]

A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Nørvåg. Reverse top-k queries. In Proc. of Int. Conf. on Data Engineering (ICDE), 2010.

[20]

A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Nørvåg. Monochromatic and bichromatic reverse top-k queries. IEEE Transactions on Knowledge and Data Engineering, 23(8):1215--1229, 2011.

Digital Library

[21]

A. Vlachou, C. Doulkeridis, and K. Nørvåg. Monitoring reverse top-k queries over mobile devices. In Proc. of Int. Workshop on Data Engineering for Wireless and Mobile Access (MobiDE), 2011.

Digital Library

[22]

A. Vlachou, C. Doulkeridis, K. Nørvåg, and Y. Kotidis. Identifying the most influential data objects with reverse top-k queries. PVLDB, 3(1-2):364--372, 2010.

Digital Library

[23]

Q. Wan, R. C.-W. Wong, I. F. Ilyas, M. T. Özsu, and Y. Peng. Creating competitive products. PVLDB, 2(1):898--909, 2009.

Digital Library

[24]

D. Xin, C. Chen, and J. Han. Towards robust indexing for ranked queries. In Proc. of Int. Conf. on Very Large Data Bases (VLDB), pages 235--246, 2006.

Digital Library

[25]

B. Yao, F. Li, and P. Kumar. Reverse furthest neighbors in spatial databases. In Proc. of Int. Conf. on Data Engineering (ICDE), 2009.

Digital Library

[26]

K. Yi, H. Yu, J. Yang, G. Xia, and Y. Chen. Efficient maintenance of materialized top-k views. In Proc. of Int. Conf. on Data Engineering (ICDE), pages 189--200, 2003.

[27]

A. Yu, P. K. Agarwal, and J. Yang. Processing a large number of continuous preference top-k queries. In Proc. of Int. Conference on Management of Data (SIGMOD), pages 397--408, 2012.

Digital Library

Cited By

Bian ZYan XZhang JYiu MTang B(2024)QSRP: Efficient Reverse $k-\text{Ranks}$ Query Processing on High-Dimensional Embeddings2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00351(4614-4627)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00351
Wang WWong RJagadish HXie M(2024)Reverse Regret Query2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00314(4100-4112)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00314
Zhang CLi JJiang S(2024)Durable reverse top-k queries on time-varying preferenceWorld Wide Web10.1007/s11280-024-01293-027:5Online publication date: 2-Aug-2024
https://doi.org/10.1007/s11280-024-01293-0
Show More Cited By

Index Terms

Branch-and-bound algorithm for reverse top-k queries
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Answering why-not and why questions on reverse top-k queries

Why-not and why questions can be posed by database users to seek clarifications on unexpected query results. Specifically, why-not questions aim to explain why certain expected tuples are absent from the query results, while why questions try to clarify ...
Monochromatic and Bichromatic Reverse Top-k Queries

Nowadays, most applications return to the user a limited set of ranked results based on the individual user's preferences, which are commonly expressed through top-k queries. From the perspective of a manufacturer, it is imperative that her products ...
Probabilistic Reverse Top-k Query on Probabilistic Data
Databases Theory and Applications
Abstract
Reverse top-k queries have received much attention from research communities. The result of reverse top-k queries is a set of objects, which had the k-most interest based on their objects’ references. Moreover, answering the queries on ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data

June 2013

1322 pages

ISBN:9781450320375

DOI:10.1145/2463676

General Chairs:
Kenneth Ross
Columbia University
,
Divesh Srivastava
AT&T Research
,
Program Chair:
Dimitris Papadias
HKUST

Copyright © 2013 ACM.

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 ACM 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]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 June 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGMOD/PODS'13

Sponsor:

SIGMOD

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

June 22 - 27, 2013

New York, New York, USA

Acceptance Rates

SIGMOD '13 Paper Acceptance Rate 76 of 372 submissions, 20%;

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
661
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)9

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bian ZYan XZhang JYiu MTang B(2024)QSRP: Efficient Reverse $k-\text{Ranks}$ Query Processing on High-Dimensional Embeddings2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00351(4614-4627)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00351
Wang WWong RJagadish HXie M(2024)Reverse Regret Query2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00314(4100-4112)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00314
Zhang CLi JJiang S(2024)Durable reverse top-k queries on time-varying preferenceWorld Wide Web10.1007/s11280-024-01293-027:5Online publication date: 2-Aug-2024
https://doi.org/10.1007/s11280-024-01293-0
Chen ZManolios PRiedewald M(2023)Why Not Yet: Fixing a Top-k Ranking that is Not Fair to IndividualsProceedings of the VLDB Endowment10.14778/3598581.359860616:9(2377-2390)Online publication date: 10-Jul-2023
https://dl.acm.org/doi/10.14778/3598581.3598606
Nishio SAmagata DHara T(2023)Approximate Reverse Top-k Spatial-Keyword Queries2023 24th IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM58254.2023.00026(96-105)Online publication date: Jul-2023
https://doi.org/10.1109/MDM58254.2023.00026
Le TCao J(2023)Probabilistic Reverse Top-k Query on Probabilistic DataDatabases Theory and Applications10.1007/978-3-031-47843-7_3(30-43)Online publication date: 7-Nov-2023
https://doi.org/10.1007/978-3-031-47843-7_3
Zhang HPeng Q(2022) Design of Branch Definition Algorithm for Top- Inverse Queries for Image Processing Applied Bionics and Biomechanics10.1155/2022/33651612022(1-7)Online publication date: 3-Mar-2022
https://doi.org/10.1155/2022/3365161
Ahmed PEldawy AHristidis VTsotras V(2022)Reverse spatial top-k keyword queriesThe VLDB Journal10.1007/s00778-022-00759-932:3(501-524)Online publication date: 25-Jul-2022
https://doi.org/10.1007/s00778-022-00759-9
Tang BMouratidis KHan MLi GLi ZIdreos SSrivastava D(2021)On m-Impact Regions and Standing Top-k Influence ProblemsProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3452832(1784-1796)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3452832
Jin PLiu ZXiao Y(2020)Discovering the Most Influential Geo-Social Object Using Location Based Social Network Data2020 IEEE International Conference on Knowledge Graph (ICKG)10.1109/ICBK50248.2020.00091(607-614)Online publication date: Aug-2020
https://doi.org/10.1109/ICBK50248.2020.00091
Show More Cited By

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.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten