Instance-Independent View Serializability for Semistructured Databases

Details Instance-Independent View Serializability for Semistructured Databases Instance-Independent View Serializability for Semistructured Databases

2005-05-26

arxiv.org/abs/cs/0505074v1

Computer Science

Databases

Scientific paper

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. We present an approach for concurrency control which is document-independent in the sense that two schedules of semistructured transactions are considered equivalent if they are equivalent on all possible documents. We prove that it is decidable in polynomial time whether two given schedules in this framework are equivalent. This also solves the view serializability for semistructured schedules polynomially in the size of the schedule and exponentially in the number of transactions.

Affiliated with

Also associated with

No associations

Rating

Instance-Independent View Serializability for Semistructured Databases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Instance-Independent View Serializability for Semistructured Databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Instance-Independent View Serializability for Semistructured Databases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-117380