I've got a situation where every attribute and element is version-ed and stored separately. Everything is treated as a node, and the relationships between nodes are defined by the query. Needless to say, it's a little trippy. Or to say it another way, we can store to different directed graphs, and define the structure of a third, and have the DB/code fill in the values of the 3rd, using the first two.
Anyone know of some kind of db architecture that would be inherently good at this?
Copyright © 2018, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds