{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T16:45:39Z","timestamp":1762015539098},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T00:00:00Z","timestamp":1283472000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10707-010-0115-2","type":"journal-article","created":{"date-parts":[[2010,9,2]],"date-time":"2010-09-02T02:36:05Z","timestamp":1283394965000},"page":"541-569","source":"Crossref","is-referenced-by-count":28,"title":["The partial sequenced route query with traveling rules in road networks"],"prefix":"10.1007","volume":"15","author":[{"given":"Haiquan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Shinn","family":"Ku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min-Te","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,3]]},"reference":[{"key":"115_CR1","unstructured":"Digital Chart of the World Server. http:\/\/www.maproom.psu.edu\/dcw\/ . Accessed August 2010"},{"key":"115_CR2","unstructured":"U.S. Geological Survey. http:\/\/www.usgs.gov\/ . Accessed August 2010"},{"key":"115_CR3","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM SIGMOD international conference on management of data, pp 322\u2013331","DOI":"10.1145\/93597.98741"},{"key":"115_CR4","doi-asserted-by":"crossref","unstructured":"Beeri C, Kanza Y, Safra E, Sagiv Y (2004) Object fusion in geographic information systems. In: Proceedings of the thirtieth international conference on very large data bases (VLDB), pp 816\u2013827","DOI":"10.1016\/B978-012088469-8.50072-3"},{"key":"115_CR5","doi-asserted-by":"crossref","unstructured":"Chen H, Ku WS, Sun MT, Zimmermann R (2008) The multi-rule partial sequenced route query. In: Proceedings of 16th ACM SIGSPATIAL international conference on advances in geographic information systems, p 10","DOI":"10.1145\/1463434.1463448"},{"issue":"2","key":"115_CR6","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(88)90333-5","volume":"37","author":"LF Escudero","year":"1988","unstructured":"Escudero LF (1988) An inexact algorithm for the sequential ordering problem. Eur J Oper Res 37(2):236\u2013249","journal-title":"Eur J Oper Res"},{"key":"115_CR7","unstructured":"Garey MR, Johnson DS (1990) Computers and intractability a guide to the theory of NP-completeness. W. H. Freeman"},{"key":"115_CR8","doi-asserted-by":"crossref","unstructured":"George B, Kim S, Shekhar S (2007) Spatio-temporal network databases and routing algorithms: a summary of results. In: Proceedings of the 10th international symposium on advances in spatial and temporal databases (SSTD), pp 460\u2013477","DOI":"10.1007\/978-3-540-73540-3_26"},{"key":"115_CR9","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: SIGMOD\u201984, proceedings of annual meeting, pp 47\u201357","DOI":"10.1145\/971697.602266"},{"issue":"2","key":"115_CR10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"GR Hjaltason","year":"1999","unstructured":"Hjaltason GR, Samet H (1999) Distance browsing in spatial databases. ACM Trans Database Syst 24(2):265\u2013318","journal-title":"ACM Trans Database Syst"},{"key":"115_CR11","unstructured":"Horowitz E, Sahni S, Anderson-Freed S (1993) Fundamentals of data strucures in C. W. H. Freeman"},{"key":"115_CR12","doi-asserted-by":"crossref","unstructured":"Jensen CS, Kol\u00e1rvr J, Pedersen TB, Timko I (2003) Nearest neighbor queries in road networks. In: Proceedings of the 11th ACM international symposium on advances in geographic information systems (ACM-GIS), pp 1\u20138","DOI":"10.1145\/956676.956677"},{"issue":"11","key":"115_CR13","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"AB Kahn","year":"1962","unstructured":"Kahn AB (1962) Topological sorting of large networks. Commun ACM 5(11):558\u2013562","journal-title":"Commun ACM"},{"key":"115_CR14","doi-asserted-by":"crossref","unstructured":"Kanza Y, Levin R, Safra E, Sagiv Y (2009) An interactive approach to route search. In: Proceedings of 17th ACM SIGSPATIAL international conference on advances in geographic information systems, pp 408\u2013411","DOI":"10.1145\/1653771.1653831"},{"key":"115_CR15","unstructured":"Kolahdouzan MR, Shahabi C (2004) Voronoi-based K nearest neighbor search for spatial network databases. In: Proceedings of the 30th international conference on very large data bases (VLDB), pp 840\u2013851"},{"key":"115_CR16","unstructured":"Ku WS, Zimmermann R, Wang H, Wan CN (2005) Adaptive nearest neighbor queries in travel time networks. In: Proceedings of the 13th ACM international symposium on advances in geographic information systems (ACM-GIS), pp 210\u2013219"},{"key":"115_CR17","doi-asserted-by":"crossref","unstructured":"Lee CK, Lee WC, Zheng B (2009) Fast object search on road networks. In: Proceeding of 12th international conference on extending database technology, pp 1018\u20131029","DOI":"10.1145\/1516360.1516476"},{"key":"115_CR18","doi-asserted-by":"crossref","unstructured":"Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng SH (2005) On trip planning queries in spatial databases. In: Proceedings of the 9th international symposium on advances in spatial and temporal databases (SSTD), pp 273\u2013290","DOI":"10.1007\/11535331_16"},{"key":"115_CR19","doi-asserted-by":"crossref","unstructured":"Ma X, Shekhar S, Xiong H, Zhang P (2006) Exploiting a page-level upper bound for multi-type nearest neighbor queries. In: Proceedings of the 14th ACM international symposium on geographic information systems (ACM-GIS), pp 179\u2013186","DOI":"10.1145\/1183471.1183501"},{"key":"115_CR20","doi-asserted-by":"crossref","unstructured":"Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: Proceedings of the 29th international conference on very large data bases (VLDB), pp 802\u2013813","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"issue":"5","key":"115_CR21","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/229459.233436","volume":"39","author":"R Reddy","year":"1996","unstructured":"Reddy R (1996) To dream the possible dream. Commun ACM 39(5):105\u2013112","journal-title":"Commun ACM"},{"key":"115_CR22","doi-asserted-by":"crossref","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: Proceedings of the 1995 ACM SIGMOD international conference on management of data, pp 71\u201379","DOI":"10.1145\/223784.223794"},{"key":"115_CR23","unstructured":"Russell SJ, Norvig P (2002) Artificial intelligence: a modern approach. Prentice Hall"},{"key":"115_CR24","doi-asserted-by":"crossref","unstructured":"Samet H (2001) Issues, developments, and challenges in spatial databases and geographic information systems (gis). In: Proceedings of the ninth ACM international symposium on advances in geographic information systems (ACM-GIS), p 1","DOI":"10.1145\/512161.512162"},{"key":"115_CR25","doi-asserted-by":"crossref","unstructured":"Samet H, Sankaranarayanan J, Alborzi H (2008) Scalable network distance browsing in spatial databases. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, pp 43\u201354","DOI":"10.1145\/1376616.1376623"},{"key":"115_CR26","unstructured":"Sellis TK, Roussopoulos N, Faloutsos C (1987) The R+-tree: a dynamic index for multi-dimensional objects. In: Proceedings of 13th international conference on very large data bases (VLDB), pp 507\u2013518"},{"issue":"4","key":"115_CR27","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1007\/s00778-006-0038-6","volume":"17","author":"M Sharifzadeh","year":"2008","unstructured":"Sharifzadeh M, Kolahdouzan MR, Shahabi C (2008) The optimal sequenced route query. VLDB J 17(4):765\u2013787","journal-title":"VLDB J"},{"issue":"1","key":"115_CR28","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s00778-007-0081-y","volume":"18","author":"M Sharifzade","year":"2009","unstructured":"Sharifzade M, Shahabi C (2009) Approximate Voronoi cell computation on spatial data streams. VLDB J 18(1):57\u201375","journal-title":"VLDB J"},{"issue":"12","key":"115_CR29","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s10707-007-0034-z","volume":"4","author":"M Sharifzadeh","year":"2008","unstructured":"Sharifzadeh M, Shahabi C (2008) Processing optimal sequenced route queries using voronoi diagrams. GeoInformatica 4(12):411\u2013433","journal-title":"GeoInformatica"},{"issue":"4","key":"115_CR30","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/248448.248465","volume":"40","author":"S Shekhar","year":"1997","unstructured":"Shekhar S, Coyle M, Goyal B, Liu DR, Sarkar S (1997) Data models in geographic information systems. Commun ACM 40(4):103\u2013111","journal-title":"Commun ACM"},{"key":"115_CR31","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: Proceedings of 28th international conference on very large data bases (VLDB), pp 287\u2013298","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"115_CR32","doi-asserted-by":"crossref","unstructured":"Tian Y, Lee CK, Lee WC (2009) Finding skyline paths in road networks. In: Proceedings of 17th ACM SIGSPATIAL international conference on advances in geographic information systems, pp 444\u2013447","DOI":"10.1145\/1653771.1653840"},{"key":"115_CR33","doi-asserted-by":"crossref","unstructured":"Tian Y, Lee CK, Lee WC (2009) Monitoring minimum cost paths on road networks. In: Proceedings of 17th ACM SIGSPATIAL international conference on advances in geographic information systems, pp 217\u2013226","DOI":"10.1145\/1653771.1653803"},{"key":"115_CR34","doi-asserted-by":"crossref","unstructured":"Terrovitis M, Bakiras S, Papadias D, Mouratidis K (2005) Constrained shortest path computation. In: Proceedings of the 9th international symposium on advances in spatial and temporal databases (SSTD), pp 181\u2013199","DOI":"10.1007\/11535331_11"},{"key":"115_CR35","doi-asserted-by":"crossref","unstructured":"Zhang J, Zhu M, Papadias D, Tao Y, Lee DL (2003) Location-based Spatial queries. In: Proceedings of the 2003 ACM SIGMOD international conference on management of data, pp 443\u2013454","DOI":"10.1145\/872757.872812"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-010-0115-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-010-0115-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-010-0115-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T01:23:39Z","timestamp":1559525019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-010-0115-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,3]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["115"],"URL":"https:\/\/doi.org\/10.1007\/s10707-010-0115-2","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,3]]}}}