{"id":"W3092832024","doi":"10.1109/icde51399.2021.00130","title":"A+ Indexes: Tunable and Space-Efficient Adjacency Lists in Graph Database Management Systems","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Search engine indexing; Adjacency list; Computer science; Vertex (graph theory); Partition (number theory); Adjacency matrix; Database; Graph; Theoretical computer science; Data mining; Mathematics; Combinatorics; Algorithm; 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.001682114,0.0007498325,0.0005865599,0.001752718,0.001158124,0.00318219,0.003373874,0.0007589636,0.002899617],"category_scores_gemma":[0.00664271,0.0005387171,0.0004125147,0.004395444,0.000920817,0.00618145,0.002671729,0.001030407,0.001257365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001432958,"about_ca_system_score_gemma":0.001565503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004794229,"about_ca_topic_score_gemma":0.005555275,"domain_scores_codex":[0.9980586,0.0004605859,0.0002201025,0.0003032122,0.0007716764,0.0001858175],"domain_scores_gemma":[0.9959506,0.001243441,0.0002865113,0.001808867,0.0004773441,0.000233198],"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.001857389,0.0007659356,0.009459252,0.0008140139,0.000176704,0.0003690837,0.001282428,0.1256784,0.08301679,0.131205,0.06270982,0.5826652],"study_design_scores_gemma":[0.0004422588,0.0006943155,0.002919083,0.00007421731,0.0001389233,0.0004969477,0.0005242547,0.7469584,0.08343969,0.09041011,0.0737389,0.0001629115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1886233,0.002122032,0.7434949,0.0008115811,0.0002307048,0.0004426572,0.002505275,0.05051892,0.01125067],"genre_scores_gemma":[0.4847026,0.000734021,0.5056117,0.0002671778,0.0001315337,0.0003088845,0.003270815,0.001562907,0.003410344],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004794229,"threshold_uncertainty_score":0.01039684,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01377196554687299,"score_gpt":0.2299567065551856,"score_spread":0.2161847410083126,"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."}}