PKC/Criteria

1. Allow Individual users to install an instance of MediaWiki service by reading this PKC/Readme.md file.
2. Make all textual content, executable software images, installation scripts in the public domain, so that everyone can share and use them at will.
3. Provide instructions to learn about how to use PKC in the initial MediaWiki's database, so that people can start learning to use PKC through their own instance of MediaWiki.

Design Principle

PKC models data assets in terms of functions, which is a kind of scale-free data representation. These functional data representation are in turn categorized into Page, File, and Service. Each category of function is treated as the primitive form of data, and can be recursively referenced to perform both computation and carry computational results. All pages in PKC are conceptualized as hyperlinked data points in a functional style. All data points or pages have their unique names. These names can be thought of as function names, and each function may have many key-value-pairs as its arguments.

Data Architecture

In PKC, data is consistently represented using one universal construct, directed relation. This also means that we can always use the same data type, directed relation to interpret and manipulate data.

Architecture = Invariant Properties

It is important to note that the word Architecture implies elements of a system that doesn't change. Therefore, this section will talk about the data elements of PKC that don't change over space and time.

Logic Model (Data Architecture) Template:LogicModel 02 21, 2022
Abstract Specification Context Data Architecture/Context Goal Data Architecture/Goal Success Criteria Data Architecture/Criteria
Concrete Implementation Given Inputs When Process is executed... Then, we get Outputs Data Architecture/Input Data Architecture/Process Data Architecture/Output
Boundary/Safety Conditions of Data Architecture Data Architecture/Boundary

Represent Knowledge in Functions

Thinking about functions at all times in this primitive, yet generic construct, allows users to think of all functions as hyperlinks that relate objects from one to the other, revealing the topological structures, or the systematic structures of anything. Most importantly, users of PKC can think of writing down notes in various pages are effectively construction functions or conducting computational work in parallel and in an explicit functionally designed data storage. The storage packages are managed in terms of files. The availability and reliability of providing these pages and files are called services. This completes the three categories of scale-free data representation. The design principle that differentiate PKC from other hyperlink/hypermedia systems is that PKC considers data content within the system as an integral part of the system. Since every instance of PKC is tightly bound with its own content, all PKC must allow maximum freedom to all instances of PKCs. To accomplish this design principle, it needs to give full ownership and power to conduct changes to the owners of individual instances. In the most egalitarian scenario, we must reduce the barrier to entry, so PKCs should be convenient and cheap to be replicated or allowing for the creation of new instances that are independent from other instances of PKC, so that the functionality of PKCs can be easily shared across many application domains.