15 replies

What is the ordering of group?

For instance (on Tinkerpop modern)
g.V().group().by('age').by('name')
gives
[{32=[josh], 35=[peter], 27=[vadas], 29=[marko]}]

There must be some logic to it?

(Understanding this would help me for unit testing, allowing me to compare results that are actually the same)

Solution

Gremlin doesn't offer too many order guarantees. I think

group()

group()

by default uses a regular old

HashMap

HashMap

for it's data structure. If you want an order you would want to specifically specify an

order()

order()

- for example:

gremlin> g.V().group().by('age').by('name').order(local).by(keys)
==>[27:[vadas],29:[marko],32:[josh],35:[peter]]

gremlin> g.V().group().by('age').by('name').order(local).by(keys)
==>[27:[vadas],29:[marko],32:[josh],35:[peter]]

I suppose you could also force use of a

LinkedHashMap

LinkedHashMap

gremlin> g.withSideEffect('m', [:]).V().hasLabel('person').group('m').by('age').by('name').cap('m')
==>[29:[marko],27:[vadas],32:[josh],35:[peter]]
gremlin> g.withSideEffect('m', [:]).V().order().by('age').group('m').by('age').by('name').cap('m')
==>[27:[vadas],29:[marko],32:[josh],35:[peter]]

gremlin> g.withSideEffect('m', [:]).V().hasLabel('person').group('m').by('age').by('name').cap('m')
==>[29:[marko],27:[vadas],32:[josh],35:[peter]]
gremlin> g.withSideEffect('m', [:]).V().order().by('age').group('m').by('age').by('name').cap('m')
==>[27:[vadas],29:[marko],32:[josh],35:[peter]]

The first being an insertion order given however the underlying graph iterates vertices from

V()

V()

or with an explicit

order()

order()

as in the second. I'd say it's possible better to do the explicit order against vertices rather than than my first example where it does a in-memory sort of the

Map

Map

as it's possible you might get some performance improvement there depending on your graph. Hard to say which is nicer as the

withSideEffect()

withSideEffect()

approach isn't quite as readable. (Note that in my Groovy examples above, the

[:]

[:]

will resolve to a

LinkedHashMap

LinkedHashMap

by default.)

Jump to solution

Apache TinkerPop•3y ago•

15 replies

wiebe

What is the ordering of group?

Solution

Gremlin doesn't offer too many order guarantees. I think

group()

group()

by default uses a regular old

HashMap

HashMap

for it's data structure. If you want an order you would want to specifically specify an

order()

order()

- for example:

gremlin> g.V().group().by('age').by('name').order(local).by(keys)
==>[27:[vadas],29:[marko],32:[josh],35:[peter]]

gremlin> g.V().group().by('age').by('name').order(local).by(keys)
==>[27:[vadas],29:[marko],32:[josh],35:[peter]]

I suppose you could also force use of a

LinkedHashMap

LinkedHashMap

gremlin> g.withSideEffect('m', [:]).V().hasLabel('person').group('m').by('age').by('name').cap('m')
==>[29:[marko],27:[vadas],32:[josh],35:[peter]]
gremlin> g.withSideEffect('m', [:]).V().order().by('age').group('m').by('age').by('name').cap('m')
==>[27:[vadas],29:[marko],32:[josh],35:[peter]]

gremlin> g.withSideEffect('m', [:]).V().hasLabel('person').group('m').by('age').by('name').cap('m')
==>[29:[marko],27:[vadas],32:[josh],35:[peter]]
gremlin> g.withSideEffect('m', [:]).V().order().by('age').group('m').by('age').by('name').cap('m')
==>[27:[vadas],29:[marko],32:[josh],35:[peter]]

The first being an insertion order given however the underlying graph iterates vertices from

V()

V()

or with an explicit

order()

order()

as in the second. I'd say it's possible better to do the explicit order against vertices rather than than my first example where it does a in-memory sort of the

Map

Map

as it's possible you might get some performance improvement there depending on your graph. Hard to say which is nicer as the

withSideEffect()

withSideEffect()

approach isn't quite as readable. (Note that in my Groovy examples above, the

[:]

[:]

will resolve to a

LinkedHashMap

LinkedHashMap

by default.)

Jump to solution

What is the ordering of group?

Similar Threads

What is the ordering of group?

Similar Threads

Similar Threads

Similar Threads