Efficient and Expressive Tree Filters

We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processing, we are interested in algorithms that make one pass over the input, using space that is independent of the data and polynomial in the filter. We deal with a logic equivalent to the XPath language, and also an extension with an Until operator. We introduce restricted sublanguages based on looking only at "reversed" axes, and show that these allow polynomial space streaming implementations. We further show that these fragments are expressively complete. Our results make use of techniques developed for the study of Linear Temporal Logic, applied to XML filtering.

[1]  Michael Benedikt,et al.  XPath satisfiability in the presence of DTDs , 2008, JACM.

[2]  Maarten Marx,et al.  Conditional XPath , 2005, TODS.

[3]  M. Lothaire,et al.  Applied Combinatorics on Words: Algorithms on Words , 2005 .

[4]  Dov M. Gabbay,et al.  EXPRESSIVE FUNCTIONAL COMPLETENESS IN TENSE LOGIC , 1981 .

[5]  Michael J. Franklin,et al.  Efficient Filtering of XML Documents for Selective Dissemination of Information , 2000, VLDB.

[6]  Thomas Eiter,et al.  Database Theory - Icdt 2005 , 2008 .

[7]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[8]  Nicole Schweikardt,et al.  Tight lower bounds for query processing on streaming and external memory data , 2007, Theor. Comput. Sci..

[9]  Stephan Merz,et al.  Model Checking , 2000 .

[10]  Byron Choi,et al.  What are real DTDs like? , 2002, WebDB.

[11]  Rajeev Rastogi,et al.  Efficient filtering of XML documents with XPath expressions , 2002, Proceedings 18th International Conference on Data Engineering.

[12]  Dov M. Gabbay,et al.  The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems , 1987, Temporal Logic in Specification.

[13]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[14]  Dan Olteanu,et al.  SPEX: Streamed and Progressive Evaluation of XPath , 2007, IEEE Transactions on Knowledge and Data Engineering.

[15]  Dan Olteanu,et al.  Forward node-selecting queries over trees , 2007, TODS.

[16]  D. Gabbay.  An Irreflexivity Lemma with Applications to Axiomatizations of Conditions on Tense Frames , 1981 .

[17]  Tobias Nipkow,et al.  FM 2006: Formal Methods, 14th International Symposium on Formal Methods, Hamilton, Canada, August 21-27, 2006, Proceedings , 2006, FM.

[18]  Gabriel M. Kuper,et al.  Structural Properties of XPath Fragments , 2003, ICDT.

[19]  Dan Suciu,et al.  Processing XML Streams with Deterministic Automata , 2003, ICDT.

[20]  Mahesh Viswanathan,et al.  Visibly pushdown automata for streaming XML , 2007, WWW '07.

[21]  Victor Vianu,et al.  Validating streaming XML documents , 2002, PODS.

[22]  Thomas Schwentick,et al.  Which XML Schemas Admit 1-Pass Preorder Typing? , 2005, ICDT.

[23]  M. Lothaire,et al.  Applied Combinatorics on Words , 2005 .

[24]  Amir Pnueli,et al.  PSL Model Checking and Run-Time Verification Via Testers , 2006, FM.

[25]  Maarten Marx,et al.  First Order Paths in Ordered Trees , 2005, ICDT.

[26]  Marcus Fontoura,et al.  On the memory requirements of XPath evaluation over XML streams , 2007, J. Comput. Syst. Sci..

[27]  Maarten Marx,et al.  Conditional XPath, the first order complete XPath dialect , 2004, PODS.

[28]  Sudarshan S. Chawathe,et al.  XPath queries on streaming data , 2003, SIGMOD '03.