Sciweavers

1091 search results - page 170 / 219
» Approximation in Databases
Sort
View
VLDB
2004
ACM
134views Database» more  VLDB 2004»
15 years 7 months ago
Model-Driven Data Acquisition in Sensor Networks
Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that “the sensornet is a database” is problematic,...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
15 years 7 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
VLDB
2001
ACM
139views Database» more  VLDB 2001»
15 years 6 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
DEXA
2008
Springer
132views Database» more  DEXA 2008»
15 years 4 months ago
Efficient Updates for Continuous Skyline Computations
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
BMCBI
2006
143views more  BMCBI 2006»
15 years 2 months ago
IsoSVM - Distinguishing isoforms and paralogs on the protein level
Background: Recent progress in cDNA and EST sequencing is yielding a deluge of sequence data. Like database search results and proteome databases, this data gives rise to inferred...
Michael Spitzer, Stefan Lorkowski, Paul Cullen, Al...