H



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]

hardcoding 2nd
hardware
     balancing programming mistakes with power
     failures of
hash indexes
hash joins 2nd 3rd 4th 5th
hash-partitioning
having clause
     filtering after group by clause
     use in aggregate statements
head counts, modeling
     computing head counts at every level
heap-organized table, index-organized table vs.
hierarchical data
     practical example of hierarchies
     suggested explode( ) operator
     walking a tree in SQL
         aggregating values from trees
         bottom-up walk
         top-down walk
     walking hierarchies
hierarchical databases
hierarchical ordering of tables with IOTs and clustered indexes
hints to the optimizer
historical data
     current values, obtaining
     design of tables storing
     difficulties of working with
     many historical values per item
     many items with few historical values
     partitioning tables by date
historical table, using
host language, SQL statements embedded in
hot spot in an index tree




The Art of SQL
The Art of SQL
ISBN: 0596008945
EAN: 2147483647
Year: N/A
Pages: 143

flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net