Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-27T11:54:04.414Z Has data issue: false hasContentIssue false

The deductive database system [Lscr ][Dscr ][Lscr ]++

Published online by Cambridge University Press:  18 December 2002

FAIZ ARNI
Affiliation:
InferData Corporation, 8200 N. MoPac Expressway, Austin, TX 78759, USA (e-mail: farni@inferdata.com)
KAYLIANG ONG
Affiliation:
Trilogy Inc., 5001 Plaza on the Lake, Austin, TX 78746, USA (e-mail: kayliang.ong@trilogy.com)
SHALOM TSUR
Affiliation:
BEA Systems, 2315 N. First Street, San Jose, CA 95131, USA (e-mail: dicktsur@bea.com)
HAIXUN WANG
Affiliation:
IBM T. J. Watson Research Center, 30 Saw Mill River Rd., Hawthorne, NY 10532, USA (e-mail: haixun@us.ibm.com)
CARLO ZANIOLO
Affiliation:
Computer Science Department, University of California, Los Angeles, CA 90095, USA (e-mail: zaniolo@cs.ucla.edu)

Abstract

This paper describes the [Lscr ][Dscr ][Lscr ]++ system and the research advances that have enabled its design and development. We begin by discussing the new nonmonotonic and nondeterministic constructs that extend the functionality of the [Lscr ][Dscr ][Lscr ]++ language, while preserving its model-theoretic and fixpoint semantics. Then, we describe the execution model and the open architecture designed to support these new constructs and to facilitate the integration with existing DBMSs and applications. Finally, we describe the lessons learned by using [Lscr ][Dscr ][Lscr ]++ on various tested applications, such as middleware and datamining.

Type
Research Article
Copyright
© 2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)