This Article 
 Bibliographic References 
 Add to: 
Processing Implication on Queries
October 1989 (vol. 15 no. 10)
pp. 1168-1175

[1] S. Finkelstein, "Common expression analysis in database applications," inProc. 1982 ACM-SIGMOD Int. Conf. Management of Data, Orlando, FL, June 1982.
[2] P.-Å. Larson and H. Z. Yang, "Computing queries from derived relations," inProc. 11th Int. Conf. Very Large Databases, 1985, pp. 259-269.
[3] D. J. Rosenkrantz and H. B. Hunt III, "Processing conjunctive predicates and queries," inProc. 6th Int. Conf. Very Large Databases, 1980, pp. 64-72.
[4] S. Even,Graph Algorithms. Rockville, MD: Computer Science Press, 1979.
[5] M. Jarke and J. Koch, "Query optimization in database systems,"ACM Comput. Surveys, vol. 16, no. 2, June 1984.
[6] M. Jarke, "Common subexpression isolation in multiple query optimization," inQuery Processing in Database Systems, W. Kim, D. Reiner, and D. Batory, Eds. New York: Springer.
[7] N. N. Kamel, "The use of controlled redundancy in self-adaptive databases." Ph.D. dissertation, Dep. Comput. Sci., Univ. Colorado, Boulder, Aug. 1985.
[8] N. N. Kamel, "Performance enhancements of rete networks through the use of page-nodes," inProc. 3rd IEEE Conf. Artificial Intelligence Applications, Orlando, FL, 1987.
[9] N. N. Kamel and R. King, "Optimal management of temporaries in distributed databases," inProc. Second Int. Conf. Supercomputing, 1986.
[10] H. Hermes,Introduction to Mathematic Logic. New York: Springer-Verlag.
[11] T. K. Sellis, "Global query optimization," inProc. ACM SIGMOD, May 1986, pp. 191-205.
[12] R. Munz, H.-J. Schneider, and F. Steyer, "Application of subpredicate tests in database systems," inProc. 5th Very Large Data Base Conf., 1979, pp. 426-435.
[13] J. A. Blakeley, N. Coburn, and P.-A. Larson, "Updating derived relations: Detecting irrelevant and autonomously computable updates," inProc. Very Large Data Bases, 1986, pp. 457-466.
[14] J. Blakeley, P. Larson, and F. Tompa, "Efficiently updating materialized views," inProc. ACM-SIGMOD Int. Conf Management of Data, Washington, May 28-30, 1986.
[15] C. H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[16] D. Maier and J. D. Ullman, "Fragments of relations," inProc. ACM SIGMOD Conf., 1983, pp. 15-22.
[17] J. Cheiney, P. Faudemay, and R. Michel, "An extension of access paths to improve joins and selections," inProc. Int. Data Eng., 1986.
[18] S. Ceri, M. Negri, and G. Pelagatti, "Horizontal data partitioning in database design," inProc. ACM SIGMOD Conf., 1982, pp. 128-136.

Index Terms:
Database; Derivability Problem; Directed Graph; Implication Problem; Mathematical Logic; NP-hard; project-select-joint queries; satisfiabilitya
Xian-he Sun, N.N. Kamel, L.M. Ni, "Processing Implication on Queries," IEEE Transactions on Software Engineering, vol. 15, no. 10, pp. 1168-1175, Oct. 1989, doi:10.1109/TSE.1989.559764
Usage of this product signifies your acceptance of the Terms of Use.