Time-series data is a pretty good representation of what I'm doing (see p.22 of this presentation: http://www.slideshare.net/LuigiDellAquila/orientdb-time-representation). Consider: a) there is never a need to traverse "up" from a lower-level node; b) the data is relatively static (i.e. write once, read mostly); and c) when finally deleting old data (if ever), the delete will also only traverse down. Given that, and taking into account the large number of nodes, I not only don't benefit from bi-directional links, but specifically, I don't want to incur the additional storage overhead of the "reverse" pointers and additional edge records (even with lightweight edges, which I can't use in this case, there is extra storage overhead that provides no value). There has been discussion of supporting uni-directional (or mono-directional) links in ODB, but as far as I can tell, this hasn't yet happened. Thus my approach of using LINKMAPs. The only downside to them is that I want to be able to do a single insert with the LINKMAP property already set, and to do that, I need to know the RID of the downstream node for each upstream node insert operation. That's what I'm trying to optimize.
On Friday, June 3, 2016 at 12:06:05 AM UTC-5, scott molinari wrote: > > Hey Eric. > > If I may ask, what is the data model you have or can you give an example, > which requires a unidirectional relationship between classes? > > Scott > -- --- You received this message because you are subscribed to the Google Groups "OrientDB" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
