591 search results - page 5 / 119 » The complexity of XPath query evaluation |
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
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...
ICDE
2005
IEEE
14 years 2 months ago
2005
IEEE
¡ Several systems have recently been proposed for the evaluation of XPath expressions. However, none of these systems have demonstrated both scalability with large document sizes ...
SIGMOD
2004
ACM
14 years 9 months ago
2004
ACM
We present BLAS , a Bi-LAbeling based System, for efficiently processing complex XPath queries over XML data. BLAS uses Plabeling to process queries involving consecutive child ax...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
The popularity of XML has motivated the development of novel XML processing tools many of which embed the XPath language for XML querying, transformation, constraint specification...