kyano_k
ATApache TinkerPop
•Created by kyano_k on 2/17/2023 in #questions
store edges of a node in a sorted manner
Actually, this is for a different project. Haven't reached development yet, just doing research atm for the architecture. I can share it with you privately if you're interested.
23 replies
ATApache TinkerPop
•Created by kyano_k on 2/17/2023 in #questions
store edges of a node in a sorted manner
correct but this is per node. I expect to have a couple 10s if not 100s of thousands of node, so it can get quite large
23 replies
ATApache TinkerPop
•Created by kyano_k on 2/17/2023 in #questions
store edges of a node in a sorted manner
hmmm i see. so essentially, I would have improvement in the
has
step correct? Meaning, that by using a graph like janus graph, filtering with has('value', gt(desiredValue))
would be more efficient since value
is indexed as opposed to if it wasn't?23 replies
ATApache TinkerPop
•Created by kyano_k on 2/17/2023 in #questions
store edges of a node in a sorted manner
variable, it could be thousands it could be a few
23 replies
ATApache TinkerPop
•Created by kyano_k on 2/17/2023 in #questions
store edges of a node in a sorted manner
but if i have that property indexed, is it safe to assume that the order step will work faster than a naive order?
23 replies
ATApache TinkerPop
•Created by kyano_k on 2/17/2023 in #questions
store edges of a node in a sorted manner
i see
23 replies
ATApache TinkerPop
•Created by kyano_k on 2/17/2023 in #questions
store edges of a node in a sorted manner
@KelvinL @edolivares @spmallette tagging for visibility
23 replies
ATApache TinkerPop
•Created by kyano_k on 2/17/2023 in #questions
store edges of a node in a sorted manner
I'll give you an example and maybe you could suggest the best solution (if there is one):
I have an a node
V
which holds the property value: x
.
All of the incoming edges hold desiredValue: y
for some y
.
I define a certain operation for all nodes V1
with incident edges with V
that have desiredValue < value
, and for all node V2
with incident edges with V
that have desiredValue > value
.
Therefore in this instance it would be very efficient to keep all of those edges sorted, because with a single binary search of value
I can identify which nodes need what operation.23 replies
ATApache TinkerPop
•Created by kyano_k on 2/17/2023 in #questions
store edges of a node in a sorted manner
it will be sorted by a numeric property shared by all
23 replies
ATApache TinkerPop
•Created by kyano_k on 2/17/2023 in #questions
store edges of a node in a sorted manner
so I'm assuming also i wouldn't be able to perform binary search on a sorted index correct?
23 replies
ATApache TinkerPop
•Created by kyano_k on 2/17/2023 in #questions
store edges of a node in a sorted manner
are you familiar with anything that will allow me to do that?
23 replies
ATApache TinkerPop
•Created by kyano_k on 2/1/2023 in #questions
addV with existing ID doesn't throw error
Thanks
18 replies
ATApache TinkerPop
•Created by kyano_k on 2/1/2023 in #questions
addV with existing ID doesn't throw error
ok
18 replies
ATApache TinkerPop
•Created by kyano_k on 2/1/2023 in #questions
addV with existing ID doesn't throw error
Hmmm
18 replies
ATApache TinkerPop
•Created by kyano_k on 1/24/2023 in #questions
Option to be a range of values
Thank you
4 replies
ATApache TinkerPop
•Created by kyano_k on 1/24/2023 in #questions
Ciel function in Math step doesn't seem to work
lol sorry about that 😂
7 replies
ATApache TinkerPop
•Created by kyano_k on 1/24/2023 in #questions
Ciel function in Math step doesn't seem to work
@spmallette
7 replies
ATApache TinkerPop
•Created by kyano_k on 1/24/2023 in #questions
Ciel function in Math step doesn't seem to work
Let me copy the error
7 replies
ATApache TinkerPop
•Created by kyano_k on 1/17/2023 in #questions
Use statement from choose and option that check only if a value has been yielded
sure things i will send it later
32 replies
ATApache TinkerPop
•Created by kyano_k on 1/17/2023 in #questions
Use statement from choose and option that check only if a value has been yielded
essentially what we care about is this;
if the conditional vertex exists we need to upsert vertices with IDs from the array
if conditional vertex doesn't exist we may disregard the array of IDs entirely
32 replies