311 search results - page 15 / 63 » Approximate XML joins |
XSYM
2004
Springer
15 years 5 months ago
2004
Springer
Due to their numerous benefits, relational systems play a major role in storing XML documents. XML also benefits relational systems by providing a means to publish legacy relatio...
WAIM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The heterogeneity nature of XML data creates the need for approximate query answering. In this paper, we present an XML system that cooperates with users to provide user-...
SSDBM
2007
IEEE
15 years 6 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
WWW
2005
ACM
16 years 11 days 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 ...
188
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...