Feeling dissatisfied with the options available in the current world of graph databases (from what I can understand here: http://en.wikipedia.org/wiki/Graph_database) I'm starting to think that building a SQLAlchemy layer will be the easiest way to implement the storage and retrieval of nodes and edges most reliably (and in system that is well supported). I'd like to be able to sort the data at the storage level and along with the basic standards outlined in the RDF spec I'd like to be able to define multiple edge properties. I'm happy to keep the storage to UTF-8 and leave the rest of it in the filesystem, so the storage systems supported by SA are perfectly fine.
I like the efforts that went in to RDFAlchemy (http://www.openvest.com/ trac/wiki/RDFAlchemy), but judging by the look of the Google group the project is basically dead. I've seen the graph theoretic examples included with the SQLAlchemy documentation, but is there anything I'm missing? It looks like discussions of this nature have come up on the list from time to time in the past few years: so perhaps someone wants to tell me I'm simply looking in the wrong place? All input is appreciated. Thanks! -- You received this message because you are subscribed to the Google Groups "sqlalchemy" group. To post to this group, send email to sqlalchemy@googlegroups.com. To unsubscribe from this group, send email to sqlalchemy+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sqlalchemy?hl=en.
