{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001613756,0.0009924453,0.001551621,0.002822916,0.00128409,0.003198925,0.003792906,0.001016712,0.006203211],"category_scores_gemma":[0.01265934,0.0007874457,0.001154925,0.006255397,0.0008468594,0.006525756,0.003714889,0.001246998,0.007583357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007207144,"about_ca_system_score_gemma":0.002296029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003366045,"about_ca_topic_score_gemma":0.005067232,"domain_scores_codex":[0.9971364,0.0003696483,0.0003457306,0.0003829766,0.001549144,0.0002161413],"domain_scores_gemma":[0.9940464,0.001362457,0.0006444692,0.002106997,0.001460293,0.0003793066],"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.001098863,0.000363676,0.009013288,0.001415974,0.0002634542,0.0007126188,0.0009425234,0.03250574,0.02586425,0.05284618,0.2000419,0.6749315],"study_design_scores_gemma":[0.0004069878,0.0009047904,0.003038288,0.0003437292,0.0002152437,0.00225495,0.0006701486,0.4665394,0.04288729,0.08352508,0.3988748,0.0003393804],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02621627,0.003678311,0.8894525,0.0007350663,0.0004325937,0.000573933,0.009182031,0.0553362,0.01439306],"genre_scores_gemma":[0.09495384,0.001940004,0.8690881,0.0004805092,0.0001744549,0.0004797393,0.02175627,0.004187185,0.006939925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006203211,"threshold_uncertainty_score":0.02075177,"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."}}