{"id":"W2140740564","doi":"","title":"Multidimensional Orthogonal Range Search Using Tries.","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rectangle; Range (aeronautics); Competitive analysis; Set (abstract data type); Algorithm; Space (punctuation); Computer science; Range query (database); Online algorithm; Combinatorics; Search algorithm; Mathematics; Theoretical computer science; Search engine; Information retrieval; Upper and lower bounds; Web search query; Engineering; Geometry; 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.001586392,0.001109567,0.001743627,0.002623232,0.0008560471,0.002484276,0.002397858,0.001225389,0.003704616],"category_scores_gemma":[0.009683107,0.0007771331,0.001216068,0.005347056,0.0009597913,0.006029231,0.00551206,0.001042447,0.00326257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004903652,"about_ca_system_score_gemma":0.001400152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001185667,"about_ca_topic_score_gemma":0.001524129,"domain_scores_codex":[0.9968106,0.000888319,0.0003262449,0.0004962297,0.001189711,0.0002888674],"domain_scores_gemma":[0.995867,0.00164514,0.0005558839,0.001147294,0.0006275234,0.0001571682],"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.001362025,0.0003115856,0.007208404,0.001029253,0.0004087197,0.0004325236,0.0006738899,0.09917375,0.02617307,0.0862332,0.01966493,0.7573286],"study_design_scores_gemma":[0.0002419379,0.0005626256,0.000966527,0.0001270786,0.0001483341,0.0020609,0.000451878,0.8775091,0.033568,0.05649836,0.02773732,0.0001278253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0155378,0.001532065,0.9757529,0.0001761075,0.0000938331,0.000177474,0.0003885,0.002406699,0.003934532],"genre_scores_gemma":[0.1704664,0.0007778404,0.8240158,0.0001726441,0.00007460216,0.0004751484,0.001276163,0.0001794561,0.00256183],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003704616,"threshold_uncertainty_score":0.01239312,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06550581335891824,"score_gpt":0.2802458608807452,"score_spread":0.2147400475218269,"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."}}