{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:31:08Z","timestamp":1760596268489,"version":"3.41.0"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2016,1,29]],"date-time":"2016-01-29T00:00:00Z","timestamp":1454025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2016,2,3]]},"abstract":"<jats:p>\n            <jats:italic>Top<\/jats:italic>\n            -\n            <jats:italic>k<\/jats:italic>\n            <jats:italic>dominating queries<\/jats:italic>\n            combine the natural idea of selecting the\n            <jats:italic>k<\/jats:italic>\n            best items with a comprehensive \u201cgoodness\u201d criterion based on dominance. A point\n            <jats:italic>p<\/jats:italic>\n            <jats:sub>1<\/jats:sub>\n            dominates\n            <jats:italic>p<\/jats:italic>\n            <jats:sub>2<\/jats:sub>\n            if\n            <jats:italic>p<\/jats:italic>\n            <jats:sub>1<\/jats:sub>\n            is as good as\n            <jats:italic>p<\/jats:italic>\n            <jats:sub>2<\/jats:sub>\n            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\n            <jats:italic>\n              top-\n              <jats:italic>k<\/jats:italic>\n              dominating queries\n            <\/jats:italic>\n            over distance-based dynamic attribute vectors, defined over a\n            <jats:italic>metric space<\/jats:italic>\n            . 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.\n          <\/jats:p>","DOI":"10.1145\/2847524","type":"journal-article","created":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T20:37:54Z","timestamp":1454359074000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Processing Top-k Dominating Queries in Metric Spaces"],"prefix":"10.1145","volume":"40","author":[{"given":"Eleftherios","family":"Tiakas","sequence":"first","affiliation":[{"name":"Aristotle University of Thessaloniki, Thessaloniki, Greece"}]},{"given":"George","family":"Valkanas","sequence":"additional","affiliation":[{"name":"Stevens Institute of Technology, New Jersey, USA"}]},{"given":"Apostolos N.","family":"Papadopoulos","sequence":"additional","affiliation":[{"name":"Aristotle University of Thessaloniki, Thessaloniki, Greece"}]},{"given":"Yannis","family":"Manolopoulos","sequence":"additional","affiliation":[{"name":"Aristotle University of Thessaloniki, Thessaloniki, Greece"}]},{"given":"Dimitrios","family":"Gunopulos","sequence":"additional","affiliation":[{"name":"University of Athens, Athens, Greece"}]}],"member":"320","published-online":{"date-parts":[[2016,1,29]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Wolf-Tilo Balke Ulrich Gntzer and Jason Xin Zheng. 2004. Efficient distributed skylining for web information systems. In EDBT. 256--273.  Wolf-Tilo Balke Ulrich Gntzer and Jason Xin Zheng. 2004. Efficient distributed skylining for web information systems. In EDBT. 256--273.","DOI":"10.1007\/978-3-540-24741-8_16"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322095"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/328939.328959"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645921.673006"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353386"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.146"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB\u201997)","author":"Ciaccia Paolo","year":"1997","unstructured":"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\u201997) . Morgan Kaufmann Publishers Inc., San Francisco, CA, 426--435. 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\u201997). Morgan Kaufmann Publishers Inc., San Francisco, CA, 426--435."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348317"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687638"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367925"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372165"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00006-7"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375567"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516479"},{"volume-title":"Proceedings of the 4th International Symposium on Advances in Spatial Databases (SSD\u201995)","author":"Gisli","key":"e_1_2_1_17_1","unstructured":"Gisli R. Hjaltason and Hanan Samet. 1995. Ranking in spatial databases . In Proceedings of the 4th International Symposium on Advances in Spatial Databases (SSD\u201995) . Springer-Verlag, London, UK, 83--95. Gisli R. Hjaltason and Hanan Samet. 1995. Ranking in spatial databases. In Proceedings of the 4th International Symposium on Advances in Spatial Databases (SSD\u201995). Springer-Verlag, London, UK, 83--95."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958948"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375690"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0128-2"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.43"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 17th International Conference on Database Theory (ICDT)","author":"Kosmatopoulos Andreas","year":"2014","unstructured":"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. 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."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375718"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516437"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005566.1005569"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061320"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071616"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023403908170"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1182635.1164192"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989298"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516463"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0231-0"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 17th International Conference on Extending Database Technology (EDBT)","author":"Tiakas Eleftherios","year":"2014","unstructured":"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. 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."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376642"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2007.05.013"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1325851.1325908"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0117-y"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0162-1"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2847524","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2847524","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:43:27Z","timestamp":1750225407000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2847524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,29]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,2,3]]}},"alternative-id":["10.1145\/2847524"],"URL":"https:\/\/doi.org\/10.1145\/2847524","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"type":"print","value":"0362-5915"},{"type":"electronic","value":"1557-4644"}],"subject":[],"published":{"date-parts":[[2016,1,29]]},"assertion":[{"value":"2015-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-01-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}