I’m creating indexes for an Edge class containing about 500 million records on keys (in, out). The index creation progressed well in the beginning at about 20,000 items/sec. But then after some time has decreased to <1000 items/sec.
2019-05-08 08:43:25:885 INFO {db=cgraph} --> 37.00% progress, 177,405,476 indexed so far (855 items/sec) [OIndexRebuildOutputListener]
2019-05-08 08:43:35:899 INFO {db=cgraph} --> 37.00% progress, 177,415,347 indexed so far (987 items/sec) [OIndexRebuildOutputListener]
2019-05-08 08:43:45:902 INFO {db=cgraph} --> 37.00% progress, 177,427,464 indexed so far (1,211 items/sec) [OIndexRebuildOutputListener]
At this speed, it’ll take like 3-4 days!!
Settings used on 16GB RAM and 300GB SSD
java -server -Xms2G -Xmx7G -Dstorage.diskCache.bufferSize=7200
Any idea why the speed of indexing decreased so drastically? And how can I increase the speed of indexing?
Orientdb 3.0.15
--
---
You received this message because you are subscribed to the Google Groups "OrientDB" group.
To unsubscribe from this group and stop receiving emails from it, send an email to orient-databa...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/orient-database/95597c3e-632b-4570-af51-f07227dc1965%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
To unsubscribe from this group and stop receiving emails from it, send an email to orient-...@googlegroups.com.
To unsubscribe from this group and stop receiving emails from it, send an email to orient-databa...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/orient-database/52f2837f-0663-4abf-9ed2-1715cda3c97b%40googlegroups.com.
For your first case, I see no other solution as build an index but you can do it with a UNIQUE_HASH_INDEX. If the implementation is good, adding a key should be mean time constant (some keys are punctually more expensive, when the index storage base has to grow).
Those queries use direct links and don't need index, the last one just don't need the edge at all.
If count result is one or more items are linked.This query use direct links and don't need index.
OK, I'm not surprised by the SB-Tree insert cost increase as adding a key complexity in such a Tree is O(log(n)).For your first case, I see no other solution as build an index but you can do it with a UNIQUE_HASH_INDEX. If the implementation is good, adding a key should be mean time constant (some keys are punctually more expensive, when the index storage base has to grow).
To unsubscribe from this group and stop receiving emails from it, send an email to orient-databa...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/orient-database/21389bd0-d014-4b25-ba4c-af685f55974f%40googlegroups.com.