You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@tinkerpop.apache.org by "Marko A. Rodriguez (JIRA)" <ji...@apache.org> on 2015/08/27 16:25:46 UTC

[jira] [Closed] (TINKERPOP3-604) DetachedEdge.attach(Vertex) is too slow.

     [ https://issues.apache.org/jira/browse/TINKERPOP3-604?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Marko A. Rodriguez closed TINKERPOP3-604.
-----------------------------------------
    Resolution: Won't Fix
      Assignee: Marko A. Rodriguez

I was confused as to where the problem happened. HW

> DetachedEdge.attach(Vertex) is too slow.
> ----------------------------------------
>
>                 Key: TINKERPOP3-604
>                 URL: https://issues.apache.org/jira/browse/TINKERPOP3-604
>             Project: TinkerPop 3
>          Issue Type: Improvement
>          Components: io
>    Affects Versions: 3.0.0-incubating
>            Reporter: Marko A. Rodriguez
>            Assignee: Marko A. Rodriguez
>
> We need a new method on Vertex.
> {code:java}
> Vertex.edges(Object... ids)
> {code}
> Right now to attach, we do a linear scan of all edges to find the edge with the right id. If the edges are already indexed by (e.g. HashMap) by the vendor, then O(1) can be achieved.
> This is killing us in OLAP where we have to read vertices from disk and those vertices can contain thousands (if not millions) of edges. And then if the graph engine uses "out of core" to cache data, we are hit again with the attachment cost.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)