32 search results - page 4 / 7 » Matching Twigs in Probabilistic XML |
DASFAA
2004
IEEE
14 years 21 days ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
SIGMOD
2002
ACM
14 years 9 months ago
2002
ACM
DEXA
2006
Springer
14 years 19 days ago
2006
Springer
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Recently, Lu et al. [7] proposed the TJFast algorithm ...
WEBDB
2009
Springer
14 years 3 months ago
2009
Springer
The ubiquitous adoption of XML as the standard of data exchange over the web has led to increased interest in building efficient and scalable XML publish-subscribe (pub-sub) syste...
ICDE
2008
IEEE
14 years 10 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...