Publisher: Springer; 1995 edition (November 30, 1994)
Format: PDF / Kindle / ePub
Size: 7.1 MB
Downloadable formats: PDF
the basis in the back of constructing robust declarative database languages is compelling: by means of allowing clients to specify their queries (and their integrity constraints) in a transparent, non-operational means, they make the user's job more uncomplicated, and supply the database approach with extra possibilities for optimization. Relational database structures provide a amazing facts that this premise is certainly legitimate. the preferred relational question language, SQL, is predicated upon relational algebra and calculus, i.e., a small fragment of first-order good judgment, and the benefit of writing queries in SQL (in comparability to extra navigational languages) has been a tremendous consider the economic good fortune of relational databases. it truly is recognized that SQL has a few very important obstacles, even with its good fortune and recognition. significantly, the question language is non-recursive, and help for integrity constraints is restricted. certainly, spotting those difficulties, the most recent normal, SQL-92, presents elevated aid for integrity constraints, and it truly is expected that the successor to the SQL-92 typical, referred to as SQL3, RECURSIVE UNION operation . common sense database structures have will comprise a targeting those extensions to the relational database paradigm, and a few structures (e.g., Bull's DEL prototype) have even integrated object-oriented beneficial properties (another extension prone to seem in SQL3).
Formal Methods and Software Engineering: 12th International Conference on Formal Engineering Methods, ICFEM 2010, Shanghai, China, November 17-19, 2010, Proceedings (Lecture Notes in Computer Science) review