INDUSTRY AND PRACTICE: Solving the Partitioning Problem in Database Design

INDUSTRY AND PRACTICE: Solving the Partitioning Problem in Database Design

Chun Hung Cheng (The Chinese University of Hong Kong, Hong Kong), Chon-Huat Goh (Rutgers University, USA) and Anita Lee-Post (University of Kentucky, USA)
Copyright: © 1999 |Pages: 3
DOI: 10.4018/jdm.1999010103
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Response time of a database system is largely determined by the number of secondary disk accesses required to process database transactions. To minimize disk accesses, a database file should be structured in such a way as to closely match data requirements of these transactions. The way in which data are organized for efficient processing of database transactions is called database partitioning. As data are stored in the form of tables in a relational database, data partitioning can be performed either vertically (i.e, along the attributes or columns) or horizontally (i.e., along the tuples or rows).

Complete Article List

Search this Journal:
Reset
Open Access Articles
Volume 28: 4 Issues (2017)
Volume 27: 4 Issues (2016)
Volume 26: 4 Issues (2015)
Volume 25: 4 Issues (2014)
Volume 24: 4 Issues (2013)
Volume 23: 4 Issues (2012)
Volume 22: 4 Issues (2011)
Volume 21: 4 Issues (2010)
Volume 20: 4 Issues (2009)
Volume 19: 4 Issues (2008)
Volume 18: 4 Issues (2007)
Volume 17: 4 Issues (2006)
Volume 16: 4 Issues (2005)
Volume 15: 4 Issues (2004)
Volume 14: 4 Issues (2003)
Volume 13: 4 Issues (2002)
Volume 12: 4 Issues (2001)
Volume 11: 4 Issues (2000)
Volume 10: 4 Issues (1999)
Volume 9: 4 Issues (1998)
Volume 8: 4 Issues (1997)
Volume 7: 4 Issues (1996)
Volume 6: 4 Issues (1995)
Volume 5: 4 Issues (1994)
Volume 4: 4 Issues (1993)
Volume 3: 4 Issues (1992)
Volume 2: 4 Issues (1991)
Volume 1: 2 Issues (1990)
View Complete Journal Contents Listing