Sciweavers

1091 search results - page 168 / 219
» Approximation in Databases
Sort
View
ICDE
2006
IEEE
134views Database» more  ICDE 2006»
16 years 3 months ago
ISOMER: Consistent Histogram Construction Using Query Feedback
Database columns are often correlated, so that cardinality estimates computed by assuming independence often lead to a poor choice of query plan by the optimizer. Multidimensional...
Utkarsh Srivastava, Peter J. Haas, Volker Markl, M...
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
16 years 2 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 2 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
192
Voted
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
16 years 2 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 2 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...