Tengis 0.91

Tengis is a small application written in Python/Qt that implements a query system (and eventually management) for bookmarks that is not based on a tree hierarchy.

Tengis is a bookmarks search and view, and eventually bookmarks manager as well. The main premise behind its novel approach is that bookmarks dont have to be organized in a tree, rather are assigned a set of keywords, that is used internally to build a graph.

The main advantages and reasons for this approach are:

* the user doesnt have to find a single location in his bookmarks tree to add a new bookmark. Rather, he simply associates a short set of keywords;
* searches are carried out by navigating between the neighboring keywords in the keyword graph (v.s. navigating up and down menus, but there is no notion of up and down);
* searches for recalling bookmarks or keywords are carried out by typing a regular expression. This is integrated by insert a new "search" keyword node in the graph.

Furthermore, other advantages that are not related to our approach:

* the user can typically add a personal comment on the description related to a bookmark;
* the file format for bookmarks that we use is extremely simple and different revisions will merge nicely if you use CVS to manage your bookmarks.

Integration with browser is done simply using the webbrowser Python module and by cut-n-paste (selecting a bookmark puts it in the clipboard).

I wrote this implementation in a fit of rage after writing down an idea for the design I really wanted to have (design document: Self-Organizing Graph-Based Search Method). This implementation is pretty much the same as what is described in the design document, except for the cool UI, which I probably wont ever have time to implement.