Filters








796 Hits in 6.5 sec

Safe Serializable Secure Scheduling

Isaac Sheff, Tom Magrino, Jed Liu, Andrew C. Myers, Robbert van Renesse
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
We explore secure scheduling of atomic, serializable transactions in a federated setting.  ...  However, the coordination mechanisms needed for transactions can both leak confidential information and allow unauthorized influence.  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their suggestions.  ... 
doi:10.1145/2976749.2978415 dblp:conf/ccs/SheffMLMR16 fatcat:wxn2yzu3eremzddrt25lgzokze

Strict serializability is harmless

Sérgio Miguel Fernandes, João Cachopo
2011 Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion - SPLASH '11  
We propose a new architecture for enterprise applications that uses a Software Transactional Memory for transactional support at the application server tier, thereby shifting the responsibility of transaction  ...  Thus, we claim that strict serializability is harmless, in the sense that programmers no longer have to trade correctness for performance for a significant class of applications.  ...  and of the FénixEDU system.  ... 
doi:10.1145/2048147.2048221 dblp:conf/oopsla/FernandesC11 fatcat:psuux5nqyjg65mbnxklwrsfs3i

Safe Serializable Secure Scheduling: Transactions and the Trade-off Between Security and Consistency [article]

Isaac Sheff, Tom Magrino, Jed Liu, Andrew C. Myers, Robbert van Renesse
2016 arXiv   pre-print
We explore secure scheduling of atomic, serializable transactions in a federated setting.  ...  However, the coordination mechanisms needed for transactions can both leak confidential information and allow unauthorized influence.  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their suggestions.  ... 
arXiv:1608.04841v2 fatcat:jdsklceamvhktg6cbyjp7ytb44

Cache Serializability: Reducing Inconsistency in Edge Transactions

Ittay Eyal, Ken Birman, Robbert van Renesse
2015 2015 IEEE 35th International Conference on Distributed Computing Systems  
We define cache-serializability, a variant of serializability that is suitable for incoherent caches, and prove that with unbounded resources T-Cache implements this new specification.  ...  With workloads based on the real-world topologies, T-Cache detects 43-70% of the inconsistencies and increases the rate of consistent transactions by 33-58%.  ...  Acknowledgement: The authors thank Dmitri Perelman for a conversation that inspired this work.  ... 
doi:10.1109/icdcs.2015.75 dblp:conf/icdcs/EyalBR15 fatcat:hutiesbnsbd3zmcbfsj7usqrm4

A Scalable Framework for Serializable XQuery [chapter]

Sebastian Bächle, Theo Härder
2010 Communications in Computer and Information Science  
This paper focuses on an aspect that is widely neglected in native XML database management systems: support for concurrent transactional access.  ...  We analyze the isolation requirements of the XQuery Update language and disclose typical sources of anomalies of various query processing strategies.  ...  A major difference between relational tuples and nodes in an XML tree is the amount of information that each data atom represents.  ... 
doi:10.1007/978-3-642-14306-9_68 fatcat:3sf3bnjagzcbzeuk6v2yilx2au

A Top-Down Approach for Two Level Serializability

Mourad Ouzzani, M. A. Atroun, N. L. Belkhodja
1994 Very Large Data Bases Conference  
In this paper, we present a protocol that guarantees the two level serializability criterion and built up according to the topdown approach.  ...  Concurrency control has received considerable attention in multidatabase systems because of their characteristics such as heterogeneity and autonomy.  ...  order 0. order relative to only global transactions.  ... 
dblp:conf/vldb/OuzzaniAB94 fatcat:qqqgeins3rgg7orkbv5c6vfhga

Regular Sequential Serializability and Regular Sequential Consistency [article]

Jeffrey Helt, Matthew Burke, Amit Levy, Wyatt Lloyd
2021 arXiv   pre-print
Strictly serializable (linearizable) services appear to execute transactions (operations) sequentially, in an order consistent with real time.  ...  They are just as strong for applications: we prove any application invariant that holds when using a strictly serializable (linearizable) service also holds when using an RSS (RSC) service.  ...  We are also grateful to Khiem Ngo for his comments on an earlier version of this paper. This work was supported by the National Science Foundation under grant CNS-1824130.  ... 
arXiv:2109.08930v2 fatcat:s7kgrqqrn5h2jpopmebcnujjfu

Ensuring consistency in multidatabases by preserving two-level serializability

Sharad Mehrotra, Rajeev Rastogi, Henry F. Korth, Abraham Silberschatz
1998 ACM Transactions on Database Systems  
Our approach exploits the structure of the integrity constraints and the nature of transaction programs to ensure consistency without requiring executions to be serializable.  ...  In this paper, we i n troduce a systematic approach to relaxing the serializability requirement in MDBS environments.  ...  As mentioned previously, since the MDBS software is unaware of the local transactions execution, schemes that ensure serializability allow a l o w degree of concurrency.  ... 
doi:10.1145/292481.277629 fatcat:umfls57jejcephizeq554za5fy

Serializability for eventual consistency: criterion, analysis, and applications

Lucas Brutschy, Dimitar Dimitrov, Peter Müller, Martin Vechev
2017 Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017  
Serializability formalizes transaction atomicity: one can assume that all transactions appear as indivisible units of execution.  ...  For now, suppose that each operation such as setIfEmpty runs atomically in its own transaction (our results extend to transactions with multiple operations).  ... 
doi:10.1145/3009837.3009895 fatcat:ozivsyv7hja4rm6xkek46e7pfi

Relaxed-currency serializability for middle-tier caching and replication

Philip A. Bernstein, Alan Fekete, Hongfei Guo, Raghu Ramakrishnan, Pradeep Tamma
2006 Proceedings of the 2006 ACM SIGMOD international conference on Management of data - SIGMOD '06  
We study concurrency control for a transactional model that allows update transactions to read out-of-date copies.  ...  We outline a serializability-theoretic correctness proof and present the results of a detailed performance study.  ...  Our main contributions are: • An extended serializability model called Relaxed Currency (or RC-) Serializability that accounts for out-of-date reads that are justified by user-specified freshness constraints  ... 
doi:10.1145/1142473.1142540 dblp:conf/sigmod/BernsteinFGRT06 fatcat:azwmlwu6yzdt7a5bowerkg6pse

SCORe: A Scalable One-Copy Serializable Partial Replication Protocol [chapter]

Sebastiano Peluso, Paolo Romano, Francesco Quaglia
2012 Lecture Notes in Computer Science  
Differently from any other literature proposal, SCORe jointly guarantees the following properties: (i) it is genuine, thus ensuring that only the replicas that maintain data accessed by a transaction are  ...  involved in its processing, and (ii) it guarantees that read operations always access consistent snapshots, thanks to a one-copy serializable multiversion scheme, which never aborts read-only transactions  ...  A common design approach for these data platforms consists in the adoption of relaxed data-consistency models, such as eventual consistency [1] and non-serializable isolation levels [2] , or restricted  ... 
doi:10.1007/978-3-642-35170-9_23 fatcat:6qz7kjkhbbahjducugb3fjd4su

The Serializability of Network Codes [chapter]

Anna Blasiak, Robert Kleinberg
2010 Lecture Notes in Computer Science  
Sometimes the system of coding functions is serializable -meaning that the cyclic dependencies (if any) can be "unraveled" by a protocol in which a vertex sends a few bits of its outgoing messages, waits  ...  How can we decide whether a given system of coding functions is serializable? When it is not serializable, how much extra information must be transmitted in order to permit a serialization?  ...  An algebraic approach to network coding. IEEE/ACM Transactions on Networking, 11(5):782-795, 2003. [8] Gerhard Kramer and Serap Savari. Edge-cut bounds on network coding rates.  ... 
doi:10.1007/978-3-642-14162-1_9 fatcat:kichwiv5zjhlffhoxz7ae2wry4

Using tickets to enforce the serializability of multidatabase transactions

D. Georgakopoulos, M. Rusinkiewicz, A.P. Sheth
1994 IEEE Transactions on Knowledge and Data Engineering  
Based on this approach, we i n troduce optimistic and conservative m ultidatabase transaction management methods that require the local database systems to assure only local serializability.  ...  The proposed methods do not violate the autonomy of the local database systems and guarantee global serializability b y p r e v enting multidatabase transactions from being serialized in di erent w ays  ...  We thank Yuri Breitbart for pointing out an error in one of our de nitions in an earlier version of this paper.  ... 
doi:10.1109/69.273035 fatcat:np4xyjuqh5abjpoel7h7ded2m4

A serializability violation detector for shared-memory server programs

Min Xu, Rastislav Bodík, Mark D. Hill
2005 Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation - PLDI '05  
First, to detect only erroneous executions, SVD checks serializability of atomic regions, which are code regions that need to be executed atomically.  ...  Second, to improve usability, SVD does not require a priori annotations of atomic regions; instead, SVD approximates them using a heuristic.  ...  an earlier version of the paper.  ... 
doi:10.1145/1065010.1065013 dblp:conf/pldi/XuBH05 fatcat:q26l2vhqqndjjhhzgdrpt2iplm

A serializability violation detector for shared-memory server programs

Min Xu, Rastislav Bodík, Mark D. Hill
2005 SIGPLAN notices  
First, to detect only erroneous executions, SVD checks serializability of atomic regions, which are code regions that need to be executed atomically.  ...  Second, to improve usability, SVD does not require a priori annotations of atomic regions; instead, SVD approximates them using a heuristic.  ...  an earlier version of the paper.  ... 
doi:10.1145/1064978.1065013 fatcat:p6vx77bbj5bdzbngkn4ibiywwu
« Previous Showing results 1 — 15 out of 796 results