Sciweavers

107 search results - page 11 / 22
» Proximity Rank Join
Sort
View
TREC
2004
13 years 10 months ago
Using Clustering and Blade Clusters in the Terabyte Task
Web search engines exploit conjunctive queries and special ranking criteria which differ from the disjunctive queries typically used for ad-hoc retrieval. We wanted to asses the e...
Giuseppe Attardi, Andrea Esuli, Chirag Patel
4OR
2005
71views more  4OR 2005»
13 years 8 months ago
On rank-perfect subclasses of near-bipartite graphs
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...
Annegret Wagler
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 8 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 ...
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 10 months ago
Integrating and Ranking Uncertain Scientific Data
Mediator-based data integration systems resolve exploratory queries by joining data elements across sources. In the presence of uncertainties, such multiple expansions can quickly ...
Landon Detwiler, Wolfgang Gatterbauer, Brenton Lou...
PODS
2005
ACM
86views Database» more  PODS 2005»
14 years 2 months ago
An incremental algorithm for computing ranked full disjunctions
The full disjunction is a variation of the join operator that maximally combines tuples from connected relations, while preserving all information in the relations. The full disju...
Sara Cohen, Yehoshua Sagiv