SIGN IN
SIGN UP
Safe locking policies for dynamic databases
Full Text:
PDF
Buy this Article
Authors:
Vinay K. Chaudhri
Department of Computer Science, University of Toronto, Toronto, Ontario M5S 1A4
Vassos Hadzilacos
Department of Computer Science, University of Toronto, Toronto, Ontario M5S 1A4
Published in:
· Proceeding
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Pages 233-244
ACM
New York, NY
, USA
©1995
table of contents
ISBN:0-89791-730-8
doi>
10.1145/212433.212464
1995 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 13
· Downloads (cumulative): 224
· Citation Count: 5
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
concurrency
concurrency control
correctness issues
deadlock avoidance
graph algorithms
theory
transaction processing
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder