591 search results - page 3 / 119 » The complexity of XPath query evaluation |
WWW
2007
ACM
14 years 9 months ago
2007
ACM
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
Contemporary XPath query engines evaluate queries in time exponential in the sizes of input queries, a fact that has gone unnoticed for a long time. Recently, the first main
EDBT
2009
ACM
14 years 1 months ago
2009
ACM
In this study, we present experiences of parallelizing XPath queries using the Xalan XPath engine on shared-address space multi-core systems. For our evaluation, we consider a sce...
DATESO
2010
13 years 6 months ago
2010
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
ICDT
2009
ACM
14 years 9 months ago
2009
ACM
We study the problem of incrementally maintaining an XPath query on an XML database under updates. The updates we consider are node insertion, node deletion, and node relabeling. ...