{"id":"W2293223786","doi":"10.1109/csci.2015.30","title":"Bloom Filter Tree for Fast Search in Tree-Structured Data","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Bloom filter; Tree traversal; Computer science; Tree (set theory); Search tree; Pruning; Set (abstract data type); Interval tree; Fractal tree index; Node (physics); Metadata; Optimal binary search tree; Data structure; Depth-first search; Filter (signal processing); Data mining; Algorithm; Search algorithm; Mathematics; World Wide Web","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002335681,0.000570886,0.001222754,0.002137522,0.001491182,0.001931138,0.001691582,0.001423351,0.002347589],"category_scores_gemma":[0.009470443,0.000551916,0.0007082807,0.003964107,0.0009838974,0.004642776,0.00129573,0.00114332,0.00084243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002723626,"about_ca_system_score_gemma":0.003682252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006349551,"about_ca_topic_score_gemma":0.00733349,"domain_scores_codex":[0.9984605,0.0004007867,0.0001434348,0.000173999,0.0006725306,0.0001487781],"domain_scores_gemma":[0.9949356,0.003040677,0.0003273347,0.0007961506,0.0007464087,0.0001537314],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009609214,0.0002858805,0.00362913,0.0006433688,0.0001466659,0.0004358637,0.0008890245,0.2419483,0.03034699,0.2393625,0.01937842,0.4619729],"study_design_scores_gemma":[0.0001142377,0.0001419251,0.0003016211,0.0000524642,0.00003621516,0.0002219982,0.0001069468,0.8766851,0.01105817,0.1014302,0.009818434,0.00003269733],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01267676,0.0006847175,0.9832407,0.0002970214,0.00003463772,0.0001669348,0.0002307542,0.001378025,0.001290483],"genre_scores_gemma":[0.1193767,0.0006226957,0.877485,0.0001520684,0.00004464158,0.0002980192,0.0005044403,0.0001106141,0.001405811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006349551,"threshold_uncertainty_score":0.01976132,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1417759591219327,"score_gpt":0.305617112929154,"score_spread":0.1638411538072213,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}