{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T05:11:42Z","timestamp":1717650702013},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,4,19]],"date-time":"2016-04-19T00:00:00Z","timestamp":1461024000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pers Ubiquit Comput"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s00779-016-0913-0","type":"journal-article","created":{"date-parts":[[2016,4,19]],"date-time":"2016-04-19T04:23:18Z","timestamp":1461039798000},"page":"413-429","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["k-Multi-preference query over road networks"],"prefix":"10.1007","volume":"20","author":[{"given":"Peiguang","family":"Lin","sequence":"first","affiliation":[]},{"given":"Yilong","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Peiyao","family":"Nie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,19]]},"reference":[{"key":"913_CR1","unstructured":"Mouratidis K, Yiu ML, Papadias D, Mamoulis N (2006) Continuous nearest neighbor monitoring in road networks. In: Proceedings of the 32nd international conference on very large data bases, pp 43\u201354"},{"issue":"6","key":"913_CR2","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1109\/TKDE.2005.87","volume":"17","author":"ML Yiu","year":"2005","unstructured":"Yiu ML, Mamoulis N, Papadias D (2005) Aggregate nearest neighbor queries in road networks. IEEE Trans Knowl Data Eng 17(6):820\u2013833","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"913_CR3","doi-asserted-by":"crossref","unstructured":"Mouratidis K, Bakiras S, Papadias D (2006) Continuous monitoring of top-k queries over sliding windows. In: Proceedings of the 2006 ACM SIGMOD international conference on management of data, pp 635\u2013646","DOI":"10.1145\/1142473.1142544"},{"key":"913_CR4","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: Proceedings of the 28th international conference on very large databases, pp 287\u2013298","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"913_CR5","doi-asserted-by":"crossref","unstructured":"Kazemi L, Shahabi C, Sharifzadeh M, Vincent L (2007) Optimal traversal planning in road networks with navigational constraints. GIS 19","DOI":"10.1145\/1341012.1341038"},{"issue":"5","key":"913_CR6","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/s00778-013-0347-5","volume":"23","author":"Bin Yao","year":"2014","unstructured":"Yao Bin, Xiao Xiaokui, Li Feifei, Yifan Wu (2014) Dynamic monitoring of optimal locations in road network databases. VLDB J 23(5):697\u2013720","journal-title":"VLDB J"},{"key":"913_CR7","doi-asserted-by":"crossref","unstructured":"Zhu AD, Ma H, Xiao X, Luo S, Tang Y, Zhou S (2013) Shortest path and distance queries on road networks: towards bridging theory and practice. In: SIGMOD conference, pp 857\u2013868","DOI":"10.1145\/2463676.2465277"},{"issue":"12","key":"913_CR8","doi-asserted-by":"crossref","first-page":"1966","DOI":"10.14778\/2367502.2367549","volume":"5","author":"S Luo","year":"2012","unstructured":"Luo S, Luo Y, Zhou S, Cong G, Guan J (2012) DISKs: a system for distributed spatial group keyword search on road networks. Proceedings VLDB Endow 5(12):1966\u20131969","journal-title":"Proceedings VLDB Endow"},{"issue":"9","key":"913_CR9","doi-asserted-by":"crossref","first-page":"661","DOI":"10.14778\/2732939.2732940","volume":"7","author":"R Song","year":"2014","unstructured":"Song R, Sun W, Zheng B, Zheng Y (2014) PRESS: a novel framework of trajectory compression in road networks. Proc VLDB Endow 7(9):661\u2013672","journal-title":"Proc VLDB Endow"},{"issue":"14","key":"913_CR10","doi-asserted-by":"crossref","first-page":"2017","DOI":"10.14778\/2733085.2733106","volume":"7","author":"Y Huang","year":"2014","unstructured":"Huang Y, Bastani F, Jin R, Wang XS (2014) Large scale real-time ridesharing with service guarantee on road networks. Proc VLDB Endow 7(14):2017\u20132028","journal-title":"Proc VLDB Endow"},{"key":"913_CR11","doi-asserted-by":"crossref","unstructured":"Xu Z, Jacobsen HA (2010) Processing proximity relations in road networks. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data, pp 243\u2013254","DOI":"10.1145\/1807167.1807196"},{"issue":"5","key":"913_CR12","doi-asserted-by":"crossref","first-page":"406","DOI":"10.14778\/2140436.2140438","volume":"5","author":"L Wu","year":"2012","unstructured":"Wu L, Xiao X, Deng D, Cong G, Zhu AD, Zhou S (2012) Shortest path and distance queries on road networks: an experimental evaluation. Proc VLDB Endow 5(5):406\u2013417","journal-title":"Proc VLDB Endow"},{"key":"913_CR13","doi-asserted-by":"crossref","unstructured":"Xiao X, Yao B, Li F (2011). Optimal location queries in road network databases. In: Data engineering (ICDE), 2011 IEEE 27th international conference, pp 804\u2013815","DOI":"10.1109\/ICDE.2011.5767845"},{"key":"913_CR14","volume-title":"Exploring spatial analysis in GIS","author":"YH Chou","year":"1996","unstructured":"Chou YH (1996) Exploring spatial analysis in GIS. Onword Press, Santa Fe"},{"key":"913_CR15","doi-asserted-by":"crossref","unstructured":"Eppstein D, Goodrich MT (2008) Studying (non-planar) road networks through an algorithmic lens. GIS 16","DOI":"10.1145\/1463434.1463455"},{"key":"913_CR16","first-page":"45","volume":"6","author":"B Gallagher","year":"2006","unstructured":"Gallagher B (2006) Matching structure and semantics: a survey on graph-based pattern matching. AAAI FS 6:45\u201353","journal-title":"AAAI FS"},{"issue":"1","key":"913_CR17","first-page":"886","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou L, Chen L, \u00d6zsu MT (2009) Distance-join: pattern match query in a large graph database. PVLDB 2(1):886\u2013897","journal-title":"PVLDB"},{"key":"913_CR18","unstructured":"Mart\u00ednez C, Valiente G (1997) An algorithm for graph pattern-matching. In: Proceedings fourth South American workshop on string processing, vol 8, pp 180\u2013197"},{"key":"913_CR19","doi-asserted-by":"crossref","unstructured":"Cheng J, Yu JX, Ding B, Yu PS, Wang H (2008) Fast graph pattern matching. In: Data engineering, 2008, ICDE 2008, IEEE 24th international conference, pp 913\u2013922","DOI":"10.1109\/ICDE.2008.4497500"},{"issue":"14","key":"913_CR20","first-page":"2017","volume":"7","author":"Y Huang","year":"2014","unstructured":"Huang Y, Bastani F, Jin R, Wang XS (2014) Large scale real-time ridesharing with service guarantee on road networks. PVLDB 7(14):2017\u20132028","journal-title":"PVLDB"},{"issue":"3","key":"913_CR21","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1025153016110","volume":"7","author":"C Shahabi","year":"2003","unstructured":"Shahabi C, Kolahdouzan MR, Sharifzadeh M (2003) A road network embedding technique for K-nearest neighbor search in moving object databases. GeoInformatica 7(3):255\u2013273","journal-title":"GeoInformatica"},{"issue":"6","key":"913_CR22","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M Thorup","year":"2004","unstructured":"Thorup M (2004) Compact oracles for reachability and approximate distances in planar digraphs. J ACM 51(6):993\u20131024","journal-title":"J ACM"},{"issue":"1","key":"913_CR23","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"key":"913_CR24","doi-asserted-by":"crossref","unstructured":"Goldberg AV, Kaplan H, Werneck RF (2006) Reach for A*: efficient point-to-point shortest path algorithms. ALENEX 129\u2013143","DOI":"10.1137\/1.9781611972863.13"},{"key":"913_CR25","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"RK Ahuja","year":"1990","unstructured":"Ahuja RK, Mehlhorn K, Orlin JB, Tarjan RE (1990) Faster algorithms for the shortest path problem. J Assoc Comput Mach 37:213\u2013223","journal-title":"J Assoc Comput Mach"},{"key":"913_CR26","doi-asserted-by":"crossref","unstructured":"Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng SH (2005) On trip planning queries in spatial databases. SSTD, pp 273\u2013290","DOI":"10.1007\/11535331_16"}],"container-title":["Personal and Ubiquitous Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00779-016-0913-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00779-016-0913-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00779-016-0913-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:29:08Z","timestamp":1559111348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00779-016-0913-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,19]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["913"],"URL":"https:\/\/doi.org\/10.1007\/s00779-016-0913-0","relation":{},"ISSN":["1617-4909","1617-4917"],"issn-type":[{"value":"1617-4909","type":"print"},{"value":"1617-4917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,19]]}}}