2217 search results - page 75 / 444 » Rank-aware Query Optimization |
200
Voted
SIGMOD
2007
ACM
16 years 2 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...
236
Voted
ICDE
2003
IEEE
16 years 3 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
142
click to vote
ODBIS
2007
Springer
15 years 8 months ago
2007
Springer
Supporting SPARQL queries over relational databases becomes an active topic recently. However, it has not received enough consideration when SPARQL queries include restrictions on...
119
click to vote
SIGMOD
2001
ACM
16 years 2 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
183
click to vote
SAS
2001
Springer
15 years 7 months ago
2001
Springer
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimiza...