ACM Transactions on Programming Languages and Systems (TOPLAS)
The Escrow transactional method
ACM Transactions on Database Systems (TODS)
Correctness conditions for highly available replicated databases
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Concurrency versus availability: atomicity mechanisms for replicated data
ACM Transactions on Computer Systems (TOCS)
Specifying graceful degradation in distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Modular Concurrency Control and Failure Recovery
IEEE Transactions on Computers
Formal model of correctness without serializabilty
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Commutativity-Based Concurrency Control for Abstract Data Types
IEEE Transactions on Computers
On long-duration CAD transactions
Information Sciences: an International Journal
Local atomicity properties: modular concurrency control for abstract data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
A model of distributed control: dependency and uncertainty
Information Processing Letters
Two phase gossip: managing distributed event histories
Information Sciences: an International Journal
Apologizing versus asking permission: optimistic concurrency control for abstract data types
ACM Transactions on Database Systems (TODS)
Symbolic finite differencing, part I (invited lecture)
Proceedings of the third European symposium on programming on ESOP '90
Lazy replication: exploiting the semantics of distributed services
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A formal approach to recovery by compensating transactions
Proceedings of the sixteenth international conference on Very large databases
Modeling long-running activities as nested sagas
Data Engineering
Data Engineering
Polytransactions for managing interdependent data
Data Engineering
Multi-level transactions and open nested transactions
Data Engineering
A theory of relaxed atomicity (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Efficient dissemination of information in computer networks
The Computer Journal - Special issue on distributed systems
Tolerating bounded inconsistency for increasing concurrency in database systems
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Increasing concurrency and autonomy in replicated database systems
Increasing concurrency and autonomy in replicated database systems
Hybrid concurrency control for abstract data types
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Using semantic knowledge for transaction processing in a distributed database
ACM Transactions on Database Systems (TODS)
Multilevel atomicity—a new correctness criterion for database concurrency control
ACM Transactions on Database Systems (TODS)
Grapevine: an exercise in distributed computing
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Sacrificing serializability to attain high availability of data in an unreliable network
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
Quasi-Copies: Efficient Data Sharing for Information Retrieval Systems
EDBT '88 Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology
Using History Information to Process Delayed Database Updates
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Knowledge-based Integrity Constraint Validation
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
High Throughput Escrow Algorithms for Replicated Databases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Efficient solutions to the replicated log and dictionary problems
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
Distributed and Parallel Databases - Special issue on mobile data management and applications
The costs and limits of availability for replicated services
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Information and Computation
A Framework for Cache Management for Mobile Databases: Design and Evaluation
Distributed and Parallel Databases
Design and evaluation of a conit-based continuous consistency model for replicated services
ACM Transactions on Computer Systems (TOCS)
Minimal replication cost for availability
Proceedings of the twenty-first annual symposium on Principles of distributed computing
IEEE Parallel & Distributed Technology: Systems & Technology
Divergence Control Algorithms for Epsilon Serializability
IEEE Transactions on Knowledge and Data Engineering
Data Consistency in Intermittently Connected Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
Flexible Management of Consistency and Availability of Networked Data Replications
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Optimal k-Coteries That Maximize Availability in General Networks
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
Efficient Numerical Error Bounding for Replicated Network Services
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Trading Replication Consistency for Performance and Availability: an Adaptive Approach
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Effective page refresh policies for Web crawlers
ACM Transactions on Database Systems (TODS)
Replication for web hosting systems
ACM Computing Surveys (CSUR)
Replication for web hosting systems
ACM Computing Surveys (CSUR)
The power of logical clock abstractions
Distributed Computing
ACM Computing Surveys (CSUR)
The costs and limits of availability for replicated services
ACM Transactions on Computer Systems (TOCS)
Design and evaluation of a continuous consistency model for replicated services
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Effective change detection using sampling
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Vector-field consistency for ad-hoc gaming
Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
Two phase replication approach for MANETs
International Journal of Ad Hoc and Ubiquitous Computing
Data-aware connectivity in mobile replicated systems
Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Vector-field consistency for ad-hoc gaming
MIDDLEWARE2007 Proceedings of the 8th ACM/IFIP/USENIX international conference on Middleware
Replicating for performance: case studies
Replication
Adaptive consistency for replicated state in real-time-strategy multiplayer games
Proceedings of the 11th International Workshop on Adaptive and Reflective Middleware
Hi-index | 0.00 |
Databases are replicated to improve performance and availability. The notion of correctness that has commonly been adopted for concurrent access by transactions to shared, possibly replicated, data is serializability. However, serializability may be impractical in high-performance applications since it imposes too stringent a restriction on concurrency. When serializability is relaxed, the integrity constraints describing the data may be violated. By allowing bounded violations of the integrity constraints, however, we are able to increase the concurrency of transactions that execute in a replicated environment. In this article, we introduce the notion of an N-ignorant transaction, which is a transaction that may be ignorant of the results of at most N prior transactions, which is a transaction that may be ignorant of the results of at most N prior transactions. A system in which all transactions are N-ignorant can have an N + 1-fold increase in concurrency over serializable systems, at the expense of bounded violations of its integrity constraints. We present algorithms for implementing replicated databases in N-ignorant systems. We then provide constructive methods for calculating the reachable states in such systems, given the value of N, so that one may assess the maximum liability that is incurred in allowing constraint violation. Finally, we generalize the notion of N-ignorance to a matrix of ignorance for the purpose of higher concurrency.