ICDE
2001
IEEE
14 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 ...
ICDE
2001
IEEE
14 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-...
ICDE
2001
IEEE
14 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...
ICDE
2001
IEEE
14 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...
ICDE
2001
IEEE
14 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...
ICDE
2001
IEEE
14 years 6 months ago
2001
IEEE
ICDE
2001
IEEE
14 years 6 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
ICDE
2001
IEEE
14 years 6 months ago
2001
IEEE
LeSelect is a mediator system which allows scientists to publish their resources (data and programs) so they can be transparently accessed. The scientists can typically issue quer...
ICDE
2001
IEEE
14 years 6 months ago
2001
IEEE
We propose to extend database systems by a Skyline operation. This operation filters out a set of interesting points from a potentially large set of data points. A point is intere...
ICDE
2001
IEEE
14 years 6 months ago
2001
IEEE
