Consistency in Hierarchical Database Systems
Journal of the ACM (JACM)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Query processing utilizing dependencies and horizontal decomposition
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Query processing for distributed databases using generalized semi-joins
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
| Hi-index | 0.00 |
A powerful and expandable system can be economically realized by a local computer network consisting of various kinds of microprocessor-based systems. The following three problems must be solved to organize a distributed processing system using nonidentical elements: (1) communication, (2) query conversion, and (3) global concurrency control. Except in the case when all transactions are read-only ones, (3) must be handled. Since each system in a network does not usually have concurrency control capability or may not use the identical mechanism, it is necessary to develop a global concurrency control mechanism for a local network consisting of systems without such capability. In this paper two such mechanisms are presented. By assigning ordered numbers to the component systems, a consistent and deadlock-free global mechanism is realized for a semijoin-based query procedure. To improve efficiency, a mechanism permitting dynamic modification capability of ordering is also presented.