{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:56:54Z","timestamp":1762210614068,"version":"3.41.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001457","name":"Media Development Authority - Singapore","doi-asserted-by":"publisher","award":["R-252-000-376-279"],"award-info":[{"award-number":["R-252-000-376-279"]}],"id":[{"id":"10.13039\/501100001457","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2010,7]]},"abstract":"<jats:p>\n            In a\n            <jats:italic>Moving Object Database<\/jats:italic>\n            (MOD), the dataset, for example, the location of objects and their distribution, and the workload change frequently. Traditional static indexes are not able to cope well with such changes, that is, their effectiveness and efficiency are seriously affected. This calls for the development of novel indexes that can be reconfigured automatically based on the state of the system. In this article, we design and present the ST\n            <jats:sup>2<\/jats:sup>\n            B-tree, a\n            <jats:italic>S<\/jats:italic>\n            elf-\n            <jats:italic>T<\/jats:italic>\n            unable\n            <jats:italic>S<\/jats:italic>\n            patio-\n            <jats:italic>T<\/jats:italic>\n            emporal\n            <jats:italic>B<\/jats:italic>\n            <jats:sup>+<\/jats:sup>\n            -tree index for MODs. In ST\n            <jats:sup>2<\/jats:sup>\n            B-tree, the data space is partitioned into regions of different density with respect to a set of reference points. Based on the density, objects in a region are managed using a grid of appropriate granularity; intuitively, a dense region employs a grid with fine granularity, while a sparse region uses a grid with coarse granularity. In this way, the ST\n            <jats:sup>2<\/jats:sup>\n            B-tree adapts itself to workload diversity in space. To enable online tuning, the ST\n            <jats:sup>2<\/jats:sup>\n            B-tree employs a \u201cmultitree\u201d indexing technique. The underlying B\n            <jats:sup>+<\/jats:sup>\n            -tree is logically divided into two subtrees. Objects are dispatched to either subtree depending on their last update time. The two subtrees are rebuilt periodically and alternately. Whenever a subtree is rebuilt, it is tuned to optimize performance by picking an appropriate setting (e.g., the set of reference points and grid granularity) based on the most recent data and workload. To cut down the overhead of rebuilding, we propose an eager update technique to construct the subtree. Finally, we present a tuning framework for the ST\n            <jats:sup>2<\/jats:sup>\n            B-tree, where the tuning is conducted online and automatically without human intervention, and without interfering with the regular functions of the MOD. We have implemented the tuning framework and the ST\n            <jats:sup>2<\/jats:sup>\n            B-tree, and conducted extensive performance evaluations. The results show that the self-tuning mechanism minimizes the degradation of performance caused by workload changes without any noticeable overhead.\n          <\/jats:p>","DOI":"10.1145\/1806907.1806909","type":"journal-article","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T13:15:22Z","timestamp":1280754922000},"page":"1-51","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Continuous online index tuning in moving object databases"],"prefix":"10.1145","volume":"35","author":[{"given":"Su","family":"Chen","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Republic of Singapore"}]},{"given":"Mario A.","family":"Nascimento","sequence":"additional","affiliation":[{"name":"University of Alberta, Edmonton, Alberta"}]},{"given":"Beng Chin","family":"Ooi","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Republic of Singapore"}]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Republic of Singapore"}]}],"member":"320","published-online":{"date-parts":[[2010,7,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304187"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"volume-title":"Proceedings of the International Conference on Very Large Databases (VLDB'97)","author":"Chaudhuri S.","key":"e_1_2_1_3_1","unstructured":"Chaudhuri , S. and Narasayya , V. R . 1997. An efficient cost-driven index selection tool for Microsoft SQL server . In Proceedings of the International Conference on Very Large Databases (VLDB'97) . 146--155. Chaudhuri, S. and Narasayya, V. R. 1997. An efficient cost-driven index selection tool for Microsoft SQL server. In Proceedings of the International Conference on Very Large Databases (VLDB'97). 146--155."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-008-9185-0"},{"volume-title":"Proceedings of the International Conference on Very Large Databases (VLDB'08)","author":"Chen S.","key":"e_1_2_1_5_1","unstructured":"Chen , S. , Jensen , C. S. , and Lin , D . 2008b. A benchmark for evaluating moving objects indexes . In Proceedings of the International Conference on Very Large Databases (VLDB'08) . 1574--1585. Chen, S., Jensen, C. S., and Lin, D. 2008b. A benchmark for evaluating moving objects indexes. In Proceedings of the International Conference on Very Large Databases (VLDB'08). 1574--1585."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376622"},{"volume-title":"Proceedings of the International SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'96)","author":"Ester M.","key":"e_1_2_1_7_1","unstructured":"Ester , M. , Kriegel , H.-P. , Sander , J. , and Xu , X . 1996. A density-based algorithm for discovering clusters in large spatial databases with noise . In Proceedings of the International SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'96) . 226--231. Ester, M., Kriegel, H.-P., Sander, J., and Xu, X. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the International SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'96). 226--231."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1228268.1228272"},{"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.1145\/1071610.1071612"},{"volume-title":"Proceedings of the International Conference on Very Large Databases (VLDB'04)","author":"Jensen C. S.","key":"e_1_2_1_11_1","unstructured":"Jensen , C. S. , Lin , D. , and Ooi , B. C . 2004. Query and update efficient B+ -tree based indexing of moving objects . In Proceedings of the International Conference on Very Large Databases (VLDB'04) . 768--779. Jensen, C. S., Lin, D., and Ooi, B. C. 2004. Query and update efficient B+ -tree based indexing of moving objects. In Proceedings of the International Conference on Very Large Databases (VLDB'04). 768--779."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2006.135"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAPD.0000013068.25976.88"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.304002"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0139-z"},{"volume-title":"Proceedings of the International Conference on Mobile Data Management (MDM'02)","author":"Kwon D.","key":"e_1_2_1_16_1","unstructured":"Kwon , D. , Lee , S. , and Lee , S . 2002. Indexing the current positions of moving objects using the lazy update . In Proceedings of the International Conference on Mobile Data Management (MDM'02) . 113--120. Kwon, D., Lee, S., and Lee, S. 2002. Indexing the current positions of moving objects using the lazy update. In Proceedings of the International Conference on Mobile Data Management (MDM'02). 113--120."},{"volume-title":"Proceedings of the International Conference on Very Large Databases (VLDB'03)","author":"Lee M. L.","key":"e_1_2_1_17_1","unstructured":"Lee , M. L. , Hsu , W. , Jensen , C. S. , Cui , B. , and Teo , K. L . 2003. Supporting frequent updates in R-trees: A bottom-up approach . In Proceedings of the International Conference on Very Large Databases (VLDB'03) . 608--619. Lee, M. L., Hsu, W., Jensen, C. S., Cui, B., and Teo, K. L. 2003. Supporting frequent updates in R-trees: A bottom-up approach. In Proceedings of the International Conference on Very Large Databases (VLDB'03). 608--619."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/319628.319663"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007638"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908985"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066230"},{"volume-title":"Proceedings of the International Conference on Database and Expert Systems Applications (DEXA'94)","author":"Ng V.","key":"e_1_2_1_22_1","unstructured":"Ng , V. and Kameda , T . 1994. The R-link tree: A recoverable index structure for spatial data . In Proceedings of the International Conference on Database and Expert Systems Applications (DEXA'94) . 163--172. Ng, V. and Kameda, T. 1994. The R-link tree: A recoverable index structure for spatial data. In Proceedings of the International Conference on Database and Expert Systems Applications (DEXA'94). 163--172."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007639"},{"volume-title":"Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX'02)","author":"Procopiuc C. M.","key":"e_1_2_1_24_1","unstructured":"Procopiuc , C. M. , Agarwal , P. K. , and Har-Peled , S . 2002. Star-Tree: An efficient self-adjusting index for moving objects . In Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX'02) . 178--193. Procopiuc, C. M., Agarwal, P. K., and Har-Peled, S. 2002. Star-Tree: An efficient self-adjusting index for moving objects. In Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX'02). 178--193."},{"volume-title":"Proceedings of the International Conference on Data Engineering (ICDE'02)","author":"Saltenis S.","key":"e_1_2_1_25_1","unstructured":"Saltenis , S. and Jensen , C. S . 2002. Indexing of moving objects for location-based services . In Proceedings of the International Conference on Data Engineering (ICDE'02) . 463--472. Saltenis, S. and Jensen, C. S. 2002. Indexing of moving objects for location-based services. In Proceedings of the International Conference on Data Engineering (ICDE'02). 463--472."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335427"},{"volume-title":"Proceedings of the International Conference on Very Large Databases (VLDB'03)","author":"Tao Y.","key":"e_1_2_1_27_1","unstructured":"Tao , Y. , Papadias , D. , and Sun , J . 2003. The TPR&ast;-tree: An optimized spatio-temporal access method for predictive queries . In Proceedings of the International Conference on Very Large Databases (VLDB'03) . 790--801. Tao, Y., Papadias, D., and Sun, J. 2003. The TPR&ast;-tree: An optimized spatio-temporal access method for predictive queries. In Proceedings of the International Conference on Very Large Databases (VLDB'03). 790--801."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0064-z"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.48"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.125"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.128"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0013-2"},{"volume-title":"Proceedings of the International Conference on Very Large Databases (VLDB'01)","author":"Yu C.","key":"e_1_2_1_33_1","unstructured":"Yu , C. , Ooi , B. C. , Tan , K.-L. , and Jagadish , H. V . 2001. Indexing the distance: An efficient method to knn processing . In Proceedings of the International Conference on Very Large Databases (VLDB'01) . 421--430. Yu, C., Ooi, B. C., Tan, K.-L., and Jagadish, H. V. 2001. Indexing the distance: An efficient method to knn processing. In Proceedings of the International Conference on Very Large Databases (VLDB'01). 421--430."}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806907.1806909","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806907.1806909","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806907.1806909"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["10.1145\/1806907.1806909"],"URL":"https:\/\/doi.org\/10.1145\/1806907.1806909","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"type":"print","value":"0362-5915"},{"type":"electronic","value":"1557-4644"}],"subject":[],"published":{"date-parts":[[2010,7]]},"assertion":[{"value":"2008-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}