We explore an active top-K ranking problem based on pairwise comparisons that are collected possibly in a sequential manner as per our design choice. We consider two settings: (1) top-K sorting in which the goal is to recover the top-K items in order out of n items; (2) top-K partitioning where only the set of top-K items is desired. Under a fairly general model which subsumes as special cases ...

Top-k filtering is an effective way of reducing the amount of data sent to subscribers in pub/sub applications. In this paper, we investigate top-k subscription filtering, where a publication is delivered only to the k best ranked subscribers. The naive approach to perform filtering early at the publisher edge broker works only if complete knowledge of the subscriptions is available, which is n...

Online, one-pass mining Web click streams poses some interesting computational issues, such as unbounded length of streaming data, possibly very fast arrival rate, and just one scan over previously arrived Web click-sequences. In this paper, we propose a new, single-pass algorithm, called DSM-TKP (Data Stream Mining for Top-K Path traversal patterns), for mining a set of top-k path traversal pa...

A typical scenario in information retrieval and web search is to index a given type of items (e.g., web pages, images) and provide search functionality for them. In such a scenario, the basic units of indexing and retrieval are the same. Extensive study has been done for efficient top-k computation in such settings. This paper studies top-k processing for many emerging scenarios: efficiently re...

Efficient processing of top-k queries has become a classical research area recently since it has lots of application fields. Fagin et al. proposed the “middleware cost” for a top-k query algorithm. In some databases there is no way to perform a random access, Fagin et al. proposed NRA (No Random Access) algorithm for this case. In this paper, we provided some key observations of NRA. Based on t...

Top-k query is an efficient way to show the most important objects to user from massive amounts of data. After huge effort working on database performance, recently, an explain capability has attract more attention in recent years. In top-k query, since people may not specify his/her accurate preference, he may feel frustrated with the top-k results and propose a question such that “why my expe...

The subject of this thesis is the intelligent caching of top-k queries in an environment with high latency and low throughput. In such an environment, caching can be used to reduce network traffic and improve response time. Slow database connections of mobile devices and to databases, which have been offshored, are practical use cases. A semantic cache is a query-based cache that caches query r...