A method for concurrency control in distributed DBMSs: Permission Test Method

Date

1987-01-09

Author

Halıcı, Uğur

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

246
views

0
downloads

In this paper, a method for concurrency control in distributed DBMSs, called Permission Test Method is proposed. The PT method satisfies the basic requirements for concurrency control, that is, it executes the transactions in a serializable order, deadlocks do not appear and indefinite postponment is prevented by the method. In PT method, transactions, which are permitted to run, are not aborted unless a related site failure occurs. Furthermore, the complexity analysis indicates that the algorithm will work in a reasonable amount of time. The PT method provides more concurrency than the Basic Timestamp Ordering and Two-Phase Locking techniques. © 1987, ACM. All rights reserved.

Subject Keywords

Software, Information Systems

URI

https://hdl.handle.net/11511/57168

Journal

ACM SIGMOD Record

DOI

https://doi.org/10.1145/988598.988601

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

A monolithic approach to automated composition of semantic web services with the Event Calculus Okutan, Cagla; Çiçekli, Fehime Nihan (Elsevier BV, 2010-07-01) In this paper, a web service composition and execution framework is presented for semantically -annotated web services. A monolithic approach to automated web service composition and execution problem is chosen, which provides some benefits by separating composition and execution phases. An AI planning method using a logical formalism, namely Abductive Event Calculus, is chosen for the composition phase. This formalism allows one to generate a narrative of actions and temporal orderings using abductive plan...
Verification and transformation of complex and uncertain conceptual schemas Yazıcı, Adnan (World Scientific Pub Co Pte Lt, 1997-12-01) In database environment it is necessary to represent complex and uncertain information at conceptual level and then transform the conceptual schema into the logical one for ultimate implementation. It is also important to verify the conceptual schema with respect to the constraints imposed on the schema definition. In this paper we primarily focus on the verification and transformation of the conceptual schema For the purpose of verification of the conceptual schema represented by the ExIFO data model (the ...
An indexing technique for similarity-based fuzzy object-oriented data model Yazıcı, Adnan; Koyuncu, M (2004-01-01) Fuzzy object-oriented data model is a fuzzy logic-based extension to object-oriented database model, which permits uncertain data to be explicitly represented. One of the proposed fuzzy object-oriented database models based on similarity relations is the FOOD model. Several kinds of fuzziness are dealt with in the FOOD model, including fuzziness between object/class and class/superclass relations. The traditional index structures are inappropriate for the FOOD model for an efficient access to the objects wi...
A discrete optimality system for an optimal harvesting problem Bakan, Hacer Oz; Yilmaz, Fikriye; Weber, Gerhard Wilhelm (Springer Science and Business Media LLC, 2017-10-01) In this paper, we obtain the discrete optimality system of an optimal harvesting problem. While maximizing a combination of the total expected utility of the consumption and of the terminal size of a population, as a dynamic constraint, we assume that the density of the population is modeled by a stochastic quasi-linear heat equation. Finite-difference and symplectic partitioned Runge-Kutta (SPRK) schemes are used for space and time discretizations, respectively. It is the first time that a SPRK scheme is e...
A new reactive method for processing web usage data Bayır, Murat Ali; Toroslu, İsmail Hakkı; Department of Computer Engineering (2006) In this thesis, a new reactive session reconstruction method 'Smart-SRA' is introduced. Web usage mining is a type of web mining, which exploits data mining techniques to discover valuable information from navigations of Web users. As in classical data mining, data processing and pattern discovery are the main issues in web usage mining. The first phase of the web usage mining is the data processing phase including session reconstruction. Session reconstruction is the most important task of web usage mining...

Citation Formats

U. Halıcı, “A method for concurrency control in distributed DBMSs: Permission Test Method,” ACM SIGMOD Record, pp. 37–50, 1987, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57168.