2223 search results - page 123 / 445 » Query Optimization in an OODBMS |
176
Voted
SIGIR
2011
ACM
14 years 6 months ago
2011
ACM
Pseudo-relevance feedback has proven effective for improving the average retrieval performance. Unfortunately, many experiments have shown that although pseudo-relevance feedback...
140
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
209
Voted
SIGMOD
2007
ACM
16 years 3 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...
126
Voted
SIGMOD
1996
ACM
15 years 7 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
249
Voted
ICDE
2003
IEEE
16 years 5 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...