74 search results - page 1 / 15 » Index Structures for Matching XML Twigs Using Relational Que... |
ICDE
2005
IEEE
13 years 10 months ago
2005
IEEE
Various index structures have been proposed to speed up the evaluation of XML path expressions. However, existing XML path indices suffer from at least one of three limitations: ...
SIGMOD
2005
ACM
14 years 4 months ago
2005
ACM
Searching for all occurrences of a twig pattern in an XML document is an important operation in XML query processing. Recently a holistic method TwigStack [2] has been proposed. T...
CIKM
2005
Springer
13 years 10 months ago
2005
Springer
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...
SOFSEM
2004
Springer
13 years 9 months ago
2004
Springer
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
ICDE
2001
IEEE
14 years 5 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...