Vertical Database Design for Scalable Data Mining

View Sample PDF

Author(s): William Perrizo (North Dakota State University, USA), Qiang Ding (Concordia College, USA), Masum Serazi (North Dakota State University, USA), Taufik Abidin (North Dakota State University, USA)and Baoying Wang (North Dakota State University, USA)
Copyright: 2008
Pages: 6
Source title: Data Warehousing and Mining: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): John Wang (Montclair State University, USA)
DOI: 10.4018/978-1-59904-951-9.ch232

Keywords: Data Mining and Databases / Data Warehousing / Information Science Reference / Library & Information Science

Purchase

View Vertical Database Design for Scalable Data Mining on the publisher's website for pricing and purchasing information.

Abstract

For several decades and especially with the preeminence of relational database systems, data is almost always formed into horizontal record structures and then processed vertically (vertical scans of files of horizontal records). This makes good sense when the requested result is a set of horizontal records. In knowledge discovery and data mining, however, researchers are typically interested in collective properties or predictions that can be expressed very briefly. Therefore, the approaches for scan-based processing of horizontal records are known to be inadequate for data mining in very large data repositories (Han & Kamber, 2001; Han, Pei, & Yin, 2000; Shafer, Agrawal, & Mehta, 1996).

The IRMA Community

Research IRM

Vertical Database Design for Scalable Data Mining

Purchase

Abstract

Related Content

IRMA Sponsors