A fast algorithm for query optimization in universal-relation databases

DOI10.1006/jcss.1998.1570zbMath0913.68060OpenAlexW2021150319MaRDI QIDQ1271615

Francesco Mario Malvestuto, Marina Moscarini

Publication date: 10 November 1998

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1998.1570

zbMATH Keywords

query processingcanonical connectionuniversal-relation databases

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (7)

Equivalence between hypergraph convexities ⋮ Unnamed Item ⋮ Decomposable convexities in graphs and hypergraphs ⋮ On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs ⋮ Decomposition of a hypergraph by partial-edge separators ⋮ Canonical and monophonic convexities in hypergraphs ⋮ An implementation of the iterative proportional fitting procedure by propagation trees.

Cites Work

• Unnamed Item
• Chordality properties on graphs and minimal conceptual connections in semantic data models
• Connections in acyclic hypergraphs
• GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
• A universal table model for categorical databases
• On hypergraph acyclicity and graph chordality
• Decomposing constraint satisfaction problems using database techniques
• On the Desirability of Acyclic Database Schemes
• Degrees of acyclicity for hypergraphs and relational database schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Equivalences among Relational Expressions

This page was built for publication: A fast algorithm for query optimization in universal-relation databases