Online monitoring and visualisation of database structural deterioration

Hoshino, Takashi; Goda, Kazuo

doi:10.1504/ijac.2010.033011

Cited by 3 publications

(3 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many prior index tuning and management approaches focus on optimizing decisions related to the management of full index structures that cover all key ranges [3][4][5][6]21,24,37]. Some approaches recognize that some data items are more heavily queried than others and support partial indexes [35,40], while others recognize that not all decisions about index selection can be taken up front and provide online index operations [3,37].…”

Section: Adaptive Indexingmentioning

confidence: 99%

Transactional support for adaptive indexing

et al. 2014

View full text Add to dashboard Cite

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, indexoptimizing side effects seem to turn read-only queries into update transactions that might, for example, create lock contention. This paper studies concurrency control and recovery 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 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 as the workload evolves and adapting to the workload needs.

show abstract

Section: Adaptive Indexingmentioning

confidence: 99%

Transactional support for adaptive indexing

et al. 2014

View full text Add to dashboard Cite

show abstract

“…Many prior index tuning and management approaches focus on optimizing decisions related to the management of full index structures that cover all key ranges [3,4,5,17,19,2,29]. Some recognize that some data items are more heavily queried than others and support partial indexes [27,31], while others recognize that not all decisions about index selection can be taken up front and provide online indexing features [2,29].…”

Section: Prior Workmentioning

confidence: 99%

Concurrency control for adaptive indexing

et al. 2012

View full text Add to dashboard Cite

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 as the workload evolves and adapting to the workload needs.

show abstract

“…This process is often time consuming. Though removal of aging has been intensively studied [1,2,3,4,5,6], it is impossible to invoke reorganization frequently enough to keep the database from being aged all the time.…”

Section: Introductionmentioning

confidence: 99%

An Experimental Study of Aging Influence on Query Cost Estimation

Kato

Hayamizu

Goda

2014

Proceedings of the 19th International Database Engineering &Amp; Applications Symposium on - IDEAS '15

Self Cite

View full text Add to dashboard Cite

Many update queries on a database can eventually degrade the structural efficiency of the database and result in lower performance. This phenomenon is called aging. On aged databases, conventional cost-based query optimizers could choose non-optimal query execution plan because they are not aging-aware and could not accurately estimate query execution cost.As a first step to build an aging-aware query optimizer, we experimentally examined the discrepancy between actual and estimated cost in order to investigate aging influence on the accuracy of cost estimation. The experimental result shows that aging could produce non-negligible cost estimation errors, up to 66.3%. The result indicates that a conventional query optimizer can fail to choose the optimal execution plan even for a simple query.

show abstract

Online monitoring and visualisation of database structural deterioration

Cited by 3 publications

References 51 publications

Transactional support for adaptive indexing

Transactional support for adaptive indexing

Concurrency control for adaptive indexing

An Experimental Study of Aging Influence on Query Cost Estimation

Contact Info

Product

Resources

About