Sciweavers

85 search results - page 1 / 17
» From Total Order to Database Replication
Sort
View
ICDCS
2002
IEEE
13 years 9 months ago
From Total Order to Database Replication
This paper presents in detail an efficient and provably correct algorithm for database replication over partitionable networks. Our algorithm avoids the need for end-toend acknow...
Yair Amir, Ciprian Tutu
ICDE
2004
IEEE
127views Database» more  ICDE 2004»
14 years 5 months ago
Lazy Database Replication with Ordering Guarantees
Lazy replication is a popular technique for improving the performance and availability of database systems. Although there are concurrency control techniques which guarantee seria...
Khuzaima Daudjee, Kenneth Salem
EUROSYS
2006
ACM
14 years 1 months ago
Tashkent: uniting durability with transaction ordering for high-performance scalable database replication
In stand-alone databases, the two functions of ordering the transaction commits and making the effects of transactions durable are generally performed in one action, namely in the...
Sameh Elnikety, Steven G. Dropsho, Fernando Pedone
EUROPAR
2008
Springer
13 years 6 months ago
Fault-Tolerant Partial Replication in Large-Scale Database Systems
We investigate a decentralised approach to committing transactions in a replicated database, under partial replication. Previous protocols either reexecute transactions entirely an...
Pierre Sutra, Marc Shapiro
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 5 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...