Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Logic, algebra and databases
Gray P. (ed), John Wiley & Sons, Inc., New York, NY, 1984. Type: Book (9789780470202593)
Date Reviewed: Nov 1 1986

The aim of the book is to provide an informal approach to databases and the languages used to manipulate them. The author has succeeded with his objective and has developed an eminently readable book without encumbering it with theorems. Readers who have some background in programming languages should be able to read the text.

The first chapter provides background material on propositional logic. The second chapter presents material on predicate logic. Both chapters provide descriptive material and read well. Readers who know logic may easily skip the chapters. The third chapter describes lambda expressions and list processing useful for comprehending database query languages based on applicative or functional languages. Readers who are familiar with the LISP language will find good material here.

The first exposure that one receives to databases is through the logic programming language PROLOG. The reader learns how to retrieve clauses. He or she also learns about the backtracking mechanism in PROLOG, recursive programming, and some of the non-logical operators, such as “cut,” “assert,” and “retract.” The material is described well. Unfortunately, the author does not make it clear that PROLOG, as currently constituted, is oriented towards databases that reside in main memory.

Chapters 5 through 8 describe various database languages: KRC, a functional programming language (Chapter 5); the relational model (Chapter 6); calculus-based languages, QUEL, SQL, and QBE (Chapter 7); and a relational algebra-based language, ASTRID (Chapter 8).

Syntactic query transformations useful for optimizing search in the relational algebra and relational calculus are covered in Chapter 9. The reader comes away with an appreciation of the various transformations used and how they help to speed retrieval.

The functional data model as embodied in DAPLEX is explicated in Chapter 10. The final two chapters describe the CODASYL Data Base Task Group approach to networks and cover the Bachman diagrams for representing schemes.

The book could be useful for first-level undergraduate courses on databases in business schools and computer science curricula. Unfortunately, the book lacks exercises. Issues such as the definition of a database, a query, and an answer to a query as well as the question of whether a database answers all queries correctly and completely are not discussed in the book.

Reviewer:  Jack Minker Review #: CR110313
Bookmark and Share
 
Languages (H.2.3 )
 
 
Logic Programming (I.2.3 ... )
 
 
Prolog (D.3.2 ... )
 
 
Logical Design (H.2.1 )
 
 
Mathematical Logic (F.4.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Languages": Date
Logic as a database language
Kowalski R. (ed)  Proc. of the third British national conference on databases (BNCOD3) (, Leeds, UK,1321984. Type: Proceedings
Mar 1 1986
A relational representation of an abstract type system
Weller D., York B. IEEE Transactions on Software Engineering SE-10(3): 303-309, 1984. Type: Article
Jan 1 1985
Logic programming and databases
Ceri S. (ed), Gottlob G., Tanca L., Springer-Verlag New York, Inc., New York, NY, 1990. Type: Book (9780387517285)
May 1 1991
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy