Vertical Database Design for Scalable Data Mining

Vertical Database Design for Scalable Data Mining

Author: 
Perrizo, William
Place: 
Hershey
Publisher: 
IGI Global
Date published: 
2005
Responsibility: 
Ding, Qiang, jt.author
Serazi, Masum, jt.author
Editor: 
C. Rivero, Laura
Journal Title: 
Encyclopedia of Database Technologies and Applications
Source: 
Encyclopedia of Database Technologies and Applications
Subject: 
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).

CITATION: Perrizo, William. Vertical Database Design for Scalable Data Mining edited by C. Rivero, Laura . Hershey : IGI Global , 2005. Encyclopedia of Database Technologies and Applications - Available at: https://library.au.int/frvertical-database-design-scalable-data-mining