Please use this identifier to cite or link to this item: https://doi.org/10.1145/1806907.1806909
DC FieldValue
dc.titleContinuous online index tuning in moving object databases
dc.contributor.authorChen, S.
dc.contributor.authorNascimento, M.A.
dc.contributor.authorOoi, B.C.
dc.contributor.authorTan, K.-L.
dc.date.accessioned2013-07-04T07:49:41Z
dc.date.available2013-07-04T07:49:41Z
dc.date.issued2010
dc.identifier.citationChen, S., Nascimento, M.A., Ooi, B.C., Tan, K.-L. (2010). Continuous online index tuning in moving object databases. ACM Transactions on Database Systems 35 (3). ScholarBank@NUS Repository. https://doi.org/10.1145/1806907.1806909
dc.identifier.issn03625915
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39793
dc.description.abstractIn a Moving Object Database (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 2B-tree, a Self-Tunable Spatio-Temporal B+-tree index for MODs. In ST2B-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 ST2B-tree adapts itself to workload diversity in space. To enable online tuning, the ST2B-tree employs a "multitree" indexing technique. The underlying B+-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 ST2B-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 ST2B-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. © 2010 ACM.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1145/1806907.1806909
dc.sourceScopus
dc.subjectAlgorithms
dc.subjectDesign
dc.subjectExperimentation
dc.subjectPerformance
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1145/1806907.1806909
dc.description.sourcetitleACM Transactions on Database Systems
dc.description.volume35
dc.description.issue3
dc.description.codenATDSD
dc.identifier.isiut000280544600002
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.