Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Processing XML Streams with Deterministic Automata
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Locating Matches of Tree Patterns in Forests
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On the power of tree-walking automata
Information and Computation - Special issue: ICC '99
Stream processing of XPath queries with predicates
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Tree-walking automata do not recognize all regular languages
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Lower bounds for sorting with few random accesses to external memory
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An Efficient XPath Query Processor for XML Streams
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
A transducer-based XML query processor
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Congruences for visibly pushdown languages
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Which XML schemas admit 1-pass preorder typing?
ICDT'05 Proceedings of the 10th international conference on Database Theory
Minimization, learning, and conformance testing of boolean programs
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewriting of visibly pushdown languages for xml data integration
Proceedings of the 17th ACM conference on Information and knowledge management
Information Processing Letters
Reasoning about XML with Temporal Logics and Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Validation of streaming XML documents with abstract state machines
Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services
Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
Efficient and expressive tree filters
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Visibly pushdown transducers for approximate validation of streaming XML
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Earliest query answering for deterministic nested word automata
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
XEvolve: an XML schema evolution framework
Proceedings of the 2011 ACM Symposium on Applied Computing
Evolving schemas for streaming XML
Theoretical Computer Science
Streamable fragments of forward XPath
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Evolving schemas for streaming XML
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Visibly pushdown transducers with look-ahead
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
On model checking for visibly pushdown automata
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Minimizing variants of visibly pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Which DTDs are streaming bounded repairable?
Proceedings of the 16th International Conference on Database Theory
Hi-index | 0.00 |
We propose the study of visibly pushdown automata (VPA) for processing XML documents. VPAs are pushdown automata where the input determines the stack operation, and XML documents are naturally visibly pushdown with the VPA pushing onto the stack on open-tags and popping the stack on close-tags. In this paper we demonstrate the power and ease visibly pushdown automata give in the design of streaming algorithms for XML documents. We study the problems of type-checking streaming XML documents against SDTD schemas, and the problem of typing tags in a streaming XML document according to an SDTD schema. For the latter problem, we consider both pre-order typing and post-order typing of a document, which dynamically determines types at open-tags and close-tags respectively as soon as they are met. We also generalize the problems of pre-order and post-order typing to prefix querying. We show that a deterministic VPA yields an algorithm to the problem of answering in one pass the set of all answers to any query that has the property that a node satisfying the query is determined solely by the prefix leading to the node. All the streaming algorithms we develop in this paper are based on the construction of deterministic VPAs, and hence, for any fixed problem, the algorithms process each element of the input in constant time, and use space (d), where d is the depth of the document.