Sciweavers

2514 search results - page 131 / 503
» On the Computation of Approximations of Database Queries
Sort
View
SSDBM
2006
IEEE
153views Database» more  SSDBM 2006»
16 years 13 days ago
HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets using Fast Bitmap Indices
Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user com...
Luke J. Gosink, John Shalf, Kurt Stockinger, Keshe...

Book
290views
17 years 4 months ago
Database System Concepts
A set of presentations that cover the book, which includes several topics such as relational database systems such as Relational Databases, Database Design, Object-Based Databases ...
Avi Silberschatz, Henry F. Korth, S. Sudarshan
JMLR
2010
169views more  JMLR 2010»
15 years 1 months ago
Focused Belief Propagation for Query-Specific Inference
With the increasing popularity of largescale probabilistic graphical models, even "lightweight" approximate inference methods are becoming infeasible. Fortunately, often...
Anton Chechetka, Carlos Guestrin
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
15 years 10 months ago
Computing Capabilities of Mediators
Existing data-integration systems based on the mediation architecture employ a variety of mechanisms to describe the query-processing capabilities ofsources. However, these system...
Ramana Yerneni, Chen Li, Hector Garcia-Molina, Jef...
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
16 years 6 months ago
Space-Efficient Online Computation of Quantile Summaries
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
Michael Greenwald, Sanjeev Khanna