289
click to vote
ADBIS
10 years 3 months ago
2015 Springer
Subspace clustering techniques were proposed to discover hidden clusters that only exist in certain subsets of the full feature spaces. However, the time complexity of such algorit...
207
click to vote
ADBIS
10 years 3 months ago
2015 Springer
This paper presents and evaluates an alternative sorting component for Hadoop based on the replacement selection algorithm. In comparison with the default quicksort-based implement...
199
click to vote
ADBIS
10 years 3 months ago
2015 Springer
In earlier work we have extended the TPC-C benchmark with basic and complex schema transformations. This paper uses this benchmark to investigate the blocking behaviour of online s...
197
click to vote
ADBIS
10 years 3 months ago
2015 Springer
When dealing with large amounts of data, exact query answering is not always feasible. We propose a query approximation method that, given an upper bound on the amount of data that...
|