{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:45:09Z","timestamp":1725601509268},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229213"},{"type":"electronic","value":"9783642229220"}],"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-22922-0_21","type":"book-chapter","created":{"date-parts":[[2011,8,20]],"date-time":"2011-08-20T05:39:14Z","timestamp":1313818754000},"page":"348-366","source":"Crossref","is-referenced-by-count":11,"title":["Efficient Evaluation of k-NN Queries Using Spatial Mashups"],"prefix":"10.1007","author":[{"given":"Detian","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Chi-Yin","family":"Chow","sequence":"additional","affiliation":[]},{"given":"Qing","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xinming","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yinlong","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/B978-155860929-7\/50006-6","volume-title":"Location-Based Services","author":"C.S. Jensen","year":"2004","unstructured":"Jensen, C.S.: Database aspects of location-based services. In: Location-Based Services, pp. 115\u2013148. Morgan Kaufmann, San Francisco (2004)"},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1155\/2005\/941816","volume":"1","author":"D.L. Lee","year":"2005","unstructured":"Lee, D.L., Zhu, M., Hu, H.: When location-based services meet databases. Mobile Information Systems\u00a01(2), 81\u201390 (2005)","journal-title":"Mobile Information Systems"},{"issue":"10","key":"21_CR3","first-page":"1384","volume":"5","author":"B. Gedik","year":"2006","unstructured":"Gedik, B., Liu, L.: MobiEyes: A distributed location monitoring service using moving location queries. IEEE TMC\u00a05(10), 1384\u20131402 (2006)","journal-title":"IEEE TMC"},{"doi-asserted-by":"crossref","unstructured":"Mokbel, M.F., Xiong, X., Aref, W.G.: SINA: Scalable incremental processing of continuous queries in spatio-temporal databases. In: ACM SIGMOD (2004)","key":"21_CR4","DOI":"10.1145\/1007568.1007638"},{"doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB (2003)","key":"21_CR5","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"doi-asserted-by":"crossref","unstructured":"Hu, H., Xu, J., Lee, D.L.: A generic framework for monitoring continuous spatial queries over moving objects. In: ACM SIGMOD (2005)","key":"21_CR6","DOI":"10.1145\/1066157.1066212"},{"doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Papadias, D., Hadjieleftheriou, M.: Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In: ACM SIGMOD (2005)","key":"21_CR7","DOI":"10.1145\/1066157.1066230"},{"doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: VLDB (2002)","key":"21_CR8","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-642-15364-8_36","volume-title":"Database and Expert Systems Applications","author":"U. Demiryurek","year":"2010","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: Efficient k-nearest neighbor search in time-dependent spatial networks. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010. LNCS, vol.\u00a06261, pp. 432\u2013449. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: Towards k-nearest neighbor search in time-dependent spatial network databases. In: International Workshop on Databases in Networked Systems (2010)","key":"21_CR10","DOI":"10.1007\/978-3-642-12038-1_20"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-540-73540-3_26","volume-title":"Advances in Spatial and Temporal Databases","author":"B. George","year":"2007","unstructured":"George, B., Kim, S., Shekhar, S.: Spatio-temporal network databases and routing algorithms: A summary of results. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol.\u00a04605, pp. 460\u2013477. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Vancea, A., Grossniklaus, M., Norrie, M.C.: Database-driven web mashups. In: IEEE ICWE (2008)","key":"21_CR12","DOI":"10.1109\/ICWE.2008.13"},{"doi-asserted-by":"crossref","unstructured":"Levandoski, J.J., Mokbel, M.F., Khalefa, M.E.: Preference query evaluation over expensive attributes. In: Proc. of ACM CIKM (2010)","key":"21_CR13","DOI":"10.1145\/1871437.1871481"},{"unstructured":"Google Maps\/Google Earth APIs Terms of Service, http:\/\/code.google.com\/apis\/maps\/terms.html (last updated: May 27, 2009)","key":"21_CR14"},{"unstructured":"Google Maps, http:\/\/maps.google.com","key":"21_CR15"},{"doi-asserted-by":"crossref","unstructured":"Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: IEEE ICDE (2006)","key":"21_CR16","DOI":"10.1109\/ICDE.2006.71"},{"key":"21_CR17","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: ACM SIGMOD (2008)","key":"21_CR18","DOI":"10.1145\/1376616.1376623"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11535331_5","volume-title":"Advances in Spatial and Temporal Databases","author":"X. Huang","year":"2005","unstructured":"Huang, X., Jensen, C.S., \u0160altenis, S.: The islands approach to nearest neighbor querying in spatial networks. In: Anshelevich, E., Egenhofer, M.J., Hwang, J. (eds.) SSTD 2005. LNCS, vol.\u00a03633, pp. 73\u201390. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Bruno, N., Gravano, L., Marian, A.: Evaluating top-k queries over web-accessible databases. In: IEEE ICDE (2002)","key":"21_CR20","DOI":"10.1109\/ICDE.2002.994751"},{"doi-asserted-by":"crossref","unstructured":"Chang, K.C.C., Hwang, S.W.: Minimal probing: Supporting expensive predicates for top-k queries. In: ACM SIGMOD (2002)","key":"21_CR21","DOI":"10.1145\/564691.564731"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22922-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T02:06:22Z","timestamp":1560477982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22922-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229213","9783642229220"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22922-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}