The Optimal Locking Problem in a Directed Acyclic Graph,
STANFORD UNIV CA DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
We assume a multiple granularity database locking scheme similar to that of Gray, et al. in which a rooted directed acyclic graph is used to represent the levels of granularity. We prove that even if it is known in advance exactly what database references the transaction will make, it is NP-complete to find the optimal locking strategy for the transaction.
- Computer Programming and Software