On generating all maximal independent sets
Information Processing Letters
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Integrating information by outerjoins and full disjunctions (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the Complexity of Testing Implications of Functional and Join Dependencies
Journal of the ACM (JACM)
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Supporting Incremental Join Queries on Ranked Inputs
Proceedings of the 27th International Conference on Very Large Data Bases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Evaluating top-k queries over web-accessible databases
ACM Transactions on Database Systems (TODS)
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
An incremental algorithm for computing ranked full disjunctions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Answering queries from statistics and probabilistic views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Full disjunctions: polynomial-delay iterators in action
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Supporting top-K join queries in relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
An abstract framework for generating maximal answers to queries
ICDT'05 Proceedings of the 10th international conference on Database Theory
Maximally joining probabilistic data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Matching twigs in probabilistic XML
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Computing full disjunction using COJO
Information Technology and Management
On the complexity of package recommendation problems
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
| Hi-index | 0.00 |
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 disjunction can be seen as a natural extension of the binary outerjoin operator to an arbitrary number of relations and is a useful operator for information integration. This paper presents the algorithm IncrementalFD for computing the full disjunction of a set of relations. IncrementalFD improves upon previous algorithms for computing the full disjunction in four ways. First, it has a lower total runtime when computing the full result and a lower runtime when computing only k tuples of the result, for any constant k. Second, for a natural class of ranking functions, IncrementalFD can be adapted to return tuples in ranking order. Third, a variation of IncrementalFD can be used to return approximate full disjunctions (which contain maximal approximately join consistent tuples). Fourth, IncrementalFD can be adapted to have a block-based execution, instead of a tuple-based execution.