Monadic Queries over Tree-Structured Data
نویسندگان
چکیده
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widespread database query problem in the context of XML. Partly a survey of recent work done by the authors and their group on logical query languages for this problem and their expressiveness, this paper provides a number of new results related to the complexity of such languages over so-called axis relations (such as “child” or “descendant”) which are motivated by their presence in the XPath standard or by their utility for data extraction (wrapping).
منابع مشابه
A note on monadic datalog on unranked trees
In the article Recursive queries on trees and data trees (ICDT’13), Abiteboul et al. asked whether the containment problem for monadic datalog over unordered unranked labeled trees using the child relation and the descendant relation is decidable. This note gives a positive answer to this question, as well as an overview of the relative expressive power of monadic datalog on various representat...
متن کاملارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملValue Joins are Expensive over ( Probabilistic ) XML . Extended Version
We address the cost of adding value joins to tree-pattern queries and monadic second-order queries over trees in terms of the tractability of query evaluation over two data models: XML and probabilistic XML. Our results show that the data complexity rises from linear, for joinfree queries, to intractable, for queries with value joins, while combined complexity remains essentially the same. For ...
متن کاملKRDB Research Centre Technical Report : Value Joins are Expensive over ( Probabilistic ) XML . Extended
We address the cost of adding value joins to tree-pattern queries and monadic second-order queries over trees in terms of the tractability of query evaluation over two data models: XML and probabilistic XML. Our results show that the data complexity rises from linear, for joinfree queries, to intractable, for queries with value joins, while combined complexity remains essentially the same. For ...
متن کاملInteractive Learning of Node Selecting Tree Transducers⋆
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. We propose to represent monadic queries by bottom-up deterministic Node Selecting Tree Transducers (Nstts), a particular class of tree au-tomata that we introduce. We prove that deterministic Nstts capture the class o...
متن کامل