Serializability of nested transactions in multidatabases

Date

1997-01-01

Author

Halıcı, Uğur
Dogac, A

Metadata

Show full item record

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

Item Usage Stats

165
views

0
downloads

The correctness of nested transactions for multidatabases differs from that of flat transactions in that, for nested transactions the execution order of siblings at each related site should also be consistent. In this paper we first propose a simple but powerful theory for the serializability of nested transactions in multidatabases and then a technique called Nested Tickets Method for Nested transactions (NTNT). The NTNT technique provides correctness of nested transactions in multidatabases without violating the local autonomy of the participating DBMSs. The algorithm is fully distributed, in other words there is no central scheduler. The correctness of the NTNT technique is proved by using the developed theory.

URI

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

Journal

DATABASE THEORY - ICDT'97

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Serializability of nested transactions in multidatabases Halıcı, Uğur; Dogac, Asuman (1997-01-01) © Springer-Verlag Berlin Heidelberg 1997.The correctness of nested transactions for multidatabases differs from that of flat transactions in that, for nested transactions the execution order of siblings at each related site should also be consistent. In this paper we first propose a simple but powerful theory for the serializability of nested transactions in multidatabases and then a technique called Nested Tickets Method for Nested Transactions (NTNT). The NTNT technique provides correctness of nested tran...
Concurrency control in distributed databases through time intervals and short-term locks Halıcı, Uğur (Institute of Electrical and Electronics Engineers (IEEE), 1989) A method for concurrency control in distributed database management systems that increases the level of concurrent execution of transactions, called ordering by serialization numbers (OSN), is proposed. The OSN method works in the certifier model and uses time-interval techniques in conjunction with short-term locks to provide serializability and prevent deadlocks. The scheduler is distributed, and the standard transaction execution policy is assumed, that is, the read and write operations are issued contin...
Integer Linear Programming Solution for the Multiple Query Optimization Problem Dokeroglu, Tansel; Bayir, Murat Ali; Coşar, Ahmet (2014-10-28) Multiple Query Optimization (MQO) is a technique for processing a batch of queries in such a way that shared tasks in these queries are executed only once, resulting in significant savings in the total evaluation. The first phase of MQO requires producing alternative query execution plans so that the shared tasks between queries are identified and maximized. The second phase of MQO is an optimization problem where the goal is selecting exactly one of the alternative plans for each query to minimize the tota...
Exploiting query views for static index pruning in web search engines Altıngövde, İsmail Sengör; Ulusoy, Özgür (2009-12-01) We propose incorporating query views in a number of static pruning strategies, namely term-centric, document-centric and access-based approaches. These query-view based strategies considerably outperform their counterparts for both disjunctive and conjunctive query processing in Web search engines.
Bit-Wise Unequal Error Protection for Variable-Length Block Codes With Feedback Nakiboğlu, Barış; Zheng, Lizhong; Coleman, Todd P (2013-03-01) The bit-wise unequal error protection problem, for the case when the number of groups of bits is fixed, is considered for variable-length block codes with feedback. An encoding scheme based on fixed-length block codes with erasures is used to establish inner bounds to the achievable performance for finite expected decoding time. A new technique for bounding the performance of variable-length block codes is used to establish outer bounds to the performance for a given expected decoding time. The inner and th...

Citation Formats

U. Halıcı and A. Dogac, “Serializability of nested transactions in multidatabases,” DATABASE THEORY - ICDT′97, pp. 321–335, 1997, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52938.