<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Coral Calero</string-name>
          <email>ccalero@inf-cr.uclm.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Carolina Pascual</string-name>
          <email>ccoimbra@proyectos.inf-cr.uclm.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mario Piattini</string-name>
          <email>mpiattin@inf-cr.uclm.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Manuel A. Serrano</string-name>
          <email>mserrano@inf-cr.uclm.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ALARCOS Research Group, University of Castilla-La Mancha (Spain)</institution>
          ,
          <addr-line>Rda. Calatrava s/n 13071 Ciudad Real -</addr-line>
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>1996</year>
      </pub-date>
      <fpage>205</fpage>
      <lpage>216</lpage>
      <abstract>
        <p>Organizations are adopting datawarehouses to manage information efficiently as “the” main organizational asset. It is essential that we can assure the information quality of the data warehouse, as it became the main tool for strategic decisions. Information quality depends on presentation quality and the data warehouse quality. This last includes the multidimensional model quality. In the last years different authors have proposed some useful guidelines to design multidimensional models, however more objective indicators are needed to help designers and managers to develop quality datawarehouses. In this paper a first proposal of metrics for multidimensional model quality is shown together with their formal validation.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>Nowadays organizations can store vast amounts of data
obtained at a relatively low cost, however these data fail to
provide information [GAR98]. To solve this problem,
organizations are adopting a data warehouse, which is
defined as a “collection of subject-oriented, integrated,
non-volatile data that supports the management decision</p>
      <sec id="sec-1-1">
        <title>The copyright of this paper belongs to the paper’s authors. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage.</title>
        <sec id="sec-1-1-1">
          <title>Proceedings of the International Workshop on Design and</title>
        </sec>
        <sec id="sec-1-1-2">
          <title>Management of Data Warehouses (DMDW'2001)</title>
          <p>Interlaken, Switzerland, June 4, 2001
(D. Theodoratos, J. Hammer, M. Jeusfeld, M. Staudt, eds.)
http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-39/
process” [INM96]. Data warehouses have become the key
trend in corporate computing in the last years, since they
provide managers with the most accurate and relevant
information to improve strategic decisions. Jarke et al.
[JAR00] forecast a 12 Millions American dollars for the
data warehouse market.</p>
          <p>Different life cycles and techniques have been
proposed for data warehouse development [HAM96]
[KEL97] [KIM98]. However the development of a data
warehouse is a difficult and very risky task. It is essential
that we can assure the information quality of the data
warehouse as it became the main tool for strategic
decisions [ENG99].</p>
          <p>Information quality of a data warehouse comprise data
warehouse system quality and data presentation quality
(see figure 1). In fact, it is very important that data in the
data warehouse reflects correctly the real world, but it is
also very important that data can be easily understood. In
data warehouse system quality, as in an operational
database [PIA00], three different aspects could be
considered: DBMSs quality, data model quality (both
conceptual and logical) and data quality.</p>
          <p>In order to assess DBMS quality we can use an
international standard like [ISO98], or some of the existing
product comparative studies. This type of quality should
be addressed in the product selection stage of the data
warehouse life cycle.</p>
          <p>Data quality is composed by the data definition quality
(degree to which data definition accurately describes the
meaning of the real-world entity type or fact-type that the
data represents. Also meets the needs of all information
customers to understand the data they use), the data
content quality (degree to which data values accurately
represent the characteristics of the real-world entity or fact
and meet the need of the information costumers to perform
their jobs effectively) and the data presentation quality
(try to capture the degree in which the format presented is
intuitive for the use to be made of the information)
[ENG98]. This kind of quality must address mostly in the
extraction, filtering, cleaning and cleansing,
synchronization, aggregation, loading, etc. activities of the
life cycle. In the last years very interesting techniques
have been proposed to assure data quality [BOU00].</p>
          <p>INFORMATIONQUALITY
DATAWAREHOUSE</p>
          <p>QUALITY</p>
          <p>PRESENTATION</p>
          <p>QUALITY
DBMS
QUALITY</p>
          <p>DATA MODEL</p>
          <p>QUALITY</p>
          <p>DATA</p>
          <p>QUALITY
DIMENSIONAL
MODEL QUALITY</p>
          <p>PHYSICAL
MODELQUALITY</p>
          <p>Metrics could be used to build prediction systems for
database projects, to understand and improve software
development and maintenance projects, to maintain the
quality of the systems, highlighting problematic areas, and
to determine the best ways to help practitioners and
researchers in their work.</p>
          <p>The final goal of our work is to define a set of metrics
for assuring data warehouse quality by means of
measuring the dimensional data model quality. In the next
section we will present the method we use for defining
correct metrics. A first proposal of metrics for data
warehouses will be described in section 3 and an example
of the proposed metrics will be shown in section 4. Section
5 will present the formal validation of the metrics and
conclusions and future work will come in the last section.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2 Defining Valid Metrics</title>
      <p>Metrics definition must be done in a methodological way
and it is necessary to follow a number of steps to ensure
the reliability of the proposed metrics. Figure 2 presents
the method we follow for the metrics proposal [CAL01].</p>
      <p>Last, but not least, data warehouse model quality has a
great influence in the overall information quality. The
designer has to choose the physical tables, processes,
indexes and data partitions, representing the logical data
warehouse and facilitating its functionality [JAR00]. Two
different aspects should be considered: dimensional data
model quality and physical data model quality. In fact
these two are often considered as different stages in the
data warehouse life cycle.</p>
      <p>Dimensional data model is usually designed using the
star schema modeling facility, which allows good response
times and an easy understanding of data and metadata for
both users and developers [KIM98].</p>
      <p>Different techniques have also been researched for
optimizing physical data models [HAR96] [LAB97].</p>
      <p>Our work focuses on dimensional data model quality.
Different authors have suggested interesting
recommendations for achieving a “good” dimensional data
model [KIM98] [ADM98] [INM96]. However quality
criteria are not enough on their own to ensure quality in
practice, because different people will generally have
different interpretations of the same concept. According
to the Total Quality Management (TQM) literature,
measurable criteria for assessing quality are necessary to
avoid “arguments of style” [BOM97]. The objective
should be to replace intuitive notions of design “quality”
with formal, quantitative measures in order to reduce
subjectivity and bias in the evaluation process. However,
for data modeling to progress from a “craft” to an
engineering discipline, the desirable qualities of data
models need to be made explicit [LIN94]. A metric is away
of measuring a quality factor in a consistent and objective
manner
THEORETICAL
VALIDATION</p>
      <p>EMPIRICAL VALIDATION
EXPERIMENTS CASE STUDIES</p>
      <p>Metrics definition. The first step is the proposal
of metrics. This definition is made taking into
account the specific characteristics of the system
we want to measure and the experience of
designers of these systems. A goal-oriented
approach, as GQM (Goal-Question-Metric)
[BAS84] can also be very useful in this step.</p>
      <p>Theoretical validation. The second step is the
formal validation of the metrics. The formal
validation helps us to know when and how apply
the metrics. There are two main tendencies in
metrics validation: the frameworks based on
axiomatic approaches [WEY88] [BRI96] [MOR97]
and the ones based on the measurement theory
[WIT97] [ZUS98]. The strength of measurement
theory is the formulation of empirical conditions
from which we can derive hypothesis of reality.
The final information when applying this kind of
2-2</p>
      <p>As shown in figure 2, the process of defining and
validating metrics is evolutionary and iterative. As a result
of the feedback, metrics could be redefined based on
discarded theoretical or empirical validations. At the
moment, we have finished only a first iteration of metrics
definition and theoretical validation for data warehouse
quality.</p>
      <p>This work only considers the two steps related with
definition and formal validation. It is clear that these are
only a first approach because it is fundamental to made
empirical validation in order to prove which of all of the
proposed metrics are useful in the real world rejecting the
ones that do not prove its uselfulness.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Metrics for Data Warehouses</title>
      <p>Taking into account the characteristics exposed
previously, we will propose the following metrics for data
warehouses. As some metrics can be applied at table, star
and schema level, we present them separately.</p>
      <sec id="sec-3-1">
        <title>3.1 Table Metrics</title>
        <p>In the last years we have researched different metrics for
assuring relational database quality [PIA01]. Two of these
metrics could be useful for data warehouses:</p>
        <p>NA(T). Number of attributes of a table.</p>
        <p>NFK(T). Number of foreign keys of a table.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2 Star Metrics</title>
        <p>frameworks in to know to which scale a metric
pertains and based on this information we can
know which statistics and which transformations
can be done with the metric.</p>
        <p>Empirical validation. The goal of this step is to
prove the practical utility of the proposed
metrics. Although there are various ways of
performing this step, basically we can divide the
empirical validation into experimentation and case
studies [BAS99] [FEN97].</p>
        <p>NDT(S). Number of dimension tables of a star.
NT(S). Number of tables of a star, which
corresponds to the number of dimension tables
added the fact table.</p>
        <p>NT(S) = NDT(S) + 1
NADT(S). Number of attributes of dimension
tables of a star.</p>
        <p>NAFT(S). Number of attributes plus the number
of foreign keys of a fact table.
•
•
•
•
•
•
•
2-3
NAFT(S) = NA(FT) + NFK(FT)</p>
        <p>Where FT is the fact table of the star S.</p>
        <p>NA(S). Number of attributes of a star.</p>
        <p>NA(S) = NAFT(FT) + NADT(S)</p>
        <p>Where FT is the fact table of the star S.</p>
        <p>NFK(S). Number of foreign keys of a star.
NDT
NFK (S ) = NFK (FT ) + ∑ NFK (DTi )
i =1</p>
        <p>Where FT is the fact table of the star S
and Dti is the dimensional table number i of the star S
RSA(S). Ratio of star attributes. Quantity of the
number of attributes of dimension tables per
number of attributes of the fact table of the star.</p>
        <p>RSA(S ) =</p>
        <p>NADT (S )</p>
        <p>NAFT(FT )</p>
        <p>Where FT is the fact table of the star S.</p>
        <p>RFK(S). Ratio of foreign keys. Quantity of the
fact table attributes which are foreign key.</p>
        <p>RFK (S ) =</p>
        <p>NFK (FT )</p>
        <p>NAFT ( FT )</p>
        <p>Where FT is the fact table of the star S
NFT(Sc). Defined as a number of fact tables of
the schema.</p>
        <p>NDT(Sc). Number of dimension tables of the
schema.</p>
        <p>NSDT(Sc). Number of shared dimension tables.
Number of dimension tables shared for more than
one star of the schema.</p>
        <p>NT(Sc). Number of tables. Number of the fact
tables plus the number of dimension tables of the
schema.</p>
        <p>NAFT(Sc). Number of attributes of fact tables of
the schema.</p>
        <p>NFT
NAFT (Sc ) = ∑ NA(FTi )
NADT(Sc). Number of attributes of dimension
tables of the schema.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3 Schema Metrics</title>
        <p>NASDT(Sc). Number of attributes of shared
dimension tables of the schema.</p>
        <p>NASDT (Sc ) =</p>
        <sec id="sec-3-3-1">
          <title>NSDT</title>
          <p>∑ NA( DTi)
i=1</p>
          <p>Where DTi is the dimensional table i of the schema Sc
NA(Sc). Number of attributes of the schema.</p>
          <p>NA(Sc) = NAFT(Sc) + NADT(Sc)
NFK(Sc). Number of foreign keys in all the fact
tables of the schema.</p>
          <p>NFT
NFK (Sc ) = ∑ NFK (FTi )</p>
          <p>As we can see we have proposed a large set of metrics,
now we must validate, formal and empirically, and pick up
the metrics that can be useful in order to measure the
quality of a data warehouse schema.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4 Example</title>
      <p>Figure 3 shows an example of a Data Warehouse
[ADA98]. The values for the metrics are shown in tables 1,
2 and 3.</p>
      <p>PRODUCTION
prod_key
product_name
recipe
carbonated
diet
production_unit
production_manager
INGREDIENT
ingred_key
ingredient_name
supplier
form
unit_of_measure</p>
      <p>PRODUCTION_FACTS
pr_key
prod_key
facility_key
time_key
production_quantity
INGREDIENT_USAGE
prod_key
facility_key
pr_key
time_key
ingred_key
quantity
total_cost</p>
      <p>FACILITY
facility_key
facility_name
facility_location
facility_manager
state
TIME
time_key
date
month_name
month_number
quarter
year
PRODUCTOION_RUN
pr_key
production_name
production_line
production_line_monthly_capacity
capacity_unit_of_measure</p>
    </sec>
    <sec id="sec-5">
      <title>5 Metrics formal validation</title>
      <p>In this section we will present the metrics formal validation
made using the formal framework proposed by [ZUS98].
This framework is a measurement-theory based framework,
so its goal is to determine the scale to which a metric
pertains. We will only show the complete process of
formalization in this framework of one of the proposed
metrics. The rest of the validation is made in a similar way
and the results obtained for all the metrics proposed will
be presented in table 5.</p>
      <p>The formal framework of [ZUS98] works with three
main mathematical structures, depending of which one of
this structures a metric accomplishes, we will be able to
characterize it in a scale. These three structures (table 4)
are: the extensive structure, the independence conditions
and the modified relation of belief. All the details about
these three structures and the complete formal framework
can be found in [ZUS98].</p>
      <p>When a measure accomplishes the extensive structure,
it also accomplishes the independence conditions and can
be used on the ratio scale levels.</p>
      <p>If a measure does not satisfy the modified extensive
structure, the combination rule (that describes the
properties of the software measure clearly) will exist or not
depending on the independence conditions. When a
measure assumes the independence conditions but not
the modified extensive structure, the scale type is the
ordinal scale.</p>
      <p>When a metric does not accomplish the extensive
structure, neither the independence conditions but it
accomplishes the modified relation of belief, can be
characterized “above” the level of the ordinal scale (the
characterization of measures above the ordinal scale level
is very important because we cannot do very much with
ordinal numbers).</p>
      <sec id="sec-5-1">
        <title>5.1 NFK Metric Formal Validation</title>
        <p>The NFK measure is a mapping: NFK: T -&gt; ℜ such that
the following holds for all relations between Ti and Tj ∈ T:
Ti • &gt;= Tj ⇔ NFK(Ti) &gt;= NFK(Tj).</p>
        <p>In order to obtain the combination rule for NFK, we
must be sure that if the concatenation (by natural join)
between tables is made by foreign key, the number of
foreign keys are affected (decreasing in one), and are not
affected in other cases. So, we can characterise the
combination rule for NFK as:
NFK(TioTj) = NFK(Ti) + NFK(Tj) -v</p>
      </sec>
      <sec id="sec-5-2">
        <title>MODIFIED EXTENSIVE STRUCTURE</title>
        <p>Axiom1: (A, • &gt;=) (weak order)
Axiom2: A1 o A2 • &gt;= A1 (positivity)
Axiom3: A1 o (A2 o A3) ≈ (A1 o A2) o A3 (weak
associativity)
Axiom4: A1 o A2 ≈ A2 o A1 (weak commutativity)
Axiom5: A1 • &gt;= A2 ⇒ A1 o A • &gt;= A2 o A (weak
monotonicity)
Axiom6: If A3 • &gt; A4 then for any A1, A2, then there exists a
natural number n, such that A1o nA3 • &gt;A2 o nA4
(Archimedean axiom)
As we know, binary relation • &gt;= is called weak order if it is
transitive and complete:
A1 • &gt;= A2, and A2 • &gt;= A3 ⇒ A1 • &gt;= A3
A1 • &gt;= A2 or A2 • &gt;= A1</p>
      </sec>
      <sec id="sec-5-3">
        <title>INDEPENDENCE CONDITIONS</title>
        <p>C 1: A1 ≈ A2 ⇒ A1 o A ≈ A2 o A and A1 ≈ A2 ⇒ A o A1 ≈ A o
A2
C 2: A1 ≈ A2 ⇔ A1 o A ≈ A2 o A and A1 ≈ A2 ⇔A o A1 ≈ A o
A2
C 3: A1 • &gt;= A2 ⇒ A1 o A • &gt;= A2 o A, and A1 • &gt;= A2 ⇒ A
o A1 • &gt;= A o A2
C 4: A1 • &gt;= A2 ⇔ A1 o A • &gt;= A2 o A, and A1 • &gt;= A2 ⇔A o
A1 • &gt;= A o A2
Where A1 ≈ A2 if and only if A1 • &gt;= A2 and A2 • &gt;= A1, and
A1 • &gt; A2 if and only if
A1 • &gt;= A2 and not (A2 • &gt;= A1).</p>
      </sec>
      <sec id="sec-5-4">
        <title>MODIFIED RELATION OF BELIEF</title>
        <p>MRB1: ∀ A, B ∈ ℑ: A • &gt;= B or B • &gt;= A (completeness)
MRB2: ∀ A, B, C ∈ ℑ: A • &gt;= B and B • &gt;= C ⇒ A • &gt;= C
(transitivity)
MRB3: ∀ A ⊇ B ⇒ A • &gt;= B (dominance axiom)
MRB4: ∀ (A ⊃ B, A ∩ C = ϕ) ⇒ (A • &gt;= B ⇒ A U C • &gt; B U
C) (partial monotonicity)
MRB5: ∀ A ∈ ℑ: A • &gt;= 0 (positivity)</p>
      </sec>
      <sec id="sec-5-5">
        <title>NFK as an extensive modified structure</title>
        <p>Axiom 1. T1, T2 and T3 being three tables of a schema,
it is obvious that: NFK(T1)&gt;=NFK(T2) or
2-6
C</p>
        <p>R3
NFK(R3) = 2
NFK(R4) = 1</p>
        <p>R1 o R3
NFK(R1 o R3) = 1</p>
        <p>R2 o R4
NFK(R2 o R4) = 2</p>
        <p>R1
R2
R2
R3
R5</p>
        <p>B
T2</p>
        <p>T1</p>
        <p>T
R6
R4
R6
R1</p>
        <p>R5
R5
NFK(T2)&gt;=NFK(T1), and also: if NFK(T1)&gt;=NFK(T2) and
NFK(T2)&gt;=NFK(T3) ⇒ NFK(T1)&gt;=NFK(T3). Then NFK
fulfils the first axiom.</p>
        <p>The positivity axiom (axiom 2) is not verified by the
metrics own definition (when v is distinct of zero). For
example, in figure 3 we have a table T with NFK(T)=2,
however, the value of the table obtained from the
concatenation of the T and the T2 tables is NFK(ToT2)=1.</p>
        <p>Associativity and commutativity, axioms three and
four, are fulfilled because the natural join operation is both
associative and commutative.</p>
        <p>With figure 4, it is clear that axiom 5 may be not
fulfilled because we have that NFK(T1)=NFK(T2) but
NFK(T1oT)=0 is not greater or equal than NFK(T2oT)=1.</p>
        <p>NFK(T1)=0
NFK(T2)=0</p>
        <p>NFK(T1oT)=0</p>
        <p>NFK(T2oT)=1</p>
        <p>Before proving the Archimedean axiom, we must verify
if the metric is idempotent: it is trivial that if a table is
concatenated with itself (by natural join) more than once,
the number of foreign keys increases, then the metric is
not idempotent, and it is necessary to prove if NFK
accomplishes the Archimedean axiom. Seeing figure 5, we
can assure that NFK does not accomplish the
Archimedean axiom (NFK(R3)&gt;NFK(R4) and
NFK(R1oR3)&lt;NFK(R2oR4)).</p>
        <p>We can conclude that NFK is not an extensive modified
structure.</p>
      </sec>
      <sec id="sec-5-6">
        <title>NFK and the independence conditions.</title>
        <p>The metric does not accomplish the first condition,
seeing figure 5, R2 and R4 have a value equal to 1
(NFK(R2)=1, NFK(R4)=1). If we combine this two relations
with R5, we obtain that NFK(R2oR5)=1 and
NFK(R4oR5)=0. If the metric does not accomplish the first
condition, it cannot accomplish the second one. The third
condition cannot be accomplished because the metric
does not fulfil the fifth axiom of the extensive structure
and if it does not accomplish the third it cannot
accomplish the fourth one. So, NFK does not accomplish
the independence conditions.</p>
      </sec>
      <sec id="sec-5-7">
        <title>NFK and the modified structure of belief</title>
        <p>Now, we must prove if NFK verifies the modified
structure of belief. If the metric meets the weak order, then
the first and the second axioms of the modified structure
of belief are fulfilled. The third axiom is also fulfilled
because if all the foreign keys of B are included in A then
NFK(A)&gt;=NFK(B). The weak monotonicity axiom is also
accomplished because if A⊃B then NFK(A)&gt;NFK(B), if
there are not common foreign keys between A and C, it
cannot be neither between B and C, and then the fourth
conditions will be accomplished because
NFK(AoC)&gt;NFK(BoC). The last condition, positivity, is
also fulfilled because the number of foreign keys cannot
be less than zero.</p>
        <p>In summary, we can characterize NFK as a measure
above the level of the ordinal scale, assuming the modified
relation of belief.</p>
        <p>As we said previously, the result of the formal
validation of the rest of metrics in the Zuse formal
framework are summarized in table 5. It is necessary to
point out that following [ZUS98] all the metrics defined as
a percentage can be characterized in the absolute scale.</p>
        <p>Ax 1
Ax 2
Ax 3
Ax 4
Ax 5
Ax 6
Ind C 1
Ind.C 2
Ind C 3
Ind C 4
MRB1
MRB2
MRB3
MRB4
MRB5</p>
        <p>NA
Y
N
Y
Y
N
N
N
N
N
N
Y
Y
Y
Y
Y</p>
        <p>NFK NDT NT
Y Y Y
Y Y Y
Y Y Y
Y Y Y
N N Y
N N Y
N N
N N
N N
N N
Y Y
Y Y
Y Y
Y Y
Y Y</p>
        <p>NAD</p>
        <p>T
Y
Y
Y
Y
N
N
N
N
N
N
Y
Y
Y
Y
Y</p>
        <p>NAFT NFT NSDT NASDT
Y Y Y Y
N Y N Y
Y Y Y Y
Y Y Y Y
N Y N Y
N Y N Y
N N
N N
N N
N N
Y Y
Y Y
Y Y
Y Y
Y Y
2-7</p>
        <p>AB AB AB AB AB AB</p>
        <p>ORD ORD ORD RAT ORD ORD RAT ORD
RSA, RFK, RSDT, RT, RScA and RSDTA pertain to the Absolute Scale</p>
        <p>As a conclusion of the formal validation we have
obtained that all our metrics are in the ordinal or in a
superior scale. That means that they are formally valid
software metrics, as remarked by [ZUS98].</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6 Conclusion and Future Work</title>
      <p>If we really consider that information is “the” main
organizational asset, one of the primary duties of IT
professionals must be assuring its quality. Information
quality can be decomposed in different types of
“qualities”: presentation quality, data warehouse
management system quality, data quality, physical model
quality and multidimensional model quality. Last one is
our focus. Although some interesting guidelines have
been proposed for designing “good” multidimensional
models, more objective indicators are needed.</p>
      <p>We are elaborating a set of valid metrics for measuring
data warehouse quality, which can help designers in
choosing the best option among more than one alternative
design.</p>
      <p>We have presented some metrics for measuring the
data warehouse star design. We have applied a formal
validation process to the metrics and we have obtained
that all our metrics are in the ordinal or in a superior scale.
That means that they are formally valid software metrics,
as remarked by [ZUS98].</p>
      <p>However, this is only the first steps in the overall
metrics definition process. As we have indicated
previously it is fundamental to run out empirical studies in
order to prove the practical utility of the defined metrics.
In this way, we are now working on the empirical
validation of the metrics presented. As a result of this step
(and of the complete method) we will be able to accept,
discard or redefine the metrics presented in ths paper.
[BRI96]
[FEN97]
[INM97]
[JAR00]</p>
      <p>
        W. H. Inmon. Building the Data Warehouse,
second editio
        <xref ref-type="bibr" rid="ref9">n, John Wiley and Sons, 1997</xref>
        .
      </p>
      <p>M. Jarke, M. Lenzerini, Y. Vassiliou and P.
Vassiliadis. Fundamentals of Data Warehouses,
Ed. Springer, 2000.
[KEL97] S. Kelly. Data Warehousing in Action. John</p>
      <p>Wiley &amp; Sons, 1997.
[KIM98] R. Kimball, L. Reeves, M. Ross and W.</p>
      <p>Thornthwaite. The Data Warehouse Lifecycle
Toolkit, John Wiley and Sons, 1998.
[LAB97]
[LIN94]</p>
      <p>W. Labio, D. Quass and B. Adelberg. Physical
Database Design for Data Warehouses.
Thirteen International Conference on Data
Engineering, IEEE Computer Society,
Birmingham, 277-288, 1997.</p>
      <p>O. Lindland, G. Sindre and A. Solvberg.
"Understanding Quality in Conceptual
Modelling", IEEE Software, Vol. 11 Nº 2. 42-49,
March 1994.
2-9
[PIA01]</p>
      <p>M. Piattini, C. Calero and M. Genero. Table
oriented metrics for relational databases.
Acceted for publication in Software Quality
Journal, 2001
.
[WEY88] E.J. Weyuker. Evaluating software complexity
measures. IEEE Transactions on Software
Engineering. 14(9). 1357-1365, 1988.</p>
      <p>Design
Software</p>
      <sec id="sec-6-1">
        <title>Acknowledgements</title>
        <p>This research is part of the CALIDAT project carried out
by Cronos Ibérica (supported by the Consejería de
Educación de la Comunidad de Madrid, Nr. 09/0013/1999)</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [ADA98]
          <string-name>
            <given-names>C.</given-names>
            <surname>Adamson</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Venerable</surname>
          </string-name>
          .
          <article-title>Data Warehouse Design Solutions</article-title>
          . John Wiley and Sons,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [BAS84]
          <string-name>
            <given-names>V.R.</given-names>
            <surname>Basili</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Weiss</surname>
          </string-name>
          .
          <article-title>A methodology for Collecting Valid Software Engineering Data</article-title>
          .
          <source>IEEE Transactions on Software Engineering. SE-10. No. 6</source>
          .
          <fpage>728</fpage>
          -
          <lpage>738</lpage>
          ,
          <year>1984</year>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [BAS99]
          <string-name>
            <given-names>V.R.</given-names>
            <surname>Basili</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Shull</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Lanubille</surname>
          </string-name>
          .
          <article-title>Building Knowledge through families of experiments</article-title>
          .
          <source>IEEE Transactions on Software Engineering. No. 4</source>
          .
          <fpage>456</fpage>
          -
          <lpage>473</lpage>
          , July/August, 1999
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>[BOM97] M. Boman</surname>
            ,
            <given-names>J</given-names>
          </string-name>
          , Bubenko,
          <string-name>
            <given-names>P.</given-names>
            <surname>Johannesson</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Wangler</surname>
          </string-name>
          . Conceptual Modelling, Prentice Hall,
          <year>1997</year>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>L.C. Briand</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Morasca</surname>
            and
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Basili</surname>
          </string-name>
          .
          <article-title>Propertybased software engineering measurement</article-title>
          .
          <source>IEEE Transactions on Software Engineering</source>
          .
          <volume>22</volume>
          (
          <issue>1</issue>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>[BOU00] M. Bouzeghoub F. Fabret</surname>
            and
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Galhardas</surname>
          </string-name>
          .
          <article-title>Datawarehouse refreshment. Chapter 4 in Fundamentals of Data Warehouses</article-title>
          . Ed. Springer,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [CAL01]
          <string-name>
            <given-names>C.</given-names>
            <surname>Calero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Piattini</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Genero</surname>
          </string-name>
          .
          <article-title>Metrics for controlling database complexity. Chapter III in Developing quality complex database systems: practices, techniques and technologies</article-title>
          . Becker (ed), Idea Group Publishing,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [ENG96]
          <string-name>
            <given-names>L.</given-names>
            <surname>English</surname>
          </string-name>
          . Information Quality Improvement: Principles, Methods and Management, Seminar, 5th Ed.,
          <string-name>
            <surname>Brentwood</surname>
            ,
            <given-names>TN</given-names>
          </string-name>
          : Information Impact International, Inc.,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>N.</given-names>
            <surname>Fenton</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Pfleeger</surname>
          </string-name>
          .
          <source>Software Metrics: A Rigorous Aproach 2nd. Edition</source>
          . London, Chapman &amp; Hall,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [GAR98]
          <string-name>
            <given-names>S.R.</given-names>
            <surname>Gardner</surname>
          </string-name>
          .
          <article-title>Building the data warehouse</article-title>
          ,
          <source>Communications of the ACM</source>
          , Vol.
          <volume>41</volume>
          ,
          <string-name>
            <surname>Nr</surname>
          </string-name>
          .
          <volume>9</volume>
          .
          <fpage>52</fpage>
          -
          <lpage>60</lpage>
          , September,
          <year>1998</year>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>