- Cover image
- Title page
- Table of Contents
- Copyright
- Dedication
- Introduction to the Fifth Edition
- Part 1: Data Declaration Features
- Chapter 1: Databases Versus File Systems
- Chapter 2: Transactions and Concurrency Control
- Abstract
- 2.1 Sessions
- 2.2 Transactions and ACID
- 2.3 Concurrency Control
- 2.4 The Isolation Levels
- 2.5 Pessimistic Concurrency Control
- 2.6 SNAPSHOT Isolation Optimistic Concurrency
- 2.7 Logical Concurrency Control
- 2.8 CAP Theorem
- 2.9 BASE
- 2.10 Server-Side Consistency
- 2.11 Error Handling
- 2.12 Deadlock and Livelocks
- Chapter 3: Tables
- Chapter 4: Keys, Locators, and Generated Values
- Chapter 5: Normalization
- Abstract
- 5.1 Functional and Multivalued Dependencies
- 5.2 First Normal Form (1NF)
- 5.3 Second Normal Form (2NF)
- 5.4 Third Normal Form (3NF)
- 5.5 Elementary Key Normal Form (EKNF)
- 5.6 Boyce-Codd Normal Form (BCNF)
- 5.7 Fourth Normal Form (4NF)
- 5.8 Fifth Normal Form (5NF)
- 5.9 Domain-Key Normal Form (DKNF)
- 5.10 Practical Hints for Normalization
- 5.11 Non-Normal Form Redundancy
- Chapter 6: VIEWs, Derived, and Other Virtual Tables
- Chapter 7: Auxiliary Tables
- Chapter 8: Other Schema Objects
- Chapter 9: DDL Flaws to Avoid
- Part 2: Data Types
- Part 3: Row and Column Level Features
- Chapter 17: Comparison or Theta Operators
- Chapter 18: Subquery Predicates
- Chapter 19: BETWEEN and OVERLAPS Predicates
- Chapter 20: CASE Expression Family
- Chapter 21: LIKE and SIMILAR TO Predicates
- Chapter 22: Basic SELECT Statement
- Chapter 23: Basic Aggregate Functions
- Chapter 24: Advance Descriptive Statistics
- Chapter 25: OLAP Aggregation in SQL
- Chapter 26: Advanced SELECT Statements
- Part 4: Data Structures in SQL
- Chapter 27: Graphs in SQL
- Chapter 28: Trees and Hierarchies in SQL
- Abstract
- 28.1 Adjacency List Model
- 28.2 Finding the Root Node
- 28.3 Finding Leaf Nodes
- 28.4 Finding Levels in a Tree
- 28.5 Tree Operations
- 28.6 Nested Sets Model
- 28.7 Finding Root and Leaf Nodes
- 28.8 Finding Subtrees
- 28.9 Finding Levels and Paths in a Tree
- 28.10 Functions in the Nested Sets Model
- 28.11 Deleting Nodes and Subtrees
- 28.12 Summary Functions on Trees
- 28.13 Inserting and Updating Trees
- 28.14 Converting Adjacency List to Nested Sets Model
- 28.15 Converting Nested Sets to Adjacency List Model
- 28.16 Comparing Nodes and Structure
- Chapter 29: Queues
- Chapter 30: Matrices in SQL
- Part 5: Typical Queries
- Chapter 31: Partitioning and Aggregating Data in Queries
- Chapter 32: Sub-sequences, Regions, Runs, Gaps, and Islands
- Abstract
- 32.1 Finding Subregions of Size (n)
- 32.2 Numbering Regions
- 32.3 Finding Regions of Maximum Size
- 32.4 Bound Queries
- 32.5 Run and Sequence Queries
- 32.6 Summation of a Handmade Series
- 32.7 Swapping and Sliding Values in a List
- 32.8 Condensing a List of Numbers
- 32.9 Folding a List of Numbers
- 32.10 Coverings
- 32.11 Equivalence Classes and Cliques
- Chapter 33: Auctions
- Chapter 34: Relational Division
- Chapter 35: Temporal Queries
- Part 6: Implementation and Coding Issues
Joe Celko's SQL for Smarties
Advanced SQL Programming
Fifth Edition
Joe Celko
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.