Hiperspace 2.2.0

dotnet add package Hiperspace --version 2.2.0
                    
NuGet\Install-Package Hiperspace -Version 2.2.0
                    
This command is intended to be used within the Package Manager Console in Visual Studio, as it uses the NuGet module's version of Install-Package.
<PackageReference Include="Hiperspace" Version="2.2.0" />
                    
For projects that support PackageReference, copy this XML node into the project file to reference the package.
<PackageVersion Include="Hiperspace" Version="2.2.0" />
                    
Directory.Packages.props
<PackageReference Include="Hiperspace" />
                    
Project file
For projects that support Central Package Management (CPM), copy this XML node into the solution Directory.Packages.props file to version the package.
paket add Hiperspace --version 2.2.0
                    
#r "nuget: Hiperspace, 2.2.0"
                    
#r directive can be used in F# Interactive and Polyglot Notebooks. Copy this into the interactive tool or source code of the script to reference the package.
#addin nuget:?package=Hiperspace&version=2.2.0
                    
Install Hiperspace as a Cake Addin
#tool nuget:?package=Hiperspace&version=2.2.0
                    
Install Hiperspace as a Cake Tool

Hiperspace

Hiperspace is an Object technology that uses a key-addressable store to expand an application data-model beyond the limits of memory that can be directly referenced in main memory.

Elements are not duplicated or changing to match database shapes.
Elements are serialized directly using Protocol Buffers to and from key/value structure for storage in memory stores including CXL expanded and pooled memory, shared cache , local SSD or key-value durable databases.
Elements that are not currently being used are released from main memory, and transparently (and quickly) reloaded when referenced. Memory stores allows petabytes of data to be addressed.

Product Compatible and additional computed target framework versions.
.NET net8.0 is compatible.  net8.0-android was computed.  net8.0-browser was computed.  net8.0-ios was computed.  net8.0-maccatalyst was computed.  net8.0-macos was computed.  net8.0-tvos was computed.  net8.0-windows was computed.  net9.0 is compatible.  net9.0-android was computed.  net9.0-browser was computed.  net9.0-ios was computed.  net9.0-maccatalyst was computed.  net9.0-macos was computed.  net9.0-tvos was computed.  net9.0-windows was computed. 
Compatible target framework(s)
Included target framework(s) (in package)
Learn more about Target Frameworks and .NET Standard.

NuGet packages (3)

Showing the top 3 NuGet packages that depend on Hiperspace:

Package Downloads
Hiperspace.Heap

Hiperspace heap store for session, edge and testing purposes

Hiperspace.Rocks

HiperSpace RocksDB adaptor

Hiperspace.SQL

# Hiperspace.SQL Hiperspace.SQL is a full SQL query engine for Hiperspace, supporting the full range of joins, aggregations, and subqueries. Hiperspace.SQL provides the same query functionality as a .NET client can use with LINQ queries, but without the need to write code in C#/F# Hiperspace fully supports point-in-time "time travel" queries that are not possible with Python Data-Frames or DuckDB ## Features - Hiperspace.SQL is not limited to queries of columns within a table, but supports the full navigation of properties of Hiperspace elements - Where a column is a complex object it is returned as a JSON object - Executing a batch of SQL statements return columnar data frames (dictionary of column-name and array of values) - Explain SQL returns the execution plan, detailing the SetSPaces accessed and keys used for search (Key, Index, Scan) - The Parquet method returns a Parquet file that can be used with any Apache Parquet library, or added to DuckDB OLAP store

GitHub repositories

This package is not used by any popular GitHub repositories.

Version Downloads Last updated
2.2.0 55 3/29/2025
2.1.3 227 3/5/2025
2.1.1 117 2/15/2025
2.1.0 106 1/24/2025
2.0.0 66 1/14/2025
1.3.9 115 11/15/2024
1.3.3 100 11/1/2024
1.3.1 163 10/18/2024
1.3.0 136 10/5/2024
1.2.31 152 9/15/2024
1.2.26 124 9/1/2024
1.2.18 89 8/6/2024
1.2.12 98 7/26/2024
1.2.9 127 7/19/2024
1.2.8 132 7/15/2024
1.2.4 149 7/4/2024
1.2.0 159 5/30/2024
1.0.46 102 5/11/2024
1.0.40 121 4/22/2024
1.0.34 169 3/14/2024
1.0.28 166 2/26/2024
1.0.27 152 2/16/2024
1.0.24 206 1/11/2024
1.0.23 193 1/1/2024
1.0.1 193 11/18/2023

https://www.cepheis.com/hiperspace/20250329
# Overview
This release introduces transitive edges, which extend the Graph model provided by `Node` and `Edge` views to include transitive traversal of an entire graph without the need for recursive queries of esoteric query languages and integrated with the data views provided by `Hiperspace`.  `Graph.TransitiveEdge` encapsulates all the Edges that can be projected as a Transitive Edge using a simple set of rules.

[Transitive Edge blog](https://www.cepheis.com/blog/blog/transitive-edge)  and [Enterprise Transitive Edge](https://www.cepheis.com/blog/blog/enterprise-transitive-edge) goes into the details of our model of `Transitive Edge`, but the [graph-automorphic](https://en.wikipedia.org/wiki/Graph_automorphism) view is that a `Transitive Edge` encapsulates all the edges between *nodes* and allows the user to focus on the ends rather than the intermediate steps between them, and view the data as relations using commodity business intelligence software without *esoteric* graph query languages.

## Hiperspace

The [Hiperspace](Hiperspace) package includes the additional `Graph` package types

| Name |░| Notes |
|-|-|-|
| GraphFunctions || static functions that can be sued directly, or via import in a *.hilang* schema |
| Route || Value type that defines name and rules for projecting `Edge` as `Transitive Edge` and extending to all related nodes |
| Rule || The rules for matching {From node type, edge type, to node type} Edges, to the transititive edge projection |

### SubSpace
* `SubSpace` includes an  additional *view* `SetSpace` `TransitiveEdges` that includes all elements that implement this view
* `FindPaths` inteface function provides a method that matches the `Graph.GraphFunctions.Paths` function, but in a way that *domain spaces* can send the graph search to a server for parallel execution on computers that have many CPU cores.

### Fix PartitionSpace and GenerationSpace
These two Space interceptors provide the partitioning of data by *hash-bucket* and *date-range*, but fault in the implementation of state-machine to implement `IAsyncEnumerable<>` in .NET9, can result in the *map/reduce* channel being disposed before the last message is processed (*warning to the wise: don't use AI generated suggestions without considering the stress-environments that it doesn't have a clue about*)

# Hilang
The [HiLang](HiLang) schema compiler has been enhanced to include the additional {**function**, **value**,**view**,**segment**}  declarations for  features of  `Hiperspace`.

There are three ways that an element can project a view in Hilang:
* `entity Person = Node (From = member/this, To = member/this, Name="value", TypeName = "Person")` where each member of the view is mapped to a specific member of the element
* `entity Person = Node()` where the view members are automatically matched by name with members of the element
* `entity Name =  View_Name = member`  **This language element has been enhanced to include a set of values** e.g. the set returned from `TransitativeEdge` function

# Hiperspace.SQL
The [Hiperspace.SQL](Hiperspace.SQL) already includes the ability to access deep structure methods like `SELECT p.Father.Name AS Father FROM Persons AS p  WHERE p.Name = :parameter;', but now also allows deep structure to members to be used in `FROM` clauses to join to segments and sets within each row.

e.g. `Person` has an extension segment `MotherChild` and property `AllRelatives` that yields a `HashSet<TransitiveEdge>`, which can now be joined to in a SQL query.

```
select  p.Name as Person,
       r.To.Name as Relation,
       r.TypeName as Relationship,
       r.Length as Length,
       r.Width as Width
from    Persons as p,
       p.AllRelatives as r
where   p.Name = :name;

select  p.Name as Parent, c.Name as Child
from    Persons as p,
       p.MotherChild as c
where   p.Name = :name;
```