Thanks for the reply, but I still don't understand the computational complexity of accessing the properties. Is it O(n), O(log n), or O(1) for n properties? "array like structure" to me implies O(n). Is this correct?
There is a difference between large and small property value strings? -Chris On Thursday, August 28, 2014 4:19:52 PM UTC-4, Michael Hunger wrote: > > All primitive properties are loaded at first access of any property and > then held in a array like structure. > > > All larger properties like large strings and arrays are only loaded on > first access of the actual property. > > Michael > > Am 28.08.2014 um 19:19 schrieb Chris Wj <[email protected] <javascript:>>: > > I've read that relationship properties are cached once they are accessed. > Are they cached individually in, for instance, a Map? Or are they and all > of the previous properties cached as a linked list? I want to know if > propery cache lookup is a constant time operation. > > -Chris > > -- > You received this message because you are subscribed to the Google Groups > "Neo4j" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected] <javascript:>. > For more options, visit https://groups.google.com/d/optout. > > > -- You received this message because you are subscribed to the Google Groups "Neo4j" 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.
