A

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]

absence of data, result sets predicated on
abstract layers
ad hoc queries
addresses 2nd
     atomicity and
adjacency model (SQL trees) 2nd 3rd
     aggregating values stored in leaf nodes
         computing head counts at every level
     bottom-up tree walk
     top-down walk
aggregation
     by range (bands)
     consolidating multiple rows into one
     double conversion, using
     in transformations
     on dates
     result sets obtained from
     values from trees
         propagating percentages across levels
         values stored in leaf nodes
aggressive coding
analytical functions (Oracle)
ANSI SQL query (example)
architectural solutions for contention
archival data
     purging
archives, location of 2nd
array interface, communicating between program and DBMS kernel
art of SQL, governing factors
     number of tables
     number of users
     result set criteria
     result set size
     total quantity of data
associative table, resolving many-to-many relationship between tables
asynchronous processing
atomic attributes 2nd
atomicity
     business requirements and
     function applied to a column
attributes
     atomic 2nd
     dealing with varying numbers of
     excessive flexibility in
     independence of
auto-incremented columns
     not using in order to limit contention
axioms