SIGMOD
2010
ACM
12 years 11 months ago
2010
ACM
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
PVLDB
2010
12 years 11 months ago
2010
Top-k queries are widely applied for retrieving a ranked set of the k most interesting objects based on the individual user preferences. As an example, in online marketplaces, cus...
PVLDB
2008
13 years 4 months ago
2008
Query processing on uncertain data streams has attracted a lot of attentions lately, due to the imprecise nature in the data generated from a variety of streaming applications, su...
DPD
2006
13 years 4 months ago
2006
A major problem of unstructured P2P systems is their heavy network traffic. This is caused mainly by high numbers of query answers, many of which are irrelevant for users. One solu...
SBBD
2003
13 years 5 months ago
2003
Advanced personalization of database applications is a big challenge, in particular for distributed mobile environments. We present several new results from a prototype of a route...
DAMON
2008
Springer
13 years 6 months ago
2008
Springer
Frequent elements and top-k queries constitute an important class of queries for data stream analysis applications. Certain applications require answers for both frequent elements...
VLDB
2004
ACM
13 years 10 months ago
2004
ACM
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
VLDB
2005
ACM
13 years 10 months ago
2005
ACM
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
ICDE
2005
IEEE
13 years 10 months ago
2005
IEEE
Processing of top-k queries has been attracting considerable attention. Much of the work assumes distributed data, with each site holding a different set of attributes for the sam...
VLDB
2007
ACM
13 years 10 months ago
2007
ACM
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...