{"id":"W2403354906","doi":"","title":"A Fault Tolerant Data Structure for Peer-to-Peer Range Query Processing","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Range query (database); Hash table; Hash function; Distributed hash table; Redundancy (engineering); Data structure; Fault tolerance; Query optimization; Theoretical computer science; Peer-to-peer; Distributed computing; Data mining; Web search query; Search engine; Sargable; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007157303,0.0003424114,0.0003578832,0.001171495,0.0002647713,0.0007800747,0.003704441,0.0002047044,0.00002238423],"category_scores_gemma":[0.001216928,0.0003496305,0.0000453654,0.00180391,0.00007509974,0.0005963068,0.0005311723,0.0003353289,0.0001246294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004426106,"about_ca_system_score_gemma":0.003535861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002707002,"about_ca_topic_score_gemma":0.01640738,"domain_scores_codex":[0.9964159,0.00004397326,0.0003694176,0.001113364,0.001229822,0.0008275057],"domain_scores_gemma":[0.9949212,0.0001972222,0.0001131066,0.001177638,0.002404353,0.00118647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000528202,0.00005099495,0.0007643246,0.00005248622,0.00005939103,0.000088664,0.001253706,0.1385939,0.00002612578,0.07755492,0.4270959,0.3544068],"study_design_scores_gemma":[0.0008303141,0.0002894667,0.003488198,0.0001348483,0.0000135055,0.00005244367,0.0002745406,0.7903332,0.00004808577,0.03407631,0.1696159,0.0008432722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02507629,0.0001133907,0.8858823,0.0836099,0.00101992,0.0009725268,0.001523717,0.0004468341,0.001355083],"genre_scores_gemma":[0.7823908,3.046767e-7,0.2104991,0.005616173,0.0001960024,0.00004829697,0.0004630994,0.00002524841,0.0007610002],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7573144,"threshold_uncertainty_score":0.9998956,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1116607272230841,"score_gpt":0.3223953343659361,"score_spread":0.210734607142852,"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."}}