COUNT(DISTINCT p) as cnt
annotates the number of people born in each city that have the programming skill. Then we order the city vertices by their descending cnt value, and choose the top 1 city:1
to each matched city vertex.1.5
to each matched city vertex.true
to each matched city vertex.2021-01-01
to each matched city vertex.name
attribute of the matched vertices p to the matched city vertex connected to vertices p.1
on the matched city vertex.1.5
on the matched city vertex.true
on the matched city vertex.2020-01-01
on the matched city vertex.name
and the value of that is attribute is attached to the san jose vertex.name
= "Emily" and the other has the attribute name
= "Kevin". The resulting value stored in singleValueAttributeOfVertexOrEdge is non deterministic and could be either "Emily" or "Kevin".datetime
, vertex
and edge
are stored in a list. This is because, we currently do not have an accumulator to store these data types directly yet.integer
, real
, string
, bool
, datetime
, vertex
and edge
.integer
, real
, string
and datetime
. However, single value attachments with the type datetime
are stored in a list, thus, we currently do not support ordering based on single value attachments that have the datetime
data type.san jose university
is working at or was born in. In other words, a person vertex that attends san jose university
needs either a work_at
edge connected to a company vertex, or a born_in
edge connected to a city vertex to be included in the result.san jose university
is working at and was born in. In other words, a person vertex needs to have both a word_at
edge connected to a company and a born_in
edge connected to a city to be included in the result.