4 search results - page 1 / 1 » Integrating Information by Outerjoins and Full Disjunctions |
PODS
1996
ACM
13 years 9 months ago
1996
ACM
PODS
2005
ACM
13 years 11 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 5 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...
SIGIR
2011
ACM
12 years 8 months ago
2011
ACM
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...