288
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
212
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
What do you do to make sense of a mass of information on a given topic? Paradoxically, you likely add yet more information to the pile: annotations, underlining, bookmarks, cross-...
244
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
The paper studies the impact of several lock manager designs on the overhead imposed to a persistent programming language by automated object locking. Our study reveals that a loc...
257
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
We study the problem of approximately answering aggregation queries using sampling. We observe that uniform sampling performs poorly when the distribution of the aggregated attrib...
231
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...