{"id":"W4288420235","doi":"10.48550/arxiv.1903.02076","title":"Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal\\n Joins","year":2019,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Computer science; Intersection (aeronautics); Binary number; Query optimization; Query plan; Matching (statistics); Vertex (graph theory); Partition (number theory); Theoretical computer science; Graph; Mathematics; Sargable; Data mining; Search engine; Combinatorics; Information retrieval","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.002300997,0.0009351671,0.0009754958,0.001144869,0.0007314274,0.001833281,0.001571203,0.0007565994,0.001827748],"category_scores_gemma":[0.004954575,0.0004915335,0.0008217147,0.00193078,0.001355833,0.003277832,0.00202743,0.001008127,0.0003225124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001917647,"about_ca_system_score_gemma":0.001908016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005989115,"about_ca_topic_score_gemma":0.01155321,"domain_scores_codex":[0.996851,0.0007791181,0.0001807303,0.0004818063,0.001253413,0.0004538271],"domain_scores_gemma":[0.9979686,0.0009946106,0.0002285425,0.0004700657,0.000213198,0.0001249772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006000188,0.000416191,0.004963552,0.000166057,0.0001076429,0.0001382537,0.0002111529,0.7809182,0.01329407,0.03398964,0.005035422,0.1601599],"study_design_scores_gemma":[0.00003301459,0.0001397219,0.0004606776,0.000007061362,0.00002656047,0.00005230559,0.00007850628,0.9711398,0.006215981,0.02040984,0.001423388,0.00001312808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1728444,0.0005584922,0.8132547,0.0006945118,0.00004443167,0.0002358002,0.0004109193,0.003117296,0.008839349],"genre_scores_gemma":[0.5873644,0.0001694696,0.4090441,0.0001546312,0.00004010258,0.0001264576,0.0007328555,0.0006099656,0.001757966],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005989115,"threshold_uncertainty_score":0.01391357,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05482722818346512,"score_gpt":0.1823133907262503,"score_spread":0.1274861625427852,"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."}}