Fabian Kostadinov

Searching in Rhizomes

In this post I will look into how it is possible to search in rhizomes. I will assume that the rhizome implementation relies on pairing functions to store relations. I described the basic necessary data structures in a previous post. The term “searching in a rhizome” is not defined precisely. Searching implies that some contextual order is given and that the search is conducted in relation to this order. For rhizomes (similar to graphs) it is not entirely clear what constitutes this contextual order, the the definition of contextual order might depend upon one’s situation.

Read More 

Pile or Rhizome? A Short Pamphlet.

Erez Elul, whose honor it is to have “discovered” or “invented” the data structures I deliberately continue to call rhizomes, originally named his invention pile (or pile system). The relatively few authors (for instance Peter Krieg, Ralf Westphal, Ralf Barkow, Miriam Bedoni as well as others besides them), who both commented and contributed on the invention accepted this naming. I must say I never found the term particularly saying for several reasons.

Read More 

Stock Market Informational Websites I Like

This is a non-exhaustive list of websites on stock market investing (and trading) I like for various reasons.

Read More 

Applications of Rhizomes

The intention of this post is to shed a little light on possible applications of rhizomes. I am personally still struggling to figure out what the best use cases for rhizomes might be, but here is a list including some ideas nevertheless. The basic problem I am confronted with is my own tendency to interpret rhizomes in terms of existing data structures and algorithms instead of focusing on what is genuinely new. I have recently come to the (maybe preliminary) conclusion that rhizomes are at their best when it comes to post-structuralist applications. That is, applications where up-to-date a certain data structure is silently accepted as a best way to do things.

Read More 

Implementation of Rhizomes

There are at least three different ways how to implement a rhizome on existing hard- and software platforms: as an object tree, relying on a programming language pointer arithmetic, or using mathematical pairing functions.

Read More