skip to main content
research-article

Processing Top-k Dominating Queries in Metric Spaces

Published: 29 January 2016 Publication History

Abstract

Top-k dominating queries combine the natural idea of selecting the k best items with a comprehensive “goodness” criterion based on dominance. A point p1 dominates p2 if p1 is as good as p2 in all attributes and is strictly better in at least one. Existing works address the problem in settings where data objects are multidimensional points. However, there are domains where we only have access to the distance between two objects. In cases like these, attributes reflect distances from a set of input objects and are dynamically generated as the input objects change. Consequently, prior works from the literature cannot be applied, despite the fact that the dominance relation is still meaningful and valid. For this reason, in this work, we present the first study for processing top-k dominating queries over distance-based dynamic attribute vectors, defined over a metric space. We propose four progressive algorithms that utilize the properties of the underlying metric space to efficiently solve the problem and present an extensive, comparative evaluation on both synthetic and real-world datasets.

References

[1]
Wolf-Tilo Balke, Ulrich Gntzer, and Jason Xin Zheng. 2004. Efficient distributed skylining for web information systems. In EDBT. 256--273.
[2]
John Louis Bentley, Hsiang-Tsung Kung, Mario Schkolnick, and C. D. Thompson. 1978. On the average number of maxima in a set of vectors and applications. J. ACM 25, 4 (1978), 536--543.
[3]
Stephan Börzsönyi, Donald Kossmann, and Konrad Stocker. 2001. The skyline operator. In Proceedings of ICDE’01. 421--430.
[4]
Tolga Bozkaya and Meral Ozsoyoglu. 1999. Indexing large metric spaces for similarity search queries. ACM Trans. Database Syst. 24, 3 (Sept. 1999), 361--404.
[5]
Sergey Brin. 1995. Near neighbor search in large metric spaces. In Proceedings of the 21th International Conference on Very Large Data Bases (VLDB’95). Morgan Kaufmann Publishers Inc., San Francisco, CA, 574--584.
[6]
Edgar Chávez, Gonzalo Navarro, Ricardo Baeza-Yates, and José Luis Marroquín. 2001. Searching in metric spaces. ACM Comput. Surv. 33, 3 (Sept. 2001), 273--321.
[7]
Lei Chen and Xiang Lian. 2008. Dynamic skyline queries in metric spaces. In Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology (EDBT’08). ACM, New York, NY, 333--343.
[8]
Lei Chen and Xiang Lian. 2009. Efficient processing of metric skyline queries. IEEE Trans. Knowl. Data Eng. 21, 3 (2009), 351--365.
[9]
Paolo Ciaccia, Marco Patella, and Pavel Zezula. 1997. M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB’97). Morgan Kaufmann Publishers Inc., San Francisco, CA, 426--435.
[10]
J. Shane Culpepper, Matthias Petri, and Falk Scholer. 2012. Efficient in-memory top-k document retrieval. In Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR’12). 225--234.
[11]
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, and Jun Xu. 2009. Randomized multi-pass streaming skyline algorithms. Proc. of VLDB Endowment 2, 1 (Aug. 2009), 85--96.
[12]
Ke Deng, Xiaofang Zhou, and Tao Shen. 2007. Multi-source skyline query processing in road networks. In Proceedings of the 23rd International Conference on Data Engineering (ICDE’07). 796--805.
[13]
Cynthia Dwork, Ravi Kumar, Moni Naor, and D. Sivakumar. 2001. Rank aggregation methods for the web. In Proceedings of the 10th International Conference on World Wide Web (WWW’01). 613--622.
[14]
R. Fadel, K. V. Jakobsen, Jyrki Katajainen, and Jukka Teuhola. 1999. Heaps and heapsort on secondary storage. Theor. Comput. Sci. 220, 2 (June 1999), 345--362.
[15]
Ronald Fagin, Amnon Lotem, and Moni Naor. 2001. Optimal aggregation algorithms for middleware. In Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS’01). ACM, New York, NY, 102--113.
[16]
David Fuhry, Ruoming Jin, and Donghui Zhang. 2009. Efficient skyline computation in metric space. In Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (EDBT’09). ACM, New York, NY, 1042--1051.
[17]
Gisli R. Hjaltason and Hanan Samet. 1995. Ranking in spatial databases. In Proceedings of the 4th International Symposium on Advances in Spatial Databases (SSD’95). Springer-Verlag, London, UK, 83--95.
[18]
Gisli R. Hjaltason and Hanan Samet. 2003. Index-driven similarity search in metric spaces (survey article). ACM Trans. Database Syst. 28, 4 (2003), 517--580.
[19]
Vagelis Hristidis, Nick Koudas, and Yannis Papakonstantinou. 2001. PREFER: A system for the efficient execution of multi-parametric ranked queries. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data (SIGMOD’01). ACM, New York, NY, 259--270.
[20]
Ihab F. Ilyas, Walid G. Aref, and Ahmed K. Elmagarmid. 2004. Supporting top-k join queries in relational databases. VLDB J. 13, 3 (2004), 207--221.
[21]
Ihab F. Ilyas, George Beskales, and Mohamed A. Soliman. 2008. A survey of top-k query processing techniques in relational database systems. Comput. Surv. 40, 4, Article 11 (2008), 11:1--11:58.
[22]
Maria Kontaki, Apostolos N. Papadopoulos, and Yannis Manolopoulos. 2012. Continuous top-k dominating queries. IEEE Trans. Knowl. Data Eng. 24, 5 (May 2012), 840--853.
[23]
Andreas Kosmatopoulos, Apostolos N. Papadopoulos, and Kostas Tsichlas. 2014. Dynamic processing of dominating queries with performance guarantees. In Proceedings of the 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24--28, 2014. 225--234.
[24]
Iosif Lazaridis and Sharad Mehrotra. 2001. Progressive approximate aggregate queries with a multi-resolution tree structure. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data (SIGMOD’01). ACM, New York, NY, 401--412.
[25]
Xiang Lian and Lei Chen. 2009. Top-k dominating queries in uncertain databases. In Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (EDBT’09). ACM, New York, NY, 660--671.
[26]
Amélie Marian, Nicolas Bruno, and Luis Gravano. 2004. Evaluating top-k queries over web-accessible databases. ACM Trans. Database Syst. 29, 2 (2004), 319--362.
[27]
Dimitris Papadias, Yufei Tao, Greg Fu, and Bernhard Seeger. 2005a. Progressive skyline computation in database systems. ACM Trans. Database Syst. 30, 1 (March 2005), 41--82.
[28]
Dimitris Papadias, Yufei Tao, Kyriakos Mouratidis, and Chun Kit Hui. 2005b. Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst. 30, 2 (June 2005), 529--576.
[29]
Katerina Raptopoulou, Apostolos N. Papadopoulos, and Yannis Manolopoulos. 2003. Fast nearest-neighbor query processing in moving-object databases. Geoinformatica 7, 2 (2003), 113--137.
[30]
Nick Roussopoulos, Stephen Kelley, and Frédéric Vincent. 1995. Nearest neighbor queries. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data (SIGMOD’95). 71--79.
[31]
Mehdi Sharifzadeh and Cyrus Shahabi. 2006. The spatial skyline queries. In Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB’06). VLDB Endowment, 751--762.
[32]
Cheng Sheng and Yufei Tao. 2011. On finding skylines in external memory. In Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS’11). 107--116.
[33]
Dimitrios Skoutas, Dimitris Sacharidis, Alkis Simitsis, Verena Kantere, and Timos Sellis. 2009. Top-k dominant web services under multi-criteria matching. In Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (EDBT’09). ACM, New York, NY, 898--909.
[34]
Eleftherios Tiakas, Apostolos N. Papadopoulos, and Yannis Manolopoulos. 2011. Progressive processing of subspace dominating queries. VLDB J. 20, 6 (Dec. 2011), 921--948.
[35]
Eleftherios Tiakas, George Valkanas, Apostolos N. Papadopoulos, Yannis Manolopoulos, and Dimitrios Gunopulos. 2014. Metric-based top-k dominating queries. In Proceedings of the 17th International Conference on Extending Database Technology (EDBT), Athens, Greece, March 24--28, 2014. 415--426.
[36]
Akrivi Vlachou, Christos Doulkeridis, and Yannis Kotidis. 2008. Angle-based space partitioning for efficient parallel skyline computation. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (SIGMOD’08). 227--238.
[37]
Yingqi Xu, Tao-Yang Fu, Wang-Chien Lee, and Julian Winter. 2007. Processing K nearest neighbor queries in location-aware sensor networks. Signal Proc. 87, 12 (2007), 2861--2881.
[38]
Man Lung Yiu and Nikos Mamoulis. 2007. Efficient processing of top-k dominating queries on multi-dimensional data. In Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB’07). VLDB Endowment, 483--494.
[39]
Man Lung Yiu and Nikos Mamoulis. 2009. Multi-dimensional top-k dominating queries. VLDB J. 18, 3 (June 2009), 695--718.
[40]
Wenjie Zhang, Xuemin Lin, Ying Zhang, Jian Pei, and Wei Wang. 2010. Threshold-based probabilistic top-k dominating queries. VLDB J. 19, 2 (April 2010), 283--305.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems
ACM Transactions on Database Systems  Volume 40, Issue 4
Special Issue: Invited 2014 PODS and EDBT Revised Articles
February 2016
248 pages
ISSN:0362-5915
EISSN:1557-4644
DOI:10.1145/2866579
Issue’s Table of Contents
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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 January 2016
Accepted: 01 October 2015
Revised: 01 August 2015
Received: 01 February 2015
Published in TODS Volume 40, Issue 4

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Dominating queries
  2. distance computation
  3. metric spaces

Qualifiers

  • Research-article
  • Research
  • Refereed

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)8
  • Downloads (Last 6 weeks)2
Reflects downloads up to 18 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Dynamic layers of maxima with applications to dominating queriesComputational Geometry10.1016/j.comgeo.2020.10169993(101699)Online publication date: Feb-2021
  • (2021)Graph threshold algorithmThe Journal of Supercomputing10.1007/s11227-021-03665-z77:9(9827-9847)Online publication date: 1-Sep-2021
  • (2020)Efficient Approaches to k Representative G-Skyline QueriesACM Transactions on Knowledge Discovery from Data10.1145/339750314:5(1-27)Online publication date: 6-Jul-2020
  • (2019)Scalable Similarity Joins of Tokenized Strings2019 IEEE 35th International Conference on Data Engineering (ICDE)10.1109/ICDE.2019.00193(1766-1777)Online publication date: Apr-2019
  • (2019) Efficient processing of top group skyline queries Knowledge-Based Systems10.1016/j.knosys.2019.06.003Online publication date: Jun-2019
  • (2019)A Top-K Retrieval algorithm based on a decomposition of ranking functionsInformation Sciences10.1016/j.ins.2018.09.014474(136-153)Online publication date: Feb-2019
  • (2018)Efficient Processing of Reverse Top-k Dominating QueriesProceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence10.1145/3297156.3297234(115-119)Online publication date: 8-Dec-2018
  • (2018)Space Filling Approach for Distributed Processing of Top-k Dominating QueriesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2018.279038730:6(1150-1163)Online publication date: 1-Jun-2018
  • (2018)Parallel Processing of Top-k Dominating Queries on Incomplete Data2018 IEEE 4th International Conference on Computer and Communications (ICCC)10.1109/CompComm.2018.8781032(1785-1791)Online publication date: Dec-2018

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media