Lock-free parallel inserts

Guarantee provided during data insertion where it is ensured that at least one thread will make progress regardless of the remaining threads; however, threads do occasionally resort to localised locking. Lock-free data structures are resilient to adverse thread scheduling and thus often parallelise better than lock-based ones.

Related Fundamentals

Back to Glossary

From the blog

High performance knowledge graph and semantic reasoning engine.