{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:50:24Z","timestamp":1740124224270,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:00:00Z","timestamp":1604880000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:00:00Z","timestamp":1604880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s10619-020-07317-8","type":"journal-article","created":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T08:06:04Z","timestamp":1604909164000},"page":"733-784","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Algorithms for processing the group K nearest-neighbor query on distributed frameworks"],"prefix":"10.1007","volume":"39","author":[{"given":"Panagiotis","family":"Moutafis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Garc\u00eda-Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Mavrommatis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2256-5523","authenticated-orcid":false,"given":"Michael","family":"Vassilakopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Corral","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Iribarne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,9]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The r*-tree: An efficient and robust access method for points and rectangles. In: SIGMOD Conference, pp. 322\u2013331 (1990)","key":"7317_CR1","DOI":"10.1145\/93605.98741"},{"key":"7317_CR2","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.ins.2014.01.015","volume":"275","author":"CLP Chen","year":"2014","unstructured":"Chen, C.L.P., Zhang, C.: Data-intensive applications, challenges, techniques and technologies: a survey on big data. Inf. Sci. 275, 314\u2013347 (2014)","journal-title":"Inf. Sci."},{"unstructured":"Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. In: OSDI Conference, pp. 137\u2013150 (2004)","key":"7317_CR3"},{"doi-asserted-by":"crossref","unstructured":"Eldawy, A., Mokbel, M.F.: Spatialhadoop: A mapreduce framework for spatial data. In: ICDE Conference, pp. 1352\u20131363 (2015)","key":"7317_CR4","DOI":"10.1109\/ICDE.2015.7113382"},{"issue":"1","key":"7317_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10707-011-0149-0","volume":"17","author":"HG Elmongui","year":"2013","unstructured":"Elmongui, H.G., Mokbel, M.F., Aref, W.G.: Continuous aggregate nearest neighbor queries. GeoInformatica 17(1), 63\u201395 (2013)","journal-title":"GeoInformatica"},{"issue":"4","key":"7317_CR6","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66(4), 614\u2013656 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"7317_CR7","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10115-015-0830-y","volume":"46","author":"A Gani","year":"2016","unstructured":"Gani, A., Siddiqa, A., Shamshirband, S., Hanum, F.: A survey on indexing techniques for big data: taxonomy and performance evaluation. Knowl. Inf. Syst. 46(2), 241\u2013284 (2016)","journal-title":"Knowl. Inf. Syst."},{"doi-asserted-by":"crossref","unstructured":"Garcia-Garcia, F., Corral, A., Iribarne, L., Vassilakopoulos, M.: MRSLICE: efficient rknn query processing in spatialhadoop. In: MEDI Conference, pp. 235\u2013250 (2019)","key":"7317_CR8","DOI":"10.1007\/978-3-030-32065-2_17"},{"key":"7317_CR9","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.future.2019.10.037","volume":"111","author":"F Garc\u00eda-Garc\u00eda","year":"2020","unstructured":"Garc\u00eda-Garc\u00eda, F., Corral, A., Iribarne, L., Vassilakopoulos, M.: Improving distance-join query processing with voronoi-diagram based partitioning in spatialhadoop. Future Gener. Comput. Syst. 111, 723\u2013740 (2020)","journal-title":"Future Gener. Comput. Syst."},{"issue":"2","key":"7317_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10707-017-0309-y","volume":"22","author":"F Garcia-Garcia","year":"2018","unstructured":"Garcia-Garcia, F., Corral, A., Iribarne, L., Vassilakopoulos, M., Manolopoulos, Y.: Efficient large-scale distance-based join queries in spatialhadoop. GeoInformatica 22(2), 171\u2013209 (2018)","journal-title":"GeoInformatica"},{"key":"7317_CR11","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ins.2019.10.030","volume":"512","author":"F Garcia-Garcia","year":"2020","unstructured":"Garcia-Garcia, F., Corral, A., Iribarne, L., Vassilakopoulos, M., Manolopoulos, Y.: Efficient distance join query processing in distributed spatial data management systems. Inf. Sci. 512, 985\u20131008 (2020)","journal-title":"Inf. Sci."},{"doi-asserted-by":"crossref","unstructured":"Guo, F., Yuan, Y., Wang, G., Chen, L., Lian, X., Wang, Z.: Cohesive group nearest neighbor queries over road-social networks. In: ICDE Conference, pp. 434\u2013445 (2019)","key":"7317_CR12","DOI":"10.1109\/ICDE.2019.00046"},{"doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD Conference, pp. 47\u201357 (1984)","key":"7317_CR13","DOI":"10.1145\/971697.602266"},{"doi-asserted-by":"crossref","unstructured":"Hashem, T., Kulik, L., Zhang, R.: Privacy preserving group nearest neighbor queries. In: EDBT Conference, pp. 489\u2013500. ACM (2010)","key":"7317_CR14","DOI":"10.1145\/1739041.1739100"},{"issue":"3","key":"7317_CR15","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. 31(3), 264\u2013323 (1999)","journal-title":"ACM Comput. Surv."},{"doi-asserted-by":"crossref","unstructured":"Jiang, T., Gao, Y., Zhang, B., Liu, Q., Chen, L.: Reverse top-k group nearest neighbor search. In: WAIM Conference, pp. 429\u2013439. Springer (2013)","key":"7317_CR16","DOI":"10.1007\/978-3-642-38562-9_44"},{"key":"7317_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.datak.2019.04.004","volume":"122","author":"C Kalyvas","year":"2019","unstructured":"Kalyvas, C., Maragoudakis, M.: Skyline and reverse skyline query processing in spatialhadoop. Data Knowl. Eng. 122, 55\u201380 (2019)","journal-title":"Data Knowl. Eng."},{"issue":"3","key":"7317_CR18","first-page":"31:1","volume":"46","author":"F Li","year":"2014","unstructured":"Li, F., Ooi, B.C., \u00d6zsu, M.T., Wu, S.: Distributed data management using mapreduce. ACM Comput. Surv. 46(3), 31:1\u201331:42 (2014)","journal-title":"ACM Comput. Surv."},{"issue":"10","key":"7317_CR19","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1109\/TKDE.2010.181","volume":"23","author":"F Li","year":"2011","unstructured":"Li, F., Yao, B., Kumar, P.: Group enclosing queries. IEEE Trans. Knowl. Data Eng. 23(10), 1526\u20131540 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Li, H., Lu, H., Huang, B., Huang, Z.: Two ellipse-based pruning methods for group nearest neighbor queries. In: ACM-GIS Conference, pp. 192\u2013199. ACM (2005)","key":"7317_CR20","DOI":"10.1145\/1097064.1097092"},{"issue":"7","key":"7317_CR21","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.1109\/TKDE.2014.2334304","volume":"27","author":"J Li","year":"2015","unstructured":"Li, J., Thomsen, J.R., Yiu, M.L., Mamoulis, N.: Efficient notification of meeting points for moving groups via independent safe regions. IEEE Trans. Knowl. Data Eng. 27(7), 1767\u20131781 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Li, J., Wang, B., Wang, G., Bi, X.: Efficient processing of probabilistic group nearest neighbor query on uncertain data. In: DASFAA Conference, pp. 436\u2013450. Springer (2014)","key":"7317_CR22","DOI":"10.1007\/978-3-319-05810-8_29"},{"issue":"6","key":"7317_CR23","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1109\/TKDE.2008.41","volume":"20","author":"X Lian","year":"2008","unstructured":"Lian, X., Chen, L.: Probabilistic group nearest neighbor queries in uncertain databases. IEEE Trans. Knowl. Data Eng. 20(6), 809\u2013824 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Liu, X., Chen, F., Lu, C.: Robust prediction and outlier detection for spatial datasets. In: ICDM Conference, pp. 469\u2013478 (2012)","key":"7317_CR24","DOI":"10.1109\/ICDM.2012.147"},{"issue":"1","key":"7317_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s11280-012-0200-6","volume":"17","author":"Z Liu","year":"2014","unstructured":"Liu, Z., Wang, C., Wang, J.: Aggregate nearest neighbor queries in uncertain graphs. World Wide Web 17(1), 161\u2013188 (2014)","journal-title":"World Wide Web"},{"doi-asserted-by":"crossref","unstructured":"Luo, Y., Chen, H., Furuse, K., Ohbo, N.: Efficient methods in finding aggregate nearest neighbor by projection-based filtering. In: ICCSA Conference, pp. 821\u2013833. Springer (2007)","key":"7317_CR26","DOI":"10.1007\/978-3-540-74484-9_70"},{"issue":"2","key":"7317_CR27","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10619-015-7173-2","volume":"34","author":"SUR Malik","year":"2016","unstructured":"Malik, S.U.R., Khan, S.U., Ewen, S.J., Tziritas, N., Kolodziej, J., Zomaya, A.Y., Madani, S.A., Min-Allah, N., Wang, L., Xu, C., Malluhi, Q.M., Pecero, J.E., Balaji, P., Vishnu, A., Ranjan, R., Zeadally, S., Li, H.: Performance analysis of data intensive cloud systems based on data management and replication: a survey. Distrib. Parallel Databases 34(2), 179\u2013215 (2016)","journal-title":"Distrib. Parallel Databases"},{"doi-asserted-by":"crossref","unstructured":"Moutafis, P., Garc\u00eda-Garc\u00eda, F., Mavrommatis, G., Vassilakopoulos, M., Corral, A., Iribarne, L.: Mapreduce algorithms for the K group nearest-neighbor query. In: Proceedings of the 34th ACM\/SIGAPP Symposium on Applied Computing, SAC 2019, Limassol, Cyprus, April 8-12, 2019, pp. 448\u2013455 (2019)","key":"7317_CR28","DOI":"10.1145\/3297280.3299733"},{"doi-asserted-by":"crossref","unstructured":"Namnandorj, S., Chen, H., Furuse, K., Ohbo, N.: Efficient bounds in finding aggregate nearest neighbors. In: DEXA Conference, pp. 693\u2013700. Springer (2008)","key":"7317_CR29","DOI":"10.1007\/978-3-540-85654-2_60"},{"doi-asserted-by":"crossref","unstructured":"Nghiem, T.P., Green, D., Taniar, D.: Peer-to-peer group k-nearest neighbours in mobile ad-hoc networks. In: ICPADS Conference, pp. 166\u2013173 (2013)","key":"7317_CR30","DOI":"10.1109\/ICPADS.2013.34"},{"unstructured":"Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: ICDE Conference, pp. 301\u2013312. IEEE (2004)","key":"7317_CR31"},{"issue":"2","key":"7317_CR32","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst. 30(2), 529\u2013576 (2005)","journal-title":"ACM Trans. Database Syst."},{"doi-asserted-by":"crossref","unstructured":"Roumelis, G., Vassilakopoulos, M., Corral, A., Manolopoulos, Y.: Plane-sweep algorithms for the k group nearest-neighbor query. In: GISTAM Conference, pp. 83\u201393. Scitepress (2015)","key":"7317_CR33","DOI":"10.5220\/0005375300830093"},{"doi-asserted-by":"crossref","unstructured":"Roumelis, G., Vassilakopoulos, M., Corral, A., Manolopoulos, Y.: The k group nearest-neighbor query on non-indexed ram-resident data. In: C.\u00a0Grueau, J.\u00a0Gustavo\u00a0Rocha (eds.) Geographical Information Systems Theory, Applications and Management, pp. 69\u201389. Springer, New York (2016)","key":"7317_CR34","DOI":"10.1007\/978-3-319-29589-3_5"},{"issue":"4","key":"7317_CR35","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10109-008-0067-3","volume":"10","author":"M Safar","year":"2008","unstructured":"Safar, M.: Group k-nearest neighbors queries in spatial network databases. J. Geogr. Syst. 10(4), 407\u2013416 (2008)","journal-title":"J. Geogr. Syst."},{"doi-asserted-by":"crossref","unstructured":"Sultana, N., Hashem, T., Kulik, L.: Group nearest neighbor queries in the presence of obstacles. In: SIGSPATIAL Conference, pp. 481\u2013484 (2014)","key":"7317_CR36","DOI":"10.1145\/2666310.2666484"},{"doi-asserted-by":"crossref","unstructured":"Zhang, D., Chan, C., Tan, K.: Nearest group queries. In: SSDBM Conference, p.\u00a07. ACM (2013)","key":"7317_CR37","DOI":"10.1145\/2484838.2484866"},{"doi-asserted-by":"crossref","unstructured":"Zhu, L., Jing, Y., Sun, W., Mao, D., Liu, P.: Voronoi-based aggregate nearest neighbor query processing in road networks. In: ACM-GIS Conference, pp. 518\u2013521. ACM (2010)","key":"7317_CR38","DOI":"10.1145\/1869790.1869876"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-020-07317-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10619-020-07317-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-020-07317-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T12:48:37Z","timestamp":1631537317000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10619-020-07317-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,9]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["7317"],"URL":"https:\/\/doi.org\/10.1007\/s10619-020-07317-8","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"type":"print","value":"0926-8782"},{"type":"electronic","value":"1573-7578"}],"subject":[],"published":{"date-parts":[[2020,11,9]]},"assertion":[{"value":"31 October 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}