Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
XML indices are essential for efficiently processing XML queries which typically have predicates on both structures and values. Since the number of all possible structural and val...
Kanda Runapongsa, Jignesh M. Patel, Rajesh Bordawe...
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set...
Marcus Fontoura, Vanja Josifovski, Eugene J. Sheki...
In a state-of-the-art XML database, an XML query is evaluated as a sequence of structural joins in which positions of data nodes are used to perform each individual structural joi...
This paper presents a framework for automatically generating structural XML documents. The user provides a target DTD and an example of an XML document, called a Generate-XML-ByEx...