Incremental XPath evaluation

Björklund, Henrik; Gelade, Wouter; Marquardt, Marcel; Martens, Wim

doi:10.1145/1514894.1514915

Cited by 13 publications

(7 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In , automata are used to evaluate, on an XML stream, many (very simple) XPath queries in parallel. It is well known that Core XPath can be evaluated using tree automata; see, for example, and . Here, we use alternating tree automata (as in and ).…”

Section: Xpath Queriesmentioning

confidence: 99%

Fast in‐memory XPath search using compressed indexes

et al. 2013

View full text Add to dashboard Cite

Artículo de publicación ISIExtensible Markup Language (XML) documents consist of text data plus structured data (markup). XPath allows to query both text and structure. Evaluating such hybrid queries is challenging. We present a system for in-memory evaluation of XPath search queries, that is, queries with text and structure predicates, yet without advanced features such as backward axes, arithmetics, and joins. We show that for this query fragment, which contains Forward Core XPath, our system, dubbed Succinct XML Self-Index (‘SXSI’), outperforms existing systems by 1–3 orders of magnitude. SXSI is based on state-of-the-art indexes for text and structure data. It combines two novelties. On one hand, it represents the XML data in a compact indexed form, which allows it to handle larger collections in main memory while supporting powerful search and navigation operations over the text and the structure. On the other hand, it features an execution engine that uses tree automata and cleverly chooses evaluation orders that leverage the speeds of the respective indexes. SXSI is modular and allows seamless replacement of its indexes. This is demonstrated through experiments with (1) a text index specialized for search of bio sequences, and (2) a word-based text index specialized for natural language search.Fondecyt, Chile 1-11006

show abstract

Section: Xpath Queriesmentioning

confidence: 99%

Fast in‐memory XPath search using compressed indexes

et al. 2013

View full text Add to dashboard Cite

show abstract

“…In the context of the XML data model, quite recently, [13] studied the problem of incremental view maintenance in its Boolean version and with respect to the XPath language. Boolean incremental view maintenance checks that, after applying the update to the base data, the XPath expression representing the view is still satisfied.…”

Section: Related Workmentioning

confidence: 99%

“…The incremental maintenance of XML materialized views has been considered in previous works [13,16,17,18,19,28,31]. Maintaining XML views over relational databases is studied in [16].…”

Section: Introductionmentioning

confidence: 99%

“…Maintaining XML views over relational databases is studied in [16]. The maintenance of boolean XPath queries is studied in [13]. Views expressed in a richer XPath dialect are considered in [30,31], which focus on node-level updates, that is, they consider updates which add or remove exactly one node to/from the document.…”

Section: Introductionmentioning

confidence: 99%

“…Our view language corresponds to a core useful conjunctive XQuery subset. This language supports the child and descendant axis, value and branch predicates, and moreover allows returning data from more than one node, unlike the XPath dialects studied in [13,30,31]. Our approach is designed to take advantage of advanced artifacts of current XML query processors, such as structural joins and smart identifiers [37].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Algebraic incremental maintenance of XML views

Bonifati

Goodfellow

Manolescu

et al. 2011

Proceedings of the 14th International Conference on Extending Database Technology

View full text Add to dashboard Cite

Materialized views can bring important performance benefits when querying XML documents. In the presence of XML document changes, materialized views need to be updated to faithfully reflect the changed document. In this work, we present an algebraic approach for propagating source updates to XML materialized views expressed in a powerful XML tree pattern formalism. Our approach differs from the state of the art in the area in two important ways. First, it relies on set-oriented, algebraic operations, to be contrasted with node-based previous approaches. Second, it exploits state-ofthe-art features of XML stores and XML query evaluation engines, notably XML structural identifiers and associated structural join algorithms. We present algorithms for determining how updates should be propagated to views, and highlight the benefits of our approach over existing algorithms through a series of experiments.

show abstract

An Algorithm for Incremental Maintenance of Materialized XPath View

Jin

Liao

2010

Web-Age Information Management

View full text Add to dashboard Cite

Incremental XPath evaluation

Cited by 13 publications

References 23 publications

Fast in‐memory XPath search using compressed indexes

Fast in‐memory XPath search using compressed indexes

Algebraic incremental maintenance of XML views

An Algorithm for Incremental Maintenance of Materialized XPath View

Contact Info

Product

Resources

About