Aug 1, 2015 · The maintenance process involves the calculation of a score for each object and the update of the top-k list. We adopt the principles of Optimal ...

Many applications are best depicted by big data streams that involve huge amount of data coming in very high rates. Data streams can be incomplete in the sense ...

In this paper, we focus on the behavior of an Observer Entity (OE) responsible to observe the incoming data and initiate the maintenance process of the top-k ...

Empirical evidence is provided that proves the ability of the proposed policies to guarantee reactiveness, while providing more accurate and relevant result ...

Bibliographic details on A time optimized scheme for top-k list maintenance over incomplete data streams.

An efficient time optimized scheme for progressive analytics in big data ... 2020. A time optimized scheme for top-k list maintenance over incomplete data streams.

This work proposes an approximate algorithm which leverages correlation statistics of pairs of streams to evict more objects while maintaining accuracy and ...

D.J. · Kolomvatsos, A time optimized scheme for top-k list maintenance over incomplete data streams, Inf. · Song, Differential dependencies: reasoning and ...

In this paper, we formally define the problem of top-k query over incomplete data stream (Topk-iDS), which continuously detects top-k objects with the highest ...

skyline maintenance in the distance-time space and to pre-compute the future changes in the NN set. All these solutions can be easily adopted to answer kNN ...