{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:48Z","timestamp":1740099048297,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319920122"},{"type":"electronic","value":"9783319920139"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92013-9_21","type":"book-chapter","created":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T12:57:09Z","timestamp":1526561829000},"page":"262-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Maximizing Reverse k-Nearest Neighbors for Trajectories"],"prefix":"10.1007","author":[{"given":"Tamjid","family":"Al Rahat","sequence":"first","affiliation":[]},{"given":"Arif","family":"Arman","sequence":"additional","affiliation":[]},{"given":"Mohammed Eunus","family":"Ali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,18]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1016\/B978-012088469-8.50070-X","volume-title":"Proceedings 2004 VLDB Conference","author":"L CHEN","year":"2004","unstructured":"Chen, L., Ng, R.T.: On the marriage of Lp-norms and edit distance. In: VLDB, pp. 792\u2013803 (2004)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Chen, L., Tamer \u00d6zsu, M., Oria, V.: Robust and fast similarity search for moving object trajectories. In: ACM SIGMOD, pp. 491\u2013502 (2005)","DOI":"10.1145\/1066157.1066213"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Chen, Z., Shen, H.T., Zhou, X., Zheng, Y., Xie, X.: Searching trajectories by locations: an efficiency study. In: ACM SIGMOD, pp. 255\u2013266 (2010)","DOI":"10.1145\/1807167.1807197"},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/290593.290596","volume":"27","author":"KL Cheung","year":"1998","unstructured":"Cheung, K.L., Fu, A.W.-C.: Enhanced nearest neighbour search on the r-tree. SIGMOD Rec. 27(3), 16\u201321 (1998)","journal-title":"SIGMOD Rec."},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10707-006-0007-7","volume":"11","author":"E Frentzos","year":"2007","unstructured":"Frentzos, E., Gratsias, K., Pelekis, N., Theodoridis, Y.: Algorithms for nearest neighbor search on moving object trajectories. GeoInformatica 11(2), 159\u2013193 (2007)","journal-title":"GeoInformatica"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10115-012-0527-4","volume":"36","author":"Y Liu","year":"2013","unstructured":"Liu, Y., Wong, R.C.-W., Wang, K., Li, Z., Chen, C., Chen, Z.: A new approach for maximizing bichromatic reverse nearest neighbor search. Knowl. Inf. Syst. 36(1), 23\u201358 (2013)","journal-title":"Knowl. Inf. Syst."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Reza, R.M., Ali, M.E., Cheema, M.A.: The optimal route and stops for a group of users in a road network. In: SIGSPATIAL\/GIS, pp. 4:1\u20134:10. ACM (2017)","DOI":"10.1145\/3139958.3140061"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Shafique, S., Ali, M.E.: Recommending most popular travel path within a region of interest from historical trajectory data. In: MobiGIS, pp. 2\u201311. ACM (2016)","DOI":"10.1145\/3004725.3004728"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Shang, S., Yuan, B., Deng, K., Xie, K., Zhou, X.: Finding the most accessible locations: reverse path nearest neighbor query in road networks. In: GIS, pp. 181\u2013190. ACM (2011)","DOI":"10.1145\/2093973.2093999"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-47724-1_5","volume-title":"Advances in Spatial and Temporal Databases","author":"Z Song","year":"2001","unstructured":"Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 79\u201396. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-47724-1_5"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-22922-0_14","volume-title":"Advances in Spatial and Temporal Databases","author":"L-A Tang","year":"2011","unstructured":"Tang, L.-A., Zheng, Y., Xie, X., Yuan, J., Yu, X., Han, J.: Retrieving k-nearest neighboring trajectories by a set of point locations. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 223\u2013241. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22922-0_14"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Vlachos, M., Gunopulos, D., Kollios, G.: Discovering similar multidimensional trajectories. In: ICDE, pp. 673\u2013684 (2002)","DOI":"10.1109\/ICDE.2002.994784"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Wang, S., Bao, Z., Shane Culpepper, J., Sellis, T.K., Cong, G.: Reverse $$k$$ nearest neighbor search over trajectories. CoRR, abs\/1704.03978 (2017)","DOI":"10.1109\/ICDE.2018.00250"},{"issue":"1","key":"21_CR14","first-page":"1126","volume":"2","author":"RC-W Wong","year":"2009","unstructured":"Wong, R.C.-W., Tamer \u00d6zsu, M., Yu, P.S., Fu, A.W.-C., Liu, L.: Efficient method for maximizing bichromatic reverse nearest neighbor. PVLDB 2(1), 1126\u20131137 (2009)","journal-title":"PVLDB"},{"key":"21_CR15","unstructured":"Yi, B.-K., Jagadish, H.V., Faloutsos, C.: Efficient retrieval of similar time sequences under time warping. In: ICDE, pp. 201\u2013208 (1998)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Wu, W., Li, X., Lee, M.-L., Hsu, W.: MaxFirst for MaxBRkNN. In: ICDE, pp. 828\u2013839. IEEE Computer Society (2011)","DOI":"10.1109\/ICDE.2011.5767892"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92013-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T03:23:24Z","timestamp":1604287404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92013-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319920122","9783319920139"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92013-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}