Incremental maintenance of path-expression views

Sawires, Arsany; Tatemura, Junichi; Po, Oliver; Agrawal, Divyakant; Candan, K. Selçuk

doi:10.1145/1066157.1066208

Cited by 23 publications

(31 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some recent works have addressed the issue of incremental maintenance of XPath views over trees [37,39]. The maintenance of XQuery views is studied in [24] but without data streams and with data fully residing in memory.…”

Section: Resultsmentioning

confidence: 99%

Efficient maintenance techniques for views over active documents

Abiteboul

Bourhis

Marinoiu

2009

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology

View full text Add to dashboard Cite

Many Web applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems or when monitoring distributed autonomous systems. Our work is in this challenging context that has generated recently a lot of attention; see Web 2.0. We introduce the axlog formal model for capturing such interactions and show how this model can be supported efficiently. The central component is the axlog widget defined by one tree-pattern query or more, over an active document (in the Active XML style) that includes some input streams of updates. A widget generates a stream of updates for each query, the updates that are needed to maintain the view corresponding to the query. We exploit an array of known technologies: datalog optimization techniques such as Differential or MagicSet, constraint query languages, and efficient XML filtering (YFilter). The novel optimization technique we propose is based on fundamental new notions: a relevance (different than that of MagicSet), satisfiability and provenance for active documents. We briefly discuss an implementation of an axlog engine, an application that we used to test the approach, and results of experiments.

show abstract

Section: Resultsmentioning

confidence: 99%

Efficient maintenance techniques for views over active documents

Abiteboul

Bourhis

Marinoiu

2009

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology

View full text Add to dashboard Cite

show abstract

“…There are several practically oriented papers dealing with incremental XPath evaluation [12,14,16,17]. None of these papers give any worst-case complexity bounds.…”

Section: Related Workmentioning

confidence: 99%

Incremental XPath evaluation

Björklund

Gelade

Martens

2010

ACM Trans. Database Syst.

View full text Add to dashboard Cite

We study the problem of incrementally maintaining an XPath query on an XML database under updates. The updates we consider are node insertion, node deletion, and node relabeling. Our main results are that downward XPath queries can be incrementally maintained in time O(depth(D) · poly(Q)) and conjunctive forward XPath queries in time O(depth(D)· log(width(D))·poly(Q)), where D is the size of the database, Q the size of the query, and depth(D) and width(D) are the nesting depth and maximum number of siblings in the database, respectively. The auxiliary data structures for maintenance are linear in D and polynomial in Q in all these cases.

show abstract

“…None of these papers give any worst-case complexity bounds. The papers [12,17] only consider leaf deletion and insertion, and [14] considers deletion and insertion of entire subtrees and can thus, in worst case, not be better than re-evaluation.…”

Section: Related Workmentioning

confidence: 99%