25 search results - page 1 / 5 » Structural Joins: A Primitive for Efficient XML Query Patter... |
ICDE
2002
IEEE
14 years 5 months ago
2002
IEEE
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
ADC
2008
Springer
13 years 6 months ago
2008
Springer
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...
ICDE
2003
IEEE
14 years 5 months ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
WWW
2005
ACM
14 years 5 months ago
2005
ACM
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 ...