{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:59:37Z","timestamp":1742997577287,"version":"3.40.3"},"publisher-location":"Cham","reference-count":3,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319210414"},{"type":"electronic","value":"9783319210421"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21042-1_43","type":"book-chapter","created":{"date-parts":[[2015,6,5]],"date-time":"2015-06-05T14:12:18Z","timestamp":1433513538000},"page":"469-472","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bichromatic Reverse kNN Query Algorithm on Road Network Distance"],"prefix":"10.1007","author":[{"given":"Tin Nilar","family":"Win","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Htoo","family":"Htoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yutaka","family":"Ohsawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,6]]},"reference":[{"key":"43_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-38562-9_23","volume-title":"Web-Age Information Management","author":"AT Hlaing","year":"2013","unstructured":"Hlaing, A.T., Htoo, H., Ohsawa, Y., Sonehara, N., Sakauchi, M.: Shortest path finder with light materialized path view for location based services. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds.) WAIM 2013. LNCS, vol. 7923, pp. 229\u2013234. Springer, Heidelberg (2013)"},{"issue":"4","key":"43_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2006.1599381","volume":"18","author":"ML Yiu","year":"2006","unstructured":"Yiu, M.L., Papadias, D., Mamoulis, N., Tao, Y.: Reverse nearest neighbor in large graphs. IEEE Transaction on Knowledge and Data Engineering 18(4), 1\u201314 (2006)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: Proc. 29th VLDB, pp. 790\u2013801 (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21042-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T10:24:26Z","timestamp":1676456666000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21042-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319210414","9783319210421"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21042-1_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"6 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}