2635 search results - page 194 / 527 » Algorithms for the Database Layout Problem |
151
click to vote
WADS
2007
Springer
16 years 19 days ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
272
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
To handle the overwhelming amount of information currently available, personalization systems allow users to specify the information that interests them through preferences. Most ...
203
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we will study the problem of projected clustering of uncertain data streams. The use of uncertainty is especially important in the high dimensional scenario, bec...
168
click to vote
IDEAS
2007
IEEE
16 years 25 days ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
178
click to vote
DEXAW
2007
IEEE
15 years 10 months ago
2007
IEEE
We built a system for the automatic creation of a textbased topic hierarchy, meant to be used in a geographically defined community. This poses two main problems. First, the appea...