Muutke küpsiste eelistusi

E-raamat: Database Systems: A Pragmatic Approach

4.67/5 (6 hinnangut Goodreads-ist)
,
  • Formaat: PDF+DRM
  • Ilmumisaeg: 24-Dec-2014
  • Kirjastus: APress
  • Keel: eng
  • ISBN-13: 9781484208779
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 67,91 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Database Systems: A Pragmatic ApproachSuurem pilt
  • Formaat: PDF+DRM
  • Ilmumisaeg: 24-Dec-2014
  • Kirjastus: APress
  • Keel: eng
  • ISBN-13: 9781484208779
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

Database Systems: A Pragmatic Approach is a classroom textbook for use by students who are learning about relational databases, and the professors who teach them. It discusses the database as an essential component of a software system, as well as a valuable, mission critical corporate resource. The book is based on lecture notes that have been tested and proven over several years, with outstanding results. It also exemplifies mastery of the technique of combining and balancing theory with practice, to give students their best chance at success. Upholding his aim for brevity, comprehensive coverage, and relevance, author Elvis C. Foster's practical and methodical discussion style gets straight to the salient issues, and avoids unnecessary fluff as well as an overkill of theoretical calculations.

The book discusses concepts, principles, design, implementation, and management issues of databases. Each chapter is organized systematically into brief, reader-friendly sections, with itemization of the important points to be remembered. It adopts a methodical and pragmatic approach to solving database systems problems. Diagrams and illustrations also sum up the salient points to enhance learning. Additionally, the book includes a number of Foster's original methodologies that add clarity and creativity to the database modeling and design experience while making a novel contribution to the discipline. Everything combines to make Database Systems: A Pragmatic Approach an excellent textbook for students, and an excellent resource on theory for the practitioner.
About the Authors xxvii
Preface xxix
Acknowledgments xxxv
Part A Preliminary Topics
1(28)
Chapter 1 Introduction to Database Systems
3(10)
1.1 Definitions and Rationale
3(2)
1.2 Objectives of a Database System
5(2)
Clarification on Data Independence
7(1)
1.3 Advantages of a Database System
7(1)
1.4 Approaches to Database Design
8(1)
1.5 Desirable Features of a DBS
8(1)
1.6 Database Development Life Cycle
8(2)
1.7 Summary and Concluding Remarks
10(1)
1.8 Review Questions
10(1)
1.9 References and/or Recommended Readings
11(2)
Chapter 2 The Database System Environment
13(16)
2.1 Levels of Architecture
13(3)
2.1.1 External Level
14(1)
2.1.2 Conceptual Level
15(1)
2.1.3 Internal Level
15(1)
2.2 Inter-level Mappings
16(1)
2.3 The Database Administrator
16(1)
2.4 The Database Management System
17(2)
2.5 Components of DBMS Suite
19(3)
2.5.1 The DBMS Engine
20(1)
2.5.2 Definition Tools Subsystem
20(1)
2.5.3 The User Interface Subsystem
20(1)
2.5.4 Application Development Subsystem
21(1)
2.5.5 Data Administration Subsystem
21(1)
2.5.6 Data Dictionary Subsystem
21(1)
2.5.7 Data Communications Manager
22(1)
2.5.8 Utilities Subsystem
22(1)
2.6 The Front-end and Back-end Perspectives
22(1)
2.7 Database System Architecture
23(3)
2.8 Summary and Concluding Remarks
26(1)
2.9 Review Questions
26(1)
2.10 References and/or Recommended Readings
27(2)
Part B The Relational Database Model
29(140)
Chapter 3 The Relational Model
31(26)
3.1 Basic Concepts
31(2)
3.2 Domains
33(1)
Significance of Domains
34(1)
3.3 Relations
34(3)
3.3.1 Properties of a Relation
35(1)
3.3.2 Kinds of Relations
36(1)
3.4 Relational Database System
37(1)
Steps in Building a Relational Database System
37(1)
3.5 Identifying, Representing, and Implementing Relationships
38(11)
3.5.1 Identifying Relationships
38(1)
3.5.2 Representing Relationships
39(1)
The Entity-Relationship Model
39(4)
3.5.4 The Object-Relationship Model
43(1)
3.5.5 Database Tree
43(1)
Database Networks
44(1)
3.5.3 Multiplicity of Relationships
45(1)
3.5.4 Implementing Relationships
46(3)
3.6 The Relation-Attributes List and Relationship List
49(4)
3.7 Non-Relational Approaches
53(1)
3.8 Summary and Concluding Remarks
53(1)
3.9 Review Questions
54(1)
3.10 References and/or Recommended Readings
55(2)
Chapter 4 Integrity Rules and Normalization
57(26)
4.1 Fundamental Integrity Rules
57(1)
4.2 Foreign Key Concept
58(2)
Deletion of Referenced Tuples
59(1)
4.3 Rationale for Normalization
60(1)
4.4 Functional Dependence and Non-loss Decomposition
61(3)
4.4.1 Functional Dependence
61(1)
4.4.2 Non-loss Decomposition
62(2)
4.5 The First Normal Form
64(2)
Problems with Relations in 1NF Only
65(1)
4.6 The Second Normal Form
66(1)
Problems with Relations in 2NF Only
66(1)
4.7 The Third Normal Form
67(1)
Problems with Relations in 3NF Only
67(1)
4.8 The Boyce-Codd Normal Form
68(1)
4.9 The Fourth Normal Form
69(2)
4.9.1 Multi-valued Dependency
70(1)
4.9.2 Fagin's Theorem
70(1)
4.10 The Fifth Normal Form
71(3)
4.10.1 Definition of Join Dependency
73(1)
4.10.2 Fagin's Theorem
73(1)
4.11 Other Normal Forms
74(4)
4.11.1 The Domain-Key Normal Form
74(1)
4.11.2 The Sixth Normal Form
75(3)
4.12 Summary and Concluding Remarks
78(1)
4.13 Review Questions
79(1)
4.14 References and/or Recommended Readings
80(3)
Chapter 5 Database Modeling and Design
83(36)
5.1 Database Model and Database Design
83(1)
5.1.1 Database Model
84(1)
5.1.2 Database Design
84(1)
5.2 The E-R Model Revisited
84(4)
5.3 Database Design via the E-R Model
88(1)
5.4 The Extended Relational Model
89(6)
5.4.1 Entity Classifications
89(1)
5.4.2 Surrogates
90(2)
5.4.3 E-Relations and P-Relations
92(2)
5.4.4 Integrity Rules
94(1)
5.5 Database Design via the XR Model
95(6)
5.5.1 Determining the Kernel Entities
95(1)
5.5.2 Determining the Characteristic Entities
96(1)
5.5.3 Determining the Designative Entities
97(1)
5.5.4 Determining the Associations
97(1)
5.5.5 Determining Entity Subtypes and Super-types
98(1)
5.5.6 Determining Component Entities
98(1)
5.5.7 Determining the Properties
99(2)
5.6 The UML Model
101(3)
5.7 Database Design via the UML Model
104(1)
5.8 Innovation: The Object/Entity Specification Grid
105(3)
5.9 Database Design via Normalization Theory
108(5)
5.9.1 Example: Mountaineering Problem
108(3)
5.9.2 Determining Candidate Keys and then Normalizing
111(2)
5.10 Database Model and Design Tools
113(2)
5.11 Summary and Concluding Remarks
115(1)
5.12 Review Questions
116(1)
5.13 References and/or Recommended Readings
117(2)
Chapter 6 Database User Interface Design
119(10)
6.1 Introduction
119(2)
6.2 Deciding on User Interface
121(1)
6.3 Steps in User Interface Design
121(3)
6.3.1 Menu or Graphical User Interface
121(3)
6.3.2 Command-Based User Interface
124(1)
6.4 User Interface Development and Implementation
124(2)
6.5 Summary and Concluding Remarks
126(1)
6.6 Review Questions
127(1)
6.7 References and/or Recommend Readings
127(2)
Chapter 7 Relational Algebra
129(20)
7.1 Introduction
129(1)
7.2 Basic Operations of Relational Algebra
130(2)
7.2.1 Primary and Secondary Operations
131(1)
7.2.2 Codd's Original Classification of Operations
131(1)
7.2.3 Nested Operations
131(1)
7.3 Syntax of Relational Algebra
132(11)
7.3.1 Select Statement
135(1)
7.3.2 Projection Statement
136(1)
7.3.3 Natural Join Statement
137(1)
7.3.4 Cartesian Product
138(2)
7.3.5 Theta-Join
140(1)
7.3.6 Union, Intersection, Difference Statements
141(1)
7.3.7 Division Statement
142(1)
7.4 Aliases, Renaming and the Relational Assignment
143(2)
7.4.1 The Alias Operation
143(1)
7.4.2 The Assignment Operation
144(1)
7.4.3 The Rename Operation
144(1)
7.5 Other Operators
145(2)
7.6 Summary and Concluding Remarks
147(1)
7.7 Review Questions
147(1)
7.8 References and/or Recommended Readings
148(1)
Chapter 8 Relational Calculus
149(14)
8.1 Introduction
149(2)
8.2 Calculus Notations and Illustrations
151(3)
8.3 Quantifiers, Free and Bound Variables
154(3)
8.3.1 Well-Formed Formula
154(1)
8.3.2 Free and Bound Variables
155(2)
8.4 Substitution Rule and Standardization Rules
157(1)
8.5 Query Optimization
158(2)
8.6 Domain Oriented Relational Calculus
160(1)
8.7 Summary and Concluding Remarks
161(1)
8.8 Review Questions
161(1)
8.9 References and/or Recommended Readings
162(1)
Chapter 9 Relational System--- a Closer Look
163(6)
9.1 The Relational Model Summarized
163(1)
9.2 Ramifications of the Relational Model
164(4)
9.2.1 Codd's Early Benchmark
164(1)
9.2.2 Revised Definition of a Relational System
165(2)
9.2.3 Far Reaching Consequences
167(1)
9.3 Summary and Concluding Remarks
168(1)
9.4 Review Questions
168(1)
9.5 References
168(1)
Part C The Structured Query Language
169(130)
Chapter 10 Overview of SQL
171(6)
10.1 Important Facts
171(2)
10.1.1 Commonly Used DDL Statements
172(1)
10.1.2 Commonly Used DML and DCL Statements
173(1)
10.1.3 Syntax Convention
173(1)
10.2 Advantages of SQL
173(1)
10.3 Summary and Concluding Remarks
174(1)
10.4 Review Questions
175(1)
10.5 Recommended Readings
175(2)
Chapter 11 SQL Data Definition Statements
177(42)
11.1 Overview of Oracle's SQL Environment
178(1)
11.2 Database Creation
179(1)
11.3 Database Management
180(4)
11.4 Tablespace Creation
184(2)
11.5 Tablespace Management
186(1)
11.6 Table Creation Statement
187(12)
11.7 Dropping or Modifying a Table
199(9)
11.8 Working with Indexes
208(5)
11.9 Creating and Managing Sequences
213(1)
11.10 Altering and Dropping Sequences
214(1)
11.11 Creating and Managing Synonyms
215(1)
11.12 Summary and Concluding Remarks
216(1)
11.13 Review Questions
217(1)
11.14 References and/or Recommended Readings
217(2)
Chapter 12 SQL Data Manipulation Statements
219(40)
12.1 Insertion of Data
220(2)
12.2 Update Operations
222(2)
12.3 Deletion of Data
224(1)
12.4 Commit and Rollback Operations
225(1)
12.5 Basic Syntax for Queries
226(3)
12.6 Simple Queries
229(1)
12.7 Queries Involving Multiple Tables
230(4)
12.7.1 The Traditional Method
230(2)
12.7.2 The ANSI Method
232(2)
12.8 Queries Involving the use of Functions
234(7)
12.8.1 Row Functions
234(2)
12.8.2 Date Functions
236(1)
12.8.3 Data Conversion Functions
237(1)
12.8.4 Programmer-Defined Functions
238(1)
12.8.5 Aggregation Functions
239(2)
12.9 Queries Using LIKE, BETWEEN and IN Operators
241(1)
12.10 Nested Queries
242(4)
12.11 Queries Involving Set Operators
246(1)
12.12 Queries with Runtime Variables
247(1)
12.13 Queries Involving SQL Plus Format Commands
248(1)
12.14 Embedded SQL
249(3)
12.15 Dynamic Queries
252(3)
12.16 Summary and Concluding Remarks
255(2)
12.17 Review Questions
257(1)
12.18 References and/or Recommended Readings
258(1)
Chapter 13 SQL Views and System Security
259(20)
13.1 Traditional Logical Views
259(4)
13.1.1 View Creation
260(2)
13.1.2 View Modification and Removal
262(1)
13.1.3 Usefulness and Manipulation of Logical Views
263(1)
13.2 System Security
263(9)
13.2.1 Access to the System
264(4)
13.2.2 Access to the System Resources
268(2)
13.2.3 Access to the System Data
270(2)
13.3 Materialized Views
272(4)
13.3.1 Creating a Materialized View
273(2)
13.3.2 Altering or Dropping a Materialized View
275(1)
13.4 Summary and Concluding Remarks
276(1)
13.5 Review Questions
277(1)
13.6 References and/or Recommended Readings
278(1)
Chapter 14 The System Catalog
279(12)
14.1 Introduction
279(1)
14.2 Three Important Catalog Tables
280(4)
14.2.1 The User_Tables View
280(1)
14.2.2 The User_Tab_Columns View
281(1)
14.2.3 The User_Indexes View
281(3)
14.3 Other Important Catalog Tables
284(2)
14.4 Querying the System Catalog
286(1)
14.5 Updating the System Catalog
286(2)
14.6 Summary and Concluding Remarks
288(1)
14.7 Review Questions
289(1)
14.8 References and/or Recommended Readings
289(2)
Chapter 15 Some Limitations of SQL
291(8)
15.1 Programming Limitations
291(1)
15.2 Limitations on Views
291(2)
15.2.1 Restriction on use of the Order-By-Clause
292(1)
15.2.2 Restriction on Data Manipulation for Views involving UNION, INTERSECT or JOIN
292(1)
15.3 Foreign Key Constraint Specification
293(1)
15.4 Superfluous Enforcement of Referential Integrity
293(1)
15.5 Limitations on Calculated Columns
294(1)
15.6 If-Then Limitation
295(1)
15.7 Summary and Concluding Remarks
296(1)
15.8 Review Questions
296(1)
15.9 Recommended Readings
297(2)
Part D Some Commonly Used DBMS Suites
299(54)
Chapter 16 Overview of Oracle
301(10)
16.1 Introduction
301(1)
16.2 Main Components of the Oracle Suite
302(5)
16.2.1 Oracle Server
303(1)
16.2.2 Oracle PL/SQL and SQL *Plus
304(1)
16.2.3 Oracle Developer Suite
305(1)
16.2.4 Oracle Enterprise Manager Database Control and SQL Developer
305(1)
16.2.5 Oracle Enterprise Manager Grid Control
306(1)
16.2.6 Oracle Database Configuration Assistant
306(1)
16.2.7 Oracle Warehouse Builder
307(1)
16.3 Shortcomings of Oracle
307(2)
16.4 Summary and Concluding Remarks
309(1)
16.5 Review Questions
309(1)
16.6 References and/or Recommended Readings
309(2)
Chapter 17 Overview of DB2
311(10)
17.1 Introduction
311(2)
17.2 Main Components of the DB2 Suite
313(4)
17.2.1 DB2 Universal Database Core
315(1)
17.2.2 IBM InfoSphere Information Server
315(1)
17.2.3 IBM Data Studio
316(1)
17.2.4 IBM InfoSphere Warehouse
317(1)
17.3 Shortcomings of DB2
317(1)
17.4 Summary and Concluding Remarks
318(1)
17.5 Review Questions
318(1)
17.6 References and/or Recommended Readings
319(2)
Chapter 18 Overview of MS SQL Server
321(14)
18.1 Introduction
322(1)
18.1.1 Brief History
322(1)
18.1.2 Operating Environment
322(1)
18.1.3 MS SQL Server and the Client-Server Model
323(1)
18.2 Main Features of MS SQL Server
323(1)
18.3 Editions of MS SQL Server
324(2)
18.4 Main Components of MS SQL Server Suite
326(3)
18.4.1 Server Components
326(1)
18.4.2 Management Tools
327(1)
18.4.3 Client Connectivity
327(1)
18.4.4 Development Tools
327(1)
18.4.5 Code Samples
328(1)
18.4.6 SQL Server Optional Components
328(1)
18.5 MS SQL Server Default Databases
329(1)
18.6 MS SQL Server Default Logins
330(1)
18.7 Named versus Default Instances
331(1)
18.8 Removing MS SQL Server
331(1)
18.9 Shortcomings of MS SQL Server
332(1)
18.10 Summary and Concluding Remarks
333(1)
18.11 Review Questions
334(1)
18.12 References and/or Recommended Readings
334(1)
Chapter 19 Overview of MySQL
335(10)
19.1 Introduction to MySQL
335(2)
19.2 Main Features of MySQL
337(1)
19.3 Main Components of MySQL
338(2)
19.4 Shortcomings of MySQL
340(2)
19.4.1 Limitation on Joins and Views
340(1)
19.4.2 Limitations on Sub-queries
340(1)
19.4.3 Limitations on server-side Cursors
341(1)
19.4.4 Other Limitations
342(1)
19.5 Summary and Concluding Remarks
342(1)
19.6 Review Questions
342(1)
19.7 References and/or Recommended Readings
343(2)
Chapter 20 Overview of Delphi
345(8)
20.1 Introduction
345(2)
20.2 Major Components of the Delphi Suite
347(4)
20.2.1 The Database Development Environment
348(1)
20.2.2 Interactive Development Environment
348(2)
20.2.3 Database Engine
350(1)
20.2.4 Component Library for Cross Reference
350(1)
20.2.5 Enterprise Core Object Subsystem
350(1)
20.2.6 Documentation
350(1)
20.3 Shortcomings of Delphi
351(1)
20.4 Summary and Concluding Remarks
351(1)
20.5 Review Questions
352(1)
20.6 References and/or Recommended Readings
352(1)
Part E Advanced Topics
353(60)
Chapter 21 Database Administration
355(12)
21.1 Database Installation, Creation, and Configuration
355(1)
21.2 Database Security
356(1)
21.3 Database Management
357(1)
21.4 Database Backup and Recovery
357(5)
21.4.1 Oracle Backups: Basic Concept
358(1)
21.4.2 Oracle Recovery: Basic Concept
358(1)
21.4.3 Types of Failures
358(2)
21.4.4 Database Backups
360(1)
21.4.5 Basic Recovery Steps
360(1)
21.4.6 Oracle's Backup and Recovery Solutions
361(1)
21.5 Database Tuning
362(3)
21.5.1 Tuning Goals
362(1)
21.5.2 Tuning Methodology
363(2)
21.6 Database Removal
365(1)
21.7 Summary and Concluding Remarks
365(1)
21.8 Review Questions
365(1)
21.9 References and/or Recommended Readings
366(1)
Chapter 22 Distributed Database Systems
367(12)
22.1 Introduction
367(1)
22.2 Advantages of Distributed Database Systems
368(1)
22.3 Twelve Rules for Distributed Database Systems
369(2)
22.4 Challenges to Distributed Database Systems
371(2)
22.5 Database Gateways
373(2)
22.6 The Future of Distributed Database Systems
375(1)
22.6.1 Object Technology
375(1)
22.6.2 Electronic Communication Systems
375(1)
22.7 Summary and Concluding Remarks
376(1)
22.8 Review Questions
376(1)
22.9 References and/or Recommended Readings
377(2)
Chapter 23 Object Databases
379(8)
23.1 Introduction
379(2)
23.2 Overview of Object-Oriented Database Management Systems
381(1)
23.3 Challenges for Object-Oriented Database Management Systems
381(1)
23.4 Hybrid Approaches
382(2)
23.4.1 Hybrid Approach A
383(1)
23.4.2 Hybrid Approach B
383(1)
23.5 Summary and Concluding Remarks
384(1)
23.6 Review Questions
384(1)
23.7 References and/or Recommended Readings
385(2)
Chapter 24 Data Warehousing
387(16)
24.1 Introduction
387(2)
24.2 Rationale for Data Warehousing
389(1)
24.3 Characteristics of a Data Warehouse
389(5)
24.3.1 Definitive Features
390(1)
24.3.2 Nature of Data Stored
390(1)
24.3.3 Processing Requirements
391(2)
24.3.4 Twelve Rules That Govern a Data Warehousing
393(1)
24.4 Data Warehouse Architecture
394(3)
24.4.1 Basic Data Warehouse Architecture
394(1)
24.4.2 Data Warehouse Architecture with a Staging Area
395(1)
24.4.3 Data Warehouse Architecture with a Staging Area and Data Marts
396(1)
24.5 Extraction, Transformation, and Loading
397(2)
24.5.1 What Happens During the ETL Process
398(1)
24.5.2 ETL Tools
398(1)
24.5.3 Daily Operations and Expansion of the Data Warehouse
399(1)
24.6 Summary and Concluding Remarks
399(1)
24.7 Review Questions
400(1)
24.8 References and/or Recommended Readings
401(2)
Chapter 25 Web-Accessible Databases
403(10)
25.1 Introduction
403(1)
25.2 Web-Accessible Database Architecture
404(1)
25.3 Supporting Technologies
405(3)
25.4 Implementation with Oracle
408(1)
25.5 Implementation with DB2
409(1)
25.6 Generic Implementation via a Front-end and a Back-end Tool
410(1)
25.7 Summary and Concluding Remarks
411(1)
25.8 Review Questions
411(1)
25.9 References and/or Recommended Readings
412(1)
Part F Final Preparations
413(34)
Chapter 26 Sample Exercises and Examination Questions
415(32)
26.1 Introduction
415(1)
26.2 Sample Assignment 1A
416(1)
26.3 Sample Assignment 2B
417(1)
26.4 Sample Assignment 3A
418(3)
26.5 Sample Assignment 4A
421(1)
26.6 Sample Assignment 5A
422(1)
26.7 Sample Assignment 6A
423(1)
26.8 Sample Assignment 7A
424(1)
26.9 Sample Assignment 8A
425(1)
26.10 Sample Interim Examination A
426(1)
26.11 Sample Interim Examination B
427(2)
26.12 Sample Final Examination A
429(5)
26.13 Sample Final Examination B
434(7)
26.14 Sample Final Examination C
441(6)
Part G Appendices
447(62)
Appendix 1 Review of Trees
449(30)
A1.1 Introduction to Trees
449(1)
A1.2 Binary Trees
450(1)
A1.2.1 Overview of Binary Trees
450(2)
A1.2.2 Representation of Binary Trees
452(1)
A1.2.3 Application of Binary Trees
453(1)
A1.2.4 Operations on Binary Trees
453(1)
A1.2.5 Implementation of Binary Trees
454(4)
A1.2.6 Binary Tree Traversals
458(3)
A1.2.7 Using Binary Tree to Evaluate Expressions
461(2)
A1.3 Threaded Binary Trees
463(1)
Threaded for In-order Traversal
463(1)
A1.4 Binary Search Trees
463(3)
A1.5 Height-Balanced Trees
466(1)
A1.6 Heaps
467(1)
A1.6.1 Building the Heap
467(1)
A1.6.2 Processing the Heap (Heap Sort)
468(1)
A1.7 M-Way Search Trees and B-Trees
469(2)
A1.7.1 Definition of B-tree
471(1)
A1.7.2 Implementation of the B-tree
471(5)
A1.8 Summary and Concluding Remarks
476(1)
A1.9 References and/or Recommended Readings
477(2)
Appendix 2 Review of Hashing
479(14)
A2.1 Introduction
479(1)
A2.2 Hash Functions
480(1)
A2.2.1 Absolute Addressing
481(1)
A2.2.2 Direct Table Lookup
481(1)
A2.2.3 Division-Remainder
482(1)
A2.2.4 Mid-Square
483(1)
A2.2.5 Folding
483(1)
A2.2.6 Truncation
484(1)
A2.2.7 Treating Alphanumeric Key Values
484(1)
A2.3 Collision Resolution
485(1)
A2.3.1 Linear Probing
485(1)
A2.3.2 Synonym Chaining
486(2)
A2.3.3 Rehashing
488(1)
A2.4 Hashing in Java
488(2)
A2.5 Summary and Concluding Remarks
490(1)
A2.6 References and/or Recommended Readings
491(2)
Appendix 3 Review of Information Gathering Techniques
493(16)
A3.1 Rationale for Information Gathering
493(2)
A3.2 Interviewing
495(1)
Steps in Planning the Interview
495(1)
Basic Guidelines for Interviews
495(1)
A3.3 Questionnaires and Surveys
496(1)
Guidelines for Questionnaires
496(1)
Using Scales in Questionnaires
497(1)
Administering the Questionnaire
498(1)
A3.4 Sampling and Experimenting
498(1)
A3.4.1 Probability Sampling Techniques
499(1)
A3.4.2 Non-Probability sampling Techniques
499(1)
A3.4.3 Sample Calculations
500(2)
A3.5 Observation and Document Review
502(1)
A3.6 Prototyping
502(1)
Kinds of Prototypes
503(1)
A3.7 Brainstorming and Mathematical Proof
503(1)
A3.8 Object Identification
504(1)
A3.8.1 The Descriptive Narrative Approach
505(1)
A3.8.2 The Rule-of-Thumb Approach
506(1)
A3.9 Summary and Concluding Remarks
507(1)
A3.10 References and/or Recommended Readings
508(1)
Index 509
Elvis C. Foster is Associate Professor of Computer Science at Keene State College, New Hampshire. He holds a Bachelor of Science (BS.) in Computer Science and Electronics, as well as a Doctor of Philosophy (PhD) in Computer Science (specializing in strategic information systems and database systems) from University of the West Indies, Mona Jamaica. Dr. Foster has over 22 years of combined experience as a software engineer, information technology executive and consultant, and computer science educator.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97814842087792e.html
Märksõnad: