Abstract
One of the problems facing the designers of a deductive database is that of the choice of query language. The deductive database model is seen as a natural progression from the ralational model; the query language should reflect this. This paper reports the decisions taken while designing an extended form of SQL, called SQUIRREL, as the query language for a Prolog-based deductive database. The extensions relate to the inclusion of both rules and incomplete information in the query language and result in changes to the data definition, data manipulation and query languages of SQL. The extensions were constrained by the desire to retain the existing SQL texture in the new language while introducing concepts such as rules, rule manipulation and incomplete information which are alien to the relational philosophy. The language we describe is being used as the interface language for an implementation of a deductive database which will run on a version of Prolog developed to handle database applications.
| Original language | English |
|---|---|
| Pages (from-to) | 535-546 |
| Number of pages | 12 |
| Journal | Computer Journal |
| Volume | 33 |
| Issue number | 6 |
| Publication status | Published - Dec 1990 |