Sciweavers

3341 search results - page 86 / 669
» On Bounded Queries and Approximation
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
14 years 9 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
SSDBM
2000
IEEE
168views Database» more  SSDBM 2000»
15 years 1 months ago
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
Multidimensional data cubes are used in large data warehouses as a tool for online aggregation of information. As the number of dimensions increases, supporting efficient queries ...
Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi
SIAMCOMP
1998
176views more  SIAMCOMP 1998»
14 years 9 months ago
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
Yonatan Aumann, Yuval Rabani
EDBT
2002
ACM
188views Database» more  EDBT 2002»
15 years 10 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis
PERCOM
2005
ACM
15 years 3 months ago
A Distributed System for Answering Range Queries on Sensor Network Data
A distributed system for approximate query answering on sensor network data is proposed, where a suitable compression technique is exploited to represent data and support query an...
Alfredo Cuzzocrea, Filippo Furfaro, Sergio Greco, ...