The Complexity of Testing Predicate Locks

From Tetherless World Wiki

Jump to: navigation, search

\begin{bibtex} @inproceedings{DBLP:conf/sigmod/HuntR79, crossref={DBLP:conf/sigmod/79}, title={The Complexity of Testing Predicate Locks}, pages={127-133}, year={1979}, booktitle={SIGMOD Conference}, url={http://www.informatik.uni-trier.de/~ley/db/conf/sigmod/sigmod79.html#HuntR79}, cdrom={SIGMOD79/P127.PDF}, ee={http://doi.acm.org/10.1145/582095.582115}, ee={db/conf/sigmod/HuntR79.html}, author={Harry B. Hunt III and Daniel J. Rosenkrantz} cite={DBLP:journals/tods/AstrahanBCEGGKLMMPTWW76 , DBLP:journals/cacm/Bentley75 , DBLP:conf/stoc/Cook71 , DBLP:conf/vldb/EswaranC75 , DBLP:journals/cacm/EswarranGLT76 , DBLP:journals/acta/FinkelB74 , DBLP:books/aw/Knuth73a , DBLP:books/aw/Knuth73 , DBLP:journals/siamcomp/Rivest76 , DBLP:conf/berkeley/StonebrakerN77 , DBLP:journals/tods/WongE77} }\end{bibtex}

Retrieved from "http://tw.rpi.edu/wiki/The_Complexity_of_Testing_Predicate_Locks"