Titre :	Foundations of databases
Type de document :	texte imprimé
Auteurs :	S. Abiteboul ; Richard Hull ; Victor Vianu
Editeur :	Reading, Mass. : Addison-Wesley
Année de publication :	1995
Importance :	1 vol (685 p.)
Présentation :	ill.
Format :	25 cm
ISBN/ISSN/EAN :	978-0-201-53771-0
Catégories :	Informatique
Mots-clés :	Bases de données
Index. décimale :	005.7 Données informatiques
Résumé :	C'est le livre le plus complet disponible sur la théorie de base de données. C'est une référence complète à la fois aux sujets classiques et aux sujets avancés qui sont autrement déformés dans des articles parfois difficiles à trouver. Un effort important dans l'écriture du livre a été fait pour mettre en évidence les intuitions derrière le développement théorique. Caractéristiques Met l'accent sur les langages d'interrogation pour le modèle relationnel, y compris la couverture de différents paradigmes linguistiques, le pouvoir expressif et la complexité. Présente une théorie unifiée des dépendances, y compris celles qui se produisent couramment dans la pratique, et leur utilisation dans l'optimisation et la conception de schémas. Fondements théoriques fournis de plusieurs sujets émergents, y compris des bases de données déductives et orientées objet. Comprend des preuves détaillées et de nombreux exemples et exercices.
Note de contenu :	Sommaire Preface Part A--Antechamber Database Systems The Main Principles Functionalities Complexity and Diversity Past and Future Ties with This Book Bibliographic Notes Theoretical Background Some Basics Languages, Computability, and Complexity Basics from Logic The Relational Model The Structure of the Relational Model Named versus Unnamed Perspectives Notation Bibliographic Notes Part B--Basics: Relational Query Languages Conjunctive Queries Getting Started Logic-Based Perspectives Query Composition and Views Algebraic Perspectives Adding Union Bibliographic Notes Exercises Adding Negation: Algebra and Calculus The Relational Algebras Nonrecursive Datalog with Negation The Relational Calculus Syntactic Restrictions for Domain Independence Aggregate Functions Digression: Finite Representations of Infinite Databases Bibliographic Notes Exercises Static Analysis and Optimization Issues in Practical Query Optimization Global Optimization Static Analysis of the Relational Calculus Computers with Acyclic Joins Bibliographic Notes Exercises Notes on Practical Languages SQL: The Structured Query Language Query-by-Example and Microsoft Access Confronting the Real World Bibliographic Notes Exercises Part C --Constraints Functional and Join Dependency Motivation Functional and Key Dependencies join and Multivalued DependenciesThe Chase Bibliographic Notes Exercises Inclusion Dependency Inclusion Dependency in Isolation Finite versus Infinite Implication Nonaxiomatizability of fd's + ind's Restricted Kinds of Inclusion Dependency Bibliographic Notes Exercises A Larger Perspective A Unifying Framework The Chase revisited Axiomatization An Algebraic Perspective Bibliographic Notes Exercises Design and Dependencies Semantic Data Models Normal Forms Universal Relation Assumption Bibliographic Notes Exercises Part D--Datalog and Recursion Datalog Syntax of Datalog Model-Theoretic Semantics Fixpoint Semantics Proof-Theoretic Approach Static Program Analysis Bibliographic Notes Exercises Evaluation of Datalog Seminaive Evaluation Top-Down Techniques Magic Two Improvements Bibliographic Notes Exercises Recursion and Negation Algebra + While Calculus + Fixpoint Datalog with Negation Equivalence Recursion in Practical Language Bibliographic Notes Exercises Negation in Datalog The Basic problem Stratified Semantics Well-Founded Semantics Expressive Power Negation as Failure of Brief Bibliographic Notes Exercises Part E--Expressiveness and Complexity Sizing Up Languages Queries Complexity of Queries Languages and Complexity Bibliographic Notes Exercises First-Order, Fixpoint and While Complexity of First-Order Queries Expressiveness of First-Order Queries Fixpoint and While Queries The Impact of Order Bibliographic Notes Exercises Highly Expressive Languages While(N)-while with Arithmetic While(new)-while with New Values While(uty)-An Untyped Extension of while Bibliographic Notes Exercises Part F--Finale Incomplete Information Warm-Up Weak Representation Systems Conditional Tables The Complexity of Nulls Other Approaches Bibliographic Notes Exercises Complex Values Complex Value Databases The Algebra The Caculas Examples Equivalence Theorems Fixpoint and Deduction Expressive Power and Complexity A Practicle Query Language for Complex Values Bibliographic Notes Exercises Object Databases Informal Presentation Formal Definition of an OODB Model Languages for OODB Queries Languages for Methods Further Issues for OODB's Bibliographic Notes Exercises Dynamic Aspects Updated Languages Transactional Schemas Updating Views and Deductive Databases Active Databases Temporal Databases and Constraints Bibliographic Notes Exercises Bibliography Symbol Index Index
Côte titre :	Fs/19753

Foundations of databases [texte imprimé] / S. Abiteboul ; Richard Hull ; Victor Vianu . - Reading, Mass. : Addison-Wesley, 1995 . - 1 vol (685 p.) : ill. ; 25 cm.
ISBN : 978-0-201-53771-0

Catégories :	Informatique
Mots-clés :	Bases de données
Index. décimale :	005.7 Données informatiques
Résumé :	C'est le livre le plus complet disponible sur la théorie de base de données. C'est une référence complète à la fois aux sujets classiques et aux sujets avancés qui sont autrement déformés dans des articles parfois difficiles à trouver. Un effort important dans l'écriture du livre a été fait pour mettre en évidence les intuitions derrière le développement théorique. Caractéristiques Met l'accent sur les langages d'interrogation pour le modèle relationnel, y compris la couverture de différents paradigmes linguistiques, le pouvoir expressif et la complexité. Présente une théorie unifiée des dépendances, y compris celles qui se produisent couramment dans la pratique, et leur utilisation dans l'optimisation et la conception de schémas. Fondements théoriques fournis de plusieurs sujets émergents, y compris des bases de données déductives et orientées objet. Comprend des preuves détaillées et de nombreux exemples et exercices.
Note de contenu :	Sommaire Preface Part A--Antechamber Database Systems The Main Principles Functionalities Complexity and Diversity Past and Future Ties with This Book Bibliographic Notes Theoretical Background Some Basics Languages, Computability, and Complexity Basics from Logic The Relational Model The Structure of the Relational Model Named versus Unnamed Perspectives Notation Bibliographic Notes Part B--Basics: Relational Query Languages Conjunctive Queries Getting Started Logic-Based Perspectives Query Composition and Views Algebraic Perspectives Adding Union Bibliographic Notes Exercises Adding Negation: Algebra and Calculus The Relational Algebras Nonrecursive Datalog with Negation The Relational Calculus Syntactic Restrictions for Domain Independence Aggregate Functions Digression: Finite Representations of Infinite Databases Bibliographic Notes Exercises Static Analysis and Optimization Issues in Practical Query Optimization Global Optimization Static Analysis of the Relational Calculus Computers with Acyclic Joins Bibliographic Notes Exercises Notes on Practical Languages SQL: The Structured Query Language Query-by-Example and Microsoft Access Confronting the Real World Bibliographic Notes Exercises Part C --Constraints Functional and Join Dependency Motivation Functional and Key Dependencies join and Multivalued DependenciesThe Chase Bibliographic Notes Exercises Inclusion Dependency Inclusion Dependency in Isolation Finite versus Infinite Implication Nonaxiomatizability of fd's + ind's Restricted Kinds of Inclusion Dependency Bibliographic Notes Exercises A Larger Perspective A Unifying Framework The Chase revisited Axiomatization An Algebraic Perspective Bibliographic Notes Exercises Design and Dependencies Semantic Data Models Normal Forms Universal Relation Assumption Bibliographic Notes Exercises Part D--Datalog and Recursion Datalog Syntax of Datalog Model-Theoretic Semantics Fixpoint Semantics Proof-Theoretic Approach Static Program Analysis Bibliographic Notes Exercises Evaluation of Datalog Seminaive Evaluation Top-Down Techniques Magic Two Improvements Bibliographic Notes Exercises Recursion and Negation Algebra + While Calculus + Fixpoint Datalog with Negation Equivalence Recursion in Practical Language Bibliographic Notes Exercises Negation in Datalog The Basic problem Stratified Semantics Well-Founded Semantics Expressive Power Negation as Failure of Brief Bibliographic Notes Exercises Part E--Expressiveness and Complexity Sizing Up Languages Queries Complexity of Queries Languages and Complexity Bibliographic Notes Exercises First-Order, Fixpoint and While Complexity of First-Order Queries Expressiveness of First-Order Queries Fixpoint and While Queries The Impact of Order Bibliographic Notes Exercises Highly Expressive Languages While(N)-while with Arithmetic While(new)-while with New Values While(uty)-An Untyped Extension of while Bibliographic Notes Exercises Part F--Finale Incomplete Information Warm-Up Weak Representation Systems Conditional Tables The Complexity of Nulls Other Approaches Bibliographic Notes Exercises Complex Values Complex Value Databases The Algebra The Caculas Examples Equivalence Theorems Fixpoint and Deduction Expressive Power and Complexity A Practicle Query Language for Complex Values Bibliographic Notes Exercises Object Databases Informal Presentation Formal Definition of an OODB Model Languages for OODB Queries Languages for Methods Further Issues for OODB's Bibliographic Notes Exercises Dynamic Aspects Updated Languages Transactional Schemas Updating Views and Deductive Databases Active Databases Temporal Databases and Constraints Bibliographic Notes Exercises Bibliography Symbol Index Index
Côte titre :	Fs/19753