{"id":"W2567386150","doi":"10.1109/iri.2016.60","title":"Bloom Filter Tree for Fast Search and Synchronization of Tree-Structured Data","year":2016,"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); Synchronizing; Search tree; Metadata; Data structure; Interval tree; Depth-first search; Overhead (engineering); Synchronization (alternating current); Data mining; Search algorithm; Algorithm; Computer network; Mathematics; Operating system","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.002234295,0.0006429036,0.00104238,0.002489991,0.001543213,0.001719988,0.001854601,0.001075246,0.002507227],"category_scores_gemma":[0.007918027,0.0005786306,0.0006446178,0.003642567,0.0007874618,0.003538631,0.001280607,0.0009365376,0.001050772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002592973,"about_ca_system_score_gemma":0.004105133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007873823,"about_ca_topic_score_gemma":0.01012877,"domain_scores_codex":[0.9982752,0.0003697845,0.0001934919,0.0002538805,0.0007449943,0.000162689],"domain_scores_gemma":[0.9955086,0.00201331,0.0004448986,0.001053351,0.0008232148,0.0001566259],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001124325,0.0002584359,0.006043506,0.0006119759,0.0001982914,0.0004952672,0.001035431,0.1256728,0.07488978,0.1096439,0.01699373,0.6630326],"study_design_scores_gemma":[0.0001433741,0.0001979363,0.0007840464,0.00005790678,0.00005127375,0.0003227592,0.0001753893,0.8969053,0.0448083,0.04064177,0.01585584,0.00005608345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01153278,0.0003550887,0.9841744,0.0001366471,0.00003643421,0.0001671061,0.0002563126,0.002398064,0.0009430442],"genre_scores_gemma":[0.1152088,0.000255033,0.881976,0.0001096319,0.00003231188,0.0002739078,0.0005886749,0.0001515618,0.001404075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007873823,"threshold_uncertainty_score":0.01881337,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04022922930280814,"score_gpt":0.2579456104917413,"score_spread":0.2177163811889331,"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."}}