ISSN NO: 0974-4274(PRINT), ISSN NO: 2582-1148(ONLINE)

  • Enlisted in UGC CARE Group - 1

  • Listed in Ulrich's Periodicals Directory

  • Indexed in J-Gate

  • Licensor for EBSCO

  • Listed in Proquest

  • Included in Google Scholar

  • Accessed in DOAJ

Denormalisation : Towards Improved Performance

Year 2012
Volume/Issue/Review Month Vol. - V | Issue II | July
Title Denormalisation : Towards Improved Performance
Authors Manas Kumar Rath , Sunil Kumar Mishra
Broad area Denormalisation : Towards Improved Performance
Abstract
In this paper, we present a practical view of denormalization, and provide
fundamental guidelines for incorporating denormalization. We have suggested
use of denormalization as an intermediate step between logical and physical
modeling, to be used as an analytic procedure for the design of the applications
requirements criteria. Relational algebra and query trees are used to examine
the effect on the performance of relational systems. The guidelines and
methodology presented are sufficiently general, and they can be applicable to
most databases. It is concluded that denormalization can enhance query
performance when it is deployed with a complete understanding of application
requirements.
Description Normalization is the process of grouping attributes into refined structures. The normal forms and the process of normalization have been studied by many researchers, since Codd [5] initiated the subject. First Normal Form (1NF), Second Normal Form (2NF),
File
Referenceses
  • [1] R. Barquin, Edelstein, H., Planning and
  • Designing the Data Warehousing, Upper Saddle
  • River, New Jersey: Prentice Hall, 1997.
  • [2] N. Bolloju, Kranti Toraskar, “Data clustering for
  • effective mapping of object models to relational
  • models,” Journal of Database Management, vol.
  • 8, no. 4, 1997, pp. 16-23.
  • [3] J.V. Carlis, C.E. Dabrowski, D.K. Jefferson, and
  • S.T. March, “Integrating a Knowledge-Based
  • Component into a Physical Database Design
  • System,” Information Management, vol. 17, no.
  • 2, 1989, pp. 71-86.
  • [4] N. Cerpa, “Pre-physical data base design
  • heuristics,” Information Management, vol. 28,
  • no. 6, 1995, pp. 351-359.
  • [5] E. Codd, “Relational Completeness of Data Base
  • Sublanguages,” in R. Rustin, ed., Data Base
  • Systems, Englewood Cliffs, NJ: Prentice-Hall,
  • 1972.
  • 152 Srusti Management Review, Vol -V, Issue - II, July-2012
  • [6] G. Coleman, “Normalizing not only way,”
  • Computerworld, December, 1989, pp. 63 - 64.
  • [7] C.J. Date, “The Normal is so ... Interesting,”
  • Database Programming & Design, November,
  • 1997, pp. 23 - 25.
  • [8] C.J. Date, The Birth of the Relational Model,
  • Intelligent Enterprise Magazine, November,
  • 1998,
  • [9] R. Elmasri, Bavathe, S. B, Fundamental of
  • Database Systems, 3 ed., New York: Addison-
  • Wesley, 2000.
  • [10] S. Finkelstein, M. Schkolnick, and P. Tiberio,
  • “Physical Database Design For Relational
  • Databases,” ACM Transactions on Database
  • Systems, vol. 13, no. 1, 1988, pp. 91-128.
  • [11] J. Hahnke, “Data model design for business
  • analysis,” Unix