{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T05:24:24Z","timestamp":1749533064716},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,11,28]],"date-time":"2006-11-28T00:00:00Z","timestamp":1164672000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2007,1,18]]},"DOI":"10.1007\/s10489-006-0004-4","type":"journal-article","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T22:47:07Z","timestamp":1164667627000},"page":"69-79","source":"Crossref","is-referenced-by-count":4,"title":["Search on transportation networks for location-based service"],"prefix":"10.1007","volume":"26","author":[{"given":"Jun","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuelong","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoto","family":"Mukai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toyohide","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,28]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Chung JD, Peak OH, Lee JW, Ryu KH (2002) Temporal pattern mining of moving objects for location-based services. In: Proceedings of the int\u2019l conference database and expert systems applications","DOI":"10.1007\/3-540-46146-9_33"},{"issue":"2","key":"4_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1009867905167","volume":"4","author":"MF Goodchild","year":"2000","unstructured":"Goodchild MF (2000) Gis and transportation: status and challenges. GeoInformatica 4(2):127\u2013139","journal-title":"GeoInformatica"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Winter S (2002) Modeling costs of turns in route planning. Geo Informatica (4):345\u2013361","DOI":"10.1023\/A:1020853410145"},{"issue":"3","key":"4_CR4","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/38.844372","volume":"20","author":"J Fawcett","year":"2000","unstructured":"Fawcett J, Robinson P (2000) Adaptive routing for road traffic. IEEE Comput Graph Appl 20(3):46\u201353","journal-title":"IEEE Comput Graph Appl"},{"issue":"3","key":"4_CR5","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TEC.1961.5219222","volume":"10","author":"CY Lee","year":"1961","unstructured":"Lee CY (1961) An algorithm for path connectivity and its applications. IRE Trans. Electron Comput 10(3):346\u2013365","journal-title":"IRE Trans. Electron Comput"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Papadias D, Zhang J, Mamoulis N, Tao YF (2003) Query processing in spatial network databases. In: Proceedings VLDB 2003, pp 802\u2013813","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"4_CR7","unstructured":"Christofides N (1975) Graph theory: an algorithmic approach. Academic Press Inc. (London) Ltd."},{"issue":"2","key":"4_CR8","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede V, Gunther O (1998) Multidimensional access methods. ACM Comput Surv 30(2):170\u2013231","journal-title":"ACM Comput Surv"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Song ZX, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: Proceedings of the SSTD\u201901, pp 79\u201396","DOI":"10.1007\/3-540-47724-1_5"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Korn F, Muthukrishnan S (2000) Influence sets based on reverse nearest neighbor queries. In: Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pp 201\u2013212","DOI":"10.1145\/342009.335415"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Bespamyatnikh S, Snoeyink J (1999) Queries with segments in voronoi diagrams. SODA","DOI":"10.1016\/S0925-7721(99)00055-3"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Tao YF, Papadias D, Shen QM (2002) Continuous nearest neighbor search. In: Proceedings of the VLDB\u201902, pp 287\u2013298","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Feng J, Mukai N, Watanabe T (2004) Incremental maintenance of all-nearest neighbors based on road network. In: Proceedings of the IEA\/AIE 2004, LNAI, vol 3029, pp 164\u2013169","DOI":"10.1007\/978-3-540-24677-0_18"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Shahabi C, Kolahdouzan MR, Sharifzadeh M (2003) A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica (3):255\u2013273","DOI":"10.1023\/A:1025153016110"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Shekhar S, Yoo JS (2003) Processing in-route nearest neighbor queries: a comparison of alternative approaches. In: Proceedings of the GIS\u201903, pp 9\u201316","DOI":"10.1145\/956676.956678"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Jensen CS, Kolvr J, Pedersen TB, Timko I (2003) Nearest neighbor queries in road networks. In: GIS \u201903: Proceedings of the 11th ACM international symposium on advances in geographic information systems, New York, NY, USA, 2003. ACM Press, pp 1\u20138","DOI":"10.1145\/956676.956677"},{"key":"4_CR17","unstructured":"Li Y, Yang J, Han J (2004) Continuous k-nearest neighbor search for moving objects. SSDBM, pp 123\u2013126"},{"key":"4_CR18","unstructured":"Feng J, Watanabe T (2002) A fast method for continuous nearest target objects query on road network. In: Proceedings of the VSMM\u201902, pp 182\u2013191"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: A dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD\u201984, pp 47\u201357","DOI":"10.1145\/602259.602266"},{"issue":"4","key":"4_CR20","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF01231602","volume":"3","author":"R Guting","year":"1994","unstructured":"Guting R (1994) An introduction to spatial database systems. Very Large Database J 3(4):357\u2013399","journal-title":"Very Large Database J"},{"issue":"4","key":"4_CR21","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1145\/503099.503101","volume":"26","author":"N Mamoulis","year":"2001","unstructured":"Mamoulis N, Papadias D (2001) Multiway spatial joins. ACM Trans Database Syst 26(4):424\u2013475","journal-title":"ACM Trans Database Syst"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The r*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD\u201990, pp 322\u2013 331","DOI":"10.1145\/93597.98741"},{"key":"4_CR23","unstructured":"Sellis T, Roussopoulos N, Faloutsos C (1987) The r+-tree: a dynamic index for multi-dimensional objects. In: Proceedings of the VLDB\u201987, pp 507\u2013518"},{"key":"4_CR24","unstructured":"Kamel I, Faloutsos C (1994) Hilbert r-tree: an improved r-tree using fractals. In: Proceedings of the 20th VLDB, pp 500\u2013509"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Katayama N, Satoh S (1997) The sr-tree: an index structure for high-dimensional nearest neighbor queries. In: Proceedings of the ACM SIGMOD\u201997, pp 369\u2013380","DOI":"10.1145\/253260.253347"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Abdelguerfi M, Givaudan J, Shaw K, Ladner R (2002) The 2-3tr-tree, a trajectory-oriented index structure for fully evolving valid-time spatio-temporal datasets. In: Proceedings of the tenth ACM international symposium on advances in geographic information systems, pp 29\u201334","DOI":"10.1145\/585147.585155"},{"key":"4_CR27","unstructured":"Ahn HK, Mamoulis N, Wong HM. A survey on multidimensional access methods."},{"issue":"3","key":"4_CR28","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R Bayer","year":"1972","unstructured":"Bayer R, McCreight E (1972) Organization and maintenance of large ordered indexes. Acta Informatica 1(3):173\u2013189","journal-title":"Acta Informatica"},{"key":"4_CR29","unstructured":"http:\/\/www.gsi.go.jp\/MAP\/CDROM\/2500\/t2500.htm"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-0004-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-006-0004-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-0004-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:26:25Z","timestamp":1559154385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-006-0004-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,28]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1,18]]}},"alternative-id":["4"],"URL":"https:\/\/doi.org\/10.1007\/s10489-006-0004-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,28]]}}}