{"id":"W4396601617","doi":"10.14778/3648160.3648187","title":"AeonG: An Efficient Built-in Temporal Support in Graph Databases","year":2024,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Graph database; Database; Graph; Theoretical computer science","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.001965147,0.001112981,0.001347276,0.003600384,0.0008500204,0.003562824,0.005685185,0.0009373467,0.002848617],"category_scores_gemma":[0.009798744,0.00089421,0.001211187,0.006470512,0.0005614795,0.01115266,0.004389247,0.001303846,0.001543176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009225484,"about_ca_system_score_gemma":0.001979907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009742966,"about_ca_topic_score_gemma":0.01035511,"domain_scores_codex":[0.997528,0.0003053206,0.0003580078,0.0005877806,0.001079667,0.0001411621],"domain_scores_gemma":[0.9936374,0.0008581755,0.0003552745,0.00388595,0.0009177299,0.000345453],"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.001915731,0.0006551513,0.01110118,0.001250177,0.0004567238,0.0005008299,0.0007077223,0.037339,0.03478986,0.04640638,0.09848747,0.7663898],"study_design_scores_gemma":[0.0004351955,0.0006936665,0.004773089,0.0001363912,0.0003247329,0.001578016,0.0008156126,0.7399145,0.04233492,0.06726614,0.1414483,0.0002794328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04904026,0.006372926,0.856475,0.001411897,0.0004838024,0.0006619382,0.01445572,0.06573944,0.005359046],"genre_scores_gemma":[0.2698689,0.0029316,0.6911725,0.0008850553,0.0002286288,0.0004762876,0.02845341,0.001562493,0.004421088],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009742966,"threshold_uncertainty_score":0.01937252,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02073560636040696,"score_gpt":0.2675125650513128,"score_spread":0.2467769586909058,"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."}}