{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T03:31:25Z","timestamp":1781062285408,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,10,31]],"date-time":"2005-10-31T00:00:00Z","timestamp":1130716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,10,31]]},"DOI":"10.1145\/1099554.1099691","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:52:40Z","timestamp":1139241160000},"page":"493-500","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Handling frequent updates of moving objects"],"prefix":"10.1145","author":[{"given":"Bin","family":"Lin","sequence":"first","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianwen","family":"Su","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,10,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645930.672850"},{"key":"e_1_3_2_1_2_1","volume-title":"Private communications","author":"Arge L.","year":"2004","unstructured":"L. Arge . Private communications , 2004 .]] L. Arge. Private communications, 2004.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646678.702170"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050028"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"issue":"2","key":"e_1_3_2_1_6_1","first-page":"19","article-title":"Generating traffic data. Bulletin on Data Engineering","volume":"26","author":"Brinkhoff T.","year":"2003","unstructured":"T. Brinkhoff . Generating traffic data. Bulletin on Data Engineering , IEEE Computer Society , 26 ( 2 ): 19 -- 25 , 2003 .]] T. Brinkhoff. Generating traffic data. Bulletin on Data Engineering, IEEE Computer Society, 26(2):19--25, 2003.]]","journal-title":"IEEE Computer Society"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/647226.719080"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/352958.352963"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0139-z"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.304002"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.667079"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. MDM","author":"Kwon D.","year":"2002","unstructured":"D. Kwon , S. Lee , and S. Lee . Indexing the current positions of moving objects using the lazy update R-tree . In Proc. MDM , 2002 .]] D. Kwon, S. Lee, and S. Lee. Indexing the current positions of moving objects using the lazy update R-tree. In Proc. MDM, 2002.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375566"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. VLDB","author":"Lee M. L.","year":"2003","unstructured":"M. L. Lee , W. Hsu , C. S. Jensen , and K. L. Teo . Supporting frequent updates in R-trees: a bottom-up approach . In Proc. VLDB , 2003 .]] M. L. Lee, W. Hsu, C. S. Jensen, and K. L. Teo. Supporting frequent updates in R-trees: a bottom-up approach. In Proc. VLDB, 2003.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.304011"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543638"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.675641"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646130.679492"},{"key":"e_1_3_2_1_20_1","volume-title":"RANDOM","author":"Raab M.","year":"1998","unstructured":"M. Raab and A. Steger . Balls into bins -- a simple and tight analysis . In RANDOM , 1998 .]] M. Raab and A. Steger. Balls into bins -- a simple and tight analysis. In RANDOM, 1998.]]"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/974121.974145"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335449"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315487"},{"key":"e_1_3_2_1_24_1","unstructured":"S. Saltenis. http:\/\/www.cs.auc.dk\/ simas\/tpr\/tpr.tar.gz.]]  S. Saltenis. http:\/\/www.cs.auc.dk\/ simas\/tpr\/tpr.tar.gz.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335427"},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. VLDB","author":"Sellis T. K.","year":"1987","unstructured":"T. K. Sellis , N. Roussopoulos , and C. Faloutsos . The r+-tree: A dynamic index for multi-dimensional objects . In Proc. VLDB , 1987 .]] T. K. Sellis, N. Roussopoulos, and C. Faloutsos. The r+-tree: A dynamic index for multi-dimensional objects. In Proc. VLDB, 1987.]]"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. ICDE","author":"Sistla A. P.","year":"1997","unstructured":"A. P. Sistla , O. Wolfson , S. Chamberlain , and S. Dao . Modeling and querying moving objects . In Proc. ICDE , 1997 .]] A. P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. Modeling and querying moving objects. In Proc. ICDE, 1997.]]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/648058.746956"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/647227.719093"},{"key":"e_1_3_2_1_30_1","volume-title":"VLDB","author":"Tao Y.","year":"2003","unstructured":"Y. Tao , D. Papadias , and J. Sun . The TPR*-tree: An optimized spatio-temporal access method for predictive queries . In VLDB , 2003 .]] Y. Tao, D. Papadias, and J. Sun. The TPR*-tree: An optimized spatio-temporal access method for predictive queries. In VLDB, 2003.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/41.3.185"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/237661.237705"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/647226.719071"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSDM.1998.688116"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584860"}],"event":{"name":"CIKM05: Conference on Information and Knowledge Management","location":"Bremen Germany","acronym":"CIKM05","sponsor":["ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 14th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1099554.1099691","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1099554.1099691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:43Z","timestamp":1750263523000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1099554.1099691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,31]]},"references-count":35,"alternative-id":["10.1145\/1099554.1099691","10.1145\/1099554"],"URL":"https:\/\/doi.org\/10.1145\/1099554.1099691","relation":{},"subject":[],"published":{"date-parts":[[2005,10,31]]},"assertion":[{"value":"2005-10-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}