|
Semistructured databases require tailor-made concurrency control
mechanisms since traditional solutions for the relational model
have been shown to be inadequate. Such mechanisms need to take
full advantage of the hierarchical structure of semistructured
data, for instance allowing concurrent updates of subtrees of, or even
individual elements in XML documents. In earlier work, we
presented two equivalent path locking schemes and two schedulers which guarantee serializability of schedules on
XML documents. However, these methods are dependent on the instance
of the XML database. In this paper we take a more
general, higher level approach by characterizing and deciding equivalence of
schedules without looking at the instance.
|