Sciweavers

PODS
2003
ACM
158views Database» more  PODS 2003»
15 years 24 days ago
Computing full disjunctions
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...
Yaron Kanza, Yehoshua Sagiv