Results 301 to 310 of about 15,889,209 (373)
Improving optimistic concurrency Control in Delta Lake : Enabling safe parallel schema evolution
Aréjula Aísa, Iñigo
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, 2015
The rise of data-intensive "Web 2.0" Internet services has led to a range of popular new programming frameworks that collectively embody the latest incarnation of the vision of Object-Relational Mapping (ORM) systems, albeit at unprecedented scale.
Peter Bailis +5 more
openaire +2 more sources
The rise of data-intensive "Web 2.0" Internet services has led to a range of popular new programming frameworks that collectively embody the latest incarnation of the vision of Object-Relational Mapping (ORM) systems, albeit at unprecedented scale.
Peter Bailis +5 more
openaire +2 more sources
Caracal: Contention Management with Deterministic Concurrency Control
Symposium on Operating Systems Principles, 2021Deterministic databases offer several benefits: they ensure serializable execution while avoiding concurrency-control related aborts, and they scale well in distributed environments. Today, most deterministic database designs use partitioning to scale up
Dai Qin, Angela Demke Brown, Ashvin Goel
semanticscholar +1 more source
The canonical amoebot model: algorithms and concurrency control
Distributed computing, 2021The amoebot model abstracts active programmable matter as a collection of simple computational elements called amoebots that interact locally to collectively achieve tasks of coordination and movement.
Joshua J. Daymude +2 more
semanticscholar +1 more source
An analysis of concurrency control protocols for in-memory databases with CCBench
Proceedings of the VLDB Endowment, 2020This paper presents yet another concurrency control analysis platform, CCBench. CCBench supports seven protocols (Silo, TicToc, MOCC, Cicada, SI, SI with latch-free SSN, 2PL) and seven versatile optimization methods and enables the configuration of seven
Takayuki Tanabe +3 more
semanticscholar +1 more source
Improving Optimistic Concurrency Control Through Transaction Batching and Operation Reordering
Proceedings of the VLDB Endowment, 2018OLTP systems can often improve throughput by batching transactions and processing them as a group. Batching has been used for optimizations such as message packing and group commits; however, there is little research on the benefits of a holistic ...
B. Ding, Lucja Kot, J. Gehrke
semanticscholar +1 more source
The Computer Journal, 2001
Summary: Serializability as an isolation criterion, though well suitable for traditional transactions, would overly restrict the concurrency of long lasting activities such as workflows. By using semantic information it is possible to weaken, or give up altogether, the serializability criterion and yet ensure workflow execution correctness. The problem,
openaire +1 more source
Summary: Serializability as an isolation criterion, though well suitable for traditional transactions, would overly restrict the concurrency of long lasting activities such as workflows. By using semantic information it is possible to weaken, or give up altogether, the serializability criterion and yet ensure workflow execution correctness. The problem,
openaire +1 more source
Concurrency Control by Locking
SIAM Journal on Computing, 1983We present a geometric method for studying concurrency control by locking. When there are only two transactions, our method yields an exact characterization of safe locking policies and also of deadlock-free locking policies. Our results can be extended to more than two transactions, but in that case the problem becomes NP-complete.
openaire +1 more source