Sciweavers

236 search results - page 15 / 48
» Testing Database Transaction Concurrency
Sort
View
ASPLOS
2012
ACM
12 years 5 months ago
Applying transactional memory to concurrency bugs
Multithreaded programs often suffer from synchronization bugs such as atomicity violations and deadlocks. These bugs arise from complicated locking strategies and ad hoc synchroni...
Haris Volos, Andres Jaan Tack, Michael M. Swift, S...
VLDB
2001
ACM
93views Database» more  VLDB 2001»
14 years 2 months ago
Transaction Timestamping in (Temporal) Databases
Many database applications need accountability and trace-ability that necessitate retaining previous database states. For a transaction-time database supporting this, the choice o...
Christian S. Jensen, David B. Lomet
SIGMOD
1997
ACM
159views Database» more  SIGMOD 1997»
14 years 2 months ago
On-Line Warehouse View Maintenance
Data warehouses store materialized views over base data from external sources. Clients typically perform complex read-only queries on the views. The views are refreshed periodical...
Dallan Quass, Jennifer Widom
PODS
1990
ACM
150views Database» more  PODS 1990»
14 years 1 months ago
On Being Optimistic about Real-Time Constraints
- Performancestudiesof concurrencycontrol algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic ...
Jayant R. Haritsa, Michael J. Carey, Miron Livny
VLDB
1989
ACM
44views Database» more  VLDB 1989»
14 years 1 months ago
Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase
In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi se...
Weimin Du, Ahmed K. Elmagarmid