Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/39216
Title: | Concurrency control for adaptive indexing | Authors: | Graefe, G. Felix, H. Idreos, S. Kuno, H. Manegold, S. |
Issue Date: | 2012 | Citation: | Graefe, G., Felix, H., Idreos, S., Kuno, H., Manegold, S. (2012). Concurrency control for adaptive indexing. Proceedings of the VLDB Endowment 5 (7) : 656-667. ScholarBank@NUS Repository. | Abstract: | Adaptive indexing initializes and optimizes indexes incrementally, as a side effect of query processing. The goal is to achieve the benefits of indexes while hiding or minimizing the costs of index creation. However, index-optimizing side effects seem to turn readonly queries into update transactions that might, for example, create lock contention. This paper studies concurrency control in the context of adaptive indexing. We show that the design and implementation of adaptive indexing rigorously separates index structures from index contents; this relaxes the constraints and requirements during adaptive indexing compared to those of traditional index updates. Our design adapts to the fact that an adaptive index is refined continuously, and exploits any concurrency opportunities in a dynamic way. A detailed experimental analysis demonstrates that (a) adaptive indexing maintains its adaptive properties even when running concurrent queries, (b) adaptive indexing can exploit the opportunity for parallelism due to concurrent queries, (c) the number of concurrency conflicts and any concurrency administration overheads follow an adaptive behavior, decreasing a s the workload evolvesand adapting to the workload needs. © 2012 VLDB Endowment. | Source Title: | Proceedings of the VLDB Endowment | URI: | http://scholarbank.nus.edu.sg/handle/10635/39216 | ISSN: | 21508097 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.