半结构化数据库中与实例无关的视图可串行性
Instance-Independent View Serializability for Semistructured Databases
摘要:
半结构化数据库需要定制的并发控制机制,因为关系模型的传统解决方案已被证明是不够的。这样的机制需要充分利用半结构化数据的层次结构,例如,允许并发更新XML文档的子树,甚至是XML文档中的单个元素。我们提出了一种并发控制的方法,这是文件无关的意义上说,两个时间表的半结构化事务被认为是等同的,如果他们是等价的所有可能的文件。我们证明了它是在多项式时间判定是否两个给定的时间表在这个框架是等价的。这也解决了半结构化计划的视图串行化的多项式在时间表的大小和指数的事务的数量。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。