{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:12:45Z","timestamp":1779174765521,"version":"3.51.4"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319556987","type":"print"},{"value":"9783319556994","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-55699-4_26","type":"book-chapter","created":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T03:56:53Z","timestamp":1490068613000},"page":"425-440","source":"Crossref","is-referenced-by-count":10,"title":["Efficient Landmark-Based Candidate Generation for kNN Queries on Road Networks"],"prefix":"10.1007","author":[{"given":"Tenindra","family":"Abeywickrama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad Aamir","family":"Cheema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"issue":"6","key":"26_CR1","first-page":"492","volume":"9","author":"T Abeywickrama","year":"2016","unstructured":"Abeywickrama, T., Cheema, M.A., Taniar, D.: K-nearest neighbors on road networks: a journey in experimentation and in-memory implementation. PVLDB 9(6), 492\u2013503 (2016)","journal-title":"PVLDB"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y.: Kawarabayashi, K.I., Kawata, Y.: Fast shortest-path distance queries on road networks by pruned highway labeling. In: ALENEX, pp. 147\u2013154 (2014)","DOI":"10.1137\/1.9781611973198.14"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1002\/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L","volume":"36","author":"M Erwig","year":"2000","unstructured":"Erwig, M., Hagen, F.: The graph voronoi diagram with applications. Networks 36, 156\u2013163 (2000)","journal-title":"Networks"},{"key":"26_CR4","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: SODA, pp. 156\u2013165 (2005)"},{"key":"26_CR5","unstructured":"Goldberg, A.V., Werneck, R.F.F.: Computing point-to-point shortest paths from external memory. In: ALENEX, pp. 26\u201340 (2005)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Kolahdouzan, M., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: VLDB, pp. 840\u2013851 (2004)","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-73540-3_5","volume-title":"Advances in Spatial and Temporal Databases","author":"H-P Kriegel","year":"2007","unstructured":"Kriegel, H.-P., Kr\u00f6ger, P., Kunath, P., Renz, M.: Generalizing the optimality of multi-step k-nearest neighbor query processing. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 75\u201392. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-73540-3_5"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-69497-7_12","volume-title":"Scientific and Statistical Database Management","author":"H-P Kriegel","year":"2008","unstructured":"Kriegel, H.-P., Kr\u00f6ger, P., Renz, M., Schmidt, T.: Hierarchical graph embedding for efficient query processing in very large traffic networks. In: Lud\u00e4scher, B., Mamoulis, N. (eds.) SSDBM 2008. LNCS, vol. 5069, pp. 150\u2013167. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-69497-7_12"},{"key":"26_CR9","doi-asserted-by":"crossref","DOI":"10.1002\/9780470317013","volume-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"A Okabe","year":"2000","unstructured":"Okabe, A., Boots, B., Sugihara, K.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd edn. Wiley, Hoboken (2000)","edition":"2"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB, pp. 802\u2013813 (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"issue":"10","key":"26_CR11","first-page":"901","volume":"6","author":"M Qiao","year":"2013","unstructured":"Qiao, M., Qin, L., Cheng, H., Yu, J.X., Tian, W.: Top-k nearest keyword search on large graphs. PVLDB 6(10), 901\u2013912 (2013)","journal-title":"PVLDB"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD, pp. 43\u201354 (2008)","DOI":"10.1145\/1376616.1376623"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Seidl, T., Kriegel, H.P.: Optimal multi-step k-nearest neighbor search. In: SIGMOD, pp. 154\u2013165 (1998)","DOI":"10.1145\/276304.276319"},{"issue":"3","key":"26_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1025153016110","volume":"7","author":"C Shahabi","year":"2003","unstructured":"Shahabi, C., Kolahdouzan, M., Sharifzadeh, M.: A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica 7(3), 255\u2013273 (2003)","journal-title":"GeoInformatica"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Zheng, B., Zheng, K., Xiao, X., Su, H., Yin, H., Zhou, X., Li, G.: Keyword-aware continuous kNN query on road networks. In: ICDE, pp. 871\u2013882 (2016)","DOI":"10.1109\/ICDE.2016.7498297"},{"issue":"8","key":"26_CR16","first-page":"2175","volume":"27","author":"R Zhong","year":"2015","unstructured":"Zhong, R., Li, G., Tan, K., Zhou, L., Gong, Z.: G-tree: an efficient and scalable index for spatial search on road networks. TKDE 27(8), 2175\u20132189 (2015)","journal-title":"TKDE"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55699-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:48:38Z","timestamp":1568940518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55699-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319556987","9783319556994"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55699-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}