DM
2006
13 years 4 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...