591 search results - page 18 / 119 » The complexity of XPath query evaluation |
SIGMOD
2002
ACM
14 years 9 months ago
2002
ACM
This work is a proposal for a database index structure that has been specifically designed to support the evaluation of XPath queries. As such, the index is capable to support all...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
LICS
2002
IEEE
14 years 1 months ago
2002
IEEE
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching scheme for XML documents. Our scheme allows sharin...