{"id":"W4398864","doi":"10.1016/0006-2952(71)90175-4","title":"Searching through spatial relationships using the 2DR-tree.","year":2006,"lang":"en","type":"article","venue":"IMSA","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Optimal binary search tree; Tree (set theory); Computer science; Binary search tree; Ternary search tree; Binary tree; Data mining; Random binary tree; Spatial analysis; Curse of dimensionality; Binary data; Tree traversal; Space partitioning; Binary number; Artificial intelligence; Interval tree; Mathematics; Tree structure; Algorithm; Statistics","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.001740627,0.0005543127,0.001094577,0.003354231,0.0009724286,0.002673859,0.001822442,0.00112383,0.004984225],"category_scores_gemma":[0.01303789,0.0004824671,0.0008549751,0.00529877,0.0008014441,0.00552996,0.00303425,0.0006979084,0.002606747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005283542,"about_ca_system_score_gemma":0.001836618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003122264,"about_ca_topic_score_gemma":0.005869847,"domain_scores_codex":[0.9977356,0.0006951636,0.000234438,0.0003803287,0.0008238598,0.000130544],"domain_scores_gemma":[0.995103,0.002280153,0.0004896153,0.001158452,0.0007962329,0.0001725892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000416626,0.0002634331,0.00500687,0.001001952,0.0002156292,0.0004171876,0.001185785,0.03312429,0.01870268,0.07063041,0.02043564,0.8485995],"study_design_scores_gemma":[0.0001610016,0.0004215473,0.00236647,0.0002782735,0.0001639974,0.002718037,0.0007274913,0.7585548,0.02498965,0.1308457,0.07861699,0.0001559967],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009018634,0.0008302724,0.9852084,0.0001829143,0.00003625118,0.0001544275,0.0005217749,0.001830075,0.002217197],"genre_scores_gemma":[0.06145988,0.0004452406,0.9351826,0.0001163857,0.00002697824,0.0001559295,0.00106052,0.000120038,0.001432523],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004984225,"threshold_uncertainty_score":0.01667392,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.064313225270257,"score_gpt":0.2842151916977682,"score_spread":0.2199019664275111,"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."}}