An optimal workload-based data allocation approach for multidisk databases

Lin, Chia-Chen

doi:10.1016/j.datak.2009.02.001

Cited by 8 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of partial replication protocols [37,6] are certification-based and hold Properties P1 and P4 at the sites where there exists a copy of the database partition and, thus, generate 1GSI-schedules. On the other hand, there exists a family of protocols that uses some heuristics, statistics and graph partitioning algorithms, to minimize the number of transactions to be executed in different replicas with the analysis of the workloads [10,25]. Hence, if we obtain a perfect partitioning (i.e., each transaction only accesses one partition) for a given application, it is naturally satisfied that Properties P5 and P6 hold.…”

Section: Discussion Of Concrete Protocolsmentioning

confidence: 99%

“…This is an attractive solution to scale databases by horizontal partitioning [37,6,10,25] or to cope with mobile transactions [19]. To this end, we should consider that those properties stated for all replicas do not refer to all server nodes but only to the database nodes that are configured to hold a copy of the item (or items) being accessed in each transaction.…”

Section: Discussion Of Concrete Protocolsmentioning

confidence: 99%

See 1 more Smart Citation

A formal characterization of SI-based ROWA replication protocols

Armendáriz-Iñigo

Juárez-Rodríguez

Mendívil

et al. 2011

Data & Knowledge Engineering

View full text Add to dashboard Cite

Snapshot Isolation (SI) is commonly used in some commercial DBMSs with a multiversion concurrency control mechanism since it never blocks read-only transactions. Recent database replication protocols have been designed using SI replicas where transactions are firstly executed in a delegate replica and their updates (if any) are propagated to the rest of replicas at commit time; i.e. they follow the Read One Write All (ROWA) approach. This paper provides a formalization that shows correctness of abstract protocols which cover these replication proposals. These abstract protocols differ in the properties demanded for achieving a global SI level and those needed for its Generalized SI (GSI) variant -allowing reads from old snapshots-. Additionally, we propose two more relaxed properties that also ensure a global GSI level. Thus, some applications can further optimize their performance in a replicated system while obtaining GSI.

show abstract

Section: Discussion Of Concrete Protocolsmentioning

confidence: 99%

Section: Discussion Of Concrete Protocolsmentioning

confidence: 99%

A formal characterization of SI-based ROWA replication protocols

Armendáriz-Iñigo

Juárez-Rodríguez

Mendívil

et al. 2011

Data & Knowledge Engineering

View full text Add to dashboard Cite

show abstract

“…The objective is to minimize the number of registers employed considering that some variables cannot be allocated to the same register. The data allocation problem addressed in Chang (2002), Lin (2009) relates to the static memory allocation studied in . It consists of finding the optimal allocation of relations to a multidisk database so that the expected query cost is minimized.…”

Section: Related Workmentioning

confidence: 99%

A multiple neighborhood search for dynamic memory allocation in embedded systems

Soto

Rossi²,

Sevaux³

2015

J Heuristics

View full text Add to dashboard Cite

International audienceMemory allocation has a significant impact on power consumption in embedded systems. We address the dynamic memory allocation problem, in which memory requirements may change at each time interval. This problem has previously been addressed using integer linear programming and iterative approaches which build a solution interval by interval taking into account the requirements of partial time intervals. A GRASP that builds a solution for all time intervals has been proposed as a global approach. Due to the complexity of this problem, the GRASP algorithm solution quality decreases for larger instances. In order to overcome this drawback, we propose a multiple neighborhood search hybridized with a Tabu Search and enhanced by complex ejection chains. The proposed approach outperforms all previously developed methods devised for the dynamic memory allocation problem

show abstract

“…Like operation allocation mentioned in the previous section, the interaction between load balancing and data allocation will be also considered in this research [5], [7], and [14].…”

Section: Load Balancingmentioning

confidence: 99%