A Guided Tour of Relational Databases and Beyond

Első borító
Springer Science & Business Media, 1999. máj. 28. - 625 oldal
Database theory is now in a mature state, and this book addresses important extensions of the relational database model such as deductive, temporal and object-oriented databases. It provides an overview of database modelling with the Entity-Relationship (ER) model and the relational model providing the pivot on which the material revolves. The main body of the book focuses on the primary achievements of relational database theory, including query languages, integrity constraints, database design, comput able queries and concurrency control. The most important extensions of the relational model are covered in separate chapters. This book will be useful to third year computer science undergraduates and postgraduates studying database theory, and will also be of interest to researchers and database practitioners who would like to know more about the ideas underlying relational dat abase management systems and the problems that confront database researchers.

Részletek a könyvből

 

Tartalomjegyzék

1 Introduction
1
11 An Introductory Example
3
12 What is a Database?
4
14 The Three Levels of Data Abstraction
5
15 What is a Database Management System?
7
16 The Concept of Data Independence
8
17 What is a Data Model?
9
171 The Relational Data Model
10
48 Discussion
282
5 Incomplete Information in the Relational Data Model
287
51 Different Types of Null Value
288
52 The Open and Closed World Assumptions
292
53 Introducing Order into the Domain
294
54 Extending the Relational Algebra with Null Values
299
55 Extending Integrity Constraints with Null Values
309
56 The Orsets Approach
325

172 The Network Data Model
12
173 The Hierarchical Data Model
16
174 The Nested Relational Data Model
19
175 The Deductive Data Model
22
176 An ObjectOriented Data Model
25
18 Discussion
28
191 Basic Concepts of Set Theory
29
192 Basic Concepts of Ordered Sets
33
193 Basic Concepts of Mathematical Logic
35
194 Basic Concepts of the Theory of Computing
40
195 FiniteModel Theory
52
110 Exercises
59
2 The EntityRelationship Model
61
21 Graphs
63
22 The Building Blocks of an EntityRelationship Diagram ERD
65
221 Entities
66
223 Attributes and Domains
71
224 Keys
73
23 Recursive Relationships
76
25 The Steps Needed for Constructing an ERD
80
26 Discussion
81
27 Exercises
82
3 The Relational Data Model
85
31 The Data Structure of the Relational Model
86
32 Query and Update Languages for the Relational Model
91
322 The Domain Relational Calculus
107
323 Datalog
115
324 An Update Language for the Relational Model
125
33 The Equivalence of Query Languages for the Relational Model
132
331 Domain Independence
133
332 The Equivalence of the Algebra the Calculus and Datalog
139
34 Integrity Constraints in Relational Databases
145
35 Inference of Integrity Constraints
146
36 Data Dependencies
149
361 Functional Dependencies and Keys
150
362 Armstrong Relations for Functional Dependencies
158
363 The Implication Problem for Functional Dependencies
160
365 Minimal Covers for Sets of Functional Dependencies
165
366 Projection of Functional Dependencies
167
367 Inclusion Dependencies
169
368 The Chase Procedure for Inclusion Dependencies
174
369 Armstrong Databases for Inclusion Dependencies
176
3610 The Implication Problem for Inclusion Dependencies
178
3611 Interaction between Functional and Inclusion Dependencies
179
3612 The Case of No Interaction Between Functional and Inclusion Dependencies
186
3613 Multivalued Dependencies
189
3614 Join Dependencies
200
37 Domain and Cardinality Constraints
212
38 The View Update Problem
215
39 Discussion
226
310 Exercises
227
4 Relational Database Design
237
41 Update Anomalies in Relational Databases
238
42 Desirable Properties of Database Decompositions
245
43 The Synthesis Versus Decomposition Approaches to Relational Database Design
247
44 Normal Forms
249
441 Second Normal Form 2NF
250
443 BoyceCodd Normal Form BCNF
253
444 Inclusion Dependency Normal Form IDNF
260
45 Horizontal Decompositions
264
46 Algorithms for Converting a Relation Schema into Normal Form
266
462 BCNF Decompositions
269
463 How to Obtain a Decomposition in IDNF
274
47 Converting an ERD into a Relational Database Schema in IDNF
278
57 The Fuzzy Sets Approach
333
58 The Rough Sets Approach
342
59 The Default Values Approach
345
510 Updating Incomplete Relations
347
511 Discussion
351
512 Exercises
355
6 Computable Database Queries and the Expressiveness of the Relational Algebra
359
62 Formalising Computable Database Queries
360
621 Encodings and Decodings
362
622 Definition of Computable Database Queries
364
63 Subclasses of Computable Database Queries
366
633 EncodingIndependent Computable Queries
367
64 An Equivalence Relation on Computable Queries
369
65 Computational Query Completeness
370
66 The Expressive Power of the Relational Algebra
374
67 Adding a Looping Mechanism to the Relational Algebra
377
68 Discussion
383
7 Temporal Relational Databases
385
72 A Taxonomy of Time in Databases
388
73 Historical Relations
391
74 A Historical Relational Algebra
393
75 Historical Relational Completeness
398
76 TSQL2
400
77 Historical Key Dependencies
403
78 Schema Evolution
405
79 Discussion
407
8 Concurrency Control
409
81 Manifestations of Concurrency Control
410
82 Serialisability
415
821 Serialisability Theory
417
83 Locking
423
831 TwoPhase Locking Policy
430
84 Deadlock
432
841 Deadlock Detection
434
842 Deadlock Prevention
436
85 Lock Granularity and Lock Manager
440
86 Lock Manager Implementation
443
87 Timestamp Ordering
445
871 Timestamp Ordering Implementation
448
88 Serialisation Graph Testing
451
89 Discussion
453
810 Exercises
454
9 Deductive Databases
459
91 Modeltheoretic Semantics of Datalog
461
92 Expressive Power of Datalog
480
93 Equivalence Between Datalog Programs
483
94 Datalog NotEqual
493
95 Updates in Deductive Databases
498
96 Integrity Constraints in Deductive Databases
502
97 Discussion
509
98 Exercises
510
10 Extensions to the Relational Data Model and Recent Directions
515
101 Nested Relational Databases
516
102 ObjectOriented Databases
524
103 GraphBased Databases
533
104 Active Databases
542
105 Hypertext Databases
547
106 Semistructured Databases
556
107 Knowledge Discovery and Data Mining
560
108 Other Areas
566
109 What Lies Beyond?
568
Bibliography
577
Index
609
Copyright

Más kiadások - Összes megtekintése

A Guided Tour of Relational Databases and Beyond
Mark Levene,George Loizou
Korlátozott előnézet - 2012
A Guided Tour of Relational Databases and Beyond
Mark Levene,George Loizou
Korlátozott előnézet - 1999
A Guided Tour of Relational Databases and Beyond
Springer
Nincs elérhető előnézet - 2012

Gyakori szavak és kifejezések

algorithm Armstrong's axiom assume attribute values axiom system Chapter computable queries data dependencies data item database design database schema Database Systems deadlock decomposition defined definite Datalog program deletion denoted DEPT digraph DNAME domain calculus employee ENAME entity integrity entity type equivalent example expressed extended F of FDs fact FDs and INDs finite foreign key formula function fuzzy relation given graph Herbrand historical relation hypernode hypertext implication problem incomplete relation inference rule input insertion integrity constraints lock logic mapping Maths MVDs natural number nested relation node normal form null values operator or-relations polynomial primary key query language r₂ recursive relation schema relational algebra relational database relational model relationship type respect to F result Reuven satisfies schema(R semantics serialisable set F set of attributes set of FDs shown in Table simply SNAME Subsection superkey t₁ T₂ Theorem timestamp transaction transitive closure tuples variables

Népszerű szakaszok

580. oldal - TL Anderson, LJ Dekeyser and HKT Wong, The Role of Time in Information Processing: A Survey.‎
1982 és 1999 között 16 könyvben jelenik meg

Hivatkozások erre a könyvre

Bibliográfiai információk

CímA Guided Tour of Relational Databases and Beyond
SzerzőkMark Levene, George Loizou
Kiadásillusztrált
KiadóSpringer Science & Business Media, 1999
ISBN1852330082, 9781852330088
Terjedelem625 oldal
  
Idézet exportálásaBiBTeX EndNote RefMan