Optimal Buffering for Streaming XPath Evaluation
نویسندگان
چکیده
We motivate and present a definition of optimal buffering for streaming evaluation of XPath queries. We consider a large fragment of XPath that includes multiple (correlated) subqueries and reverse (up the document tree) axes. We describe a method for XPath evaluation with optimal buffering. We present the results of an experimental evaluation of our methods based on our implementation, which is freely available.
منابع مشابه
Streaming XPath Subquery Evaluation
We describe a method for the streaming evaluation of XPath queries that have subqueries in predicates. Our method rewrites XPath queries into a set of predicate-free labeled linear-form expressions (LFEs). These LFEs are used to generate a pushdown transducer that enables efficient management of a buffer and hierarchical index at runtime. To the best of our knowledge, our method is the first to...
متن کاملStreaming Validation of Schemata: the Lazy Typing Discipline
Assertions, identity constraints, and conditional type assignments are (planned) features of XML Schema which rely on XPath evaluation to various ends. The allowed XPath subset exploitable in those features is trimmed down for streamability concerns partly understandable (the apparent wish to avoid buffering to determine the evaluation of an expression) and partly artificial. In this paper we d...
متن کاملXML Data Stream Processing: Extensions to YFilter
Running XPath queries on XML data steams is a challenge. Current approaches that store the entire document tree in memory are more suited for static environments. We modify the existing YFilter architecture to support online execution of XPath queries. This is achieved by minimal buffering of the data stream and dynamic pruning of the document tree in memory. These modifications enable us to ef...
متن کاملWorst-case optimal algorithm for XPath evaluation over XML streams
We consider the XPath evaluation problem: Evaluate an XPath query Q on a streaming XML documentD; i.e., determine the setQ(D) of document elements selected byQ. We mainly consider Conjunctive XPath queries that involve only the child and descendant axes. Previously known in-memory algorithms for this problem use O(|D|) space and O(|Q||D|) time. Several previously known algorithms for the stream...
متن کاملQuickXScan: Efficient Streaming XPath Evaluation
Many XML applications over the Internet favor high-performance single-pass streaming XPath evaluation. Finite automata-based algorithms suffer from potentially combinatorial explosion of dynamic states for matching descendant axes. We present QuickXScan for streaming evaluation of XPath queries containing child and descendant axes with complex predicates. Using a tree representation for an XPat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008