Sciweavers

55 search results - page 1 / 11
» Evaluating rank joins with optimal cost
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 4 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 4 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
VLDB
2007
ACM
229views Database» more  VLDB 2007»
13 years 10 months ago
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 4 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...
CIKM
2004
Springer
13 years 10 months ago
Evaluating window joins over punctuated streams
We explore join optimizations in the presence of both timebased constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named...
Luping Ding, Elke A. Rundensteiner