Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...