Dear all, first a BIG thank you for opening up this project to the world, pushing it forward and providing good project documentation and groups like this one for new users - would like to see more projects like traildb out there :)
My question is related to optimizing retrieval of consecutive events. I would like to efficiently retrieve all the events stored in one trail, between time interval [t1, t2].
Let's assume first the simple use-case, where no traildb filter is configured on the cursor.
The "data" (that gets stored with each "event") has always the same length.
The closest API to achieve this I've seen is tdb_multi_cursor_next_batch().
Is this the fastest traildb API to retrieve events stored in a given time range?
Actually tangent to the above: just now I saw here some notes about a great feature: tdb indexing (created using 'tdb index -i my-tdb').
This could speed such queries quite a bit, if I understood it correctly. Does this indexing operation apply to events as well and it is safe to run in parallel with "read" operations (cursors performing read operations from different processes)?
tdb_cursor_next()vs. many events in a batch with
tdb_multi_cursor_next_batch(). The batch mode tends to be much faster if using a language binding
tdbcommand line tool does and you can use it in your own apps too
/usr/bin/ld: .dub/obj/TrailDB.o: relocation R_X86_64_32 against symbol_D9Exception7__ClassZ' can not be used when making a shared object; recompile with -fPIC`
-fPICflag: http://www.cprogramming.com/tutorial/shared-libraries-linux-gcc.html. dmd calls gcc and perhaps supplies the
-fPICflag automatically, while perhaps ldc does not?
cffiin Python, if you want to give it a try