Results 1 to 10 of about 14,769 (187)
Regular Sequential Serializability and Regular Sequential Consistency [PDF]
arXiv, 2021 Strictly serializable (linearizable) services appear to execute transactions (operations) sequentially, in an order consistent with real time. This restricts a transaction's (operation's) possible return values and in turn, simplifies application programming.
Jeffrey Helt +3 more
arxiv +5 more sources
The serializability of concurrent database updates [PDF]
Journal of the ACM, 1979 A sequence of interleaved user transactions in a database system may not be ser:ahzable, t e, equivalent to some sequential execution of the individual transactions Using a simple transaction model, it ~s shown that recognizing the transaction histories that are serlahzable is an NP-complete problem.
Christos H. Papadimitriou
semanticscholar +5 more sources
Serializable Snapshot Isolation in PostgreSQL [PDF]
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 12, pp.
1850-1861 (2012), 2012 This paper describes our experience implementing PostgreSQL's new serializable isolation level. It is based on the recently-developed Serializable Snapshot Isolation (SSI) technique. This is the first implementation of SSI in a production database release as well as the first in a database that did not previously have a lock-based serializable ...
Dan R. K. Ports, Kevin Grittner
arxiv +7 more sources
Repairing Serializability Bugs in Distributed Database Programs via Automated Schema Refactoring [PDF]
ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2021 Serializability is a well-understood concurrency control mechanism that eases reasoning about highly-concurrent database programs. Unfortunately, enforcing serializability has a high-performance cost, especially on geographically distributed database clusters.
Kia Rahmani +3 more
arxiv +3 more sources
Automated Detection of Serializability Violations under Weak Consistency [PDF]
arXiv, 2018 While a number of weak consistency mechanisms have been developed in recent years to improve performance and ensure availability in distributed, replicated systems, ensuring correctness of transactional applications running on top of such systems remains a difficult and important problem.
Kartik Nagar, S. Jagannathan
arxiv +2 more sources
The Serializability of Network Codes [PDF]
arXiv, 2010 Network coding theory studies the transmission of information in networks whose vertices may perform nontrivial encoding and decoding operations on data as it passes through the network. The main approach to deciding the feasibility of network coding problems aims to reduce the problem to optimization over a polytope of entropic vectors subject to ...
Anna Blasiak, Robert Kleinberg
arxiv +5 more sources
Cache Serializability: Reducing Inconsistency in Edge Transactions [PDF]
IEEE International Conference on Distributed Computing Systems, 2014 Read-only caches are widely used in cloud infrastructures to reduce access latency and load on backend databases. Operators view coherent caches as impractical at genuinely large scale and many client-facing caches are updated in an asynchronous manner with best-effort pipelines.
Ittay Eyal, K. Birman, R. V. Renesse
arxiv +3 more sources
Ggtree: A serialized data object for visualization of a phylogenetic tree and annotation data [PDF]
iMeta, Volume 1, Issue 4, December 2022., 2022 The ggtree object is designed to store phylogenetic tree and associated data, and the object itself is a graphic object that can be rendered as an image file. This work will increase the reproducibility and reusability of phylogenetic data, as well as facilitate integrative and comparative studies.
Shuangbin Xu +9 more
openalex +2 more sources
Maximal serializability of iterated transactions
Theoretical Computer Science, 1985 AbstractThe serializability condition is usually considered in order to maintain the consistency of a Database in the presence of conflicting accesses to the Database performed by concurrent transactions. This serializability condition is considered herein as a general synchronization problem among transactions (or processes) which can be iterated ...
Marie-Paule Flé, Gérard Roucairol
openalex +3 more sources
Journal of the ACM, 1984 The power of locking as a primitive for controlling concurrency in database systems is examined. It is accepted that the concurrent execution (or schedule) of different transactions must be serializable; that is, it must behave like a serial schedule, one in which the transactions run one at a time.
M. Yannakakis
openaire +3 more sources