Sciweavers

1091 search results - page 67 / 219
» Approximation in Databases
Sort
View
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 4 days ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
PODS
2003
ACM
157views Database» more  PODS 2003»
15 years 12 months ago
Algorithms for data migration with cloning
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such high demand storage servers are used as web servers, or multimedia servers...
Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
ICDT
2001
ACM
153views Database» more  ICDT 2001»
15 years 4 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
BMCBI
2006
116views more  BMCBI 2006»
14 years 12 months ago
MICA: desktop software for comprehensive searching of DNA databases
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
William A. Stokes, Benjamin S. Glick
STACS
2009
Springer
15 years 6 months ago
Approximating Acyclicity Parameters of Sparse Hypergraphs
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...