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
Per-string median search time (ms) across string sizes. Tag counts: tiny = 1, small = 5, medium = 10, large = 25, xlarge = 50, xxlarge = 100. Larger strings also contain nested groups (e.g. large = 5 groups at depth 2). The table below is filtered to the `bare_term` query (`Event` / `@Event`) to isolate parse and tree-walk cost from query complexity; see the query heatmap image below for all 12 queries.
@@ -400,7 +400,7 @@ Search over 200 rows of the `eeg_ds003645s_hed` BIDS test dataset.
400
400
401
401
Number of tags in the HED string (1 to 100), query `Event`. Basic search time is dominated by regex compilation overhead and stays roughly constant; tree-based engines scale linearly with the number of nodes to traverse.
0 commit comments