From regular expressions to deterministic automata
Theoretical Computer Science
Handbook of formal languages, vol. 3
DSD: A schema language for XML
FMSP '00 Proceedings of the third workshop on Formal methods in software practice
XDuce: A Typed XML Processing Language (Preliminary Report)
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
Locating Matches of Tree Patterns in Forests
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
XDuce: A statically typed XML processing language
ACM Transactions on Internet Technology (TOIT)
Query Evaluation on Compressed Trees (Extended Abstract)
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
CDuce: an XML-centric general-purpose language
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Automata- and logic-based pattern languages for tree-structured data
Proceedings of the 2nd international conference on Semantics in databases
Attribute grammars for scalable query processing on XML streams
The VLDB Journal — The International Journal on Very Large Data Bases
Information Processing Letters
Compact Representation for Answer Sets of n-ary Regular Queries
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Compact representation for answer sets of n-ary regular queries
Theoretical Computer Science
N-ary queries by tree automata
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Web and semantic web query languages: a survey
Proceedings of the First international conference on Reasoning Web
Hi-index | 0.00 |
Motivated by XML applications, we address the problem of answering k-ary queries, i.e. simultaneously locating k nodes of an input tree as specified by a given relation. In particular, we discuss how binary queries can be used as a means of navigation in XML document transformations. We introduce a grammar-based approach to specifying k-ary queries. An efficient tree-automata based implementation of unary queries is reviewed and the extensions needed in order to implement k-ary queries are presented. In particular, an efficient solution for the evaluation of binary queries is provided and proven correct. We introduce fxgrep, a practical implementation of unary and binary queries for XML. By means of fxgrep and of the fxt XML transformation language we suggest how binary queries can be used in order to increase expressivity of rule-based transformations. We compare our work with other querying languages and discuss how our ideas can be used for other existing settings.