Vi har bytt namn till Adlibris Campus! Campusbokhandeln ❤️ Adlibris - Läs mer här
Introduction to Database Systems | 8:e upplagan
- Inbunden, Engelska, 2003
- Författare: C.J. Date
- Betyg:
Ej i lager
Beskrivning
(All chapters begin with an Introduction end with a Summary, Exercises, and Reference and Bibliography)
What is a database system?What is a database?Why database?Data independence.Relational systems and others.2. Database System Architecture.
The three levels of the architecture.The external level.The conceptual level.The internal level.Mappings.The database administrator.The database management system.Data communications.Client/server architecture.Utilities.Distributed processing.3. An Introduction to Relational Databases.
An informal look at the relational model.Relations and relvars.What relations mean.Optimization.The catalog.Base relvars and views.Transactions.The suppliers-and-parts database.4. An Introduction to SQL.
Overview.The catalog.Views.Transactions.Embedded SQL.Dynamic SQL and SQL/CLI.SQL is not perfect.
Values v Variables.Types v Representations.Type Definition.Operators.Type generators.SQL facilities.6. Relations.
Tuples.Relation types.Relation values.Relation variables.SQL facilities.7. Relational Algebra.
Closure revisited.The original algebra: Syntax.The original algebra: Semantics.Examples.What is the algebra for?Further points.Additional operators.Grouping and ungrouping.8. Relational Calculus.
Tuple calculus.Examples.Calculus vs. algebra.Computational capabilities.SQL facilities.Domain calculus.Query-By-Example.9. Integrity.
A closer look.Predicates and propositions.Relvar predicates and database predicates.Checking the constraints.Internal v external constraints.Correctness v consistency.Integrity and views.A constraint classification scheme.Keys.Triggers (a digression).SQL facilities.10. Views.
What are views for?View retrievals.View updates.Snapshots (a digression).SQL facilities.
Basic definitions.Trivial and nontrivial dependencies.Closure of a set of dependencies.Closure of a set of attributes.Irreducible sets of dependencies.12. Further Normalization I: 1NF, 2NF, 3NF, BCNF.
Nonloss decomposition and functional dependencies.First, second, and third normal forms.Dependency preservation.Boyce/Codd normal form.A note on relation-valued attributes.13. Further Normalization II: Higher Normal Forms.
Multi-valued dependencies and fourth normal form.Join dependencies and fifth normal form.The normalization procedure summarized.A note on denormalization.Orthogonal design (a digression).Other normal forms.14. Semantic Modeling.
The overall approach.The E/R model.E/R diagrams.Database design with the E/R model.A brief analysis.
Transactions.Transaction recovery.System recovery.Media recovery.Two-phase commit.Savepoints (a digression).SQL facilities.16. Concurrency.
Three concurrency problems.Locking.The three concurrency problems revisited.Deadlock.Serializability.Recovery revisited.Isolation levels.Intent locking.ACID dropping.SQL facilities.
Discretionary access control.Mandatory access control.Statistical databases.Data encryption.SQL facilities.18. Optimization.
A motivating example.An overview of query processing.Expression transformation.Database statistics.A divide-and-conquer strategy.Implementing the relational operators.19. Missing Information.
An overview of the 3VL approach.Some consequences of the foregoing scheme.Nulls and keys.Outer join (a digression).Special values.SQL facilities.20. Type Inheritance.
Type hierarchies.Polymorphism and substitutability.Variables and assignments.Specialization by constraint.Comparisons.Operators, versions, and signatures.Is a circle an ellipse?Specialization by constraint revisited.SQL facilities.21. Distributed Databases.
Some preliminaries.The twelve objectives.Problems of distributed systems.Client/server systems.DBMS independence.SQL facilities.22. Decision Support.
Aspects of decision support.Database design for decision support.Data preparation.Data warehouses and data marts.Online analytical processing.Data mining.SQL facilities.23. Temporal Databases.
What is the problem?Intervals.Packing and unpacking relations.Generalizing the relational operators.Database work design.Integrity constraints.24. Logic-Based Databases.
Overview.Propositional calculus.Predicate calculus.A proof-theoretic view of databases.Deductive database systems.Recursive query processing.
Objects, classes, methods, and messages.A closer look.A cradle-to-grave example.Miscellaneous issues.26. Object / Relational Databases.
The First Great Blunder.The Second Great Blunder.Implementation issues.Benefits of true rapprochement.SQL facilities.27. The World Wide Web and XML.
The Web and the Internet.An overview of XML.XML data definition.XML data manipulation.XML and databases.SQL facilities.
Three levels of abstraction.The basic idea.Condensed columns.Merged columns.Implementing the relational operators.Appendix B: SQL Expressions, Table Expressions, and Boolean Expressions.
Appendix C: Abbreviations, Acronyms, and Symbol.
Appendix D: Online storage structures and access methods, database access: an overview, page sets and files, indexing, hashing, pointer chains, and compression techniques.
Index.
I. PRELIMINARIES.
1. An Overview of Database Management.What is a database system?What is a database?Why database?Data independence.Relational systems and others.2. Database System Architecture.
The three levels of the architecture.The external level.The conceptual level.The internal level.Mappings.The database administrator.The database management system.Data communications.Client/server architecture.Utilities.Distributed processing.3. An Introduction to Relational Databases.
An informal look at the relational model.Relations and relvars.What relations mean.Optimization.The catalog.Base relvars and views.Transactions.The suppliers-and-parts database.4. An Introduction to SQL.
Overview.The catalog.Views.Transactions.Embedded SQL.Dynamic SQL and SQL/CLI.SQL is not perfect.
II. THE RELATIONAL MODEL.
5. Types.Values v Variables.Types v Representations.Type Definition.Operators.Type generators.SQL facilities.6. Relations.
Tuples.Relation types.Relation values.Relation variables.SQL facilities.7. Relational Algebra.
Closure revisited.The original algebra: Syntax.The original algebra: Semantics.Examples.What is the algebra for?Further points.Additional operators.Grouping and ungrouping.8. Relational Calculus.
Tuple calculus.Examples.Calculus vs. algebra.Computational capabilities.SQL facilities.Domain calculus.Query-By-Example.9. Integrity.
A closer look.Predicates and propositions.Relvar predicates and database predicates.Checking the constraints.Internal v external constraints.Correctness v consistency.Integrity and views.A constraint classification scheme.Keys.Triggers (a digression).SQL facilities.10. Views.
What are views for?View retrievals.View updates.Snapshots (a digression).SQL facilities.
III. DATABASE DESIGN.
11. Functional Dependencies.Basic definitions.Trivial and nontrivial dependencies.Closure of a set of dependencies.Closure of a set of attributes.Irreducible sets of dependencies.12. Further Normalization I: 1NF, 2NF, 3NF, BCNF.
Nonloss decomposition and functional dependencies.First, second, and third normal forms.Dependency preservation.Boyce/Codd normal form.A note on relation-valued attributes.13. Further Normalization II: Higher Normal Forms.
Multi-valued dependencies and fourth normal form.Join dependencies and fifth normal form.The normalization procedure summarized.A note on denormalization.Orthogonal design (a digression).Other normal forms.14. Semantic Modeling.
The overall approach.The E/R model.E/R diagrams.Database design with the E/R model.A brief analysis.
IV. TRANSACTION MANAGEMENT.
15. Recovery.Transactions.Transaction recovery.System recovery.Media recovery.Two-phase commit.Savepoints (a digression).SQL facilities.16. Concurrency.
Three concurrency problems.Locking.The three concurrency problems revisited.Deadlock.Serializability.Recovery revisited.Isolation levels.Intent locking.ACID dropping.SQL facilities.
V. FURTHER TOPICS.
17. Security.Discretionary access control.Mandatory access control.Statistical databases.Data encryption.SQL facilities.18. Optimization.
A motivating example.An overview of query processing.Expression transformation.Database statistics.A divide-and-conquer strategy.Implementing the relational operators.19. Missing Information.
An overview of the 3VL approach.Some consequences of the foregoing scheme.Nulls and keys.Outer join (a digression).Special values.SQL facilities.20. Type Inheritance.
Type hierarchies.Polymorphism and substitutability.Variables and assignments.Specialization by constraint.Comparisons.Operators, versions, and signatures.Is a circle an ellipse?Specialization by constraint revisited.SQL facilities.21. Distributed Databases.
Some preliminaries.The twelve objectives.Problems of distributed systems.Client/server systems.DBMS independence.SQL facilities.22. Decision Support.
Aspects of decision support.Database design for decision support.Data preparation.Data warehouses and data marts.Online analytical processing.Data mining.SQL facilities.23. Temporal Databases.
What is the problem?Intervals.Packing and unpacking relations.Generalizing the relational operators.Database work design.Integrity constraints.24. Logic-Based Databases.
Overview.Propositional calculus.Predicate calculus.A proof-theoretic view of databases.Deductive database systems.Recursive query processing.
VI. OBJECTS, RELATIONS, AND XML.
25. Object Databases.Objects, classes, methods, and messages.A closer look.A cradle-to-grave example.Miscellaneous issues.26. Object / Relational Databases.
The First Great Blunder.The Second Great Blunder.Implementation issues.Benefits of true rapprochement.SQL facilities.27. The World Wide Web and XML.
The Web and the Internet.An overview of XML.XML data definition.XML data manipulation.XML and databases.SQL facilities.
APPENDIXES.
Appendix A: The TransRelational™ Model.Three levels of abstraction.The basic idea.Condensed columns.Merged columns.Implementing the relational operators.Appendix B: SQL Expressions, Table Expressions, and Boolean Expressions.
Appendix C: Abbreviations, Acronyms, and Symbol.
Appendix D: Online storage structures and access methods, database access: an overview, page sets and files, indexing, hashing, pointer chains, and compression techniques.
Index.
Produktinformation
Kategori:
Data & IT
Bandtyp:
Inbunden
Språk:
Engelska
Förlag:
Pearson Education
Upplaga:
8
Utgiven:
2003-07-22
ISBN:
9780321197849
Sidantal:
1040
$event.detail.name === 'primary-menu' ? isOpen = true : ''"
@close-drawer.window="() => $event.detail.name === 'primary-menu' ? isOpen = false : ''"
@keydown.escape.window="isOpen = false"
x-init="$watch('isOpen', value => {
if (value) {
$refs.dialog.showModal();
document.body.style.overflow = 'hidden';
} else {
setTimeout(() => {
$refs.dialog.close();
}, 300)
document.body.style.overflow = '';
}
});"
class="h-full"
>
$event.detail.name === 'mobile-search' ? isOpen = true : ''"
@close-drawer.window="() => $event.detail.name === 'mobile-search' ? isOpen = false : ''"
@keydown.escape.window="isOpen = false"
x-init="$watch('isOpen', value => {
if (value) {
$refs.dialog.showModal();
document.body.style.overflow = 'hidden';
} else {
setTimeout(() => {
$refs.dialog.close();
}, 300)
document.body.style.overflow = '';
}
});"
class="h-full"
>
$event.detail.name === 'mini-cart' ? isOpen = true : ''"
@close-drawer.window="() => $event.detail.name === 'mini-cart' ? isOpen = false : ''"
@keydown.escape.window="isOpen = false"
x-init="$watch('isOpen', value => {
if (value) {
$refs.dialog.showModal();
document.body.style.overflow = 'hidden';
} else {
setTimeout(() => {
$refs.dialog.close();
}, 300)
document.body.style.overflow = '';
}
});"
class="h-full"
>
$event.detail.name === 'add-to-cart' ? isOpen = true : ''"
@close-drawer.window="() => $event.detail.name === 'add-to-cart' ? isOpen = false : ''"
@keydown.escape.window="isOpen = false"
x-init="$watch('isOpen', value => {
if (value) {
$refs.dialog.showModal();
document.body.style.overflow = 'hidden';
} else {
setTimeout(() => {
$refs.dialog.close();
}, 300)
document.body.style.overflow = '';
}
});"
class="h-full"
>