OLAP and Metadata
OLAP and Metadata
OLAP and Metadata
Operational metadata, which include data lineage (history of migrated data and the
sequence of transformations applied to it), currency of data (active, archived, or
purged), and monitoring information (warehouse usage statistics, error reports, and
audit trails).
The algorithms used for summarization, which include measure and dimension
definition algorithms, data on granularity, partitions, subject areas, aggregation,
summarization, and predefined queries and reports.
The mapping from the operational environment to the data warehouse, which
includes source databases and their contents, gateway descriptions, data partitions, data
extraction, cleaning, transformation rules and defaults, data refresh and purging
rules,
and security (user authorization and access control).
Data related to system performance, which include indices and profiles that improve
data access and retrieval performance, in addition to rules for the timing and
scheduling of refresh, update, and replication cycles.
➢ Consolidation (Roll-Up)
➢ Drill-Down
➢ Slicing and Dicing
The drill-down is a technique that allows users to navigate through the details.
For instance, users can view the sales by individual products that make up a region’s
sales.
Slicing and dicing is a feature whereby users can take out (slicing) a specific set of
data of the OLAP cube and view (dicing) the slices from different viewpoints.
Types of OLAP:
ROLAP works directly with relational databases. The base data and the
dimension tables are stored as relational tables and new tables are created to hold
the aggregated information. It depends on a specialized schema design.
This methodology relies on manipulating the data stored in the relational database
to give the appearance of traditional OLAP's slicing and dicing functionality. In
essence, each action of slicing and dicing is equivalent to adding a "WHERE"
clause in the SQL statement.
ROLAP tools do not use pre-calculated data cubes but instead pose the query to
the standard relational database and its tables in order to bring back the data
required to answer the question.
ROLAP tools feature the ability to ask any question because the methodology
does not limit to the contents of a cube. ROLAP also has the ability to drill down
to the lowest level of detail in the database.
MOLAP stores this data in an optimized multi-dimensional array storage, rather than
in a relational database. Therefore, it requires the pre-computation and storage
of information in the cube - the operation known as processing.
MOLAP tools generally utilize a pre-calculated data set referred to as a data cube.
The data cube contains all the possible answers to a given range of questions.
MOLAP tools have a very fast response time and the ability to quickly write back
data into the data set.
Data Integration:
It combines data from multiple sources into a coherent data store, as in data warehousing.
These sources may include multiple databases, data cubes, or flat files.
The data integration systems are formally defined as triple<G, S, M> Where G: The
global schema
How can the data analyst or the computer be sure that customer id in one database and
customer number in another reference to the same attribute?
2. Redundancy:
An attribute (such as annual revenue, for instance) may be redundant if it can be derived
from another attribute or set of attributes. Inconsistencies in attribute or dimension naming
can also cause redundancies in the resulting data set.
For the same real-world entity, attribute values from different sources may differ.
Data Transformation:
In data transformation, the data are transformed or consolidated into forms appropriate
for mining.
Smoothing, which works to remove noise from the data. Such techniques include binning,
regression, and clustering.
Aggregation, where summary or aggregation operations are applied to the data. For
example, the daily sales data may be aggregated so as to compute monthly and annual total
amounts. This step is typically used in constructing a data cube for analysis of the data at
multiple granularities.
Generalization of the data, where low-level or ―primitive‖ (raw) data are replaced
by higher-level concepts through the use of concept hierarchies. For example, categorical
attributes, like street, can be generalized to higher-level concepts, like city or country.
Normalization, where the attribute data are scaled so as to fall within a small specified
range, such as 1:0 to 1:0, or 0:0 to 1:0.
Attribute construction (or feature construction), where new attributes are constructed
and added from the given set of attributes to help the mining process.
Data Reduction:
Data reduction techniques can be applied to obtain a reduced representation of the data set that
is much smaller in volume, yet closely maintains the integrity of the original data. That is, mining
on the reduced data set should be more efficient yet produce the same (or almost the same)
analytical results.
Strategies for data reduction include the following:
Data cube aggregation, where aggregation operations are applied to the data in the
construction of a data cube.
Attribute subset selection, where irrelevant, weakly relevant, or redundant attributes or
dimensions may be detected and removed.
Dimensionality reduction, where encoding mechanisms are used to reduce the dataset
size.
Numerosity reduction, where the data are replaced or estimated by alternative,
smaller data representations such as parametric models (which need store only the model
parameters instead of the actual data) or nonparametric methods such as clustering,
sampling, and the use of histograms.
Discretization and concept hierarchy generation, where raw data values for
attributes are replaced by ranges or higher conceptual levels. Data discretization is a form
of numerosity reduction that is very useful for the automatic generation of concept
hierarchies. Discretization and concept hierarchy generation are powerful tools for
datamining, in that they allow the mining of data at multiple levels of abstraction.