SEARCH
0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Prev | Current Page 185 | Next

Robert Wrembel and Christian Koncilia

"Data Warehouses and Olap: Concepts, Architectures and Solutions"


Modern DBMS support some kind of partitioning with unique techniques and constructions.
The first way to achieve partitions in the Oracle DBMS was with the use
of views; a partitioned table was defined as a view of many tables with the same
layout connected together in ???union all.??? Partitioning pruning, the ability of the
query optimizer to involve only the few necessary partitions in a query instead of
the all partitions, was achieved via an initialization parameter. Starting with Oracle8
and further releases, partitioning constructions were introduced in SQL as specific
???partitioning clauses.??? Each partition can have its storage attributes like distinct
tables, and there is information stored in the dictionary that permits a unified view
of them. Nowadays, in the Oracle DBMS there are three types of partitions: range,
hash, and list, with the possibility of subpartitioning by hash or list.
Partitioning is a fundamental issue in the DW and ETL design because this technique
permits an easy management of history, loading, and query performance. Each row
in a DW fact table has columns named ???date-of-fact??? or ???loading-date???; when one
wants to maintain data for a certain period of time (one month, one year, etc.), one
must label the rows with a date (date-of-fact) and then, via management operation
on tables at every loading cycle, delete old rows, making space for the new records.


Pages:
173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197