126 search results - page 12 / 26 » Lower Bounds for Set Intersection Queries |
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
SOFSEM
2012
Springer
13 years 5 months ago
2012
Springer
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
COLT
2001
Springer
15 years 2 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
PVLDB
2010
14 years 8 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
79
Voted
PODS
2008
ACM
15 years 9 months ago
2008
ACM
Data exchange, also known as data translation, has been extensively investigated in recent years. One main direction of research has focused on the semantics and the complexity of...