{"id":"W2035937973","doi":"10.1016/j.jpdc.2011.04.003","title":"HD Tree: A novel data structure to support multi-dimensional range query for P2P networks","year":2011,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Static routing; Range query (database); Routing (electronic design automation); Dynamic Source Routing; Multipath routing; Tree (set theory); Destination-Sequenced Distance Vector routing; Computer network; Routing protocol; Web search query; Mathematics; 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.001112637,0.0006081513,0.001383464,0.001967515,0.001232373,0.002159247,0.003029505,0.001046025,0.004611629],"category_scores_gemma":[0.00444683,0.0005575056,0.0005661036,0.003479039,0.0007108357,0.004692959,0.003617086,0.001247156,0.001880675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000798429,"about_ca_system_score_gemma":0.001443834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004119081,"about_ca_topic_score_gemma":0.004994959,"domain_scores_codex":[0.9988978,0.0001370983,0.0001365105,0.0001421362,0.0005786457,0.0001078561],"domain_scores_gemma":[0.9973428,0.0006397686,0.0001804888,0.00100497,0.0005764067,0.0002556654],"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.001799436,0.0004451182,0.004716108,0.001364766,0.0003008769,0.0005652967,0.0009026251,0.03759218,0.04716906,0.07137518,0.1936735,0.6400959],"study_design_scores_gemma":[0.000586061,0.0006575777,0.002734459,0.0001662336,0.0002916795,0.001224666,0.0005462546,0.6017909,0.04875086,0.08645501,0.2564611,0.0003352626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02248891,0.002420977,0.9335157,0.0009145701,0.0006595243,0.0003757338,0.005781556,0.02746128,0.006381867],"genre_scores_gemma":[0.2948729,0.002252372,0.6670195,0.0009901007,0.0006677198,0.0006630007,0.01899388,0.002390164,0.01215041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004611629,"threshold_uncertainty_score":0.01542747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09141247208430599,"score_gpt":0.2974670884671627,"score_spread":0.2060546163828568,"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."}}