51 search results - page 2 / 11 » Rewriting and Evaluating Tree Queries with XPath |
VLDB
2004
ACM
13 years 9 months ago
2004
ACM
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
DOCENG
2003
ACM
13 years 9 months ago
2003
ACM
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
SIGMOD
2007
ACM
14 years 4 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
ICDE
2006
IEEE
14 years 5 months ago
2006
IEEE
Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural...
ICDE
2007
IEEE
14 years 5 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...