1038 search results - page 79 / 208 » Space-Bounded Query Approximation |
130
Voted
ISI
2008
Springer
15 years 2 months ago
2008
Springer
In this paper, we propose managing data summaries in unstructured P2P systems. Our summaries are intelligible views with two main virtues. First, they can be directly queried and u...
193
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
155
Voted
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
134
Voted
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
122
Voted
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...