{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:25Z","timestamp":1763468185365},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p>Progress in science and engineering relies on the ability to measure, reliably and in detail, pertinent properties of artifacts under design. Progress in the area of database-index design thus relies on empirical studies based on prototype implementations of indexes. This paper proposes a benchmark that targets techniques for the indexing of the current and near-future positions of moving objects. This benchmark enables the comparison of existing and future indexing techniques. It covers important aspects of such indexes that have not previously been covered by any benchmark. Notable aspects covered include update efficiency, query efficiency, concurrency control, and storage requirements. Next, the paper applies the benchmark to half a dozen notable moving-object indexes, thus demonstrating the viability of the benchmark and offering new insight into the performance properties of the indexes.<\/jats:p>","DOI":"10.14778\/1454159.1454229","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1574-1585","source":"Crossref","is-referenced-by-count":53,"title":["A benchmark for evaluating moving object indexes"],"prefix":"10.14778","volume":"1","author":[{"given":"Su","family":"Chen","sequence":"first","affiliation":[{"name":"National University of Singapore"}]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[{"name":"Aalborg University"}]},{"given":"Dan","family":"Lin","sequence":"additional","affiliation":[{"name":"Purdue University"}]}],"member":"320","published-online":{"date-parts":[[2008,8]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"TPR*-tree. http:\/\/www.rtreeportal.org\/code.html.  TPR*-tree. http:\/\/www.rtreeportal.org\/code.html."},{"key":"e_1_2_1_2_1","unstructured":"U.S. Census Bureau - TIGER\/Line. http:\/\/www.census.gov\/geo\/www\/tiger\/.  U.S. Census Bureau - TIGER\/Line. http:\/\/www.census.gov\/geo\/www\/tiger\/."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_2_1_4_1","first-page":"591","volume-title":"Proc. VLDB","author":"Biveinis L.","year":"2007","unstructured":"L. Biveinis , S. \u0160altenis , and C. S. Jensen . Main-memory operation buffering for efficient r-tree update . In Proc. VLDB , pp. 591 -- 602 , 2007 . L. Biveinis, S. \u0160altenis, and C. S. Jensen. Main-memory operation buffering for efficient r-tree update. In Proc. VLDB, pp. 591--602, 2007."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015231126594"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376622"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288933"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316756"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2006.135"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11733836_11"},{"key":"e_1_2_1_13_1","first-page":"113","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 . In Proc. MDM , pp. 113 -- 120 , 2002 . D. Kwon, S. Lee, and S. Lee. Indexing the current positions of moving objects using the lazy update. In Proc. MDM, pp. 113--120, 2002."},{"key":"e_1_2_1_14_1","first-page":"608","volume-title":"Proc. VLDB","author":"Lee M. L.","year":"2003","unstructured":"M. L. Lee , W. Hsu , C. S. Jensen , B. Cui , and K. L. Teo . Supporting frequent updates in R-trees: a bottom-up approach . In Proc. VLDB , pp. 608 -- 619 , 2003 . M. L. Lee, W. Hsu, C. S. Jensen, B. Cui, and K. L. Teo. Supporting frequent updates in R-trees: a bottom-up approach. In Proc. VLDB, pp. 608--619, 2003."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/648060.747136"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007639"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335427"},{"key":"e_1_2_1_18_1","volume-title":"The design and analysis of spatial data structures","author":"Samet H.","year":"1990","unstructured":"H. Samet . The design and analysis of spatial data structures . Addison-Wesley , Boston, MA, USA , 1990 . H. Samet. The design and analysis of spatial data structures. Addison-Wesley, Boston, MA, USA, 1990."},{"key":"e_1_2_1_19_1","first-page":"790","volume-title":"Proc. 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 Proc. VLDB , pp. 790 -- 801 , 2003 . Y. Tao, D. Papadias, and J. Sun. The TPR*-tree: an optimized spatio-temporal access method for predictive queries. In Proc. VLDB, pp. 790--801, 2003."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0064-z"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/46.6.713"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2003.08.008"},{"key":"e_1_2_1_23_1","first-page":"365","volume-title":"Annual Colloquium of the","author":"Werstein P.","year":"1998","unstructured":"P. Werstein . A performance benchmark for spatiotemporal databases. In Proc . Annual Colloquium of the Spatial Information Research Centre , pp. 365 -- 373 , 1998 . P. Werstein. A performance benchmark for spatiotemporal databases. In Proc. Annual Colloquium of the Spatial Information Research Centre, pp. 365--373, 1998."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.125"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0013-2"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1454159.1454229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:54:43Z","timestamp":1672221283000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1454159.1454229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.14778\/1454159.1454229"],"URL":"https:\/\/doi.org\/10.14778\/1454159.1454229","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}