Vista, D. and Wood, Peter (1993) Efficient evaluation of visual queries using deductive databases. In: Ramakrishnan, R. (ed.) Applications of Logic Databases. The Kluwer International Series in Engineering and Computer Science 296. Kluwer, pp. 143-161. ISBN 9781461522072.
Abstract
Book synopsis: The premise behind developing powerful declarative database languages is compelling: by enabling users to specify their queries (and their integrity constraints) in a clear, non-operational way, they make the user's task easier, and provide the database system with more opportunities for optimization. Relational database systems offer a striking proof that this premise is indeed valid. The most popular relational query language, SQL, is based upon relational algebra and calculus, i.e., a small fragment of first-order logic, and the ease of writing queries in SQL (in comparison to more navigational languages) has been an important factor in the commercial success of relational databases. It is well-known that SQL has some important limitations, in spite of its success and popUlarity. Notably, the query language is non-recursive, and support for integrity constraints is limited. Indeed, recognizing these problems, the latest standard, SQL-92, provides increased support for integrity constraints, and it is anticipated that the successor to the SQL-92 standard, called SQL3, RECURSIVE UNION operation [1]. Logic database systems have will include a concentrated on these extensions to the relational database paradigm, and some systems (e.g., Bull's DEL prototype) have even incorporated object-oriented features (another extension likely to appear in SQL3).
Metadata
Item Type: | Book Section |
---|---|
School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
Depositing User: | Sarah Hall |
Date Deposited: | 18 Oct 2021 16:34 |
Last Modified: | 09 Aug 2023 12:52 |
URI: | https://eprints.bbk.ac.uk/id/eprint/46339 |
Statistics
Additional statistics are available via IRStats2.