Sciweavers

3731 search results - page 503 / 747
» cases 2006
Sort
View
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 7 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
VLDB
2006
ACM
190views Database» more  VLDB 2006»
16 years 6 months ago
Online summarization of dynamic time series data
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
16 years 6 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
PODS
2006
ACM
104views Database» more  PODS 2006»
16 years 6 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei
EDBT
2006
ACM
124views Database» more  EDBT 2006»
16 years 6 months ago
Physical Design Refinement: The "Merge-Reduce" Approach
Abstract. Physical database design tools rely on a DBA-provided workload to pick an "optimal" set of indexes and materialized views. Such an approach fails to capture sce...
Nicolas Bruno, Surajit Chaudhuri