552 search results - page 10 / 111 » Efficient Algorithms for Processing XPath Queries |
98
Voted
ICDE
2002
IEEE
15 years 2 months ago
2002
IEEE
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
154
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
Tree patterns represent important fragments of XPath. In this paper, we show that some classes of tree patterns exhibit such a property that, given a finite number of tree patter...
79
Voted
WISE
2006
Springer
15 years 3 months ago
2006
Springer
Maintaining a semantic cache of materialized XPath views inside or outside the database, is a novel, feasible and efficient approach to accelerate XML query processing. However, th...
164
click to vote
ICDE
2008
IEEE
15 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...