{"id":"W2912891501","doi":"10.14778/3291264.3291270","title":"PS-tree-based efficient boolean expression matching for high-dimensional and dense workloads","year":2018,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Disjoint sets; Matching (statistics); Predicate (mathematical logic); Memory footprint; Tree (set theory); Theoretical computer science; Algorithm; Parallel computing; 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.0008160351,0.00056967,0.0009494238,0.001342194,0.0006520706,0.001369959,0.001450128,0.0005611358,0.003024187],"category_scores_gemma":[0.005174197,0.0002810902,0.0007781101,0.003472073,0.0004505208,0.003442001,0.001315561,0.0007605521,0.001005237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009113204,"about_ca_system_score_gemma":0.001771852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003264848,"about_ca_topic_score_gemma":0.004762508,"domain_scores_codex":[0.9987105,0.0001765309,0.0001469041,0.0002157877,0.0006013053,0.0001489664],"domain_scores_gemma":[0.9982563,0.0006586135,0.0001482517,0.0005082095,0.000345517,0.00008321134],"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.0006317106,0.0003956482,0.006845889,0.000436182,0.0001169972,0.0003850695,0.0003410045,0.09410629,0.05619137,0.03850555,0.0291629,0.7728813],"study_design_scores_gemma":[0.00006102654,0.0001539673,0.0008956068,0.00001478022,0.0000358431,0.0002844128,0.0001303485,0.937313,0.02001552,0.03039462,0.01067696,0.00002402627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06944394,0.0007468538,0.9142327,0.0004486249,0.0001084581,0.0002547919,0.001631109,0.008114597,0.005018958],"genre_scores_gemma":[0.4567328,0.000545498,0.530444,0.0004896857,0.00009880958,0.0002994441,0.00616382,0.0005984682,0.004627432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003264848,"threshold_uncertainty_score":0.01011693,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008289532133585992,"score_gpt":0.2184565017200199,"score_spread":0.2101669695864339,"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."}}