Show simple item record

dc.contributor.author
Akal, Fuat
dc.contributor.author
Türker, Can
dc.contributor.author
Schek, Hans-Jörg
dc.contributor.author
Grabs, Torsten
dc.contributor.author
Breitbart, Yuri
dc.date.accessioned
2017-08-14T08:46:50Z
dc.date.available
2017-06-10T19:31:17Z
dc.date.available
2017-08-14T08:46:50Z
dc.date.issued
2004-09
dc.identifier.uri
http://hdl.handle.net/20.500.11850/69781
dc.identifier.doi
10.3929/ethz-a-006774941
dc.description.abstract
Eager replication management is known to generate unacceptable performance as soon as the update rate or the number of replicas increases. Lazy replication protocols tackle this problem by decoupling transaction execution from the propagation of new values to replica sites while guaranteeing a correct and more efficient transaction processing and replica maintenance. However, they impose several restrictions on transaction models that are often not valid in practical database settings, e.g., they require that each transaction executes at its initiation site and/or are restricted to full replication schemes. Also, the protocols cannot guarantee that the transactions will always see the freshest available replicas. This paper presents a new lazy replication protocol called PDBREP that is free of these restrictions while ensuring one copy serializable executions. The protocol exploits the distinction between read-only and general transactions and works with arbitrary physical data organizations such as partitioning and striping as well as different replica granularities. It does not require that each read-only transaction executes entirely at its initiation site. Hence, each read-only site need not contain a fully replicated database. PDBREP furthermore generalizes the notion of freshness to finer data granules than entire databases. Beside its architectural advantages, experiments revealed that PDBREP outperforms related lazy replication techniques.
en_US
dc.language.iso
en
en_US
dc.publisher
ETH, Department of Computer Science
en_US
dc.rights.uri
http://rightsstatements.org/page/InC-NC/1.0/
dc.title
Fine-Grained Lazy Replication with Strict Freshness and Correctness Guarantees
en_US
dc.type
Report
dc.rights.license
In Copyright - Non-Commercial Use Permitted
ethz.journal.title
Technical report
ethz.journal.volume
457
en_US
ethz.size
14 p.
en_US
ethz.code.ddc
0 - Computer science, information & general works::004 - Data processing, computer science
en_US
ethz.identifier.nebis
006774941
ethz.publication.place
Zurich
en_US
ethz.publication.status
published
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science
en_US
ethz.date.deposited
2017-06-10T19:34:36Z
ethz.source
ECOL
ethz.source
ECIT
ethz.identifier.importid
imp593650d37439a69575
ethz.identifier.importid
imp59366b14e325767441
ethz.ecolpid
eth:4790
ethz.ecitpid
pub:110488
ethz.eth
yes
en_US
ethz.availability
Open access
en_US
ethz.rosetta.installDate
2017-07-18T20:28:13Z
ethz.rosetta.lastUpdated
2017-08-14T08:46:56Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Fine-Grained%20Lazy%20Replication%20with%20Strict%20Freshness%20and%20Correctness%20Guarantees&rft.jtitle=Technical%20report&rft.date=2004-09&rft.volume=457&rft.au=Akal,%20Fuat&T%C3%BCrker,%20Can&Schek,%20Hans-J%C3%B6rg&Grabs,%20Torsten&Breitbart,%20Yuri&rft.genre=report&
 Search via SFX

Files in this item

Thumbnail

Publication type

Show simple item record