Using semantic knowledge for transaction processing in a distributed database
- 1 June 1983
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 8 (2), 186-213
- https://doi.org/10.1145/319983.319985
Abstract
This paper investigates how the semantic knowledge of an application can be used in a distributed database to process transactions efficiently and to avoid some of the delays associated with failures. The main idea is to allow nonserializable schedules which preserve consistency and which are acceptable to the system users. To produce such schedules, the transaction processing mechanism receives semantic information from the users in the form of transaction semantic types, a division of transactions into steps, compatibility sets, and countersteps. Using these notions, we propose a mechanism which allows users to exploit their semantic knowledge in an organized fashion. The strengths and weaknesses of this approach are discussed.Keywords
This publication has 18 references indexed in Scilit:
- Distributed deadlock detection algorithmACM Transactions on Database Systems, 1982
- Concurrency Control in Distributed Database SystemsACM Computing Surveys, 1981
- General purpose schedulers for database systemsActa Informatica, 1980
- A locking protocol for resource coordination in distributed databasesACM Transactions on Database Systems, 1980
- Concurrency control in a system for distributed databases (SDD-1)ACM Transactions on Database Systems, 1980
- A transaction modelLecture Notes in Computer Science, 1980
- The serializability of concurrent database updatesJournal of the ACM, 1979
- A Majority consensus approach to concurrency control for multiple copy databasesACM Transactions on Database Systems, 1979
- System level concurrency control for distributed database systemsACM Transactions on Database Systems, 1978
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976