The general problem of answering top-k queries can be modeled using lists of data items
sorted by their local scores. The main algorithm proposed so far for answering top-k queries …

Many datasets have a temporal dimension and contain a wealth of historical information.
When using such data to make decisions, we often want to examine not only the current …

This paper studies the problem of finding objects with durable quality over time in historical
time series databases. For example, a sociologist may be interested in the top 10 web …

A way of finding interesting or exceptional records from instant-stamped temporal data is to
consider their" durability," or, intuitively speaking, how well they compare with other records …

Current Information Retrieval systems use inverted index structures for efficient query
processing. Due to the extremely large size of many data sets, these index structures are …

In this paper, we propose a novel method for distributing the distance computations of record
pairs generated by a blocking mechanism to the reduce tasks of a Map/Reduce system. The …

We study the problem of temporal database indexing, ie, indexing versions of a database
table in an evolving database. With the larger and cheaper memory chips nowadays, we can …

Much of the English in text documents today comes from nonnative speakers. Web searches
are also conducted very often by non-native speakers. Though highly qualified in their …

Temporal data are ubiquitous nowadays and efficient management of temporal data is of
key importance. A temporal data typically describes the evolution of an object over time. One …

As we are in the big data era, techniques for retrieving only user-desirable data objects from
massive and diverse datasets is being required. Ranking queries, eg, top-k queries, which …