Results 151 to 160 of about 14,769 (187)
Some of the next articles are maybe not open access.
A serializability violation detector for shared-memory server programs
ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2005We aim to improve reliability of multithreaded programs by proposing a dynamic detector that detects potentially erroneous program executions and their causes.
Min Xu, Rastislav Bodík, M. Hill
semanticscholar +1 more source
International Journal of Foundations of Computer Science, 1994
Cai and Furst introduced the notion of bottleneck Turing machines. Based on Barrington’s innovating technique, which is used to showed that polynomial-size branching programs have exactly the same power as NC1, Cai and Furst showed that the languages recognized by width-5 bottleneck Turing machines are exactly the same as those in PSPACE.
openaire +2 more sources
Cai and Furst introduced the notion of bottleneck Turing machines. Based on Barrington’s innovating technique, which is used to showed that polynomial-size branching programs have exactly the same power as NC1, Cai and Furst showed that the languages recognized by width-5 bottleneck Turing machines are exactly the same as those in PSPACE.
openaire +2 more sources
On serializability of multidatabase transactions through forced local conflicts
[1991] Proceedings. Seventh International Conference on Data Engineering, 1991A multidatabase transaction management mechanism called the optimistic ticket method (OTM) is introduced for enforcing global serializability. It permits the commitment of multidatabase transactions only if their relative serialization order is the same ...
Dimitrios Georgakopoulos +2 more
semanticscholar +1 more source
2PC Agent method: achieving serializability in presence of failures in a heterogeneous multidatabase
International Conference on Databases, Parallel Architectures, and Their Applications, 1990A method for integrated concurrency control and recovery, applicable to heterogeneous multidatabase systems, is proposed. The responsibility for two-phase local commitment and recovery of the prepared state at participants is taken over by an entity ...
A. Wolski, J. Veijalainen
semanticscholar +1 more source
Using Tickets to Enforce the Serializability of Multidatabase Transactions
IEEE Transactions on Knowledge and Data Engineering, 1994To enforce global serializability in a multidatabase environment the multidatabase transaction manager must take into account the indirect (transitive) conflicts between multidatabase transactions caused by local transactions.
Dimitrios Georgakopoulos +2 more
semanticscholar +1 more source
Relaxed-currency serializability for middle-tier caching and replication
SIGMOD Conference, 2006Many applications, such as e-commerce, routinely use copies of data that are not in sync with the database due to heuristic caching strategies used to enhance performance.
P. Bernstein +4 more
semanticscholar +1 more source
Strict serializability is harmless: a new architecture for enterprise applications
OOPSLA Companion, 2011Despite many evolutions in the software architecture of enterprise applications, one thing has remained the same over the years: They still use a relational database both for data persistence and transactional support.
S. Fernandes, João P. Cachopo
semanticscholar +1 more source
Maintaining quasi serializability in multidatabase systems
[1991] Proceedings. Seventh International Conference on Data Engineering, 1991A scheduler producing quasi-serializable executions for concurrency control in multidatabase systems (MDBSs) is presented. An algorithm is proposed which ensures quasi-serializability by controlling submissions of global transactions.
W. Du, A. Elmagarmid, Won Kim
semanticscholar +1 more source
Serializability by commitment ordering
Information Processing Letters, 1994Abstract A new serializability concept, Commitment Ordering (CO), allows to effectively achieve global serializability across multiple autonomous Database Systems, that may use different (any) concurrency control mechanisms. CO generalizes the popular Strong-Strict Two Phase Locking (S-S2PL) concept.
openaire +2 more sources
Performance characteristics of epsilon serializability with hierarchical inconsistency bounds
Proceedings of IEEE 9th International Conference on Data Engineering, 1993The notion of hierarchical inconsistency bounds that allows inconsistency to be specified at different granularities-with transactions being at the top of the hierarchy, objects at the bottom, and groups in between-is introduced. The mechanisms needed to
M. Kamath, K. Ramamritham
semanticscholar +1 more source