Re: [orientdb] Get Edges Between Vertices (Again)

2017-03-16 Thread Luigi Dell'Aquila
Hi John, In MATCH statement (2.2) and more in general in 3.0 we are changing the optimization of queries based on indexes, but you will still need an index on the edge for such use case, so the big part of the work will be needed anyway. Thanks Luigi 2017-03-16 12:43 GMT+01:00 John J. Szucs

Re: [orientdb] Sorting is not work for double Field Type

2017-03-16 Thread Roberto Franchini
On Thu, 16 Mar 2017 at 16:20 Abhijit Shivathare wrote: > I have store the timestamp in onDt column as > > var d = new Date(); > var timestamp = Math.floor(d.getTime() / 1000); > > > select query use order by on onDt column. Which give me wrong result > > > Is onDt

[orientdb] Sorting is not work for double Field Type

2017-03-16 Thread Abhijit Shivathare
I have store the timestamp in onDt column as var d = new Date(); var timestamp = Math.floor(d.getTime() / 1000); select query use order by on onDt column. Which give me wrong result -- --- You received this message because you are subscribed to the Google Groups "OrientDB" group. To

[orientdb] the orientdb thorwing fetch error #15:0 which was deleted by delete query and put with in transactio

2017-03-16 Thread IV Krishna
db.begin(TXTYPE.OPTIMISTIC);1.delete from course table with rowid2.removing course rowid from Student table UPDATE Student REMOVE couses = #25:183 Student is a class which contains couses field of List type. There is another table Cousre which is having course data. db.commit(); The above

Re: [orientdb] Get Edges Between Vertices (Again)

2017-03-16 Thread Luigi Dell'Aquila
Hi John, you have two alternatives: 1) use OrientVertex.countEdges() to check which of the two vertices has a smaller number of edges. This approach is good if you know that at most one is a supernode 2) if you know that both vertices can be supernodes, then the only efficient way to find the

Re: [orientdb] Get Edges Between Vertices (Again)

2017-03-16 Thread John J. Szucs
Luigi, Yes, this helps. Your option #2 is more applicable to my project. Will OrientDB 3.0 significantly change/improve this use case? I don't want to implement this manual edge index if it will become unnecessary in (a few?) weeks. Thanks! -- John > On Mar 16, 2017, at 07:24, Luigi

[orientdb] Get Edges Between Vertices (Again)

2017-03-16 Thread John J. Szucs
I need to *very quickly* find the edges that directly connect two specified vertices, using either a SQL query, the Java API, or a combination of the two. If it helps, at this point in the program, I know for a fact that the two vertices are adjacent. What I'm trying to determine is *how* they