neo

I feel I have been wiki-fied. Thanks.


In the mind of an average person, yes, there are many. In the mind of a
db, only those it has been told. For example, in the current dbd db,
SFGG Bridge can be accessed via the following queries based on
classification, name and location:

(get (. 'world 'wonder) instance *)
(get * name (get 'golden 'gate 'bridge))
(get * location (& (get location instance *)
(get * latitude '37^49'10"N)
(get * longitude '122^28'43"W)))

Also instead of navigating the db\item\universe... route to the bridge
in the tree view interface, one can use the following alternate paths:

db\item\world wonder
db\item\city\san francisco\ ...
db\item\state\california\ ...
db\item\country\usa\ ...
db\item\continent\north america\ ...
db\item\earth\ continent\ ...
and so on.

And if one navigated to SF Bridge via db\item\world wonder, he can find
out where else it is referenced by issuing "Find Where Referenced"
command which in this case would find san francisco.


Luckily, iddy biddy dbd doesn't use the Hierarchal, Relational, Binary,
Graph, CODYSL Network, XML, ProLog, LISP, hyperNotePad or bitBucket
model It does use a tree and grid to view data.


But user's can create hierachies on the fly with data they have.

Can you describe what that problem is? Possibly with respect to the
current World Hierarchy Example? Who knows, maybe I already accidently
solved it


What does it need to do that a regular db doesn't already? Can you give
an example?


Can things in the Dewey system have multiple classifications?

What would make it better?