On implicate discovery and query optimization

Proceedings of the International Database Engineering and Applications Symposium, IDEAS

Volumn 2002-January, Issue , 2002, Pages 2-11

  Vorwerk, K ^a,b   Paulley, G N ^a  

^a Ianywhere Solutions   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Boolean functions; Computer science; Explosions; Hardware; History; Logic; Minimization; Query processing; Relational databases; Switching circuits

Indexed keywords

BOOLEAN FUNCTIONS; CHOPPERS (CIRCUITS); COMPUTER SCIENCE; EXPLOSIONS; HARDWARE; HISTORY; MANY VALUED LOGICS; OPTIMIZATION; QUERY LANGUAGES; QUERY PROCESSING; SWITCHING CIRCUITS;

AUTOMATED REASONING; BOOLEAN EXPRESSIONS; COMBINATORIAL EXPLOSION; LOGIC; NORMALIZATION ALGORITHMS; QUERY OPTIMIZATION; RELATIONAL DATABASE; THREE-VALUED LOGIC;

COMPUTER HARDWARE;

EID: 84948770592     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDEAS.2002.1029651     Document Type: Conference Paper

References (33)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers-Principles, Techniques and Tools. Addison-Wesley, Reading, Massachusetts, 1986.
2. C.-Y. Chan and Y. E. Ioannidis. An efficient bitmap encoding scheme for selection queries. In ACM SIGMOD International Conference on Management of Data, pages 215-226, Philadelphia, Pennsylvania, May 1999. Association for Computing Machinery.
3. A. K. Chandra and G. Markowsky. On the number of prime implicants. Discrete Mathematics, 24(1):7-11, 1978.
4. O. Coudert. On solving covering problems. In Proceedings of the 33rd Annual Conference on Design Automation, pages 197-202, Las Vegas, Nevada, June 1996. Association for Computing Machinery.
5. O. Coudert and J. C. Madre. Implicit and incremental computation of primes and essential primes of Boolean functions. In Proceedings of the 29th Annual Conference on Design Automation, pages 36-39, Anaheim, California, June 1992. IEEE Computer Society Press.
6. H. Garcia-Molina, J. D. Ullman, and J. Widom. Database System Implementation. Prentice-Hall, Upper Saddle River, New Jersey, 2000.
7. J. Goldstein and P.-Å. Larson. Optimizing queries using materialized views: A practical, scalable solution. In ACM SIGMOD International Conference on Management of Data, pages 331-342, Santa Barbara, California, May 2001. Association for Computing Machinery.
8. H. R. Hwa. A method for generating prime implicants of a Boolean expression. IEEE Transactions on Computers, 23:637-641, June 1974.
9. International Standards Organization. (ANSI/ISO) 9075-2, SQL Foundation, Sept. 1999.
10. P. Jackson. Computing prime implicates. In Proceedings of the ACM Conference on Computer Science, pages 65-72, Kansas City, Missouri, Mar. 1992. Association for Computing Machinery.
11. P. Jackson. Computing prime implicates incrementally. In Proceedings, 11th International Conference on Automated Deduction, pages 253-267, Sarasota Springs, New York, June 1992. Springer-Verlag. Available as Springer-Verlag's Lecture Notes in Computer Science Volume 607.
12. P. Jackson and J. Pais. Computing prime implicants. In Proceedings, 10th International Conference on Automated Deduction, pages 543-557, Kaiserlautern, Germany, July 1990. Springer-Verlag Lecture Notes in Computer Science Volume 449.
13. G. Karnaugh. The map method for synthesis of combinational logic circuits. Transactions on Communications and Electronics, Part 1, 72:593-599, Nov. 1953.
14. A. Kean and G. K. Tsiknis. An incremental method for generating prime implicants/implicates. Journal of Symbolic Computation, 9(2):185-206, Feb. 1990.
15. A. Y. Levy, I. S. Mumick, and Y. Sagiv. Query optimization by predicate move-around. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 96-107, Santiago, Chile, Sept. 1994. Morgan Kaufmann.
16. C. Mohan, D. Haderle, Y. Wang, and J. Cheng. Single table access using multiple indexes: Optimization, execution, and concurrency control techniques. In F. Bancilhon, C. Thanos, and D. Tsichritzis, editors, Advances in Database Technology - EDBT' 90 (Proceedings of the 2nd International Conference on Extending Database Technology), pages 29-43. Springer-Verlag, Venice, Italy, Mar. 1990.
17. N. V. Murray and E. Rosenthal. Dissolution: Making paths vanish. Journal of the ACM, 40(3):504-535, 1993.
18. P. O'Neil. Database: Principles, Programming, Performance. Morgan-Kaufmann, San Francisco, California, 1994.
19. P. E. O'Neil. The set query benchmark. In J. Gray, editor, The Benchmark Handbook for Database and Transaction Processing Systems, pages 359-395. Morgan-Kaufmann, San Francisco, California, second edition, 1993.
20. L. Palopoli, F. Pirri, and C. Pizzuti. Algorithms for selective enumeration of prime implicants. Artificial Intelligence, 111(1-2):41-72, July 1999.
21. W. V. Quine. The problem of simplifying truth functions. American Mathematics Monthly, 59:521-531, 1952.
22. W. V. Quine. A way to simplify truth functions. American Mathematics Monthly, 62:627-631, 1955.
23. W. V. Quine. On cores and prime implicants of truth functions. American Mathematics Monthly, 66:755-760, 1959.
24. A. Ramesh, G. Becker, and N. V. Murray. CNF and DNF considered harmful for computing prime implicants/implicates. Journal of Automated Reasoning, 18(3):337-356, 1997.
25. A. Ramesh and N. V. Murray. Non-clausal deductive techniques for computing prime implicants and prime implicates. In Proceedings, 4th International Conference on Logic Programming and Automated Reasoning, pages 277-288, St. Petersburg, Russia, July 1993. Springer-Verlag Lecture Notes in Computer Science 698.
26. S. Shekhar, J. Srivastava, and S. Dutta. A formal model of trade-off between optimization and execution costs in semantic query optimization. In Proceedings of the 14th International Conference on Very Large Data Bases, pages 457-467, New York, New York, Aug. 1988. Morgan Kaufmann.
27. J. R. Slagle, C.-L. Chang, and R. C. T. Lee. A new algorithm for generating prime implicants. IEEE Transactions on Computers, 19(4):304-310, 1970.
28. R. Socher. Optimizing the clausal normal form transformation. Journal of Automated Reasoning, 7(3):325-336, Sept. 1991.
29. P. Tison. Generalized consensus theory and its application to the minimization of Boolean functions. IEEE Transactions on Electronic Computers, EC-16(4):446-456, 1967.
30. Transaction Processing Performance Council, San Jose, California. TPC Benchmark H (Decision Support) Standard Specification, Revision 1.1.0, June 1999.
31. K. Vorwerk and G. N. Paulley. Implicate discovery and query optimization in SQL Anywhere Studio. Technical report, iAnywhere Solutions, Waterloo, Ontario, Dec. 2000.
32. Y. Wang. Transforming normalized Boolean expressions into minimal normal forms. Master's thesis, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1992.
33. W. Zhang and P.-Å. Larson. SQL Predicate Conversion in Multidatabase Systems. University of Waterloo, Waterloo, Ontario, Canada, Jan. 1996. Unpublished manuscript, 20 pages.