You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+8-3
Original file line number
Diff line number
Diff line change
@@ -36,7 +36,7 @@ insert 1M items one by one | 6.18s | 16.46s | 2.7x
36
36
1000 searches of 1% area | 0.53s | 5.03s | 9.6x
37
37
1000 searches of 10% area | 2.45s | 16.76s | 6.8x
38
38
remove 1000 items one by one | 0.03s | 3.2s | 118x
39
-
bulk-insert 1M items | 3.92s | n/a | 4.2x
39
+
bulk-insert 1M items | 1.99s | n/a | 8.3x
40
40
41
41
## Usage
42
42
@@ -145,7 +145,7 @@ e.g. first indexing the data on the server and and then importing the resulting
145
145
146
146
* single insertion: non-recursive R-tree insertion with overlap minimizing split routine from R*-tree (split is very effective in JS, while other R*-tree modifications like reinsertion on overflow and overlap minimizing subtree search are too slow and not worth it)
147
147
* single deletion: non-recursive R-tree deletion using depth-first tree traversal with free-at-empty strategy (entries in underflowed nodes are not reinserted, instead underflowed nodes are kept in the tree and deleted only when empty, which is a good compromise of query vs removal performance)
0 commit comments