A survey of top-k query processing techniques in relational database systems
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 …
environments that involve massive amounts of data. In particular, efficient top-k processing …
[ΒΙΒΛΙΟ][B] Modern information retrieval
R Baeza-Yates, B Ribeiro-Neto - 1999 - people.ischool.berkeley.edu
Information retrieval (IR) has changed considerably in recent years with the expansion of the
World Wide Web and the advent of modern and inexpensive graphical user interfaces and …
World Wide Web and the advent of modern and inexpensive graphical user interfaces and …
Simple, robust and optimal ranking from pairwise comparisons
We consider data in the form of pairwise comparisons of n items, with the goal of identifying
the top k items for some value of k< n, or alternatively, recovering a ranking of all the items …
the top k items for some value of k< n, or alternatively, recovering a ranking of all the items …
Load balancing in mapreduce based on scalable cardinality estimates
B Gufler, N Augsten, A Reiser… - 2012 IEEE 28th …, 2012 - ieeexplore.ieee.org
MapReduce has emerged as a popular tool for distributed and scalable processing of
massive data sets and is being used increasingly in e-science applications. Unfortunately …
massive data sets and is being used increasingly in e-science applications. Unfortunately …
Best position algorithms for efficient top-k query processing
R Akbarinia, E Pacitti, P Valduriez - Information Systems, 2011 - Elsevier
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 …
sorted by their local scores. The main algorithm proposed so far for answering top-k queries …
Top-k monitoring in wireless sensor networks
Top-k monitoring is important to many wireless sensor applications. This paper exploits the
semantics of top-k query and proposes an energy-efficient monitoring approach called FILA …
semantics of top-k query and proposes an energy-efficient monitoring approach called FILA …
Approximate distributed k-means clustering over a peer-to-peer network
Data intensive peer-to-peer (P2P) networks are finding increasing number of applications.
Data mining in such P2P environments is a natural extension. However, common monolithic …
Data mining in such P2P environments is a natural extension. However, common monolithic …
Efficient skyline and top-k retrieval in subspaces
Skyline and top-k queries are two popular operations for preference retrieval. In practice,
applications that require these operations usually provide numerous candidate attributes …
applications that require these operations usually provide numerous candidate attributes …
SpringerBriefs in Computer Science
This is an introduction to multicast routing, which is the study of methods for routing from one
source to many destinations, or from many sources to many destinations. Multicast is …
source to many destinations, or from many sources to many destinations. Multicast is …
SKYPEER: Efficient subspace skyline computation over distributed data
Skyline query processing has received considerable attention in the recent past. Mainly, the
skyline query is used to find a set of non dominated data points in a multidimensional …
skyline query is used to find a set of non dominated data points in a multidimensional …