{"id":"W2053495332","doi":"10.1145/2487259.2487260","title":"Analysis and optimization for boolean expression indexing","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Regular expression; Theoretical computer science; Search engine indexing; Boolean expression; Tree (set theory); Matching (statistics); Search tree; Data structure; Tree structure; String searching algorithm; Data mining; Algorithm; Pattern matching; Boolean function; Binary tree; Search algorithm; Artificial intelligence; Mathematics","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.001793019,0.0007183676,0.001065706,0.001482319,0.0007510118,0.003008807,0.001965148,0.0006793574,0.004935978],"category_scores_gemma":[0.01121253,0.000394244,0.000975094,0.004083353,0.001163289,0.005621689,0.001666186,0.001464263,0.001139146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002402986,"about_ca_system_score_gemma":0.00326325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003546303,"about_ca_topic_score_gemma":0.005173323,"domain_scores_codex":[0.9961573,0.0007042459,0.0002750265,0.0003671852,0.002035857,0.0004603751],"domain_scores_gemma":[0.9951615,0.002689472,0.0003229961,0.0009371674,0.0007833068,0.0001054825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005240041,0.0002933208,0.003186145,0.000523604,0.00007034847,0.0001231824,0.0002288591,0.2545762,0.01379962,0.2498584,0.01672461,0.4600917],"study_design_scores_gemma":[0.00003023218,0.00008715544,0.0003147385,0.0000230143,0.0000242873,0.00007724085,0.00006156626,0.9092592,0.006120636,0.07774493,0.006239515,0.00001752145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03071239,0.001323686,0.9537104,0.0005846177,0.00009096297,0.0001640744,0.0006802697,0.002330491,0.01040305],"genre_scores_gemma":[0.3858693,0.001150598,0.6025813,0.0003091113,0.0001502223,0.000394422,0.002134524,0.0007629616,0.006647552],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004935978,"threshold_uncertainty_score":0.01743501,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02055275887691247,"score_gpt":0.2477562282413695,"score_spread":0.227203469364457,"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."}}