Name
Abstract | ||
|---|---|---|
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, however, is that the use of semantic information in c... |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1093/comjnl/44.1.42 | The Computer Journal |
Keywords | Field | DocType |
concurrency control | Timestamp-based concurrency control,Isolation (database systems),Serializability,Concurrency control,Computer science,Multiversion concurrency control,Distributed concurrency control,Non-lock concurrency control,Optimistic concurrency control,Distributed computing | Journal |
Volume | Issue | ISSN |
44 | 1 | 0010-4620 |
Citations | PageRank | References |
4 | 0.53 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juha Puustjärvi | 1 | 111 | 22.64 |