{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:49Z","timestamp":1740107869585,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T00:00:00Z","timestamp":1481068800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100014103","name":"Key research and development program of Shandong Province","doi-asserted-by":"crossref","award":["2015GGX106007"],"award-info":[{"award-number":["2015GGX106007"]}],"id":[{"id":"10.13039\/100014103","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Distributed processing of k nearest neighbor queries over an ocean of moving objects","award":["2016ZRB01A51"],"award-info":[{"award-number":["2016ZRB01A51"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00500-016-2452-z","type":"journal-article","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T10:42:26Z","timestamp":1481107346000},"page":"5181-5191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Real-time processing of k-NN queries over moving objects"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2836-9761","authenticated-orcid":false,"given":"Ziqiang","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuehui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,7]]},"reference":[{"issue":"4","key":"2452_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/1039621.1039623","volume":"3","author":"L Baoli","year":"2004","unstructured":"Baoli L, Qin L, Shiwen Y (2004) An adaptive k-nearest neighbor text categorization strategy. ACM Trans Asian Lang Inf Process (TALIP) 3(4):215\u2013226","journal-title":"ACM Trans Asian Lang Inf Process (TALIP)"},{"key":"2452_CR2","unstructured":"Chaudhuri S, Gravano L (1999) Evaluating top-k selection queries. In: VLDB, pp 399\u2013410"},{"issue":"3","key":"2452_CR3","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/290593.290596","volume":"27","author":"KL Cheung","year":"1998","unstructured":"Cheung KL, Fu AW-C (1998) Enhanced nearest neighbour search on the r-tree. ACM SIGMOD Rec 27(3):16\u201321","journal-title":"ACM SIGMOD Rec"},{"issue":"1","key":"2452_CR4","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1002\/asi.23163","volume":"66","author":"C Cui","year":"2015","unstructured":"Cui C, Ma J, Lian T, Chen Z, Wang S (2015) Improving image annotation via ranking-oriented neighbor search and learning-based keyword propagation. J Assoc Inf Sci Technol 66(1):82\u201398","journal-title":"J Assoc Inf Sci Technol"},{"key":"2452_CR5","unstructured":"Cui C, Shen J, Ma J, Lian T (2016) Social tag relevance learning via ranking-oriented neighbor voting. Multimedia Tools Appl 1\u201327"},{"issue":"5","key":"2452_CR6","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/TKDE.2006.81","volume":"18","author":"B Gedik","year":"2006","unstructured":"Gedik B, Wu K, Yu P, Liu L (2006) Processing moving queries over moving objects using motion-adaptive indexes. Knowl Data Eng 18(5):651\u2013668","journal-title":"Knowl Data Eng"},{"key":"2452_CR7","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp 47\u201357","DOI":"10.1145\/602259.602266"},{"issue":"5","key":"2452_CR8","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1007\/s00778-007-0046-1","volume":"17","author":"MF Mokbel","year":"2008","unstructured":"Mokbel MF, Aref WG (2008) SOLE: scalable on-line execution of continuous queries on spatio-temporal data streams. VLDB J 17(5):971\u2013995","journal-title":"VLDB J"},{"key":"2452_CR9","doi-asserted-by":"crossref","unstructured":"Mokbel MF, Xiong X, Aref WG (2004) SINA: scalable incremental processing of continuous queries in spatio-temporal databases. In: SIGMOD, pp 623\u2013634","DOI":"10.1145\/1007568.1007638"},{"issue":"10","key":"2452_CR10","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1109\/TMC.2009.14","volume":"8","author":"K Mouratidis","year":"2009","unstructured":"Mouratidis K, Bakiras S, Papadias D (2009) Continuous monitoring of spatial queries in wireless broadcast environments. IEEE Trans Mobile Comput 8(10):1297\u20131311","journal-title":"IEEE Trans Mobile Comput"},{"key":"2452_CR11","doi-asserted-by":"crossref","unstructured":"Nehme RV, Rundensteiner EA (2006) SCUBA: scalable cluster-based algorithm for evaluating continuous spatio-temporal queries on moving objects. In: EDBT, pp 1001\u20131019","DOI":"10.1007\/11687238_58"},{"issue":"2","key":"2452_CR12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1023403908170","volume":"7","author":"K Raptopoulou","year":"2003","unstructured":"Raptopoulou K, Papadopoulos A, Manolopoulos Y (2003) Fast nearest-neighbor query processing in moving-object databases. GeoInformatica 7(2):113\u2013137","journal-title":"GeoInformatica"},{"key":"2452_CR13","doi-asserted-by":"crossref","unstructured":"Seidl T, Kriegel H (1998) Optimal multi-step k-nearest neighbor search. In: SIGMOD, pp 154\u2013165","DOI":"10.1145\/276304.276319"},{"key":"2452_CR14","doi-asserted-by":"crossref","unstructured":"\u0160idlauskas D, \u0160altenis S, Jensen CS (2012) Parallel main-memory indexing for moving-object query and update workloads. In: SIGMOD, pp 37\u201348","DOI":"10.1145\/2213836.2213842"},{"key":"2452_CR15","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: VLDB, pp 287\u2013298","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"2452_CR16","doi-asserted-by":"crossref","unstructured":"Wang H, Zimmermann R (2008) Snapshot location-based query processing on moving objects in road networks. In: SIGSPATIAL GIS, pp 50:1\u201350:4","DOI":"10.1145\/1463434.1463495"},{"key":"2452_CR17","unstructured":"Xiong X, Mokbel MF, Aref WG (2005) SEA-CNN: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: ICDE, pp 643\u2013654"},{"key":"2452_CR18","doi-asserted-by":"crossref","unstructured":"Yang M, Liu Y, Yu Z (2015) Distributed grid-based k nearest neighbour query processing over moving objects. In: International Conference on Web-Age Information Management, pp 350\u2013361","DOI":"10.1007\/978-3-319-21042-1_28"},{"key":"2452_CR19","unstructured":"Yu C, Ooi B, Tan K, Jagadish H (2001) Indexing the distance: an efficient method to knn processing. In: VLDB, pp 421\u2013430"},{"key":"2452_CR20","unstructured":"Yu X, Pu K, Koudas N (2005) Monitoring k-nearest neighbor queries over moving objects. In: ICDE, pp 631\u2013642"},{"issue":"1","key":"2452_CR21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s00778-004-0146-0","volume":"15","author":"B Zheng","year":"2006","unstructured":"Zheng B, Xu J, Lee W-C, Lee L (2006) Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services. VLDB J 15(1):21\u201339","journal-title":"VLDB J"},{"key":"2452_CR22","doi-asserted-by":"crossref","unstructured":"Zheng B, Zheng K, Xiao X, Su H, Yin H, Zhou X, Li G (2016) Keyword-aware continuous KNN query on road networks. In: ICDE, pp 871\u2013882","DOI":"10.1109\/ICDE.2016.7498297"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2452-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2452-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2452-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T11:04:50Z","timestamp":1589713490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2452-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,7]]},"references-count":22,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["2452"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2452-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2016,12,7]]}}}