| 000 | 00762camuu2200229 a 4500 | |
| 001 | 000000593730 | |
| 005 | 20010903163920 | |
| 008 | 960416s1997 nyua b 001 0 eng | |
| 010 | ▼a 96018198 | |
| 020 | ▼a 0195107837 (cloth) | |
| 040 | ▼a DLC ▼c DLC ▼d UKM ▼d 211009 | |
| 049 | 1 | ▼l 111107883 ▼l 121055111 ▼f 과학 |
| 050 | 0 0 | ▼a QA76.9.D3 ▼b J58 1997 |
| 082 | 0 0 | ▼a 005.74 ▼2 20 |
| 090 | ▼a 005.74 ▼b J67d | |
| 100 | 1 | ▼a Johnson, James L. ▼q (James Lee), ▼d 1942- |
| 245 | 1 0 | ▼a Database : ▼b models, languages, design / ▼c James L. Johnson. |
| 260 | ▼a New York : ▼b Oxford University Press, ▼c 1997. | |
| 300 | ▼a xiv, 930 p. : ▼b ill. ; ▼c 24 cm. | |
| 504 | ▼a Includes bibliographical references and index. | |
| 650 | 0 | ▼a Database management. |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 005.74 J67d | 등록번호 121055111 (1회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
| No. 2 | 소장처 학술정보관(CDL)/B1 국제기구자료실(보존서고8)/ | 청구기호 005.74 J67d | 등록번호 111107883 (1회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 005.74 J67d | 등록번호 121055111 (1회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 학술정보관(CDL)/B1 국제기구자료실(보존서고8)/ | 청구기호 005.74 J67d | 등록번호 111107883 (1회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
This text presents the traditional topics of a first undergraduate Computer Science course in database theory in a thorough manner. The author conveys a clearer and more comprehensive introduction to database theory than competing books through his organization of the material and explanations of the concepts. The author describes five database models which represent current practice (the relational model), future trends (the object-oriented and deductive models),
and past experiences (the network and hierarchical models). It is intended as a text for a first undergraduate database course as well as for self-study by database practitioners. A solutions manual will be available.
Database: Models, Languages, Design presents the traditional topic in database theory, and can be used as a self-study by database practitioners who are familiar with the relational technology and want to learn about object-oriented and deductive models. The author conveys a clearer introduction than competing books through his organization of the material and explanations of the concepts. Presentation and style differ from existing books, most notably in
the emphasis on generic concepts rather than the specifics of the existence of commercial products. The book is divided into three parts: Part I, Database Models and their Access Models; Part II, Disk Storage Management; and Part III, Database Design.
정보제공 :
목차
CONTENTS Preface = xi Ⅰ : DATABASE MODELS AND ACCESS METHODS = 1 1 Introduction to Databases = 3 Motivation for database systems = 4 Definition of a database system = 7 Overview of database Models = 9 Components of a datagase system = 14 A continuing example = 18 2 Relational Databases = 21 An informal illustration of a relatinal database = 21 Relational terminology = 23 Binary relationships = 29 Higher-degree relationships = 44 Recursive relationships = 48 Constraints = 52 Elementary entity-relationship diagrams = 57 Schema specification = 67 Metadata and the system catalog = 69 3 Relational Algebra = 79 Renaming and set operators = 80 Select-project-join operators = 82 Existential queries = 92 Universal queries = 98 Aggregates and partitions = 107 Limits on the expressive power of relational algebra = 111 Elementary query optimization = 114 4 Relational Calculus = 123 Review of predicate calculus = 123 Selection via a predicate = 128 Existential queries = 132 Universal queries = 134 Aggregates and partitions = 138 Domain relational calculus = 143 5 Basic SQL = 153 Conceptual model for simple retrieval queries = 154 Subqueries = 164 Existential queries = 169 Universal queries = 171 Aggeregates and partitions = 176 Suppressing partitions = 182 The full select syntax = 184 Data editing operations = 190 Embedded SQL = 194 6 Advanced SQL = 213 Views = 213 Null values = 222 Outer operations = 232 Constraints = 239 Triggers = 247 Extended definition of a relational database = 250 Shortcomings of the relational model = 251 7 Object-Oriented Databases = 261 Informal illustration of an object-oriented database = 262 Object-oriented terminology = 270 Definition of an object-oriented database = 285 Relationships = 290 Constrains = 299 Comparison of object-oriented and relational databases = 307 8 Object-Oriented Queries = 317 Conceptual model for simple data retrieval = 317 Existential queries = 328 Universal queries = 334 Aggregates and partitions = 338 Recursive queries = 343 Data editing operations = 345 Signal expressions from SQL = 349 Object Query Language (QQL) = 360 9 Deductive Databases = 371 Logic programming in a database context = 371 Imformal illustration of a deductive database = 381 Definition of a deductive database = 386 Query solution as goal satisfaction = 395 Relationships = 401 Constraints = 408 10 Deductive Queries = 423 Existential queries = 424 Universal queries = 428 Aggregates and partitions = 431 Logic programs and relational algebra = 434 Beyond acyclic deductive databases = 445 Recursive queries = 451 11 Network Databases = 465 Informal illustration of a network database = 466 Definition of a network database = 472 Network Data Manipulation Language (DML) = 483 Relationships = 493 Constraints = 504 Network queries = 507 Comparison of network databases with previous models = 513 12 Hierarchical Databases = 519 Informal illustration of a hierarchical database = 520 Relationships = 533 Hierarchical definition and data manipulation = 541 Constraints = 547 Hierarchical queries = 549 13 Comparing the Database Models = 559 Model similarities = 559 The model's strengths and weaknesses = 563 Ⅱ : DISK STORAGE MANAGEMENT = 569 14 File Structures = 571 Physical organization of a disk storage unit = 572 Block layout schemes = 576 Indexed sequential files = 580 Hash files = 585 Dynamic file structures = 596 15 Indexes = 617 Sparse hierarchical indexes = 617 Dense Indexes = 632 B-trees = 637 16 File Structure for the Database Models = 665 The relational model = 666 The network model = 671 The hierarchical model = 677 The object-oriented model = 682 The deductive model = 686 Ⅲ : DATABASE DESIGN = 691 17 Application Design Capture = 693 The entiry-relationship model = 693 Class hierarchies and inheritance = 695 Mapping from ER diagrams to database schemas = 705 Object Modeling Technique (OMT) = 734 18 Functional Dependency Analysis = 745 Sources of functionaldependency constraints = 746 Minimal covers = 755 Lossless-join decompositions = 766 Boyce-Codd normal form (BCNF) = 769 Dependency preservation = 776 The first three normal forms = 781 Linitations and extensions of FD analysis = 790 19 Join Dependency Analysis = 799 Multivalued dependencies = 800 Interactions among MVDs and FDs = 804 The dependency basis = 813 Fourth normal form = 825 General join dependencies = 833 Fifth normal form = 845 Beyond join dependencies = 854 Ⅳ : EPILOGUE = 865 20 Performance = 867 Concurrency = 868 Recovery = 885 Security = 896 Query optimization = 905 References = 919 Index = 925