Re: [orientdb] How to properly index edges?

We’re using Apache Accumulo now. It fits better to our needs. > Am 31.05.2017 um 15:29 schrieb Özgür Sucu : > > Hi Sven, > Which solution did you switch? or what did you use as the replacement of > OrientDB > > 31 Mayıs 2017 Çarşamba 16:03:57 UTC+3 tarihinde Sven Hod

Re: [orientdb] How to properly index edges?

you have any performance issues regarding the suggested query above? if > you had how did you manage it? > > 11 Ağustos 2015 Salı 22:09:18 UTC+3 tarihinde Sven Hodapp yazdı: > Hi Savio, > > is OrientDB’s intersect algorithm optimized, like the one in Lucene? E.g. > using skip lists

Re: [orientdb] How to properly index edges?

Hi Savio, is OrientDB’s intersect algorithm optimized, like the one in Lucene? E.g. using skip lists for fast intersection? For that kind of query are no other efficient ways possible with real graph-queries? (Especially to overcome input sensitive intersections) Is there a optimal way to model

[orientdb] Re: How to properly index edges?

So it is not possible to make an automatic index to speedup the "uima_annotated where in.uuid =..." query? I'll can think about a "inuuid" property within uima_annotated and place an index on that? (But this would be a bit wasteful in terms of space?) Regards, Sven Am Donnerstag, 6. August 201

[orientdb] Re: How to properly index edges?

Thanks! That's not bad. At some point, if we have many more edges in the bag, the intersect function will be slow? So that query is very sensitive about data quantity? (The entire dataset is at least 240x more data!) Is it possible to use an index to speed things up? Am Donnerstag, 6. August 2

[orientdb] Re: How to properly index edges?

Hi SavioL, thanks for your reply. Here you can download it: https://owncloud.scai.fraunhofer.de/public.php?service=files&t=ad73207d52d3ed6b163fa10f954823c6 The download resource expires on 2015-08-09. Regards, Sven Am Donnerstag, 6. August 2015 12:20:05 UTC+2 schrieb SavioL: > > Hi, > can you

[orientdb] How to properly index edges?

Hi there, my data model looks like this: - V class Abstract with uuid (notuniqe index), model (lucene index) and some other properties - V class NormalizedNamedEntity with the same props and indexes like Abstract - E class uima_annotated which connects Abstracts with Normaliz

Re: [orientdb] De-duplication is very slow?

>> Could you post the details of your db schema, in terms of classes, >>> properties and index definitions? >>> >>> Thanks >>> >>> Luigi >>> >>> >>> 2015-04-21 17:03 GMT+02:00 Sven Hodapp >>> >: >>> >&g

[orientdb] De-duplication is very slow?

Hi together, for my project I want to import a lot of data into the database. But the data should be de-duplicated. First of all, without de-duplication the insertion takes about 500 ms (a minimal test set): docelem = graph.addVertex("class:DocElem", "uri", uri, "type", type, "model", mod

[orientdb] Re: Write graph queries: follow edges in where clause

t_hasModel > +-+---+-+--+ > 0 |#48:0|DocElem|paragraph|domain.tdl|[size=1] > +-+---+-+--+ > > Note that in both cases, the Model vertex must be referenced using > index[0] (assuming that a Doc

[orientdb] Write graph queries: follow edges in where clause

Hi there, I'm experimenting with OrientDB. Now I want to do some queries with more complexity. DocElem and Model are subclasses of V and hasModel of E, I'm assuming this: insert into DocElem set uri = 'domain.tdl', type = "paragraph" insert into Model set hash = '0e1f', model = "hello w