1038 search results - page 175 / 208 » Space-Bounded Query Approximation |
73
Voted
KDD
2006
ACM
16 years 3 days ago
2006
ACM
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
100
click to vote
KDD
2005
ACM
16 years 3 days ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
190
click to vote
VLDB
2007
ACM
15 years 12 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
PODS
2008
ACM
15 years 11 months ago
2008
ACM
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...