1 Hit in 1.2 sec

Parallel Batch-Dynamic kd-Trees [article]

Rahul Yesantharao
2021 arXiv   pre-print
Our experiments on a 36-core machine with two-way hyper-threading using a variety of synthetic and real-world datasets show that our implementation of BDL-tree achieves a self-relative speedup of up to  ...  34.8× (28.4× on average) for batch insertions, up to 35.5× (27.2× on average) for batch deletions, and up to 46.1× (40.0× on average) for k-nearest neighbor queries.  ...  Dhulipala, “ParlayLib - a toolkit in Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium for parallel algorithms on shared-memory multicore machines,” in on Principles  ... 
arXiv:2112.06188v1 fatcat:e5bje74lg5hbnlxanqkhubpqli