Transaction Management for Mobile Objects Using Optimistic Concurrency Control
We present computationally efficient error-correcting codes and holographic proofs. Our error-correcting codes are asymptotically good and can be encoded and decoded in linear time. Our construction of holographic proofs provide, for every proof of any t
Main Author: | Adya, Atul |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149774 |
Similar Items
-
Transaction management for mobile objects using optimistic concurrency control
by: Adya, Atul
Published: (2007) -
Optimistic Concurrency Control for Nested Distributed Transactions
by: Gruber, Robert Edward
Published: (2023) -
Weak Consistency: A Generalized Theory and Optimistic Implementations for Distributed Transactions
by: Adya, Atul
Published: (2023) -
TicToc: Time Traveling Optimistic Concurrency Control
by: Yu, Xiangyao, et al.
Published: (2018) -
Concurrency Control for Resilient Nested Transaction
by: Lynch, Nancy A.
Published: (2023)