116 search results - page 18 / 24 » Measuring the Complexity of Join Enumeration in Query Optimi... |
108
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
83
Voted
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
163
Voted
CLEF
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Recent research has suggested that there is no general similarity measure, which can be applied on arbitrary databases without any parameterization. Hence, the optimal co...
160
click to vote
PVLDB
2008
15 years 2 months ago
2008
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...
128
Voted
CIKM
2007
Springer
15 years 9 months ago
2007
Springer
Queries issued by casual users or specialists exploring a data set often point us to important subsets of the data, be it clusters, outliers or other features of particular import...