An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems

摘要

Various notions are introduced for the closure of a set of rectilinearly oriented rectangles on the plane. Optimal algorithms are presented for computing the closures. These algorithms imply optimal solutions to several problems related to database concurrency control.