{"id":"W2239313659","doi":"10.11575/prism/17658","title":"The 2DR-tree: a 2-dimensional spatial access method","year":2004,"lang":"en","type":"dissertation","venue":"PRISM (University of Calgary)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Node (physics); Algorithm; Computer science; Mathematics; Bounding overwatch; Tree (set theory); Partition (number theory); Time complexity; Binary number; Theoretical computer science; Combinatorics; Artificial intelligence","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.001641091,0.0007612254,0.001286842,0.0021703,0.001136531,0.003289243,0.002941836,0.001189778,0.00802186],"category_scores_gemma":[0.005369331,0.0007236901,0.001304085,0.003971766,0.0012041,0.006471174,0.003865787,0.001568504,0.00370215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008646576,"about_ca_system_score_gemma":0.002276626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003432983,"about_ca_topic_score_gemma":0.005222615,"domain_scores_codex":[0.9971379,0.0006013114,0.0002549877,0.0004284905,0.001380781,0.0001965777],"domain_scores_gemma":[0.9973067,0.00077134,0.0001756967,0.0009260658,0.0006749327,0.0001452188],"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.0002785364,0.0001283351,0.001561969,0.0005270044,0.000114848,0.0003187156,0.0008954243,0.01805924,0.01160077,0.1416767,0.06579239,0.759046],"study_design_scores_gemma":[0.0002199211,0.0002034823,0.001208726,0.0002120836,0.0001149737,0.001697388,0.0004189723,0.4260765,0.02609296,0.1579384,0.3855714,0.0002453079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002006929,0.0003483278,0.9902673,0.0001633762,0.00007411554,0.00008675568,0.0004137426,0.004033105,0.002606275],"genre_scores_gemma":[0.02810196,0.0004802776,0.9625306,0.0001993905,0.00007305734,0.000236367,0.001603046,0.001098924,0.005676357],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00802186,"threshold_uncertainty_score":0.0268358,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01211885645645039,"score_gpt":0.2474575217851173,"score_spread":0.2353386653286669,"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."}}