The Art of SQL

Index

[SYMBOL] [A] [B] [C] [D] [E] [F] [G] [H] [I] [J] [K] [L] [M] [N] [O] [P] [Q] [R] [S] [T] [U] [V] [W] [X]

pages

     locking

     pre-joined tables and

parallelism

     adjusting to solve contention problems

     increased, with partitioning

     processing very large volumes of information

parallelized queries

parent/child link, master/detail relationship vs.

parents, multiple

Parkinson's Law

partition clause

partition key

partition pruning

partitioned view

partitioning 2nd

     archival and data purges

     data distribution and

     data-driven

     determining best way to partition data

     methods of

     round-robin

     scattering or clustering data

     solution for contention

     solving data volume problems

partitions

     varying meanings among DBMS systems

Pascal, Fabian

percentages, propagating across different tree levels

performance

     bottom-up tree walk, comparing for various models

     clustered vs. non-clustered indexes

     committing and

     computing head counts from aggregation of information in leaf nodes

     costs of excess flexibility

     database connections, minimizing

     database engine, hardware, and I/O subsystems

     database links, costs of

     design and

     improving queries, what really matters

     joins and

     non-relational layer of queries

     procedural logic and

     request complexity and

     results from contention-limiting measures

     solving problems with

         aggregating by range (bands)

         columns that should have been rows

         columns that should have been something else

         finding the best match

         optimizer directives

         querying a list variable

         rows that should have been columns

         selecting rows matching several list items

         superseding a general case

     statements arriving faster than they are serviced

     top-down query, comparing various models

     transparent references to remote data

persistency layers, abstract

PHP

     wrapping SQL in

physical layout of data

     conflicting goals in optimization attempts

     forcing row ordering

     index performance and

     indexes as data repositories

     partitioning

         best way to partition, determining

         data distribution and

         scattering or clustering data

     pre-joining tables

     process requirements and physical design

     sacrificing simplicity with strong structuring

pivot operator

pivot tables

     creating

     multiplying rows

     passing list of values as single string to a statement

     using values

place-holders (bind variables)

pointers, manipulation of

Practical Issues in Database Management

primary key index

     clustering index, using as

     insertion rate for IOT vs. regular table

     limiting contention within

primary keys

     composite

         order of columns

     defining

     detection of duplicates

     indexing of

     subtype relationships

     system-generated, indexing of

     values in operational database vs. dimension identifiers

     whole key dependence and

primitive input

principles

probabilistic basis, coding on

problems, defining before solution

procedural logic

     achieving in database applications

     exception handling and

     in SQL, reasons for shunning

procedural processes within a business, paying too much attention to

procedural processing, declarative vs.

processes

     physical database layout and

     spawned by listener in database connections

processing flow

production databases

program variable for sequence value

purging data