Hi Stefan. Your question are very interesting. Yes we do not use any indexes to handle graph relations.
On Wed, Mar 26, 2014 at 5:56 PM, <[email protected]> wrote: > Hi, > > Just to be absolutely sure. > > Am I correct in understanding index-free adjacency so that a > direct/physical pointer, to the adjacent record, is stored in both the edge > and vertex. > (I mean that is the only way to go to the adjacent record without looking > it up in a index, right?) > > I have no officially seen too many articles discussion index-based > "index-free adjacency" and always wanted to but in :). > > Regards, > -Stefán > > -- > > --- > 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. > -- Best regards, Andrey Lomakin. Orient Technologies the Company behind OrientDB -- --- 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.
