Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
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
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
A weighted voting algorithm for replicated directories
Journal of the ACM (JACM)
Achieving High Availability in Distributed Databases
IEEE Transactions on Software Engineering
Data replicas in distributed information services
ACM Transactions on Database Systems (TODS)
Parallelism and concurrency control performance in distributed database machines
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Heterogeneous distributed database systems for production use
ACM Computing Surveys (CSUR) - Special issue on heterogeneous databases
Conflict detection tradeoffs for replicated data
ACM Transactions on Database Systems (TODS)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
ANSS '92 Proceedings of the 25th annual symposium on Simulation
Correctness of query execution strategies in distributed databases
ACM Transactions on Database Systems (TODS)
Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems
A recovery algorithm for a distributed database system
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Data Mining and Knowledge Discovery
A Fault-Tolerant Protocol for Atomic Broadcast
IEEE Transactions on Parallel and Distributed Systems
Certification by Intervals of Timestamps in Distributed Database Systems
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Mixed concurrency control: Dealing with heterogeneity in distributed database systems
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
A Case for Message Oriented Middleware
Proceedings of the 13th International Symposium on Distributed Computing
Dynamic Data Distribution (D3) in a Shared-Nothing Multiprocessor Data Store
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
RM: A resource-sharing system for personal computers
SIGSMALL '83 Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers
An algorithm, for replicated directories
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
The failure and recovery problem for replicated databases
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A resource class independent deadlock detection algorithm
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Derived relations: a unified mechanism for views, snapshots, and distributed data
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Strategies for handling transactions in distributed data base systems during recovery
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Lock-free consistency control for web 2.0 applications
Proceedings of the 17th international conference on World Wide Web
Reliable dynamic reconfigurations in the fractal component model
Proceedings of the 6th international workshop on Adaptive and reflective middleware: held at the ACM/IFIP/USENIX International Middleware Conference
Decision support in a distributed environment
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
Device transparency: a new model for mobile storage
ACM SIGOPS Operating Systems Review
A multi-stage approach for reliable dynamic reconfigurations of component-based systems
DAIS'08 Proceedings of the 8th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Towards monitored data consistency and business processing based on declarative software agents
Software engineering for large-scale multi-agent systems
A formal characterization of SI-based ROWA replication protocols
Data & Knowledge Engineering
On the notion of consistency in metadata repository systems
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
Reliable dynamic reconfigurations in a reflective component model
CBSE'10 Proceedings of the 13th international conference on Component-Based Software Engineering
Transaction processing using thread-to-metadata
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.03 |
The concepts of transaction and of data consistency are defined for a distributed system. The cases of partitioned data, where fragments of a file are stored at multiple nodes, and replicated data, where a file is replicated at several nodes, are discussed. It is argued that the distribution and replication of data should be transparent to the programs which use the data. That is, the programming interface should provide location transparency, replica transparency, concurrency transparency, and failure transparency. Techniques for providing such transparencies are abstracted and discussed.By extending the notions of system schedule and system clock to handle multiple nodes, it is shown that a distributed system can be modeled as a single sequential execution sequence. This model is then used to discuss simple techniques for implementing the various forms of transparency.