X-Git-Url: http://www2.svjatoslav.eu/gitweb/?a=blobdiff_plain;f=doc%2Findex.html;h=584f5d0385e7d2a791726ea5f8b81907780eabad;hb=058fc98562d8714f5ffcdb89c50f685b474c61fc;hp=c719c14e1a95c91702ffdb0a7e7b8693eb7925cd;hpb=b382105757c3d9a2bb528fa8e4218354feff2429;p=sixth-data.git diff --git a/doc/index.html b/doc/index.html index c719c14..584f5d0 100644 --- a/doc/index.html +++ b/doc/index.html @@ -1,346 +1,403 @@ - - + + + -Sixth - system for data storage, computation, exploration and interaction - - - - - - - -" - - - + + + + + -
-

Sixth - system for data storage, computation, exploration and interaction

-
- +
+
+

1.1. Source code

+
+
    +
  • Download latest snapshot in TAR GZ format
    • -
    -

    1 Vision / goal

    -
    -

    -Provide versioned, clustered, flexible, distributed, multi-dimensional -data storage engine for the Sixth computation engine. -

    +
  • Browse Git repository online
    • -
      -
    • Speaking of traditional relational database and object oriented -business applications: -
        -
      • I hate object-relational impedance mismatch. -
        • +

      • +Clone Git repository using command: +

        +
        +git clone https://www2.svjatoslav.eu/git/sixth-data.git
+
        • -
      • I don't like to convert data between persistent database and -
        • +
      • See JavaDoc.
      +
    +
    +
+ +
+

2. Vision / goal

+

-runtime objects for every transaction. How about creating united -database/computation engine instead to: +Provide hackable, versioned, optimized, distributed, geometrical, +arbitrary dimensional (hypercube based) data storage and computation +engine (as inspired by the brain) for general purpose visual computing +environment called Sixth.

-
    -
  • Eliminate constant moving and converting of data between 2 systems. -
    • -
  • Abstract away difference between RAM VS persistent storage. Let -
    • -
+

-the system decide at runtime which data to keep in what kind of -memory. +Because Lisp is hackable self defined programmable programming +language it would be used to provide imperative programming support.

- -
- -
-

2 Inspiration

-
-
    -
  • Relational databases: +
    +

    3. Inspiration

    +
      -
    • Transactional. -
      • -
    • Indexable / Quickly searchable. -
      • +
    • see also: OLAP cube.
    -
    • +
+
+

3.1. Brain

+
+ +
+
+ + +
+

3.2. CM-1 Connection Machine

+

-https://www.kenneth-truyers.net/2016/10/13/git-nosql-database/ ) +https://en.wikipedia.org/wiki/Connection_Machine

- - + +

+Massively parallel (thousands of CPUs) connected via +machine's internal 12-dimensional hypercube network allows to +efficiently simulate arbitrary dimensional hypercube and network +topology between computational units. So that when we are +solving/simulating for example 5 dimensional problem, we can arrange +computational units into virtual 5D network. See: +http://www.mission-base.com/tamiko/theory/cm_txts/di-ch2.html +

+ +

+we can pre-distribute data across computation units and perform +parallel geometrical computation. +

+
+
-
-

2.1 Brain

-
-
+
+

5. Geometrical computation idea

+
+
+

5.1. Distributed computation and data storage

+
+

+Lots of problems can be translated to geometry (use any shapes and as +many dimensions as you need). Solution(s) to such problems could be +then found via geometrical search/comparison/lookup results. As a +bonus, such geometrical data storage AND computation can be +naturally made in parallel and distributed. +

-
-

3 Ideas

-
-
-

3.1 Distributed computation and data storage

-

-Maybe every problem can be translated to geometry (use any shapes and -as many dimensions as you need). Solution(s) to such problems would -then appear as relatively simple search/comparison/lookup results. As -a bonus, such geometrical *data storage* AND *computation* can be -naturally made in *parallel* and *distributed*. That's what neurons in -the brain appear to be doing ! :) . Learning means building/updating -the model (the hard part). Question answering is making (relatively -simple) lookups (geometrical queries) against the model. +Learning means building/updating/re-balancing the model (the hard +part). Question answering is making (relatively simple) lookups +(geometrical queries) against the model.

-
-

3.2 Mapping of hyperspace to traditional object-oriented model

-
+
+

5.2. Mapping hypercube to object-oriented model and relational database

+

Object oriented programming is inspired by the way human mind operates. It allows programmer to express ideas to computer in a more @@ -348,164 +405,77 @@ human-like terms.

-It is possible to map object model to geometrical hyperspace: +It is actually also possible to map object model and relational +database to geometrical hyperspace:

    -
  • Object is a point in space (universe). Each object member variable -translates to its own dimension. That is: if class declares 4 -variables for an object, then corresponding object can be stored as -a single point inside 4 dimensional space. Variable values translate -to point coordinates in space. That is: Integer, floating point -number and even boolean and string can be translated to linear value -that can be used as a coordinate along particular dimension. -
    • - -
  • Each class declares its own space (universe). All class instances -(objects) are points inside that particular universe. References -between objects of different types are hyperlinks (portals) between -different universes. -
    • +
  • Object or database table row is a point in hypercube arbitrary +dimensional space. Each object member variable or database table +column can be mapped to its own dimension in hypercube. That is: if +class declares 4 variables for an object, then corresponding object +can be stored as a single point inside 4 dimensional +hypercube. Variable values translate to point coordinates in that +hypercube. That is: numbers and string can be translated to linear +value that can be used as a coordinate along particular dimension.
    • + +
  • Each object class or database table declares its own hypercube that +contain instances (objects) of that class or rows of a table.
-
-

3.3 Handling of relations

-
+ +
+

5.3. Mapping entity relations in hypercube

+

-Consider we want to create database of books and authors. Book can -have multiple authors, and single person can be author for multiple -books. It is possible to store how many hours of work each author has -contributed to every book, using hyperspace as follows: +Consider we want to create database of:

- -
    -
  • Every dimension corresponds to one particular book author. (10 -authors in the database, would require 10 dimensional space) -
      -
    • Point in space corresponds to one particular book.
        -
      • Point location along particular (author) dimension corresponds -to amount of work contributed by particular author for given -book. -
        • -
      -
      • -
    -
    • +
  • Books.
    • +
  • Authors.
    • +
  • Effort: Amount of time contributed by every author to every book +that he/she wrote.

-Alternatively: +Information above can be represented as 3D cube where dimensions are:

-
    -
  • Every dimension corresponds to one particular book. -
      -
    • Point in space corresponds to one particular author in the entire -database. -
        -
      • Point location along particular (book) dimension corresponds to -amount of work contributed for book by given author (point). -
        • -
      -
      • -
    -
    • +
  • X: Book
    • +
  • Y: Author
    • +
  • Z: Effort
+ +

+Points in that cube would nicely capture many to many relations +between authors and the books. +

- - -
-

4 Current status

-
+
+

6. Current status

+
    -
  • More or less defined Vision / goal. -
    • +
  • More or less defined Vision / goal.
    • -
  • Collected some ideas. -
    • +
  • Collected some inspiring ideas.
  • Implemented very simple persistent key-value map.
    • Long term goal is to use it as a backing storage engine and -implement more advanced features on top of this. -
      • -
    -
    • -
-
-
- -
-

5 See also

-
-

-Interesting or competing projects with good ideas: -

- -
-
-
-