Journal of Computer and System Sciences
Attribute grammars: definitions, systems and bibliography
Attribute grammars: definitions, systems and bibliography
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
Expressiveness of structured document query languages based on attribute grammars
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
One-unambiguous regular languages
Information and Computation
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
WWW '99 Proceedings of the eighth international conference on World Wide Web
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
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
Handbook of Formal Languages
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
Mind Your Grammar: a New Approach to Modelling Text
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
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
Query Primitives for Tree-Structured Data
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
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
Logic as a Query Language: From Frege to XML
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On the complexity of regular-grammars with integer attributes
Journal of Computer and System Sciences
Attribute grammar for XML integrity constraint validation
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Consistency of XML specifications
Inconsistency Tolerance
Selectively storing XML data in relations
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Complexity of pebble tree-walking automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Computer Standards & Interfaces
Transactions on Large-Scale Data- and Knowledge-Centered Systems VI
| Hi-index | 0.00 |
Document specification languages like 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 two key properties of standard attribute grammars carry over to extended AGs: efficiency of evaluation and decidability of well-definedness. We further characterize the expressiveness of extended AGs in terms of monadic second-order logic and establish the complexity of their non-emptiness and equivalence problem 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.