Searching for "Computing full disjunctions." – sorted by Relevance.
8 documents found, showing 1 through 8.
-
An Incremental Algorithm for Computing Ranked Full Disjunctions
- …An Incremental Algorithm for Computing Ranked Full Disjunctions ∗ Sara Cohen Faculty of Industrial…
- Cited by 4 (3 self) – Add To MetaCart
-
Full disjunctions: Polynomial-delay iterators in action
- … preserving all the original information. An algorithm for efficiently computing full disjunctions…
- Cited by 2 (1 self) – Add To MetaCart
-
Integrating information by outerjoins and full disjunctions (Extended Abstract)
- … connections among facts. Such a computation has been termed a \full disjunction" by Galindo-Legaria. We…
- Cited by 22 (0 self) – Add To MetaCart
-
Integrating Information by Outerjoins and Full Disjunctions
- … hypergraph or collection of relations R. Computing the Full Disjunction We would like to find some simple…
- Add To MetaCart
-
Oblivious Queries over Data with Irregular Structure
- … by computing the full disjunction (rather than the natural join or equijoin) of the given relations. For two…
- Add To MetaCart
-
Solving Set Constraints for Greatest Models
- … intersections of variables, we compute again full disjunctive normal forms for these intersections (Axiom 2…
- Cited by 1 (0 self) – Add To MetaCart
-
Outerjoins as Disjunctions
- … query graphs, the full disjunction can be computed applying full outerjoins, in any order. For cyclic…
- Cited by 31 (1 self) – Add To MetaCart
-
Co-definite Set Constraints
- … with intersections and vice versa), compute the full disjunctive normal form (this time over variables, not terms f…
- Cited by 16 (8 self) – Add To MetaCart
Showing 1 through 8.
