RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      DBMS for distributed computers & networks

      한글로보기

      https://www.riss.kr/link?id=M1009373

      • 저자
      • 발행사항

        New York : PBI, c1983

      • 발행연도

        1983

      • 작성언어

        영어

      • 주제어
      • DDC

        001.64/2 판사항(19)

      • ISBN

        0894331841

      • 자료형태

        일반단행본

      • 발행국(도시)

        New York(State)

      • 서명/저자사항

        DBMS for distributed computers & networks / Dimitris N. Chorafas.

      • 형태사항

        xii, 255 p. : ill. ; 24 cm.

      • 일반주기명

        "A Petrocelli book."
        Includes index.

      • 소장기관
        • 국립중앙도서관 국립중앙도서관 우편복사 서비스
        • 동국대학교 중앙도서관 소장기관정보
        • 동서대학교 민석도서관 소장기관정보
        • 백석대학교 도서관(천안) 소장기관정보
        • 부산외국어대학교 도서관 소장기관정보
        • 서울대학교 중앙도서관 소장기관정보 Deep Link
        • 이화여자대학교 도서관 소장기관정보 Deep Link
        • 한국외국어대학교 글로벌캠퍼스 도서관 소장기관정보
        • 한국외국어대학교 서울캠퍼스 도서관 소장기관정보
        • 한양대학교 안산캠퍼스 소장기관정보
      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      목차 (Table of Contents)

      • CONTENTS
      • FOREWORD = ⅸ
      • CHAPTER I, MILESTONES IN THE DEVELOPMENT OF DBMS = 1
      • Introduction = 1
      • The DBMS Contribution = 3
      • CONTENTS
      • FOREWORD = ⅸ
      • CHAPTER I, MILESTONES IN THE DEVELOPMENT OF DBMS = 1
      • Introduction = 1
      • The DBMS Contribution = 3
      • From Operating Systems to DBMS = 7
      • A DBMS Architecture = 14
      • CHAPTER 2, TEXT/DATA DEFINITION AND MANIPULATION = 19
      • Introduction = 19
      • DML and DDL = 21
      • A DBMS Operation = 28
      • Text Processing and Retrieval Options = 34
      • CHAPTER 3, DBMS FOR MINI-AND MICROCOMPUTERS = 41
      • Introduction = 41
      • Points of Comparison = 42
      • Guidelines for Adopting a Profile = 47
      • DBMS for Microcomputers = 54
      • Facing Memory Constraints = 58
      • CHAPTER 4, A POLYVALENT DESIGN APPROACH = 63
      • Introduction = 63
      • Projecting a DBMS = 64
      • Database Utilities = 70
      • Services to a DBMS = 76
      • CHAPTER 5, DATA STRUCTURES FOR DATABASE MANAGEMENT = 81
      • Introduction = 81
      • The Logical Organization = 82
      • Hierarchical, Networking and Relational Models = 85
      • Developing Standards = 92
      • Contrasting the DBMS to File Management Solutions = 96
      • CHAPTER 6, THE BETTER KNOWN DATA STRUCTURES = 99
      • Introduction = 99
      • A Broader Look at Data Structures = 101
      • Hierarchical Models = 114
      • List Structures = 117
      • Networking Models = 122
      • CHAPTER 7, RELATIONAL DATA STRUCTURES = 125
      • Introduction = 125
      • Relational Type Models = 128
      • Query Capabilities = 133
      • SQL-Example of a Query Language = 140
      • CHAPTER 8, THE DATABASE ENGINE = 147
      • Introduction = 147
      • Reasons for a Separate Database Machine = 148
      • Supporting Services for Database Engines = 153
      • Logic Over Data = 158
      • Implementing Relational Approaches = 163
      • CHAPTER 9, USER LEVEL PROTOCOLS = 167
      • Introduction = 167
      • The User Interface = 168
      • Applications Oriented Protocols = 170
      • Database Requirements = 175
      • A Network-Wide View = 177
      • CHAPTER 10, SESSION, PRESENTATION, AND VIRTUAL CAPABILITIES = 181
      • Introduction = 181
      • Session Control = 183
      • Layers in the Session Functions = 185
      • Presentation Control = 187
      • Virtual Terminals = 190
      • CHAPTER 11, A DISTRIBUTED-NETWORK = 195
      • Introduction = 195
      • DBMS for the End User = 197
      • Distributing the DBMS = 202
      • Preparatory Steps = 205
      • The DBMS as a System Component = 210
      • CHAPTER 12, MANAGING THE DISTRIBUTED DATABASE = 215
      • Introduction = 215
      • Lifecycle Characteristics = 217
      • The Allocation Mechanism = 221
      • Normalizing the Ffles = 225
      • Database Migration = 229
      • CHAPTER 13, INTEGRITY IN DATABASE SYSTEMS = 233
      • Introduction = 233
      • An Integrity Mechanism = 234
      • Backout, Rollback, and Recovery = 237
      • Implementing the Journal = 240
      • CHAPTER 14, WHAT IS NOT A DBMS = 245
      • Introduction = 245
      • The Mechanism = 245
      • Afterthoughts = 249
      • To Do or Not to Do = 250
      • INDEX = 253
      • 1. The Evolution of Software Engineering = 1
      • The Problems = 3
      • Productivity = 4
      • The Solutions = 4
      • Measuring Productivity and Quality = 7
      • Requirements Constraining Productivity = 7
      • Buying Software to Improve Productivity = 11
      • Implementation = 11
      • 2. Methodology = 13
      • Phased System Development = 13
      • Proposal = 15
      • Feasibility = 18
      • Definition-Requirements Specification = 18
      • Design = 19
      • Programming = 25
      • Conversion = 37
      • Performance Review = 37
      • Quality Assurance = 38
      • Maintenance = 40
      • Task Analysis = 44
      • 3. Technology = 47
      • Office Automation Tools = 47
      • Requirements Definition Tools = 58
      • Design Tools = 58
      • Coding Tools = 60
      • Testing Tools = 71
      • Nonprocedural Languages-The Information Center = 75
      • 4. People = 79
      • Computerization = 80
      • Human Needs = 85
      • Programmers Aren't Machines = 91
      • Solutions = 91
      • Human Impacts-Methodology = 92
      • Human Needs-Technology = 97
      • 5. Management and Organization = 101
      • Management = 101
      • Organization = 117
      • 6. Software Metrics = 125
      • Why Measure Productivity and Quality? = 125
      • How to Measure Programmer/Analyst Productivity and Quality = 126
      • Applying Software Metrics to Testing = 143
      • Applying Software Metrics to Program/Software Releases = 144
      • 7. Reliability-What a Concept = 147
      • Built-in Reliability = 148
      • Detecting Errors to Improve Reliability = 160
      • Correcting Errors to Improve Reliability = 163
      • Allowing Errors to Improve Reliability = 163
      • 8. Maintenance = 165
      • Identifying Maintenance-Prone Software = 166
      • Error Tracking = 178
      • Software Development = 179
      • 9. Quality Assurance = 181
      • What Is Quality Assurance? = 182
      • Implementing the Quality Assurance Function = 189
      • Quality Assurance Tools = 190
      • 10. Auditing = 197
      • System Development Controls = 198
      • Auditing Tools = 200
      • Internal Controls = 202
      • Productivity Issues = 205
      • 11. Buying Software to Improve Productivity = 207
      • How to Look for Software = 208
      • Where to Find Software = 208
      • The Make or Buy Decision = 211
      • How to Acquire Software = 211
      • Developing System Requirements = 213
      • Contract Negotiations = 214
      • Software Development Contracting = 215
      • 12. Implementing Software Engineering = 219
      • Implementing Productivity and Quality Improvements = 220
      • Maintenance = 220
      • Application Control = 221
      • Software Factory = 221
      • Information Center = 221
      • Office Automation = 222
      • People = 223
      • Your Software Factory = 223
      • Bibliography = 225
      • Appendix A. Generic Update Program = 231
      • Appendix B. Document Prototypes = 241
      • Appendix C. COBOL Software Metric Program = 245
      • Index = 279
      • Preface = ⅸ
      • 1. Automatic Computer Systems = 1
      • 1.1. Historical Perspective = 2
      • 1.2. A Classification of Automatic Computers = 5
      • 1.3. The Nature of a Computer System = 7
      • 1.4. Principles of Hardware Organization = 9
      • 1.5. Conventions on Use of Storage = 12
      • 1.6. Elements of Programming = 12
      • 1.7. Some Facts of Computer Technology = 15
      • 1.8. Principles of the Space-Time Relationship = 16
      • 2. Programming = 22
      • 2.1. APL: The Programming Language Used in This Book = 23
      • 2.2. Alphabet (Character Set), Operands, and Variables = 25
      • 2.3. A Simple Program = 29
      • 2.4. Expressions: Right-to-left Rule = 31
      • 2.5. Base Value and Representation (inverse Base Value) = 32
      • 2.6. Primitive Scalar Operators, Element-by-element Rule = 35
      • 2.7. Branching, Looping, and Tracing = 38
      • 2.8. Principles of Looping Summarized = 42
      • 2.9. Arrays and Indexing: Ravel and Reshape = 44
      • 2.10. Data Generator Operators = 47
      • 2.11. Reduction Operations: Inner and Outer Product = 48
      • 2.12. Generation of Similarity Matrix = 52
      • 2.13. Solution of Linear Equations and Matrix Inversion = 52
      • 2.14. Functions = 60
      • 2.15. Function Naming: Global and Local Variables = 62
      • 2.16. Formula Evaluation: One Function of Many Variables = 65
      • 2.17. Recursive Definition of Functions = 67
      • 2.18. Selection,Search,and Ordering Operations = 69
      • 2.19. Some Statistics Applications = 71
      • 2.20. Some Nonnumerical Applications = 77
      • 3. Program Translation = 89
      • 3.1. Interpreters = 90
      • 3.2. Compilers = 92
      • 3.3. Assembler Programs = 94
      • 3.4. Principles of Subroutines = 97
      • 3.5. Macros = 99
      • 3.6. Subroutine Communication: Parameter Translation = 102
      • 3.7. Reentrant Subroutines = 105
      • 3.8. Translation of Algebraic Expressions = 107
      • 3.9. Syntax Description: BNF Equations = 112
      • 3.10. Syntax-direted Compiling: Compiler of Compilers = 116
      • 3.11. Translating Indexes into Addresses = 116
      • 3.12. Efficiency Considerations in Programming Systems = 117
      • 3.13. Concluding Remarks = 118
      • 4. Storage Organization and Searching = 123
      • 4.1. Basic Storage Operations ; Direct, Sequential, and Associative Access = 124
      • 4.2. A Brief Description of Some Storage Devices = 126
      • 4.3. Methods of Controlling Transmission = 130
      • 4.4. Cycle Stealing and I/O-Compute Overlap = 132
      • 4.5. A Simple Model for I/O-Compute Overlap = 134
      • 4.6. Statement of a Search Problem = 142
      • 4.7. Bit Maps versus Index Vectors = 144
      • 4.8. last Maintenance Using a Single Storage Pool = 145
      • 4.9. Some Factors in File Organization = 150
      • 4.10. Searching and Ordering Files: General Discussion = 152
      • 4.11. Updating Ordered Files = 153
      • 4.12. Principles of Ordering (Sorting) = 156
      • 4.13. Binary Search (Ordered Files, Direct-access Divices) = 162
      • 4.14. Search of an Unordered File = 164
      • 4.15. Search of Unordered Files Stored on Direct-wcess (Random-access) Devices = 164
      • 4.16. Transfomation-synonym Problem = 165
      • 4.17. Chaining on Secondary Keys = 169
      • 4.18. Searching Eirect-access Devices: Index Lists and Directories = 171
      • 4.19. Brief Summary of Ffle-maintenmce Processes = 171
      • 5. Logic and Logic Circuits = 179
      • 5.1. The Truth Table as a Logic-circuit Specification = 182
      • 5.2. Canonical Forms and Boolean Algebra = 183
      • 5.3. Logic-block Circuits = 189
      • 5.4. Circuit Minimization or Simplification = 194
      • 5.5. Karnaugh Map Technique of Simplification = 195
      • 5.6. Quine-McCluskey Simplification Algorithm = 198
      • 5.7. Design of a 1-bit Full Adder = 201
      • 5.8. Functions of n Variables = 203
      • 5.9. Not-And (NAND or Sheffer Stroke) Logic = 206
      • 5.10. Decomposition Using Two-input Blocks = 208
      • 5.11. Binary Decoders = 210
      • 5.12. Design of a Decimal (BCD) Decoder = 217
      • 5.13. Binary Encoders = 218
      • 6. Data-flow Circuits and Magnetic-core Storage = 223
      • 6.1. Interconnection Configurations = 224
      • 6.2. Bus Priority Control for Noncritical Sources = 226
      • 6.3. Data Flow of a Simple Processor = 229
      • 6.4. Examples of Bus Circuits in the IBM 7090 Computer = 231
      • 6.5. Effect of Data Flow on lnternal Speed = 233
      • 6.6. Magnetic-core Storage = 234
      • 6.7. Overlap and Cycle Splitting = 241
      • 6.8. Multiple-module Core Storage = 244
      • 6.9. Control-system Model for Critically Timed Sources = 246
      • 6.10. Elementary Guaranteed Service Procedure = 246
      • 7. Turing, Finite-state, and Sequential-circuit Models = 253
      • 7.1. Turing Machine Model = 254
      • 7.2. Finite-state-machine Model = 259
      • 7.3. Connectivity and Reachability = 264
      • 7.4. Periodic Behavior of Finite-state Machines = 267
      • 7.5. State Equivalence = 268
      • 7.6. State Minimization = 268
      • 7.7. Homing and Diagnosis Experiments = 270
      • 7.8. Sequential-circuit Applications of FSM Models = 271
      • 7.9. Flip-flops and Registers = 273
      • 7.10. Counters = 279
      • 7.11. Electronic Stepping Switch: Ring Counter = 284
      • 7.12. Conversion between Analog and Digital Representations = 285
      • 7.13. Cathode-ray Display Systems = 288
      • 8. Number Representations and Arithmetic Operations = 293
      • 8.1. Positional Number Systems = 294
      • 8.2. Conversion from One Radix Representation to Another = 297
      • 8.3. Binary-Decimal Conversions = 301
      • 8.4. Subtraction of Positive Integers with Complement Arithmetic = 304
      • 8.5. Sign Control for Addition and Subtraction = 310
      • 8.6. Serial and Parallel Representations of Numbers = 312
      • 8.7. Serial Complementer Circuits = 313
      • 8.8. Serial Binary Addition = 315
      • 8.9. Design of Parallel Binary Adders = 316
      • 8.10. Serial-by-byte Addition = 321
      • 8.11. Decimal Addition in a Binary Adder = 321
      • 8.12. Binary Multiplication = 324
      • 8.13. Speeding Up Parallel Multiplication = 326
      • 8.14. Division Principles = 329
      • 8.15. Floating-point Number Representation = 334
      • 8.16. Encoding = 339
      • 8.17. Encoding for Compaction = 342
      • 8.18. Error Detection = 344
      • 8.19. Single-error Correction over a Set of Binary Numbers = 346
      • 8.20. Single-error Correction of Each Code Point: Hamming Code = 346
      • 9. computer Architecture and Microprogramming = 353
      • 9.1. Initial Program Load and Instruction Sequencing = 354
      • 9.2. Choice of Radix and Length of Information Units = 358
      • 9.3. Some Fundamental Objectives in Address-system Design = 362
      • 9.4. Addressing Modes (Immediate, Direct, Indirect) = 363
      • 9.5. Address Modification: Indexing = 366
      • 9.6. Binding Time and Relocatability = 367
      • 9.7. Features of an Addressing System = 368
      • 9.8. Push-down Storage, or Stack = 372
      • 9.9. Operating Systems: Essential Hardware Requirements = 374
      • 9.10. Storage Protection and Privileged Mode = 377
      • 9.11. Program Interrupt = 379
      • 9.12. InPut/Output Control = 383
      • 9.13. Microprogramming: Purpose and Principles = 385
      • 9.14. Microprogramming: An Example Configuration = 387
      • 9.15. A Simple Machine = 392
      • 9.16. Summary = 398
      • 10. The IBM System/360 and System/370 = 403
      • 10.1. Data Representations = 405
      • 10.2. Registers and Addressing = 408
      • 10.3. lnstruction Formats = 412
      • 10.4. Branch-type Instructions = 414
      • 10.5. Other Interesting Instructions = 418
      • 10.6. Interrupt Principle = 418
      • 10.7. Channels and Channel Logic = 424
      • 10.8. System/360 Implementation Summary = 432
      • 10.9. The IBM System/370: Mod 155 Buffer Storage Organization = 434
      • 11. Some Principles of Reliability Theory = 443
      • 11.1. Definitions and Serie-Parallel Configurations = 445
      • 11.2. More General Reliability Stmctures = 447
      • 11.3. Component versus System Redundancy = 448
      • 11.4. Time-dependent Reliability = 449
      • 11.5. Concluding Remark = 451
      • Appendix
      • A Mathematical Constants in Radices 10, 8, and 16 ; Power of 2 = 455
      • B Summary of Some Results in Combinatorial Analysis and Probabbility = 457
      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼