In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
We present BLAS , a Bi-LAbeling based System, for efficiently processing complex XPath queries over XML data. BLAS uses Plabeling to process queries involving consecutive child ax...
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Recently, Lu et al. [7] proposed the TJFast algorithm ...
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
In recent years, publish-subscribe (pub-sub) systems based on XML document filtering have received much attention. In a typical pubsub system, subscribed users specify their inte...