{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:09:17Z","timestamp":1750306157774,"version":"3.41.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T00:00:00Z","timestamp":1474416000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Union Seventh Framework Programme - Marie Curie Actions"},{"name":"Initial Training Network GEOCROWD","award":["FP7-PEOPLE-2010-ITN-264994"],"award-info":[{"award-number":["FP7-PEOPLE-2010-ITN-264994"]}]},{"name":"NGA NURI","award":["HM02101410004"],"award-info":[{"award-number":["HM02101410004"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Spatial Algorithms Syst."],"published-print":{"date-parts":[[2016,10,14]]},"abstract":"<jats:p>\n            Novel Web technologies and resulting applications have led to a participatory data ecosystem that, when utilized properly, will lead to more rewarding services. In this work, we investigate the case of Location-Based Services, specifically how to improve the typical location-based Point-of-Interest (POI) request processed as a\n            <jats:italic>k<\/jats:italic>\n            -Nearest-Neighbor query. This work introduces Links-of-Interest (LOI) between POIs as a means to increase the relevance and overall result quality of such queries. By analyzing user-contributed content in the form of travel blogs, we establish the overall popularity of an LOI, that is, how frequently the respective POI pair was visited and is mentioned in the same context. Our contribution is a query-processing method for so-called\n            <jats:italic>k<\/jats:italic>\n            -Relevant Nearest Neighbor (\n            <jats:italic>k<\/jats:italic>\n            -RNN) queries that considers spatial proximity in combination with LOI information to retrieve close-by and relevant (as judged by the crowd) POIs. Our method is based on intelligently combining indices for spatial data (a spatial grid) and for relevance data (a graph) during query processing. Using landmarks as a means to prune the search space in the Relevance Graph, we improve the proposed methods. Using in addition A*-directed search, the query performance can be further improved. An experimental evaluation using real and synthetic data establishes that our approach efficiently solves the\n            <jats:italic>k<\/jats:italic>\n            -RNN problem.\n          <\/jats:p>","DOI":"10.1145\/2934675","type":"journal-article","created":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T13:13:56Z","timestamp":1474463636000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Processing of Relevant Nearest-Neighbor Queries"],"prefix":"10.1145","volume":"2","author":[{"given":"Christodoulos","family":"Efstathiades","sequence":"first","affiliation":[{"name":"National Technical University of Athens"}]},{"given":"Alexandros","family":"Efentakis","sequence":"additional","affiliation":[{"name":"Research Center \u201cAthena\u201d, Marousi, Greece"}]},{"given":"Dieter","family":"Pfoser","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA"}]}],"member":"320","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536206.2536218"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920891"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989363"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142505"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687666"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497474"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1768570.1768577"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2068984.2068990"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424383"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40235-7_18"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1600"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"volume-title":"Proceedings of the 16th SODA Conference. 156--165","author":"Andrew","key":"e_1_2_1_14_1","unstructured":"Andrew V. Goldberg and Chris Harrelson. 2005. Computing the shortest path: A search meets graph theory . In Proceedings of the 16th SODA Conference. 156--165 . Andrew V. Goldberg and Chris Harrelson. 2005. Computing the shortest path: A search meets graph theory. In Proceedings of the 16th SODA Conference. 156--165."},{"volume-title":"Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX\u201905)","author":"Andrew","key":"e_1_2_1_15_1","unstructured":"Andrew V. Goldberg and Renato F. Werneck. 2005. Computing point-to-point shortest paths from external memory . In Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX\u201905) . 26--40. Andrew V. Goldberg and Renato F. Werneck. 2005. Computing point-to-point shortest paths from external memory. In Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX\u201905). 26--40."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/320248.320255"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"volume-title":"IN: 9th Dimacs Implementation Challenge.","author":"K\u00f6hler Ekkehard","key":"e_1_2_1_20_1","unstructured":"Ekkehard K\u00f6hler , Rolf H. M\u00f6hring , and Heiko Schilling . 2006. Fast point-to-point shortest path computations with arc-flags . In IN: 9th Dimacs Implementation Challenge. Ekkehard K\u00f6hler, Rolf H. M\u00f6hring, and Heiko Schilling. 2006. Fast point-to-point shortest path computations with arc-flags. In IN: 9th Dimacs Implementation Challenge."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316759"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113321"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.149"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1111\/tgis.12023"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465275"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1096985.1096993"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1564502"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2339838"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453973"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/647227.719095"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2035253.2035270"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2534732.2534742"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the 18th International EDBT Conference. 493--504","author":"Sun Yu","year":"2015","unstructured":"Yu Sun , Jianzhong Qi , Yu Zheng , and Rui Zhang . 2015 . K-nearest neighbor temporal aggregate queries . In Proceedings of the 18th International EDBT Conference. 493--504 . Yu Sun, Jianzhong Qi, Yu Zheng, and Rui Zhang. 2015. K-nearest neighbor temporal aggregate queries. In Proceedings of the 18th International EDBT Conference. 493--504."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063834"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_13"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.77"},{"key":"e_1_2_1_38_1","volume-title":"Beng Chin Ooi, and Anthony K. H. Tung","author":"Zhang Dongxiang","year":"2010","unstructured":"Dongxiang Zhang , Beng Chin Ooi, and Anthony K. H. Tung . 2010 . Locating mapped resources in Web 2.0. In ICDE. Dongxiang Zhang, Beng Chin Ooi, and Anthony K. H. Tung. 2010. Locating mapped resources in Web 2.0. In ICDE."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1099554.1099584"}],"container-title":["ACM Transactions on Spatial Algorithms and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2934675","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2934675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:47Z","timestamp":1750217987000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2934675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,21]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10,14]]}},"alternative-id":["10.1145\/2934675"],"URL":"https:\/\/doi.org\/10.1145\/2934675","relation":{},"ISSN":["2374-0353","2374-0361"],"issn-type":[{"type":"print","value":"2374-0353"},{"type":"electronic","value":"2374-0361"}],"subject":[],"published":{"date-parts":[[2016,9,21]]},"assertion":[{"value":"2015-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-09-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}