Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
938
Reverse Top-k Queries
"... Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user’s preferences. Top-k queries have been mainly studied from the perspective of the user, focusing primarily on efficient query processing. In this work, ..."
Abstract
-
Cited by 29 (6 self)
- Add to MetaCart
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user’s preferences. Top-k queries have been mainly studied from the perspective of the user, focusing primarily on efficient query processing. In this work
Privacy-preserving top-k queries
- In ICDE
, 2005
"... There is an increasing need for ranked and “best match” queries, in particular the top-k query: Finding the k closest matches to a query “point”. Top-k queries are particularly relevant when dealing with privacy-sensitive information. For example, profiling has potential anti-terrorism applications ..."
Abstract
-
Cited by 20 (0 self)
- Add to MetaCart
There is an increasing need for ranked and “best match” queries, in particular the top-k query: Finding the k closest matches to a query “point”. Top-k queries are particularly relevant when dealing with privacy-sensitive information. For example, profiling has potential anti-terrorism applications
Approximate Distributed Top-k Queries ∗
, 2007
"... We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such a system asks which are the k items whose global count, across all nodes in the system, is the largest. In this paper we ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such a system asks which are the k items whose global count, across all nodes in the system, is the largest. In this paper we
Top-k Query Evaluation with Probabilistic Guarantees
- In VLDB
, 2004
"... 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 algorithm for evaluating top-k queries is Fagin’s threshold algorithm (TA). Since the user’s goal behind top-k queries is to i ..."
Abstract
-
Cited by 105 (16 self)
- Add to MetaCart
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 algorithm for evaluating top-k queries is Fagin’s threshold algorithm (TA). Since the user’s goal behind top-k queries
Monochromatic and Bichromatic Reverse Top-k Queries
"... Nowadays, most applications return to the user a limited set of ranked results based on the individual user’s preferences, which are commonly expressed through top-k queries. From the perspective of a manufacturer, it is imperative that her products appear in the highest ranked positions for many di ..."
Abstract
-
Cited by 12 (3 self)
- Add to MetaCart
Nowadays, most applications return to the user a limited set of ranked results based on the individual user’s preferences, which are commonly expressed through top-k queries. From the perspective of a manufacturer, it is imperative that her products appear in the highest ranked positions for many
I. PROBABILISTIC THRESHOLD TOP-k QUERIES
"... Abstract — In this paper, we propose a novel type of probabilistic threshold top-k queries on uncertain data, and give an exact algorithm. More details can be found in [4]. ..."
Abstract
- Add to MetaCart
Abstract — In this paper, we propose a novel type of probabilistic threshold top-k queries on uncertain data, and give an exact algorithm. More details can be found in [4].
Algebraic query optimization for distributed top-k queries
- GI-Fachtagung für Datenbanksysteme in Business, Technologie und Web, volume 103 of Lecture Notes in Informatics
, 2007
"... Abstract: Distributed top-k query processing is increasingly becoming an essential functionality in a large number of emerging application classes. This paper addresses the efficient algebraic optimization of top-k queries in wide-area distributed data repositories where the index lists for the attr ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Abstract: Distributed top-k query processing is increasingly becoming an essential functionality in a large number of emerging application classes. This paper addresses the efficient algebraic optimization of top-k queries in wide-area distributed data repositories where the index lists
Efficient processing of top-k queries on uncertain databases
, 2007
"... Abstract — This work introduces novel polynomial-time algorithms for processing top-k queries in uncertain databases, under the generally adopted model of x-relations. An x-relation consists of a number of x-tuples, and each x-tuple randomly instantiates into one tuple from one or more alternatives. ..."
Abstract
-
Cited by 62 (7 self)
- Add to MetaCart
Abstract — This work introduces novel polynomial-time algorithms for processing top-k queries in uncertain databases, under the generally adopted model of x-relations. An x-relation consists of a number of x-tuples, and each x-tuple randomly instantiates into one tuple from one or more alternatives
A Survey of Techniques For Answering Top-k queries
, 2013
"... Top-k queries are useful in retrieving top-k records from a given set of records depending on the value of a function F on their attributes. Many techniques have been proposed in database literature for answering top-k queries.These are mainly categorized into three:Sorted-list based,layer based and ..."
Abstract
- Add to MetaCart
Top-k queries are useful in retrieving top-k records from a given set of records depending on the value of a function F on their attributes. Many techniques have been proposed in database literature for answering top-k queries.These are mainly categorized into three:Sorted-list based,layer based
Response time constrained top-k query evaluation in sensor networks
- in Proc. ICPADS’08
, 2008
"... Abstract Existing solutions for top-k queries in wireless sensor ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract Existing solutions for top-k queries in wireless sensor
Results 1 - 10
of
938
