Supporting efficient access to XML data using XPath [3] continues to be an important research problem [6, 12]. XPath queries are used to specify nodelabeled trees which match portions of the hierarchical XML data. In XPath query evaluation, indices similar to those used in relational database systems - namely, value indices on tags and text values - are first used, together with structural join algorithms [1, 2, 19]. This approach turns out to be simple and efficient. However, the structural containment relationships native to XML data are not directly captured by value indices
This paper presents the advantages of combining multiple document representation schemes for query p...
XML document markup is highly repetitive and therefore well com-pressible using dictionary-based met...
This article is a proposal for a database index structure, the XPath accelerator, that has been spec...
Supporting efficient access to XML data using XPath [3] continues to be an important research proble...
We introduce a new methodology for coupling language-induced partitions and in-dex-induced partition...
Recent studies have proposed structural summary techniques for pathquery evaluation on semi-structur...
XML (Extensible Mark-up Language) has been recently understood as a new approach to data modelling. ...
XML queries differ from relational queries in that the former are expressed as path expressions. The...
XML data consists of a very flexible tree-structure which makes it difficult to support the storing ...
Queries on XML documents typically combine selections on element contents, and, via path expressions...
A number of indexing techniques have been proposed in recent times for optimizing the queries on XML...
XML documents are typically queried with a combination of value search and structure search. While q...
This work is a proposal for a database index structure that has been specifically designed to suppor...
Queries on XML documents typically combine selections on element contents, and, via path expressio...
textabstractThis paper presents the advantages of combining multiple document representation schemes...
This paper presents the advantages of combining multiple document representation schemes for query p...
XML document markup is highly repetitive and therefore well com-pressible using dictionary-based met...
This article is a proposal for a database index structure, the XPath accelerator, that has been spec...
Supporting efficient access to XML data using XPath [3] continues to be an important research proble...
We introduce a new methodology for coupling language-induced partitions and in-dex-induced partition...
Recent studies have proposed structural summary techniques for pathquery evaluation on semi-structur...
XML (Extensible Mark-up Language) has been recently understood as a new approach to data modelling. ...
XML queries differ from relational queries in that the former are expressed as path expressions. The...
XML data consists of a very flexible tree-structure which makes it difficult to support the storing ...
Queries on XML documents typically combine selections on element contents, and, via path expressions...
A number of indexing techniques have been proposed in recent times for optimizing the queries on XML...
XML documents are typically queried with a combination of value search and structure search. While q...
This work is a proposal for a database index structure that has been specifically designed to suppor...
Queries on XML documents typically combine selections on element contents, and, via path expressio...
textabstractThis paper presents the advantages of combining multiple document representation schemes...
This paper presents the advantages of combining multiple document representation schemes for query p...
XML document markup is highly repetitive and therefore well com-pressible using dictionary-based met...
This article is a proposal for a database index structure, the XPath accelerator, that has been spec...