On the degree of ambuguity of finite automata
Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
On the finite degree of ambiguity of finite tree automata
Acta Informatica
Single-valuedness of tree transducers is decidable in polynomial time
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Haskell overloading is DEXPTIME-complete
Information Processing Letters
Equivalence of finite-valued tree transducers is decidable
Mathematical Systems Theory
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
Tree Extension Algebras: Logics, Automata, and Query Languages
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Deciding Equivalence of Finite Tree Automata
STACS '89 Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science
Locating Matches of Tree Patterns in Forests
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Query Evaluation on Compressed Trees (Extended Abstract)
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
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
The VLDB Journal — The International Journal on Very Large Data Bases
Buffering in query evaluation over XML streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
An Efficient XPath Query Processor for XML Streams
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
On the memory requirements of XPath evaluation over XML streams
Journal of Computer and System Sciences
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
On the minimization of XML Schemas and tree automata for unranked trees
Journal of Computer and System Sciences
Efficient algorithms for evaluating xpath over streams
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SPEX: Streamed and Progressive Evaluation of XPath
IEEE Transactions on Knowledge and Data Engineering
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Online evaluation of regular tree queries
Nordic Journal of Computing
Stream firewalling of xml constraints
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On the Decidability of Bounded Valuedness for Transducers
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
General Algorithms for Testing the Ambiguity of Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Evaluating partial tree-pattern queries on XML streams
Proceedings of the 17th ACM conference on Information and knowledge management
Information Processing Letters
Adding nesting structure to words
Journal of the ACM (JACM)
Bounded Delay and Concurrency for Earliest Query Answering
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
XPath evaluation in linear time with polynomial combined complexity
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Worst-case optimal algorithm for XPath evaluation over XML streams
Journal of Computer and System Sciences
Efficient inclusion checking for deterministic tree automata and XML Schemas
Information and Computation
Efficient and expressive tree filters
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Earliest query answering for deterministic nested word automata
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Properties of visibly pushdown transducers
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
N-ary queries by tree automata
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Visibly pushdown transducers with look-ahead
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Early nested word automata for XPath query answering on XML streams
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
High-performance complex event processing over hierarchical data
ACM Transactions on Database Systems (TODS) - Invited papers issue
From Two-Way to One-Way Finite State Transducers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query are two measures for the degree of their streamability. They count the maximal number of stream elements during the life time for some query answer, and respectively, the maximal number of simultaneously alive answer candidates of a query. We study queries defined by deterministic nested word automata, which subsume large streamable fragments of XPath subject to schema restrictions by DTDs modulo P-time translations. We show that bounded and k-bounded delay and concurrency of such automata-defined queries are all decidable in polynomial time in the size of the automaton. Our results are obtained by P-time reduction to the bounded valuedness problem for recognizable relations between unranked trees, a problem that we show to be decidable in P-time.