311 search results - page 11 / 63 » Approximate XML joins |
PODS
1999
ACM
15 years 4 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
202
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
ICDE
2010
IEEE
15 years 11 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...
180
click to vote
SYRCODIS
2008
15 years 1 months ago
2008
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
128
click to vote
DEXA
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Finding all occurrences of a twig pattern in an XML document is a core operation for XML query processing. The emergence of XML as a common mark-up language for data inte...