ACM Home Page
Please provide us with feedback. Feedback
Implementation of the CORAL deductive database system
Full text PdfPdf (1.13 MB)
Source International Conference on Management of Data archive
Proceedings of the 1993 ACM SIGMOD international conference on Management of data table of contents
Washington, D.C., United States
Pages: 167 - 176  
Year of Publication: 1993
ISBN:0-89791-592-5
Also published in ...
Authors
Raghu Ramakrishnan  Computer Science Department, University of Wisconsin, Madison, WI and AT&T Bell Laboratoriez, 600 Mountain Avenue, Murray Hill, NJ
Divesh Srivastava  University of Wisconsin, Madison
S. Sudarshan  University of Wisconsin, Madison
Praveen Seshadri  University of Wisconsin, Madison
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 30,   Citation Count: 15
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/170035.170067
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
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
8
 
9
 
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
 
12
 
13
 
14
15
 
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
 
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
 
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
 
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.
 
27
 
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  15

Collaborative Colleagues:
Raghu Ramakrishnan: colleagues
Divesh Srivastava: colleagues
S. Sudarshan: colleagues
Praveen Seshadri: colleagues