I’ve been talking about it for a while now. . . I finally got around to doing it.
I’m building the database out, with a desktop admin client I spent the last couple days making, to support an open sourced search engine, powered by a category based XXX.XXX.XXX taxonomy.
If you want to see how the database will work, paste this into your ipfs node and follow the next links: bafkreiaiaq2abnub3zp6kcvr4aiwrwv3qe4fjd5auf3ytjasfuj3pvgwva
This is the current release. I will be adding more to it, but none of the additions will appear here. It’s a huge blockchain. Your IPFS node downloads only the portions of the chain that interests you.
I have plans to role out a desktop explorer client.
You’ve opened the root inode. In the categories listed, choose the next string and open it. It’ll take you to the second inode. After the third inode, you begin to hit drawers of cards. Each card has 25 domains listed on it, with a ranking score, domain name, and description. To get to the next 25 domains, you use the next string.
Uh, ok. Sorry, but I don’t understand any of that. But I’ll do some more research into whatever this is.
An inode (or index node) is something which points to something else, to help you find it easier. In a library, it would be the cards in the card catalog. They help you find a book.
There are 3 layers of inodes in this system: the root node, the medial node, and the distal node.
Each node lists the categories it has, and then tells you where to go to get the sub-categories for that category. Here, for example, you have the root. If you follow the next link under INF, you’ll get to its subcategories (REF). If you follow the next link under REF, you’ll see DIC, ENC, and MAP. Following the next link under those will get you to sites that contain that particular type of information.
I am building a desktop explorer that makes this much easier.