1018 search results - page 114 / 204 » On the minimization of XPath queries |
117
click to vote
SIGMOD
1993
ACM
15 years 5 months ago
1993
ACM
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
128
click to vote
CIKM
2007
Springer
15 years 5 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
123
click to vote
SIGMOD
2009
ACM
15 years 8 months ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
110
click to vote
CIKM
2010
Springer
15 years 7 days ago
2010
Springer
Most database systems allow query processing over attributes that are derived at query runtime (e.g., user-defined functions and remote data calls to web services), making them e...
183
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...