Sciweavers

2217 search results - page 239 / 444
» Rank-aware Query Optimization
Sort
View
COCO
2004
Springer
93views Algorithms» more  COCO 2004»
15 years 12 months ago
Lower Bounds for Testing Bipartiteness in Dense Graphs
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
Andrej Bogdanov, Luca Trevisan
PVLDB
2008
98views more  PVLDB 2008»
15 years 6 months ago
Performance profiling with EndoScope, an acquisitional software monitoring framework
We propose EndoScope, a software monitoring framework that allows users to pose declarative queries that monitor the state and performance of running programs. Unlike most existin...
Alvin Cheung, Samuel Madden
SIGIR
2011
ACM
14 years 9 months ago
A boosting approach to improving pseudo-relevance feedback
Pseudo-relevance feedback has proven effective for improving the average retrieval performance. Unfortunately, many experiments have shown that although pseudo-relevance feedback...
Yuanhua Lv, ChengXiang Zhai, Wan Chen
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
15 years 10 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
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...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
FUIN
2006
139views more  FUIN 2006»
15 years 6 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale