{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T04:29:15Z","timestamp":1648873755953},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,28]],"date-time":"2012-11-28T00:00:00Z","timestamp":1354060800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s11704-012-2069-z","type":"journal-article","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T13:17:49Z","timestamp":1354195069000},"page":"44-54","source":"Crossref","is-referenced-by-count":3,"title":["VGQ-Vor: extending virtual grid quadtree with Voronoi diagram for mobile k nearest neighbor queries over mobile objects"],"prefix":"10.1007","volume":"7","author":[{"given":"Botao","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingwei","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaosong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaru","family":"Kitsuregawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,28]]},"reference":[{"issue":"2","key":"2069_CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/568271.223794","volume":"24","author":"N Roussopoulos","year":"1995","unstructured":"Roussopoulos N, Kelley S, Vincent F. Nearest neighbor queries. ACM SIGMOD Record, 1995, 24(2): 71\u201379","journal-title":"ACM SIGMOD Record"},{"issue":"2","key":"2069_CR2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1145\/276305.276319","volume":"27","author":"T Seidl","year":"1998","unstructured":"Seidl T, Kriegel H. Optimal multi-step k-nearest neighbor search. ACM SIGMOD Record, 1998, 27(2): 154\u2013165","journal-title":"ACM SIGMOD Record"},{"key":"2069_CR3","unstructured":"Chaudhuri S, Gravano L. Evaluating top-k selection queries. In: Proceedings of the 25th International Conference on Very Large Data Bases. 1999, 397-410"},{"issue":"2","key":"2069_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1023\/B:DAPD.0000013068.25976.88","volume":"15","author":"D Kalashnikov","year":"2004","unstructured":"Kalashnikov D, Prabhakar S, Hambrusch S. Main memory evaluation of monitoring queries over moving objects. Distributed and Parallel Databases, 2004, 15(2): 117\u2013135","journal-title":"Distributed and Parallel Databases"},{"key":"2069_CR5","unstructured":"Cai Y, Hua K, Cao G. Processing range-monitoring queries on heterogeneous mobile objects. In: Proceedings of the 2004 IEEE International Conference on Mobile Data Management. 2004, 27-38"},{"key":"2069_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-47724-1_5","volume-title":"Advances in Spatial and Temporal Databases","author":"Z Song","year":"2001","unstructured":"Song Z, Roussopoulos N. k-nearest neighbor search for moving query point. Advances in Spatial and Temporal Databases, 2001, 79\u201396"},{"key":"2069_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/B978-155860869-6\/50033-0","volume-title":"Proceedings of the 28th International Conference on Very Large Data Bases","author":"Y Tao","year":"2002","unstructured":"Tao Y, Papadias D, Shen Q. Continuous nearest neighbor search. In: Proceedings of the 28th International Conference on Very Large Data Bases. 2002, 287\u2013298"},{"key":"2069_CR8","first-page":"840","volume-title":"Proceedings of the 30th International Conference on Very Large Data Bases","author":"M Kolahdouzan","year":"2004","unstructured":"Kolahdouzan M, Shahabi C. Voronoi-based k nearest neighbor search for spatial network databases. In: Proceedings of the 30th International Conference on Very Large Data Bases. 2004, 840\u2013851"},{"issue":"1","key":"2069_CR9","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.14778\/1453856.1453973","volume":"1","author":"S Nutanong","year":"2008","unstructured":"Nutanong S, Zhang R, Tanin E, Kulik L. The v*-diagram: a querydependent approach to moving knn queries. Proceedings of the VLDB Endowment, 2008, 1(1): 1095\u20131106","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1\u20132","key":"2069_CR10","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.14778\/1920841.1920994","volume":"3","author":"M Sharifzadeh","year":"2010","unstructured":"Sharifzadeh M, Shahabi C. Vor-tree: R-trees with voronoi diagrams for efficient processing of spatial nearest neighbor queries. Proceedings of the VLDB Endowment, 2010, 3(1\u20132): 1231\u20131242","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2069_CR11","first-page":"631","volume-title":"Proceedings of the 21st International Conference on Data Engineering. ICDE\u201905","author":"X Yu","year":"2005","unstructured":"Yu X, Pu K, Koudas N. Monitoring k-nearest neighbor queries over moving objects. In: Proceedings of the 21st International Conference on Data Engineering. ICDE\u201905. 2005, 631\u2013642"},{"key":"2069_CR12","first-page":"643","volume-title":"Proceedings of the 21st International Conference on Data Engineering. ICDE\u201905","author":"X Xiong","year":"2005","unstructured":"Xiong X, Mokbel M, Aref W. Sea-cnn: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: Proceedings of the 21st International Conference on Data Engineering. ICDE\u201905. 2005, 643\u2013654"},{"key":"2069_CR13","first-page":"43","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases","author":"K Mouratidis","year":"2006","unstructured":"Mouratidis K, Yiu M, Papadias D, Mamoulis N. Continuous nearest neighbor monitoring in road networks. In: Proceedings of the 32nd International Conference on Very Large Data Bases. 2006, 43\u201354"},{"issue":"1","key":"2069_CR14","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.is.2011.08.002","volume":"37","author":"P Fan","year":"2012","unstructured":"Fan P, Li G, Yuan L, Li Y. Vague continuous k-nearest neighbor queries over moving objects with uncertain velocity in road networks. Information Systems, 2012, 37(1): 13\u201332","journal-title":"Information Systems"},{"issue":"2","key":"2069_CR15","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/335191.335427","volume":"29","author":"S \u0160altenis","year":"2000","unstructured":"\u0160altenis S, Jensen C, Leutenegger S, Lopez M. Indexing the positions of continuously moving objects. ACM SIGMOD Record, 2000, 29(2): 331\u2013342","journal-title":"ACM SIGMOD Record"},{"key":"2069_CR16","first-page":"790","volume-title":"Proceedings of the 29th International Conference on Very Large Data Bases","author":"Y Tao","year":"2003","unstructured":"Tao Y, Papadias D, Sun J. The TPR*-tree: an optimized spatiotemporal access method for predictive queries. In: Proceedings of the 29th International Conference on Very Large Data Bases. 2003, 790\u2013801"},{"key":"2069_CR17","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1145\/1007568.1007639","volume-title":"Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data","author":"J Patel","year":"2004","unstructured":"Patel J, Chen Y, Chakka V. STRIPES: an efficient index for predicted trajectories. In: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data. 2004, 635\u2013646"},{"issue":"3","key":"2069_CR18","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1007\/s00778-008-0120-3","volume":"18","author":"Y N Silva","year":"2009","unstructured":"Silva Y N, Xiong X P, Aref W G. The RUM-tree: supporting frequent updates in R-trees using memos. The VLDB Journal, 2009, 18(3): 719\u2013738","journal-title":"The VLDB Journal"},{"key":"2069_CR19","first-page":"768","volume-title":"Proceedings of the 30th International Conference on Very Large Data Bases","author":"C Jensen","year":"2004","unstructured":"Jensen C, Lin D, Ooi B. Query and update efficient B+-tree based indexing of moving objects. In: Proceedings of the 30th International Conference on Very Large Data Bases. 2004, 768\u2013779"},{"issue":"5","key":"2069_CR20","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1007\/s00778-007-0064-z","volume":"17","author":"Y Tao","year":"2008","unstructured":"Tao Y, Xiao X. Primal or dual: which promises faster spatiotemporal search? The VLDB Journal, 2008, 17(5): 1253\u20131270","journal-title":"The VLDB Journal"},{"key":"2069_CR21","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/1376616.1376622","volume-title":"Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data","author":"S Chen","year":"2008","unstructured":"Chen S, Ooi B, Tan K, Nascimento M. ST2B-tree: a self-tunable spatiotemporal b+-tree index for moving objects. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. 2008, 29\u201342"},{"key":"2069_CR22","doi-asserted-by":"crossref","DOI":"10.1002\/9780470317013","volume-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"A Okabe","year":"2000","unstructured":"Okabe A, Boots B, Sugihara K, Chiu S N. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley, 2000"},{"issue":"1","key":"2069_CR23","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1299\/jcst.4.64","volume":"4","author":"B Wang","year":"2010","unstructured":"Wang B, Chen H, Ma J, Kitsuregawa M, Wang G. Design and implementation of mobile object index based on covered area. Journal of Frontiers of Computer Science and Technology, 2010, 4(1): 64\u201372","journal-title":"Journal of Frontiers of Computer Science and Technology"},{"key":"2069_CR24","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1145\/1559845.1559907","volume-title":"Proceedings of the 35th SIGMOD International Conference on Management of Data","author":"Z Chen","year":"2009","unstructured":"Chen Z, Shen H, Zhou X, Yu J. Monitoring path nearest neighbor in road networks. In: Proceedings of the 35th SIGMOD International Conference on Management of Data. 2009, 591\u2013602"},{"key":"2069_CR25","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1145\/1951365.1951400","volume-title":"Proceedings of the 14th International Conference on Extending Database Technology","author":"K Zheng","year":"2011","unstructured":"Zheng K, Trajcevski G, Zhou X, Scheuermann P. Probabilistic range queries for uncertain trajectories on road networks. In: Proceedings of the 14th International Conference on Extending Database Technology. 2011, 283\u2013294"},{"key":"2069_CR26","first-page":"22","volume-title":"Proceedings of the 22nd International Conference on Data Engineering. ICDE\u201906","author":"X Xiong","year":"2006","unstructured":"Xiong X, Aref W. R-trees with update memos. In: Proceedings of the 22nd International Conference on Data Engineering. ICDE\u201906. 2006, 22\u201322"},{"key":"2069_CR27","first-page":"599","volume-title":"Readings in Database Systems","author":"A Guttman","year":"1988","unstructured":"Guttman A. R-trees: a dynamic index structure for spatial searching. Readings in Database Systems, 1988, 599\u2013609"},{"issue":"8","key":"2069_CR28","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1016\/j.is.2010.05.004","volume":"35","author":"R Zhang","year":"2010","unstructured":"Zhang R, Jagadish H, Dai B, Ramamohanarao K. Optimized algorithms for predictive range and kNN queries on moving objects. Information Systems, 2010, 35(8): 911\u2013932","journal-title":"Information Systems"},{"issue":"5","key":"2069_CR29","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1007\/s00778-010-0185-7","volume":"19","author":"R G\u00fcting","year":"2010","unstructured":"G\u00fcting R, Behr T, Xu J. Efficient k-nearest neighbor search on moving object trajectories. The VLDB Journal, 2010, 19(5): 687\u2013714","journal-title":"The VLDB Journal"},{"issue":"2","key":"2069_CR30","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.14778\/1454159.1454229","volume":"1","author":"S Chen","year":"2008","unstructured":"Chen S, Jensen C, Lin D. A benchmark for evaluating moving object indexes. Proceedings of the VLDB Endowment, 2008, 1(2): 1574\u20131585","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1","key":"2069_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R Finkel","year":"1974","unstructured":"Finkel R, Bentley J. Quad trees a data structure for retrieval on composite keys. Acta Informatica, 1974, 4(1): 1\u20139","journal-title":"Acta Informatica"},{"issue":"2","key":"2069_CR32","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1015231126594","volume":"6","author":"T Brinkhoff","year":"2002","unstructured":"Brinkhoff T. A framework for generating network-based moving objects. GeoInformatica, 2002, 6(2): 153\u2013180","journal-title":"GeoInformatica"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-012-2069-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-012-2069-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-012-2069-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T15:41:08Z","timestamp":1643730068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-012-2069-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,28]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["2069"],"URL":"https:\/\/doi.org\/10.1007\/s11704-012-2069-z","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,28]]}}}