Sciweavers

8 search results - page 1 / 2
» Supporting Linearizable Semantics in Replicated Databases
Sort
View
NCA
2008
IEEE
13 years 11 months ago
Supporting Linearizable Semantics in Replicated Databases
This paper proposes a novel database replication algorithm that offers strong consistency (linearizable semantics) and allows reads and non-conflicting writes to execute in para...
Luís Rodrigues, Nuno Carvalho, Emili Miedes
NETGAMES
2006
ACM
13 years 10 months ago
Applying database replication to multi-player online games
Multi-player Online Games (MOGs) have emerged as popular data intensive applications in recent years. Being used by many players simultaneously, they require a high degree of faul...
Yi Lin, Bettina Kemme, Marta Patiño-Mart&ia...
CIDR
2011
342views Algorithms» more  CIDR 2011»
12 years 8 months ago
Megastore: Providing Scalable, Highly Available Storage for Interactive Services
Megastore is a storage system developed to meet the requirements of today’s interactive online services. Megastore blends the scalability of a NoSQL datastore with the convenien...
Jason Baker, Chris Bond, James Corbett, J. J. Furm...
ICDCS
2005
IEEE
13 years 10 months ago
Flexible Consistency for Wide Area Peer Replication
The lack of a flexible consistency management solution hinders P2P implementation of applications involving updates, such as read-write file sharing, directory services, online ...
Sai Susarla, John B. Carter
EDBT
2008
ACM
159views Database» more  EDBT 2008»
14 years 4 months ago
P2P systems with transactional semantics
Structured P2P systems have been developed for constructing applications at internet scale in cooperative environments and exhibit a number of desirable features such as scalabili...
Shyam Antony, Divyakant Agrawal, Amr El Abbadi