Sciweavers

1091 search results - page 30 / 219
» Approximation in Databases
Sort
View
LPNMR
2005
Springer
14 years 2 months ago
Approximating Answer Sets of Unitary Lifschitz-Woo Programs
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
Victor W. Marek, Inna Pivkina, Miroslaw Truszczyns...
VLDB
2005
ACM
129views Database» more  VLDB 2005»
14 years 1 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
SIGMETRICS
1992
ACM
145views Hardware» more  SIGMETRICS 1992»
14 years 16 days ago
Analysis of the Generalized Clock Buffer Replacement Scheme for Database Transaction Processing
The CLOCK algorithm is a popular buffer replacement algorithm becauseof its simplicity and its ability to approximate the performance of the Least Recently Used (LRU) replacement ...
Victor F. Nicola, Asit Dan, Daniel M. Dias
PODS
2004
ACM
143views Database» more  PODS 2004»
14 years 8 months ago
Approximate Counts and Quantiles over Sliding Windows
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...
Arvind Arasu, Gurmeet Singh Manku
VLDB
2001
ACM
144views Database» more  VLDB 2001»
14 years 8 months ago
Approximate query processing using wavelets
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
Kaushik Chakrabarti, Minos N. Garofalakis, Rajeev ...