2370 search results - page 332 / 474 » The Characterization of Data-Accumulating Algorithms |
107
click to vote
PODS
2001
ACM
15 years 10 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
2003
ACM
15 years 10 months ago
2003
ACM
Normalization as a way of producing good database designs is a well-understood topic. However, the same problem of distinguishing well-designed databases from poorly designed ones...
PODS
2003
ACM
15 years 10 months ago
2003
ACM
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
PODS
2008
ACM
15 years 10 months ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
EDBT
2008
ACM
15 years 10 months ago
2008
ACM
k-anonymization is an important privacy protection mechanism in data publishing. While there has been a great deal of work in recent years, almost all considered a single static r...