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] table of contents, index vs. tables current table and historical table, using enabling data retrieval as with table of contents forcing row ordering improving contention within indexes index-organized table (IOT) locking 2nd number involved in a query partitioning physical design of pre-joining remote, joins single table in hierarchical tree structure tables that are views valuation tablespace (Oracle), referred to as a partition tactics, defined by strategy temporary storage temporary tables disadvantages of using third normal form (3NF) 2nd data warehousing and threads spawned by listener in database connections three-valued logic (implied by nulls) "tight-fit" query time information timestamps reverse indexing and top-down tree walk adjacency model aggregating values stored in leaf nodes materialized path model nested set model performance for various models Transact-SQL, @@IDENTITY system variable transaction space transactional databases indexes indexing requirements transactions across heterogeneous systems good practices in locking and committing transformations mathematical equivalence of star transformation emulating transparent references to remote data tree structures aggregating values from trees propagating percentages across levels values stored in leaf nodes hierarchies, practical examples of master/detail relationships vs. materialized path model, exploding of indexes practical implementation of trees adjacency model materialized path model nested set model representing trees in SQL database walking a tree in SQL bottom-up walk top-down walk triggers 2nd index maintenance costs vs. Tropashko, Vadim truncate operations delete vs. truths freedom in the choice of tuning adding indexes two-valued logic types implicit conversions partitioning by |
Категории