Duane, (01)
I'm moving this thread to the more general Ontolog Forum. (02)
DN
> Neo4J? Given the large instance data sets, I have been finding it an
> ideal database to work on as it models graphs really well. It uses a
> traversal model to find associated data...
> Check this out: http://console.neo4j.org/usage.html (03)
For really Big Data, node-by-node traversals of graphs degenerate
to a combinatorial explosion. (04)
I'm sure that things like Neo4J can be useful for many applications,
but if you really have large graphs and large numbers of graphs,
you need to index the data. And there are some very good methods
for indexing finding exact and approximate matches. (05)
In particular, the organic chemists have been pioneers in searching,
indexing, and matching huge graphs. They abandoned brute-force
traversal methods in the 1980s. (06)
See, for example, slides 104 to 128 of the following slides: (07)
http://www.jfsowa.com/talks/goal.pdf (08)
For issues of computational complexity, see the subset of slides
from 115 to 118 and the references cited there. (09)
John (010)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J (011)
|