Approximate Query Answering Using Data Warehouse Striping
Journal of Intelligent Information Systems - Special issue on data warehousing and knowledge discovery
Value Range Queries on Earth Science Data via Histogram Clustering
TSDM '00 Proceedings of the First International Workshop on Temporal, Spatial, and Spatio-Temporal Data Mining-Revised Papers
A new two-phase sampling based algorithm for discovering association rules
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Index structures for data warehouses
Index structures for data warehouses
| Hi-index | 0.00 |
We review techniques for exploring large object-relational scientific and statistical databases in an interactive online manner. The idea is to provide continuously updated running estimates of the final query results to the user, along with an indication of the precision of the estimates. The user can then halt the query as soon as the answer is sufficiently precise - the time required to obtain an acceptable approximate answer can be faster by orders of magnitude than the time needed to completely process the query. We describe methods for online processing of aggregation queries, online visualization, and online display of a set of result records. We also describe methods that use precomputed results to rapidly obtain approximate querry answers.