@@ -13,7 +13,8 @@ Horst is an acronym for 'holistic recommender and storytelling technology' and i
...
@@ -13,7 +13,8 @@ Horst is an acronym for 'holistic recommender and storytelling technology' and i
* In-memory graph representation with **small memory footprint**. We e.g. host the whole music area in a ~1GB RAM graph at [Horst](http://horst.dfki.de). This graph comprises currently(year 2020) ~21 million nodes with ~67 million connecting relationships.
* In-memory graph representation with **small memory footprint**. We e.g. host the whole music area in a ~1GB RAM graph at [Horst](http://horst.dfki.de). This graph comprises currently(year 2020) ~21 million nodes with ~67 million connecting relationships.
* Fast multi **steiner tree** implementation, offering cheapest connecting subgraphs between a set of graph nodes. In the case you give just two start nodes, you will receive the connecting paths, which implements a **shortest path** algorithm - but even faster than other implementations we tried (maybe you had more luck).
* Fast multi **steiner tree** implementation, offering cheapest connecting subgraphs between a set of graph nodes. In the case you give just two start nodes, you will receive the connecting paths, which implements a **shortest path** algorithm - but even faster than other implementations we tried (maybe you had more luck).
* Explainable **node recommendations** by specifying start nodes and result node types.
* Explainable **node recommendations** by specifying start nodes and result node types.
* RDF module to **load arbitrary rdf graphs** and offer the Horst functionality on top of it.
* RDF module to **load arbitrary rdf graphs** which offers the Horst functionality on top of it.
* Small **webserver** for using the functionality as a **microservice**. It's a http server that deals with JSON data.
**Try it with the whole music domain at [Horst](http://horst.dfki.de)!**
**Try it with the whole music domain at [Horst](http://horst.dfki.de)!**
