Results 1  10
of
380,227
Optimizing multiple topk queries over joins
 In SSDBM
, 2005
"... Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a proper support of multiple Topk queries in order to perform projected clustering. Although some research tackles to proble ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
to problem of optimizing restricted ranking (topk) queries, there is no solution considering more than one single ranking criterion. This deficit optimizing multiple Topk queries over joins is targeted by this paper from two perspectives. On the one hand, we propose a minimal but quite handy extension
JTop Algorithms for Topk Join Queries
, 2008
"... Topk join queries have become very important in many important areas of computing. One of the most efficient algorithms for topk join queries is the RankJoin algorithm [17] [18]. However, there are many cases where RankJoin does much unnecessary access to the input data sources. In this report, ..."
Abstract
 Add to MetaCart
Topk join queries have become very important in many important areas of computing. One of the most efficient algorithms for topk join queries is the RankJoin algorithm [17] [18]. However, there are many cases where RankJoin does much unnecessary access to the input data sources. In this report
Efficient Topk Joins on Complex Data Types
, 2015
"... Consider two collections of objects R and S, where each object is assigned a score (e.g., a rating). Given a join predicate and an integer k, a topk join query returns the k pairs of objects which have the highest combined score (based on an aggregate scoring function ) among all object pairs in R ..."
Abstract
 Add to MetaCart
Consider two collections of objects R and S, where each object is assigned a score (e.g., a rating). Given a join predicate and an integer k, a topk join query returns the k pairs of objects which have the highest combined score (based on an aggregate scoring function ) among all object pairs
Efficient Topk Spatial Distance Joins?
"... Abstract. Consider two sets of spatial objects R and S, where each object is assigned a score (e.g., ranking). Given a spatial distance threshold and an integer k, the topk spatial distance join (kSDJ) returns the k pairs of objects, which have the highest combined score (based on an aggregate f ..."
Abstract
 Add to MetaCart
Abstract. Consider two sets of spatial objects R and S, where each object is assigned a score (e.g., ranking). Given a spatial distance threshold and an integer k, the topk spatial distance join (kSDJ) returns the k pairs of objects, which have the highest combined score (based on an aggregate
Shortlisting TopK Assignments
"... In this paper we identify a novel query type, the topK assignment query (αTopK). Consider a set of objects P and a set of suppliers S, where each object pi ∈ P must be assigned to one supplier sj ∈ S. Assume that there is a cost cij associated with every objectsupplier pair 〈pi, sj〉. The matching ..."
Abstract
 Add to MetaCart
In this paper we identify a novel query type, the topK assignment query (αTopK). Consider a set of objects P and a set of suppliers S, where each object pi ∈ P must be assigned to one supplier sj ∈ S. Assume that there is a cost cij associated with every objectsupplier pair 〈pi, sj
Efficiently Computing TopK Shortest Path Join
"... Driven by many applications, in this paper we study the problem of computing the topk shortest paths from one set of target nodes to another set of target nodes in a graph, namely the topk shortest path join (KPJ) between two sets of target nodes. While KPJ is an extension of the problem of comput ..."
Abstract
 Add to MetaCart
Driven by many applications, in this paper we study the problem of computing the topk shortest paths from one set of target nodes to another set of target nodes in a graph, namely the topk shortest path join (KPJ) between two sets of target nodes. While KPJ is an extension of the problem
Costaware topk join algorithms
, 2009
"... In this paper we consider the problem of joining ranked results produced by search services on the Web. We consider services that output data tuples sorted by score. We cast this problem as a generalization of the traditional rank aggregation problem, i.e., combining several ranked lists of objects ..."
Abstract
 Add to MetaCart
In this paper we consider the problem of joining ranked results produced by search services on the Web. We consider services that output data tuples sorted by score. We cast this problem as a generalization of the traditional rank aggregation problem, i.e., combining several ranked lists of objects
Optimal Incremental Algorithms for Topk Joins with UserDefined Join Constraints
, 2007
"... We investigate the problem of incremental joins of multiple ranked data streams when the join condition is a list of arbitrary userdefined predicates on the input tuples. We propose an algorithm J∗ for ranked input joins over userdefined join predicates. The basic version of the algorithm uses onl ..."
Abstract
 Add to MetaCart
only sequential access into the database and is easily pipelinable—that is, the output of one join query can be fed as the input of another. We also propose a J∗PA algorithm that can exploit available database indexes for efficient random access based on the join predicates, as well as give ɛ
Anytime measures for topk algorithms
 VLDB 2007, Proc. of 33rd international onference on Very Large Data Bases
, 2007
"... Topk queries on large multiattribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime behavior of topk algorithms. In particular, given specific topk algorithms (TA and TASorted) we are interested in study ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Topk queries on large multiattribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime behavior of topk algorithms. In particular, given specific topk algorithms (TA and TASorted) we are interested
Results 1  10
of
380,227