Efficient processing of top-k queries is a crucial requirement in many interactive
environments that involve massive amounts of data. In particular, efficient top-k processing …

A regret minimizing set Q is a small size representation of a much larger database P so that
user queries executed on Q return answers whose scores are not much worse than those on …

Multimedia data require specialised management techniques because the representations
of colour, time, semantic concepts, and other underlying information can be drastically …

The family of threshold algorithm (ie, TA) has been widely studied for efficiently computing
top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted, and …

Data management at the edge of the network can increase the performance of applications
as the processing is realized close to end users limiting the observed latency in the …

Recommendation systems have received considerable attention recently. However, most
research has been focused on improving the performance of collaborative filtering (CF) …

Cloud Services remain one of the largest segments in the world because it has experienced
very rapid growth published, which makes the service selection and recommendation a …

The goal of a threshold query is to detect all objects whose score exceeds a given threshold.
This type of query is used in many settings, such as data mining, event triggering, and top-k …

Consider a database where each record represents a math function. A third party is in
charge of processing queries over this database and we want to provide a mechanism for …

In many applications, the underlying data (the web, an XML document, or a relational
database) can be seen as a graph. These graphs may be enriched with weights, associated …