SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
Incremental validation of XML documents
ACM Transactions on Database Systems (TODS)
XJ: facilitating XML processing in Java
WWW '05 Proceedings of the 14th international conference on World Wide Web
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Verification of tree updates for optimization
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Updates and views dependencies in semi-structured databases
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Analysis of imperative XML programs
Information Systems
Schema-based independence analysis for XML updates
Proceedings of the VLDB Endowment
Regular tree patterns: a uniform formalism for update queries and functional dependencies in XML
Proceedings of the 2010 EDBT/ICDT Workshops
Analysis of imperative XML programs
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Destabilizers and independence of XML updates
Proceedings of the VLDB Endowment
Dynamic reasoning on XML updates
Proceedings of the 14th International Conference on Extending Database Technology
Type-based detection of XML query-update independence
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
There has been growing interest in the addition of update operations to languages that operate on XML data, for example, XQuery and XJ. These update operations support efficient and declarative specification of transformations of XML data. The presence of update operations raises the question of detecting data dependencies between reads and updates of XML documents. The ability to optimize the execution of update operations depends on the ability to detect such conflicts. In this paper, we formalize the notions of updates on XML data and conflicts between update operations. We show that conflict detection is NP-complete when the update operations are specified using XPath expressions that support the use of the child and descendant axis, wildcard symbols, and branching. We also provide efficient polynomial algorithms for update conflict detection when the patterns do not use branching.