{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T01:23:26Z","timestamp":1746667406116,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T00:00:00Z","timestamp":1590364800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T00:00:00Z","timestamp":1590364800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100010669","name":"H2020 LEIT Information and Communication Technologies","doi-asserted-by":"publisher","award":["780754"],"award-info":[{"award-number":["780754"]}],"id":[{"id":"10.13039\/100010669","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012288","name":"Foundation for Research and Technology-Hellas","doi-asserted-by":"publisher","award":["1059","1667"],"award-info":[{"award-number":["1059","1667"]}],"id":[{"id":"10.13039\/501100012288","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10619-020-07297-9","type":"journal-article","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T14:03:10Z","timestamp":1590415390000},"page":"169-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Pruning techniques for parallel processing of reverse top-k queries"],"prefix":"10.1007","volume":"39","author":[{"given":"Panagiotis","family":"Nikitopoulos","sequence":"first","affiliation":[]},{"given":"Georgios A.","family":"Sfyris","sequence":"additional","affiliation":[]},{"given":"Akrivi","family":"Vlachou","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Doulkeridis","sequence":"additional","affiliation":[]},{"given":"Orestis","family":"Telelis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,25]]},"reference":[{"issue":"1","key":"7297_CR1","first-page":"922","volume":"2","author":"A Abouzeid","year":"2009","unstructured":"Abouzeid, A., Bajda-Pawlikowski, K., Abadi, D.J., Rasin, A., Silberschatz, A.: HadoopDB: an architectural hybrid of MapReduce and DBMS technologies for analytical workloads. PVLDB 2(1), 922\u2013933 (2009)","journal-title":"PVLDB"},{"key":"7297_CR2","unstructured":"B\u00f6rzs\u00f6nyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of ICDE, pp. 421\u2013430 (2001)"},{"issue":"2","key":"7297_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00778-012-0269-7","volume":"21","author":"Y Bu","year":"2012","unstructured":"Bu, Y., Howe, B., Balazinska, M., Ernst, M.D.: The HaLoop approach to large-scale iterative data analysis. VLDB J. 21(2), 169\u2013190 (2012)","journal-title":"VLDB J."},{"issue":"1","key":"7297_CR4","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/MMUL.2010.70","volume":"18","author":"KS Candan","year":"2011","unstructured":"Candan, K.S., Kim, J.W., Nagarkar, P., Nagendra, M., Yu, R.: RanKloud: scalable multimedia data processing in server clusters. IEEE MultiMedia 18(1), 64\u201377 (2011)","journal-title":"IEEE MultiMedia"},{"key":"7297_CR5","doi-asserted-by":"crossref","unstructured":"Chang, Y., Bergman, L.D., Castelli, V., Li, C., Lo, M., Smith, J.R.: The onion technique: Indexing for linear optimization queries. In: Proceedings of the SIGMOD, pp. 391\u2013402 (2000)","DOI":"10.1145\/335191.335433"},{"key":"7297_CR6","unstructured":"Cheema, M.A., Shen, Z., Lin, X., Zhang, W.: A unified framework for efficiently processing ranking related queries. In: Proceedings of EDBT, pp. 427\u2013438 (2014)"},{"issue":"1","key":"7297_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"issue":"3","key":"7297_CR8","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s00778-013-0319-9","volume":"23","author":"C Doulkeridis","year":"2014","unstructured":"Doulkeridis, C., N\u00f8rv\u00e5g, K.: A survey of large-scale analytical query processing in mapreduce. VLDB J. 23(3), 355\u2013380 (2014)","journal-title":"VLDB J."},{"key":"7297_CR9","unstructured":"Doulkeridis, C., Vlachou, A., Mpestas, D., Mamoulis, N.: Parallel and distributed processing of spatial preference queries using keywords. In: Proceedings of EDBT, pp. 318\u2013329 (2017)"},{"issue":"7","key":"7297_CR10","first-page":"738","volume":"8","author":"Y Gao","year":"2015","unstructured":"Gao, Y., Liu, Q., Chen, G., Zheng, B., Zhou, L.: Answering why-not questions on reverse top-k queries. PVLDB 8(7), 738\u2013749 (2015)","journal-title":"PVLDB"},{"issue":"5","key":"7297_CR11","first-page":"1015","volume":"25","author":"S Ge","year":"2013","unstructured":"Ge, S., Mamoulis, N., Cheung, D.W.: Efficient all top-k computation: a unified solution for all top-k, reverse top-k and top-m influential queries. IEEE TKDE 25(5), 1015\u20131027 (2013)","journal-title":"IEEE TKDE"},{"issue":"1","key":"7297_CR12","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1109\/TKDE.2016.2602345","volume":"29","author":"K Georgoulas","year":"2017","unstructured":"Georgoulas, K., Vlachou, A., Doulkeridis, C., Kotidis, Y.: User-centric similarity search. IEEE Trans. Knowl. Data Eng. 29(1), 200\u2013213 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7297_CR13","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Koudas, N., Papakonstantinou, Y.: PREFER: a system for the efficient execution of multi-parametric ranked queries. In: Proceedings of SIGMOD, pp. 259\u2013270 (2001)","DOI":"10.1145\/376284.375690"},{"issue":"4","key":"7297_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391729.1391730","volume":"40","author":"IF Ilyas","year":"2008","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 40(4), 1\u201358 (2008)","journal-title":"ACM Comput. Surv."},{"key":"7297_CR15","doi-asserted-by":"crossref","unstructured":"Kim, W., Kim, Y., Shim, K.: Parallel computation of k-nearest neighbor joins using mapreduce. In: Proceedings of BigData, pp. 696\u2013705 (2016)","DOI":"10.1109\/BigData.2016.7840662"},{"issue":"3","key":"7297_CR16","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/2493268","volume":"38","author":"JJ Levandoski","year":"2013","unstructured":"Levandoski, J.J., Eldawy, A., Mokbel, M.F., Khalefa, M.E.: Flexible and extensible preference evaluation in database systems. ACM Trans. Database Syst. 38(3), 17:1\u201317:43 (2013)","journal-title":"ACM Trans. Database Syst."},{"issue":"12","key":"7297_CR17","first-page":"1554","volume":"8","author":"K Mouratidis","year":"2015","unstructured":"Mouratidis, K., Zhang, J., Pang, H.: Maximum rank query. PVLDB 8(12), 1554\u20131565 (2015)","journal-title":"PVLDB"},{"key":"7297_CR18","doi-asserted-by":"crossref","unstructured":"Nikitopoulos, P., Sfyris, G.A., Vlachou, A., Doulkeridis, C., Telelis, O.: Parallel and distributed processing of reverse top-k queries. In: Proceedings of ICDE, pp. 1586\u20131589 (2019)","DOI":"10.1109\/ICDE.2019.00148"},{"issue":"14","key":"7297_CR19","first-page":"2002","volume":"6","author":"Y Park","year":"2013","unstructured":"Park, Y., Min, J., Shim, K.: Parallel computation of skyline and reverse skyline queries using MapReduce. PVLDB 6(14), 2002\u20132013 (2013)","journal-title":"PVLDB"},{"issue":"5","key":"7297_CR20","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1109\/TKDE.2017.2654459","volume":"29","author":"Y Park","year":"2017","unstructured":"Park, Y., Min, J., Shim, K.: Efficient processing of skyline queries using mapreduce. IEEE Trans. Knowl. Data Eng. 29(5), 1031\u20131044 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7297_CR21","doi-asserted-by":"crossref","unstructured":"Rao, S., Ramakrishnan, R., Silberstein, A., Ovsiannikov, M., Reeves, D.: Sailfish: a framework for large scale data processing. In: Proceedings of SOCC, p. 4 (2012)","DOI":"10.1145\/2391229.2391233"},{"key":"7297_CR22","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Landmarks in Mathematics. Princeton University Press, Princeton (1997)"},{"key":"7297_CR23","doi-asserted-by":"crossref","unstructured":"Saouk, M., Doulkeridis, C., Vlachou, A., N\u00f8rv\u00e5g, K.: Efficient processing of top-k joins in mapreduce. In: Proceedings of BigData, pp. 570\u2013577 (2016)","DOI":"10.1109\/BigData.2016.7840649"},{"key":"7297_CR24","doi-asserted-by":"crossref","unstructured":"Tang, B., Mouratidis, K., Yiu, M.L.: Determining the impact regions of competing options in preference space. In: Proceedings of SIGMOD, pp. 805\u2013820 (2017)","DOI":"10.1145\/3035918.3064044"},{"issue":"3","key":"7297_CR25","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.is.2005.12.001","volume":"32","author":"Y Tao","year":"2007","unstructured":"Tao, Y., Hristidis, V., Papadias, D., Papakonstantinou, Y.: Branch-and-bound processing of ranked queries. Inf. Syst. 32(3), 424\u2013445 (2007)","journal-title":"Inf. Syst."},{"key":"7297_CR26","doi-asserted-by":"crossref","unstructured":"Vlachou, A., Doulkeridis, C., Kotidis, Y., N\u00f8rv\u00e5g, K.: Reverse top-k queries. In: Proceedings of ICDE, pp. 365\u2013376 (2010)","DOI":"10.1109\/ICDE.2010.5447890"},{"issue":"8","key":"7297_CR27","first-page":"1215","volume":"23","author":"A Vlachou","year":"2011","unstructured":"Vlachou, A., Doulkeridis, C., Kotidis, Y., N\u00f8rv\u00e5g, K.: Monochromatic and bichromatic reverse top-k queries. IEEE TKDE 23(8), 1215\u20131229 (2011)","journal-title":"IEEE TKDE"},{"key":"7297_CR28","doi-asserted-by":"crossref","unstructured":"Vlachou, A., Doulkeridis, C., N\u00f8rv\u00e5g, K., Kotidis, Y.: Branch-and-bound algorithm for reverse top-k queries. In: Proceedings of SIGMOD, pp. 481\u2013492 (2013)","DOI":"10.1145\/2463676.2465278"},{"key":"7297_CR29","doi-asserted-by":"crossref","unstructured":"Yu, A., Agarwal, P.K., Yang, J.: Processing a large number of continuous preference top-k queries. In: Proceedings of SIGMOD, pp. 397\u2013408 (2012)","DOI":"10.1145\/2213836.2213882"},{"issue":"10","key":"7297_CR30","first-page":"785","volume":"7","author":"Z Zhang","year":"2014","unstructured":"Zhang, Z., Jin, C., Kang, Q.: Reverse k-ranks query. PVLDB 7(10), 785\u2013796 (2014)","journal-title":"PVLDB"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-020-07297-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10619-020-07297-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-020-07297-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T23:29:40Z","timestamp":1621898980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10619-020-07297-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,25]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["7297"],"URL":"https:\/\/doi.org\/10.1007\/s10619-020-07297-9","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"type":"print","value":"0926-8782"},{"type":"electronic","value":"1573-7578"}],"subject":[],"published":{"date-parts":[[2020,5,25]]},"assertion":[{"value":"25 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}