{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002159548,0.0005886066,0.001535647,0.002217351,0.00213882,0.00263241,0.004356471,0.001493472,0.003318956],"category_scores_gemma":[0.007007269,0.0008923443,0.0007911838,0.00355123,0.001462464,0.005930108,0.004415195,0.001814592,0.002029303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001294772,"about_ca_system_score_gemma":0.001483971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001371549,"about_ca_topic_score_gemma":0.001135607,"domain_scores_codex":[0.9974301,0.0003208528,0.0004342922,0.000353902,0.001277595,0.0001832236],"domain_scores_gemma":[0.994332,0.0009313441,0.000563208,0.002952043,0.000914913,0.0003064896],"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.001204757,0.000437659,0.004906815,0.001336176,0.0002028381,0.0007776379,0.001008423,0.09020073,0.04480313,0.174862,0.03845885,0.6418011],"study_design_scores_gemma":[0.0004532755,0.001657493,0.002623588,0.0001884524,0.0002311961,0.003035235,0.0006022492,0.5090449,0.07472391,0.1717935,0.235227,0.0004192545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01095988,0.0007951923,0.9805022,0.0004742205,0.0002103598,0.0003188263,0.001066509,0.003941944,0.001730955],"genre_scores_gemma":[0.2257495,0.0009660774,0.7610428,0.0003567396,0.0002808089,0.0006981476,0.005135622,0.0003939175,0.005376469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004356471,"threshold_uncertainty_score":0.01142091,"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."}}