{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:08:40Z","timestamp":1743001720660,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642230905"},{"type":"electronic","value":"9783642230912"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23091-2_13","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T04:52:27Z","timestamp":1312951947000},"page":"136-143","source":"Crossref","is-referenced-by-count":5,"title":["An Incremental Approach to Closest Pair Queries in Spatial Networks Using Best-First Search"],"prefix":"10.1007","author":[{"given":"Chunan","family":"Chen","sequence":"first","affiliation":[]},{"given":"Weiwei","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Dingding","family":"Mao","sequence":"additional","affiliation":[]},{"given":"Weimo","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD (1984)","DOI":"10.1145\/602259.602266"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest Pair Queries in Spatial Databases. In: SIGMOD (2000)","DOI":"10.1145\/342009.335414"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: VLBD (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, J., Samet, H.: Distance Join Queries on Spatial Networks. In: GIS (2006)","DOI":"10.1145\/1183471.1183506"},{"issue":"1","key":"13_CR5","first-page":"102","volume":"19","author":"S. Shekhar","year":"1997","unstructured":"Shekhar, S., Liu, D.: CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations. TKDE\u00a019(1), 102\u2013119 (1997)","journal-title":"TKDE"},{"key":"13_CR6","unstructured":"Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous Nearest Neighbor Monitoring in Road Networks. In: VLDB (2006)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Kolahdouzan, M., Shahabi, C.: Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases. In: VLDB (2004)","DOI":"10.1016\/B978-012088469-8.50074-7"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","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\u00a07(3), 255\u2013273 (2003)","journal-title":"Geoinformatica"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable Network Distance Browsing in Spatial Databases. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376623"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, J., Samet, H.: Distance Oracles for Spatial Networks. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.53"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, J., Samet, H.: Path Oracles for Spatial Networks. In: VLDB (2009)","DOI":"10.1109\/ICDE.2009.53"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/1994.2022","volume":"9","author":"W. Effelsberg","year":"1984","unstructured":"Effelsberg, W.: Principles of Database buffer Management. ACM TODS\u00a09(4), 560\u2013595 (1984)","journal-title":"ACM TODS"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"O\u2019Neil, E.J., Neil, P.E.O., Weikum, G.: The LRU-K Page Replacement Algorithm for Database Disk Buffering. In: SIGMOD (1993)","DOI":"10.1145\/170035.170081"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Papadopoulos, A., Manolopoulos, Y.: Global Page Replacement in Spatial Databases. In: DEXA (1996)","DOI":"10.1007\/BFb0034737"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T.: A Robust and Self-tuning Page Replacement Strategy for Spatial Database Systems. In: DEXA (2002)","DOI":"10.1007\/3-540-45876-X_34"},{"key":"13_CR16","unstructured":"Digital Chart of the World Server, http:\/\/www.maproom.psu.edu\/dcw\/"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23091-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T19:39:12Z","timestamp":1560454752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23091-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642230905","9783642230912"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23091-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}