Sciweavers

107 search results - page 6 / 22
» Approximate Query Answering by Model Averaging
Sort
View
DKE
2007
119views more  DKE 2007»
13 years 7 months ago
Error minimization in approximate range aggregates
Histogram techniques have been used in many commercial database management systems to estimate a query result size. Recently, it has been shown that they are very effective to su...
Xuemin Lin, Qing Zhang, Yidong Yuan, Qing Liu
CCCG
2008
13 years 9 months ago
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
Jonathan Derryberry, Don Sheehy, Maverick Woo, Dan...
PVLDB
2010
134views more  PVLDB 2010»
13 years 6 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
14 years 7 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
14 years 1 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han