KStore: A Dynamic Meta-Knowledge Repository for Intelligent BI

KStore: A Dynamic Meta-Knowledge Repository for Intelligent BI

Jane Campbell Mazzagatti (As It Is Inc., USA)
DOI: 10.4018/978-1-60960-595-7.ch015
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

KStore is a computer data structure based on the Phaneron of C. S. Peirce (Peirce, 1931-1958). This structure, called a Knowledge Store, KStore or simply K, is currently being developed as a storage engine to support BI data queries and analysis (Mazzagatti, 2007). The first Ks being constructed handle nominal data and record sequences of field/record data variables and their relationships. These rudimentary Ks are dynamic allowing real-time data processing, ad hoc queries and data compression, to facilitate data mining. This paper describes a next step in the development of the K structure, to record into the K structure, meta data associated with the field/record data, in particular the column or dimension names and a source indicator.
Chapter Preview
Top

Basic K Structure

Given the dataset in Figure 1, a diagram of the resulting K data structure would look like Figure 2. All possible data elements or particles, in this case the alpha-numeric character set, are represented by the K nodes at the lowest level of the K structure.

Figure 1.

Sample data set

Figure 2.

KStore Representation of the data set

The middle level of the K structure contains the sequences of K nodes referencing the K nodes of the lower level (characters) and representing the sequences of those lower level K nodes that are the field variables. The end K nodes of middle level will be used to create top level.

Finally the top level of the K structure contains the sequences of K nodes referencing the end K nodes of the middle level (the field variables) and representing the sequences of those middle level K nodes that are the records.

So the first level of the K structure contains K nodes that represent the smallest data particles, in this case the alpha-numeric character set, in other data sets it might be pixels or sound bytes for example. The second level contains the representation of a sequence of particles from the first level. All the other levels represent sequences of the sequences from the next lower level by referencing the last K node of the sequences of the next lower level.

Complete Chapter List

Search this Book:
Reset