spellbook VS supertag

The article fails to mention existence of graph databases, or graph theory, except for tuple spaces which leads to that direction.

With graph databases you can easily and efficiently model any kind of network, including ones that are hierarchical or almost hierarchical by allowing a node to refer to multiple parent nodes instead of one.

My original idea with my bookmark extension Spellbook was this latter kind of graph, and I implemented a prototype called Grimoire using Ruby on Rails and Neo4j graph database, that worked very well.

The Spellbook currently only allows adding new bookmarks into the hierarchical structure imposed by browser APIs, but features an easy to use search feature to find the right category. Spellbook is available for Chrome and Firefox, but the Firefox version seems broken again by their API changes: https://github.com/peterhil/spellbook

I'm writing another script to turn the metadata into tags and import it to TagSpaces, wutag, dolphin, TMSU, Supertag.

You could look into projects like https://amoffat.github.io/supertag/

I wrote Supertag[0] specifically to get the same kind of ergonomics with tags as you get with folders. Basically you can dynamically render sub-folders based on the tags that apply to your current selection.

Example: /A/B contains the intersection of tags A and B. If sub-folder C exists underneath /A/B, it's because one of the files in the intersection also has tag C.

0. https://amoffat.github.io/supertag/

I'm the author of Supertag, which is what you might be talking about. https://github.com/amoffat/supertag