An incremental algorithm for computing ranked full disjunctions

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 three ways. First, it has a lower total run-time 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 returns tuples in ranking order. Third, INCREMENTALFD can be adapted to have a block-based execution, instead of a tuple-based execution.

[1]  Luis Gravano,et al.  Evaluating top-k queries over web-accessible databases , 2004, TODS.

[2]  Moshe Y. Vardi.  On the Complexity of Bounded-Variable Queries. , 1995, PODS 1995.

[3]  Moni Naor,et al.  Optimal aggregation algorithms for middleware , 2001, PODS '01.

[4]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[5]  Anand Rajaraman,et al.  Integrating Information by Outerjoins and Full Disjunctions , 1996, PODS 1996.

[6]  Yehoshua Sagiv,et al.  Generating All Maximal Induced Subgraphs for Hereditary Connected-Hereditary and Rooted-Hereditary Properties , 2004, ArXiv.

[7]  Walid G. Aref,et al.  Rank-aware query optimization , 2004, SIGMOD '04.

[8]  César A. Galindo-Legaria,et al.  Outerjoins as disjunctions , 1994, SIGMOD '94.

[9]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[10]  Jeffrey D. Ullman,et al.  Integrating information by outerjoins and full disjunctions (extended abstract) , 1996, PODS.

[11]  Yehoshua Sagiv,et al.  An Abstract Framework for Generating Maximal Answers to Queries , 2005, ICDT.

[12]  Mihalis Yannakakis,et al.  On the Complexity of Testing Implications of Functional and Join Dependencies , 1981, JACM.

[13]  Yehoshua Sagiv,et al.  Computing full disjunctions , 2003, PODS '03.

[14]  John R. Smith,et al.  Supporting Incremental Join Queries on Ranked Inputs , 2001, VLDB.

[15]  Moshe Y. Vardi.  On the complexity of bounded-variable queries (extended abstract) , 1995, PODS '95.