Welcome to the InfoSci Platform
Reference Hub1
INDUSTRY AND PRACTICE: Solving the Partitioning Problem in Database Design

INDUSTRY AND PRACTICE: Solving the Partitioning Problem in Database Design

Chun Hung Cheng, Chon-Huat Goh, Anita Lee-Post
Copyright: © 1999 |Volume: 10 |Issue: 1 |Pages: 3
ISSN: 1063-8016|EISSN: 1533-8010|EISBN13: 9781466638082|DOI: 10.4018/jdm.1999010103
Cite Article Cite Article

MLA

Cheng, Chun Hung, et al. "INDUSTRY AND PRACTICE: Solving the Partitioning Problem in Database Design." JDM vol.10, no.1 1999: pp.36-38. http://doi.org/10.4018/jdm.1999010103

APA

Cheng, C. H., Goh, C., & Lee-Post, A. (1999). INDUSTRY AND PRACTICE: Solving the Partitioning Problem in Database Design. Journal of Database Management (JDM), 10(1), 36-38. http://doi.org/10.4018/jdm.1999010103

Chicago

Cheng, Chun Hung, Chon-Huat Goh, and Anita Lee-Post. "INDUSTRY AND PRACTICE: Solving the Partitioning Problem in Database Design," Journal of Database Management (JDM) 10, no.1: 36-38. http://doi.org/10.4018/jdm.1999010103

Export Reference

Mendeley
Favorite Full-Issue Download

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).

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.