{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:07:06Z","timestamp":1771700826788,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2008,11]]},"DOI":"10.1007\/s11390-008-9185-0","type":"journal-article","created":{"date-parts":[[2008,11,21]],"date-time":"2008-11-21T19:48:57Z","timestamp":1227296937000},"page":"998-1014","source":"Crossref","is-referenced-by-count":9,"title":["Adaptive Indexing of Moving Objects with Highly Variable Update Frequencies"],"prefix":"10.1007","volume":"23","author":[{"given":"Nan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Dan","family":"Shou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Xiang","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,11,23]]},"reference":[{"key":"9185_CR1","doi-asserted-by":"crossref","unstructured":"Christian S Jensen, Dalia Tiesyte, Nerius Tradisauskas. Robust B+-tree-based indexing of moving objects. In Proc. MDM, Nara, Japan, 2006, p.12.","DOI":"10.1109\/MDM.2006.135"},{"key":"9185_CR2","doi-asserted-by":"crossref","unstructured":"Antonin Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. SIGMOD Conference, Boston, MA, USA, 1984, pp.47\u201357.","DOI":"10.1145\/602259.602266"},{"key":"9185_CR3","doi-asserted-by":"crossref","unstructured":"Simonas Saltenis, Christian S Jensen, Scott T Leutenegger, Mario A Lopez. Indexing the positions of continuously moving objects. In Proc. SIGMOD Conference, Dallas, TX, USA, 2000, pp.331\u2013342.","DOI":"10.1145\/335191.335427"},{"key":"9185_CR4","doi-asserted-by":"crossref","unstructured":"Simonas Saltenis, Christian S Jensen. Indexing of moving objects for location-based services. In Proc. ICDE, San Jose, CA, USA, 2002, pp.463\u2013472.","DOI":"10.1109\/ICDE.2002.994759"},{"key":"9185_CR5","doi-asserted-by":"crossref","unstructured":"Yufei Tao, Dimitris Papadias, Jimeng Sun. The TPR*-tree: An optimized spatio-temporal access method for predictive queries. In Proc. VLDB, Berlin, Germany, 2003, pp.790\u2013801.","DOI":"10.1016\/B978-012722442-8\/50075-6"},{"key":"9185_CR6","doi-asserted-by":"crossref","unstructured":"Jignesh M Patel, Yun Chen, V Prasad Chakka. STRIPES: An efficient index for predicted trajectories. In Proc. SIGMOD Conference, Paris, France, 2004, pp.637\u2013646.","DOI":"10.1145\/1007568.1007639"},{"issue":"2","key":"9185_CR7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"Hanan Samet","year":"1984","unstructured":"Hanan Samet. The quadtree and related hierarchical data structures. ACM Comput. Surv., 1984, 16(2): 187\u2013260.","journal-title":"ACM Comput. Surv."},{"key":"9185_CR8","doi-asserted-by":"crossref","unstructured":"Christian S Jensen, Dan Lin, Beng Chin Ooi. Query and update efficient B+-tree based indexing of moving objects. In Proc. VLDB, Toronto, Ontario, Canada, 2004, pp.768\u2013779.","DOI":"10.1016\/B978-012088469-8\/50068-1"},{"issue":"2","key":"9185_CR9","first-page":"40","volume":"26","author":"Mohamed F Mokbel","year":"2003","unstructured":"Mohamed F Mokbel, Thanaa M Ghanem, Walid G Aref. Spatio-temporal access methods. IEEE Data Eng. Bull., 2003, 26(2): 40\u201349.","journal-title":"IEEE Data Eng. Bull."},{"key":"9185_CR10","doi-asserted-by":"crossref","unstructured":"Bin Lin, Hoda Mokhtar, Rafael Pelaez-Aguilera, Jianwen Su. Querying moving objects with uncertainty. In Proc. Vehicular Technology Conference, Orlando, FL, USA, 2003, pp.2783\u20132787.","DOI":"10.1109\/VETECF.2003.1286090"},{"issue":"2","key":"9185_CR11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s11390-007-9031-9","volume":"22","author":"Ji-Dong Chen","year":"2007","unstructured":"Ji-Dong Chen, Xiao-Feng Meng. Indexing future trajectories of moving objects in a constrained network. Journal of Computer Science and Technology, 2007, 22(2): 245\u2013251.","journal-title":"Journal of Computer Science and Technology"},{"issue":"10","key":"9185_CR12","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1109\/TKDE.2004.48","volume":"16","author":"Yufei Tao","year":"2004","unstructured":"Yufei Tao, Jun Zhang, Dimitris Papadias, Nikos Mamoulis. An efficient cost model for optimization of nearest neighbor search in low and medium dimensional spaces. IEEE Trans. Knowl. Data Eng., 2004, 16(10): 1169\u20131184.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9185_CR13","doi-asserted-by":"crossref","unstructured":"Mong-Li Lee, Wynne Hsu, Christian S. Jensen, Bin Cui, Keng Lik Teo. Supporting frequent updates in R-trees: A bottom-up approach. In Proc. VLDB, Berlin, Germany, 2003, pp.608\u2013619.","DOI":"10.1016\/B978-012722442-8\/50060-4"},{"key":"9185_CR14","doi-asserted-by":"crossref","unstructured":"Xiaopeng Xiong, Walid G Aref. R-trees with update memos. In Proc. ICDE, Atlanta, Georgia, USA, 2006, p.22.","DOI":"10.1109\/ICDE.2006.125"},{"issue":"1","key":"9185_CR15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/1121995.1122002","volume":"35","author":"Goetz Graefe","year":"2006","unstructured":"Goetz Graefe. B-tree indexes for high update rates. SIGMOD Record, 2006, 35(1): 39\u201344.","journal-title":"SIGMOD Record"},{"issue":"1","key":"9185_CR16","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/69.908985","volume":"13","author":"Bongki Moon","year":"2001","unstructured":"Bongki Moon, H V Jagadish, Christos Faloutsos, Joel H Saltz. Analysis of the clustering properties of the Hilbert space-filling curve. IEEE Trans. Knowl. Data Eng., 2001, 13(1): 124\u2013141.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9185_CR17","doi-asserted-by":"crossref","unstructured":"V Srinivasan, Michael J Carey. Performance of B-tree concurrency algorithms. In Proc. SIGMOD Conference, Denver, CO, USA, 1991, pp.416\u2013425.","DOI":"10.1145\/119995.115860"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-008-9185-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-008-9185-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-008-9185-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,3]],"date-time":"2025-02-03T03:57:05Z","timestamp":1738555025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-008-9185-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["9185"],"URL":"https:\/\/doi.org\/10.1007\/s11390-008-9185-0","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11]]}}}