Relational database: selected writings
Relational database: selected writings
On generating all maximal independent sets
Information Processing Letters
Introduction to algorithms
Query graphs, implementing trees, and freely-reorderable outerjoins
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
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
Outerjoin simplification and reordering for query optimization
ACM Transactions on Database Systems (TODS)
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
Database Systems: The Complete Book
Database Systems: The Complete Book
How to Extend a Conventional Optimizer to Handle One- and Two-Sided Outerjoin
Proceedings of the Eighth International Conference on Data Engineering
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Canonical abstraction for outerjoin optimization
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
An incremental algorithm for computing ranked full disjunctions
Journal of Computer and System Sciences
Maximally joining probabilistic data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Self-correcting queries for xml
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Matching twigs in probabilistic XML
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficiently enumerating results of keyword search over data graphs
Information Systems
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Journal of Computer and System Sciences
Modeling and querying probabilistic XML data
ACM SIGMOD Record
Computing full disjunction using COJO
Information Technology and Management
Information Systems
Information Systems
Subsumption and complementation as data fusion operators
Proceedings of the 13th International Conference on Extending Database Technology
Combining incompleteness and ranking in tree queries
ICDT'07 Proceedings of the 11th international conference on Database Theory
Static analysis and optimization of semantic web queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
A personal perspective on keyword search over data graphs
Proceedings of the 16th International Conference on Database Theory
Static analysis and optimization of semantic web queries
ACM Transactions on Database Systems (TODS) - Invited papers issue
Hi-index | 0.00 |
Full disjunctions are an associative extension of the outer-join operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from different relations while preserving all the original information. An algorithm for efficiently computing full disjunctions is presented. This algorithm is superior to previous ones in three ways. First, it is the first algorithm that computes a full disjunction with a polynomial delay between tuples. Hence, it can be implemented as an iterator that produces a stream of tuples, which is important in many cases (e.g., pipelined query processing and Web applications). Second, the total runtime is linear in the size of the output. Third, the algorithm employs a novel optimization that divides the relation schemes into biconnected components, uses a separate iterator for each component and applies outerjoins whenever possible. Combining efficiently full disjunctions with standard SQL operators is discussed. Experiments show the superiority of our algorithm over the state of the art.