107 search results - page 1 / 22 » An incremental algorithm for computing ranked full disjuncti... |
PODS
2005
ACM
13 years 10 months ago
2005
ACM
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...
PODS
2003
ACM
14 years 4 months ago
2003
ACM
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
WWW
2005
ACM
14 years 5 months ago
2005
ACM
Link Analysis has been a popular and widely used Web mining technique, especially in the area of Web search. Various ranking schemes based on link analysis have been proposed, of ...
WAW
2004
Springer
13 years 9 months ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
WWW
2005
ACM
14 years 5 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...