A Fast Algorithm for Query Optimization in Universal-Relation Databases

Journal of Computer and System Sciences

Volumn 56, Issue 3, 1998, Pages 299-309

  Malvestuto, Francesco Mario ^a   Moscarini, Marina ^a  

^a Dipto di Scienze dell'Informazione   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; QUERY LANGUAGES;

CYCLIC CANONICAL CONNECTIONS; FAST ALGORITHMS; UNIVERSAL-RELATIONAL DATABASE SYSTEMS;

RELATIONAL DATABASE SYSTEMS;

EID: 0032089769     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1570     Document Type: Article

References (18)

1. A. V. Aho, Y. Sagiv, and J. D. Ullman, Efficient optimization of a class of relational expressions, ACM-TODS 4 (1919), 435-454.
2. A. V. Aho, Y. Sagiv, and J. D. Ullman, Equivalences among relational expressions, SIAM. J. Comput. 8 (1979), 218-246.
3. G. Ausiello, A. D'Atri, and M. Moscarini, Chordality properties on graphs and minimal conceptual connections in semantic data models, J. Comput. System Sci. 33 (1986), 179-202.
4. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, On the desirability of acyclic database schemes, J. ACM 3 (1983), 479-513.
5. C. Berge, "Hypergraphs," North-Holland, Amsterdam, 1989.
6. A. D'Atri and M. Moscarini, Recognition algorithms and design methodology for acyclic database schemes, in "Advances in Computing Research" (P. Kanellakis and F. Preparata, Eds.), Vol. 3, JAI Press, Greenwich, CT, 1986.
7. A. D'Atri and M. Moscarini, On hypergraph acyclicity and graph chordality, Inf. Process. Lett. 29 (1988), 271-274.
8. R. Fagin, Degrees of acyclicity for hypergraphs and relational database schemes, J. ACM 3 (1983), 514-550.
9. N. Goodman, O. Shmueli, and Y. C. Tay, GYO reductions, canonical connections, tree and cyclic schemas, and tree projections, J. Comput. System Sci. 29 (1984), 338-358.
10. M. Gyssens, P. G. Jeavons, and D. A. Cohen, Decomposing constraint satisfaction problems using database techniques, Artif. Intell. 66 (1994), 57-89.
11. D. Maier, D. Rozenshtein, and D. S. Warren, Window functions, in "Advances in Computing Research" (P. Kanellakis and F. Preparata, Eds.), Vol. 3, JAI Press, Greenwich, CT, 1986.
12. D. Maier and J. D. Ullman, Connections in acyclic hypergraphs, Theor. Comput. Sci. 32 (1984), 185-199.
13. F. M. Malvestuto, Answering queries in categorical databases, in "Proc. of the VI ACM Symp. on Principles of Database Systems, 1987," pp. 82-89.
14. F. M. Malvestuto, A universal table model for categorical databases, Inform. Sci. 49 (1989), 203-223.
15. F. M. Malvestuto and M. Moscarini, "Separability of Hypergraphs by Partial Edges," Research Report SI/05 Dipartimento di Scienze dell'Informazione, I University of Rome, 1994.
16. Y. Sagiv and O. Shmueli, Solving queries by tree projections, ACM-TODS 18 (1993), 487-511.
17. R. E. Tarjan and M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (1984), 566-591.
18. J. D. Ullman, "Principles of Database and Knowledge-Base Systems," Vol. II, The New Technologies, Computer Science Press, Rockville, MD, 1989.