Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been ...
Hypertext functionalities represent a form of the distilled wisdom of the hypermedia community. Given the peculiar nature of the World Wide Web, it is very difficult to successful...
With the rise of XML, the database community has been challenged by semi-structured data processing. Since the data type behind XML is the tree, state-of-the-art RDBMSs have learn...
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soinine...
Many tasks require users to extract information from diverse sources, to edit or process this information locally, and to explore how the end results are affected by changes in th...