Sciweavers

486 search results - page 34 / 98
» What was the Query
Sort
View
DASFAA
2003
IEEE
115views Database» more  DASFAA 2003»
15 years 10 months ago
The BofS Solution to Limitations of Approximate Summaries
Data warehouses are of crucial importance to decision-making in competitive organizations. The fact that they store enormous quantities of data is a challenge in what concerns per...
Pedro Furtado, João Pedro Costa
PODS
2000
ACM
146views Database» more  PODS 2000»
15 years 9 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
ICDE
1993
IEEE
158views Database» more  ICDE 1993»
15 years 9 months ago
Data fragmentation for parallel transitive closure strategies
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
Maurice A. W. Houtsma, Peter M. G. Apers, Gideon L...
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
16 years 5 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
KDD
2008
ACM
207views Data Mining» more  KDD 2008»
16 years 5 months ago
Active learning with direct query construction
Active learning may hold the key for solving the data scarcity problem in supervised learning, i.e., the lack of labeled data. Indeed, labeling data is a costly process, yet an ac...
Charles X. Ling, Jun Du