Jiawei Han
Ling Liu
ABSTRACT
A deductive database system prototype, LogicBase, has been developed, with an emphasis on efficient compilation and query evaluation of application-oriented recursions in deductive databases. The system identifies different classes of recursions and compiles recursions into chain or psuedo-chain forms when appropriate. Queries posed to the compiled recursions are analyzed systematically with efficient evaluation plans generated and executed, mainly based on a chained-based query evaluation method. The system has been tested using sophisticated recursions and queries with satisfactory performance. This paper introduces the general design principles and implementation techniques of the system and discusses its strength and limitations.
- 1.F. Bancflhon, D. Maier, Y. Sagiv, and J. D. Ultman. Magic sets and other strange ways to implement logic programs. In Proc. 5th A CM Syrup. Principles of Database Systems, pages 1-15, Cambridge, MA, March 1986. Google Scholar
Digital Library
- 2.F. Bancilhon and R. Ramakrishnan. An amateur's introduction to recursive query processing strategies. In Proc. 1986 A CM-SIGMOD Int. Conf. Management of " Data, pages 16-52, Washington, DC, May 1986. Google ScholarDigital Library
- 3.C. Beeri and R. Ramakrishnan. On the power of magic. In Proc. 6th A CM Syrup. Principles oJ Database Systems, pages 269-283, San Diego, CA, March 1987. Google ScholarDigital Library
- 4.W. Chen, M. Kifer, and D. S. Warren. Hflog: A foundation for higher-order logic programming. J. Logic Programming, 15:187-230, 1993. Google ScholarDigital Library
- 5.D. Chimenti, It. Gamboa, R. Krishnamurthy, S. Naqvi, S. Tsur, and C. Zaniolo. The LDL system prototype. IEEE Trans. Knowledge and Data Engineering, 2:76- 90, 1990. Google ScholarDigital Library
- 6.J. Han. Multi-way counting method. Information Systems, 14:219-229, 1989. Google ScholarDigital Library
- 7.J. Hazl. Constraint-based query evaluation in deductive databases. IEEE Trans. Knowledge and Data Engineering, 6:96-107, 1994. Google ScholarDigital Library
- 8.J. Han and L. V. S. Lakshmanan. Evaluation of regular nonhnear recursions by deductive database techniques. In SFU CSS/LCCR Technical Report TR93-09, Simon Fraser University, July 1993.Google Scholar
- 9.J. Han, L. Liu, and Z. Xie. LogicBase: A system prototype for deductive query evaluation. In Proc. i993 ILPS Workshop on Programm,ng with Logic Databases, pages 146-160, Vancouver, Canada, October 1993.Google Scholar
- 10.J. Han and T. Lu. N-queens problem revisited: A deductive database approach. In Proc. 1992 IJCSLP Workshop on Deductive Databases, pages 48-55, Washinton D.C., Nov. 1992.Google Scholar
- 11.J. Han and W. Lu. Asynchronous chain recursions. IEEE Trans. Knowledge and Data Engineering, 1:185- 195, 1989. Google ScholarDigital Library
- 12.J. Han and K. Zeng. Automatic generation of compiled forms for linear recursions. Information Systems, 17:299-322, 1992. Google ScholarDigital Library
- 13.Y. E. ioannidis and R. Ramakrishnan. Efficient transitive closure algorithms. In Proc. 14th Int. Conf. Very Large Data Bases, pages 382-394, Long Beach, CA, August 1988. Google ScholarDigital Library
- 14.B. Jiang. A suitable algorithm for computing partial transitive closures. In Proc. 6th Int. Con}. Data Engineering, pages 264-271, Los Angeles, CA, February 1990. Google ScholarDigital Library
- 15.R. E. Korf. Linear-space best-first search: Summary of results. In Proc. lOth National Con}. on AL AAA1-92, pages 533-538, San Jose, CA, July 1992.Google Scholar
- 16.M. J. Maher and P. J. Stuckey. Expanding query power in constraint logic programming languages. In Proc. 1989 North American Con}. Logic Programming, pages 20-36, Cleveland, OH, Oct. 1989.Google Scholar
- 17.S. Morishita, M. Derr, and G. Phipps. Design and implementation of the Glue-Nail database system. In Proc. 1993 A CM-SIGMOD Conf. Management o.f Data, pages 147-156, Washington, DC, May 1993. Google ScholarDigital Library
- 18.I.S. Mumick, H. Pirahesh, and R. Ramakrishnan. The magic of duplicates and aggregates. In Proc. 16th Int. Con}. Very Large Data Bases, pages 264-277, Brisbame, Australia, August 1990. Google ScholarDigital Library
- 19.R. Ramakrishnan, D. Srivastava, and S. Sudarshan. Coral- control, relations and logic. In Proc. 18th Int. Con}. Very Large Data Bases, pages 547-559., Vancouver, Canada, August 1992. Google ScholarDigital Library
- 20.K. Ross and Y. Sagiv. Monotonic aggregation in deductive databases. In Proc. 11th A CM Syrup. Principles of Database Systems, pages 114-126, San Diego, CA, June 1992. Google ScholarDigital Library
- 21.K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. In Proc. 199# A CM SIGMOD Int. Conf. Management of Data, pages 442- 453, Minneapolis, MN, 1994. Google ScholarDigital Library
- 22.A. Sflberschatz, M. Stonebraker, and J. D. Unman. Database systems: Achievements and opportunities. Comm. A CM, 34:94-109, 1991. Google ScholarDigital Library
- 23.D. Srivastava, R. Ramakrishnan, P. Seshadri, and S. Sudarshan. CorM++: Adding object-orientation to a logic database language. In Proc. 19th Int. Conf. Very Large Data Bases, Dublin, Ireland, August 1993. Google ScholarDigital Library
- 24.L. Sterling and E. Shapiro. The Art of Prolog. The MIT Press, 1986.Google Scholar
- 25.L. A. Taylor and R. E. Korf. Pruning duplicate nodes in depth-first search, in Proc. 11th National Con}. on AI, AAAI-93, pages 756-761, Washington, D.C., July 1993.Google Scholar
- 26.J. D. Ullman. Principles of Database and Knowledge- Base Systems, Vol. 2. Computer Science Press, 1989. Google ScholarDigital Library
- 27.J. Vaghani, K. Ramaznohanarao, D. Kemp, Z. Somogyi, and P. Stuckey. An introduction to the ADITI deductive database system. Australian Computer Journal, 23:37-52, 1991. Google ScholarDigital Library
- 28.P. van Hentenryck. Constraint Satisfaction #n Logic Programming. MIT Press, 1989. Google ScholarDigital Library
- 29.L. Vieille, P. Bayer, V. Kuchenhoff, and A. Lefebvre. EKS-V1, a short overview. In AAAI-90 Workshop on Knowledge Base Management Systems, Boston, MA, July 1990.Google Scholar
- 30.W. Zhang and R. E. Korf. Depth-first vs. best-first search: New results. In Proc. 11th National Con}. on AI, AAAI-93, pages 769-775, Washington, D.C., July 1993.Google Scholar
Index Terms
- LogicBase: a deductive database system prototype
Recommendations
RQL: A Recursive Query Language
Different classes of recursive queries in the relational databases are identified. It is shown that existing proposals to extend the relational query languages are either not powerful enough to express queries in many of these classes or use nonfirst ...
Comments