PODS
2001
ACM
14 years 4 months ago
2001
ACM
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
PODS
2001
ACM
14 years 4 months ago
2001
ACM
Database systems frequently have to execute a set of related queries, which share several common subexpressions. Multi-query optimization exploits this, by finding evaluation plan...
PODS
2001
ACM
14 years 4 months ago
2001
ACM
PODS
2001
ACM
14 years 4 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
PODS
2001
ACM
14 years 4 months ago
2001
ACM
PODS
2001
ACM
14 years 4 months ago
2001
ACM
The increasing ability to track and collect large amounts of data with the use of current hardware technology has lead to an interest in the development of data mining algorithms ...
PODS
2001
ACM
14 years 4 months ago
2001
ACM
The dimensionality curse has profound e ects on the effectiveness of high-dimensional similarity indexing from the performance perspective. One of the well known techniques for im...
PODS
2001
ACM
14 years 4 months ago
2001
ACM
A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space -- where k is lo...
PODS
2001
ACM
14 years 4 months ago
2001
ACM
