On the complexity of concurrency control using semantic information

Acta Inf., pp. 271-284, 1995.

Cited by: 5|Bibtex|Views1|DOI:https://doi.org/10.1007/s002360050015
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com|link.springer.com

Abstract:

In the presence of semantic information, serializability is too strong a correctness criterion and unnecessarily restricts concurrency. Many researchers have investigated the use of semantic information to allow interleaving among transactions which are non-serializable, but which nonetheless preserves the consistency of the database and ...More

Code:

Data:

Your rating :
0

 

Tags
Comments