Journal of the ACM (JACM)
Decision problems for regular trace languages
14th International Colloquium on Automata, languages and programming
Properties and update semantics of consistent views
ACM Transactions on Database Systems (TODS)
Foundations of canonical update support for closed database views
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Alignment of trees: an alternative to tree edit
Theoretical Computer Science
Update semantics of relational views
ACM Transactions on Database Systems (TODS)
On the correct translation of update operations on relational views
ACM Transactions on Database Systems (TODS)
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
Journal of the ACM (JACM)
Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Testing Equivalence of Morphisms on Context-Free Languages
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
An optimal pre-determinization algorithm for weighted transducers
Theoretical Computer Science - Implementation and application of automata
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Data & Knowledge Engineering - Special issue: ER 2004
PATAXÓ: A framework to allow updates through XML views
ACM Transactions on Database Systems (TODS)
Journal of Computer and System Sciences
Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
Bidirectional interpretation of XQuery
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Reasoning about XML with Temporal Logics and Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Updating recursive XML views of relations
Journal of Computer Science and Technology
CSF '09 Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium
An Automata-Theoretic Approach to Regular XPath
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
The view update problem for XML
Proceedings of the 2010 EDBT/ICDT Workshops
Query rewriting algorithm evaluation for XML security views
SDM'07 Proceedings of the 4th VLDB conference on Secure data management
Properties of visibly pushdown transducers
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Query translation for XPath-based security views
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Consistency and repair for XML write-access control policies
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
We study the problem of update translation for views on XML documents. More precisely, given an XML view definition and a user defined view update program, find a source update program that translates the view update without side effects on the view. Additionally, we require the translation to be defined on all possible source documents; this corresponds to Hegner's notion of uniform translation. The existence of such translation would allow to update XML views without the need of materialization. The class of views we consider can remove parts of the document and rename nodes. Our update programs define the simultaneous application of a collection of atomic update operations among insertion/deletion of a subtree and node renaming. Such update programs are compatible with the XQuery Update Facility (XQUF) snapshot semantics. Both views and update programs are represented by recognizable tree languages. We present as a proof of concept a small fragment of XQUF that can be expressed by our update programs, thus allows for update propagation. Two settings for the update problem are studied: without source constraints, where all source updates are allowed, and with source constraints, where there is a restricted set of authorized source updates. Using tree automata techniques, we establish that without constraints, all view updates are uniformly translatable and the translation is tractable. In presence of constraints, not all view updates are uniformly translatable. However, we introduce a reasonable restriction on update programs for which uniform translation with constraints becomes possible.