Article

Free access

Implementation of the CORAL deductive database system

Authors:

Raghu Ramakrishnan,

Divesh Srivastava,

Praveen SeshadriAuthors Info & Claims

SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data

Pages 167 - 176

https://doi.org/10.1145/170035.170067

Published: 01 June 1993 Publication History

Abstract

CORAL is a deductive database system that supports a rich declarative language, provides a wide range of evaluation methods, and allows a combination of declarative and imperative programming. The data can be persistent on disk or can reside in main-memory. We describe the architecture and implementation of CORAL.

There were two important goals in the design of the CORAL architecture: (1) to integrate the different evaluation strategies in a reasonable fashion, and (2) to allow users to influence the optimization techniques used so as to exploit the full power of the CORAL implementation. A CORAL declarative program can be organized as a collection of interacting modules and this modular structure is the key to satisfying both these goals. The high level module interface allows modules with different evaluation techniques to interact in a transparent fashion. Further, users can optionally tailor the execution of a program by selecting from among a wide range of control choices at the level of each module.

CORAL also has an interface with C++, and users can program in a combination of declarative CORAL, and C++ extended with CORAL primitives. A high degree of extensibility is provided by allowing C++ programmers to use the class structure of C++ to enhance the CORAL implementation.

References

[1]

i. Balbin and K. Ramamohanarao. A generalization of the differential approach to recursive query evaluation, journal of Logic Programming, 4(3), September 1987.]]

Digital Library

[2]

M. Carey, D. DeWitt, G. Graefe, D. Haight, j. Richardson, D. Schuh, E. Shekita, and S. Vandenberg. The EXODUS extenslble DBMS project: An overview. In Readings in Object- Oriented Databases. Morgan-Kaufman, 1990.]]

Digital Library

[3]

D. Chlmenti, R. Gumbos, R. Krishnamurthy, S. Naqvi, S. Tsur, and C. Zaniolo. The LDL system prototype. IEEE Transactions on Knowledge and Data Engineering, 2(1):76- 90, 1990.]]

Digital Library

[4]

B. Freltag, H. Sch/itz, and G. Specht. LOLA - a logic language for deductive databases and its implementation. In Proceedings of #nd International Symposium on Database Systems }or Advanced Applications (DASFAA), 1991.]]

Digital Library

[5]

E. Goto. Monocopy and associative algorithms in an extended lisp. Technical Report 74-03, information Science Laboratory, Univ. of Tokyo, Tokyo, Japan, May 1974.]]

[6]

M. Jeusfeld and M. Staudt. Query optimization in deductive object bases. In G. J.C. Freytag, G. Vossen and D. Mater, editors, Query Processing }or Advanced Database Applications. Morgan-Kaufmann, 1993.]]

[7]

D. Kemp, K. Ramamohanarao, and Z. Somogyi. Right-, left-, and multi-linear rule transformations that maint#n context information. In Proceedings of the International Con- }erence on Very Large Databases, pages 380-391, Brisbane, AustrAlia, 1990.]]

Digital Library

[8]

G. Kiernan, C. de Maindreville, and E. Simon. Making deductive database a practical t#ology: a step forward. In Proceedings o.f the A CM SIGMOD Conference on M#nagement of Data, 1990.]]

Digital Library

[9]

W. Kieflling and H. Schmidt. DECLARE and SDS: Early efforts to commercialize deductive database technology. Submitted to the VLDB Journal., 1993.]]

Digital Library

[10]

A. Lefebvre. Towards an efficient evaluation of recursive aggregates in deductive d#tabases. In Proceedings of the International Conference on Fifth Generation Computer Systents, June 1992.]]

[11]

K. Morris, J. D. Unman, and A. Van Gelder. Degi#n overview of the NAIL! system. In Proceedings of the Third International Conference on Logic Programming, 1980.]]

Digital Library

[12]

I. S. Mumick, H. Pirahesh, and B. Ramakrishnan. Duplicates and aggregates in deductive databases, in Proceedings of the Si#rteenth International Conference on Very Large Databases, Aug. 1990.]]

Digital Library

[13]

S. Naqvl and S. Tsur. A Logical Language for Data and KnouJledge Bases. Principles of Computer Science. Computer Science Press, New York, 1989.]]

Digital Library

[14]

J. F. Naughton, R. Ramakrishnan, Y. Sagiv, and J. D. Ullman. Argument reduction through factoring. In Proceedings of the Fifteenth International Conference on Ver3t Large Databases, pages 173-t82, Amsterdam, The Netherlands, August 1989.]]

Digital Library

[15]

G. Phipps, M. A. Derr, and K. A. Ross. Glue-NAIL!: A deductive database system. In Proceedings of the A CM SIG- MOD Conference on Management of Data, pages 308-317, 1991.]]

Digital Library

[16]

R. Ramakrishnan. Magic Templates: A spellbinding approach to logic programs. In Proceedings of the International Conference on Logic Programming, pages 140-159, Seattle, Washington, August 1988.]]

[17]

R. Ramakrishna#, C. Beeri, and R. Krishnamurthy. Optimizing existential Datalog queries. In Proceedings of the ACM Symposium on Principles of D#tabase S#stems, pages 89-102, Austin, Texas, March 1988.]]

Digital Library

[18]

R. Ramakrishnan, P. Bothner, D. Srivastava, and S. Sudarshan. CORAL: A database programming language. In J. ChoraleS, editor, Proceedings of the NA CLP '90 Workshop on Deductive Databases, October 1990. Available as Report TR-CS-90-14, Department of Computing and Information Sciences, Kansas State University.]]

[19]

R. Ramakrishnan, P. Seshadri, D. Srivastava, and S. Sudarshun. The CORAL user manual: A tutorial introduction to CORAL. Manuscript, 1993.]]

[20]

R. Ramakrishnan, D. Srivastava, and S. Sudarshan. Rule ordering in bottom-up fix-point evaluation of logic programs. IEEE Transactions on Knowledge and Data Engineering (to appear). A shorter version appeared in VLDB, 1990.]]

Digital Library

[21]

R. Ramakrislman, D. Srivastava, and S. Sudarshan. Controlling the search in bottom-up evaluation. In Proceedings of the Joint International Conference and S#/mposium on Logic Programming, 1992.]]

[22]

R. Ramakrishnan, D. Srivastava, and S. Sudarshan. CORAL: Control, Relations and Logic. In Proceedings of the International Conference on Very Large Databases, 1992.]]

Digital Library

[23]

R. Ramakrishnan, D. Srivastava, and S. Sudarshan. Efficient bottom-up evaluation of logic programs. In J. Vandewane, editor, The State of the Art in Computer Systems and Software Engineering. Kluwer Academic Pubfishers, 1992.]]

[24]

R. Ramakrishnan and S. Sudarshan. Top-Down vs. Bottom- Up Revisited. In Proceedings of the International Logic Programming Symposium, 1991.]]

[25]

D. Srlvastava, R. Ramakrishnan, P. Seshadri, and S. Sudarshan. CORAL++: Adding object-orientation to a logic database language. Submitted.]]

[26]

S. Sudarshan and #ghu Ramakrlshnan. Optimizations of bottom-up evaluation with non-ground ter#s. In JICSLP'9# Post-Conference Workshop on Deductive Databases, 1992.]]

Digital Library

[27]

S. Tsur and C. Zaniolo. LDL: A logic-based data-language. In Proceedings of the T#velflh International Conference on Very Large Data B#ses, pages 33-41, Kyoto, Japan, August 1986.]]

Digital Library

[28]

J. Vaghani, K. Ramamohanarao, D. Kemp, Z. Somogyi, and P. Stuckey. The Aditi deductive database system. In Proceedings of the NA CLP'90 Workshop on Deductive Database Systems, 1990.]]

[29]

L. Vieille, P. Bayer, V. Kfichenhoff, and A. Lefebvre. EKS- V1, a short overview. In AAAI-90 Workshop on Knowledge Base Management Systems, 1990.]]

Cited By

Ordonez CTosic P(2018)Time Complexity and Parallel Speedup of Relational Queries to Solve Graph ProblemsDatabase and Expert Systems Applications10.1007/978-3-319-98812-2_30(339-349)Online publication date: 9-Aug-2018
https://doi.org/10.1007/978-3-319-98812-2_30
Miao JHuang JZhao J(2016)TopPRFACM Transactions on Information Systems10.1145/295623434:4(1-36)Online publication date: 29-Aug-2016
https://dl.acm.org/doi/10.1145/2956234
Mancas C(2015)Data, Information and Knowledge in the Computer EraConceptual Data Modeling and Database Design: A Fully Algorithmic Approach, Volume 110.1201/b19279-2(1-34)Online publication date: 29-Sep-2015
https://doi.org/10.1201/b19279-2
Show More Cited By

Index Terms

Implementation of the CORAL deductive database system

Recommendations

Implementation of the CORAL deductive database system

CORAL is a deductive database system that supports a rich declarative language, provides a wide range of evaluation methods, and allows a combination of declarative and imperative programming. The data can be persistent on disk or can reside in main-...
The CORAL deductive system
Prototypes of deductive database systems

CORAL is a deductive system that supports a rich declarative language, and an interface to C++, which allows for a combination of declarative and imperative programming. A CORAL declarative program can be organized as a collection of interacting ...
Design and Implementation of the Relationlog Deductive Database System
DEXA '98: Proceedings of the 9th International Workshop on Database and Expert Systems Applications

We describe the design and implementation of Relationlog, a persistent deductive database system. Unlike other related systems such as Aditi, CORAL, LDL, LOLA and Nail-Glue, Relationlog supports effective storage, efficient access and inference of large ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data

June 1993

566 pages

ISBN:0897915925

DOI:10.1145/170035

Editors:
Peter Buneman
Univ. of Pennsylvania
,
Sushil Jajodia

ACM SIGMOD Record Volume 22, Issue 2
June 1, 1993
558 pages
ISSN:0163-5808
DOI:10.1145/170036
Editors:
Peter Buneman
Univ. of Pennsylvania
,
Sushil Jajodia,
Won Kim
UniSQL, Inc., Austin, TX
Issue’s Table of Contents

Copyright © 1993 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS93

Sponsor:

SIGMOD/PODS93: Joint ACM SIGMOD International Conference on Management of Data and ACM SIGMOD

May 25 - 28, 1993

D.C., Washington, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

49
Total Citations
View Citations
441
Total Downloads

Downloads (Last 12 months)50
Downloads (Last 6 weeks)12

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

Ordonez CTosic P(2018)Time Complexity and Parallel Speedup of Relational Queries to Solve Graph ProblemsDatabase and Expert Systems Applications10.1007/978-3-319-98812-2_30(339-349)Online publication date: 9-Aug-2018
https://doi.org/10.1007/978-3-319-98812-2_30
Miao JHuang JZhao J(2016)TopPRFACM Transactions on Information Systems10.1145/295623434:4(1-36)Online publication date: 29-Aug-2016
https://dl.acm.org/doi/10.1145/2956234
Mancas C(2015)Data, Information and Knowledge in the Computer EraConceptual Data Modeling and Database Design: A Fully Algorithmic Approach, Volume 110.1201/b19279-2(1-34)Online publication date: 29-Sep-2015
https://doi.org/10.1201/b19279-2
Ordonez CGurram ARai NSong ISimitsis ACuzzocrea A(2014)Recursive Query Evaluation in a Column DBMS to Analyze Large GraphsProceedings of the 17th International Workshop on Data Warehousing and OLAP10.1145/2666158.2666177(71-80)Online publication date: 7-Nov-2014
https://dl.acm.org/doi/10.1145/2666158.2666177
Tan GYin ZJiang H(2013)Trap arrayACM SIGMETRICS Performance Evaluation Review10.1145/2494232.246554441:1(317-328)Online publication date: 17-Jun-2013
https://dl.acm.org/doi/10.1145/2494232.2465544
Attiya H(2011)Sharing memories, robustlyACM SIGACT News10.1145/2078162.207817942:4(79-82)Online publication date: 13-Dec-2011
https://dl.acm.org/doi/10.1145/2078162.2078179
Chen X(2011)Guest columnACM SIGACT News10.1145/2078162.207817742:4(54-76)Online publication date: 13-Dec-2011
https://dl.acm.org/doi/10.1145/2078162.2078177
Ordonez C(2010)Optimization of Linear Recursive Queries in SQLIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2009.8322:2(264-277)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.1109/TKDE.2009.83
Lam MWhaley JLivshits VMartin MAvots DCarbin MUnkel CGottlob GAfrati F(2005)Context-sensitive program analysis as database queriesProceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1065167.1065169(1-12)Online publication date: 13-Jun-2005
https://dl.acm.org/doi/10.1145/1065167.1065169
Zaniolo C(2005)The nonmonotonic semantics of active rules in deductive databasesDeductive and Object-Oriented Databases10.1007/3-540-63792-3_20(265-282)Online publication date: 17-Aug-2005
https://doi.org/10.1007/3-540-63792-3_20
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents