{"id":"W3193719172","doi":"10.1145/3468791.3468818","title":"NIR-Tree: A Non-Intersecting R-Tree","year":2021,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bounding overwatch; Computer science; Search engine indexing; Tree (set theory); Range query (database); R-tree; B-tree; Range (aeronautics); Point (geometry); Interval tree; K-ary tree; Database index; Segment tree; Range tree; Data mining; Data structure; Access method; Binary tree; Tree structure; Algorithm; Spatial database; Mathematics; Information retrieval; Database; Artificial intelligence; Combinatorics; Spatial analysis; Search engine; Statistics; Web search query; Sargable","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":[],"consensus_categories":[],"category_scores_codex":[0.0001358419,0.00008429009,0.00008714192,0.00005093387,0.00007116138,0.0003772646,0.0006827671,0.00001834119,0.000118296],"category_scores_gemma":[0.00002445741,0.00007590542,0.00005093191,0.0003804344,0.00001045329,0.0007398742,0.0009370297,0.00007005208,0.0003769328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001371229,"about_ca_system_score_gemma":0.00002903823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003062744,"about_ca_topic_score_gemma":0.00009474823,"domain_scores_codex":[0.9991372,0.000016831,0.0001199093,0.0003437062,0.0001641241,0.0002181792],"domain_scores_gemma":[0.9992828,0.00003041977,0.00002847816,0.0005629478,0.00004208137,0.0000532452],"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.000001116103,0.00009112732,0.0008656006,0.00001946091,0.00004602487,0.0003845592,0.0004001644,0.000005961008,0.001372693,0.04881506,0.07081272,0.8771855],"study_design_scores_gemma":[0.001768345,0.0001595777,0.01128694,0.00011639,0.00003230387,0.0001102355,0.001851421,0.6333952,0.04520246,0.007478212,0.297367,0.001231892],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001695604,0.00002265831,0.7520931,0.001356656,0.0005288989,0.0000404879,6.528297e-7,0.0001661149,0.2440958],"genre_scores_gemma":[0.4500715,0.00002110772,0.4512898,0.003174748,0.0003491277,0.00001295021,0.00002508473,0.00001730493,0.09503831],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8759536,"threshold_uncertainty_score":0.4844834,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01326175357077821,"score_gpt":0.2352353544712552,"score_spread":0.221973600900477,"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."}}