Sciweavers

412 search results - page 15 / 83
» Ranked Join Indices
Sort
View
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 6 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 ...
ACL
1998
13 years 8 months ago
Ranking Text Units According to Textual Saliency, Connectivity and Topic Aptness
An efficient use of lexical cohesion is described for ranking text units according to their contribution in defining the meaning of a text (textual saliency), their ability to for...
Antonio Sanfilippo
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 6 months ago
Learning to rank with combinatorial Hodge theory
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
MP
2011
13 years 1 months ago
Statistical ranking and combinatorial Hodge theory
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
PODS
2005
ACM
86views Database» more  PODS 2005»
14 years 8 days 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