Composition and evaluation of attribute coupled grammars
Acta Informatica
Invited talk: automata theory for database theoreticians
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Retrieval from hierarchical texts by partial patterns
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
A Grammar-Based Approach Towards Unifying Hierarchical Data Models
SIAM Journal on Computing
Complexity results for two-way and multi-pebble automata and their logics
ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
Handbook of formal languages, vol. 3
Languages, automata, and logic
Handbook of formal languages, vol. 3
One-unambiguous regular languages
Information and Computation
Algebras for querying text regions: expressive power and optimization
Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Information Systems - Special issue on semistructured data
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
Domains of partial attributed tree transducers
Information Processing Letters
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
Journal of Computer and System Sciences
The intrinsically exponential complexity of the circularity problem for attribute grammars
Communications of the ACM
Integrating contents and structure in text retrieval
ACM SIGMOD Record
Normal form algorithms for extended context-free grammars
Theoretical Computer Science
Expressiveness of structured document query languages based on attribute grammars
Journal of the ACM (JACM)
Monadic datalog and the expressive power of languages for web information extraction
Proceedings of the twenty-first 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
On the power of walking for querying tree-structured data
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Modern Information Retrieval
Query automata over finite trees
Theoretical Computer Science
On Implementing Structured Document Query Facilities on Top of a DOOD
DOOD '97 Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases
Schemas for Integration and Translation of Structured and Semi-structured Data
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Monadic Second Order Logic and Node Relations on Graphs and Trees
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
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
Query Primitives for Tree-Structured Data
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Structured Document Transformations Based on XSL
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
A logical view of structured files
The VLDB Journal — The International Journal on Very Large Data Bases
Ambiguity in Graphs and Expressions
IEEE Transactions on Computers
Journal of Computer and System Sciences
Online evaluation of regular tree queries
Nordic Journal of Computing
Journal of Functional Programming
Optimizing the Region Algebra is PSPACE-complete
Information Processing Letters
Engineering web services with attribute grammars: a case study
ACM SIGSOFT Software Engineering Notes
On the complexity of regular-grammars with integer attributes
Journal of Computer and System Sciences
The complexity of text-preserving XML transformations
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deciding twig-definability of node selecting tree automata
Proceedings of the 15th International Conference on Database Theory
Computer Standards & Interfaces
| Hi-index | 0.00 |
Document specification languages, like for instance XML, model documents using extended context-free grammars. These differ from standard context-free grammars in that they allow arbitrary regular expressions on the right-hand side of productions. To query such documents, we introduce a new form of attribute grammars (extended AGs) that work directly over extended context-free grammars rather than over standard context-free grammars. Viewed as a query language, extended AGs are particularly relevant as they can take into account the inherent order of the children of a node in a document. We show that non-circularity remains decidable in EXPTIME and establish the complexity of the non-emptiness and equivalence problem of extended AGs to be complete for EXPTIME. As an application we show that the Region Algebra expressions can be efficiently translated into extended AGs. This translation drastically improves the known upper bound on the complexity of the emptiness and equivalence test for Region Algebra expressions from non-elementary to EXPTIME. Finally, we characterize the expressiveness of extended AGs in terms of monadic second-order logic.