Sciweavers

8695 search results - page 1617 / 1739
» Making the Complex Simple
Sort
View
SIGMOD
2007
ACM
121views Database» more  SIGMOD 2007»
16 years 3 months ago
Execution strategies for SQL subqueries
Optimizing SQL subqueries has been an active area in database research and the database industry throughout the last decades. Previous work has already identified some approaches ...
César A. Galindo-Legaria, Milind Joshi, Mos...
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 3 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
PODS
2006
ACM
134views Database» more  PODS 2006»
16 years 3 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 3 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
PODS
2008
ACM
211views Database» more  PODS 2008»
16 years 3 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
« Prev « First page 1617 / 1739 Last » Next »