{"id":"W3149546047","doi":"10.1109/ideas.2007.4318110","title":"The LBF R-tree: Efficient Multidimensional Indexing with Graceful Degradation","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Search engine indexing; Computer science; Exploit; Range query (database); Tree (set theory); Curse of dimensionality; Data mining; R-tree; Data structure; Range (aeronautics); Theoretical computer science; Web search query; Information retrieval; Search engine; Artificial intelligence; Sargable; Mathematics; Spatial analysis; Spatial database","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.003274218,0.0009916084,0.001947542,0.002030286,0.001183625,0.002209032,0.004242891,0.001790831,0.001551162],"category_scores_gemma":[0.01169474,0.0006383768,0.0007376802,0.005169818,0.001409213,0.006511376,0.003077044,0.001484098,0.002270379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009228786,"about_ca_system_score_gemma":0.001477955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002881721,"about_ca_topic_score_gemma":0.002781051,"domain_scores_codex":[0.9973823,0.0005432899,0.0001869801,0.0002517734,0.001319573,0.0003159943],"domain_scores_gemma":[0.9926884,0.00177168,0.0006141998,0.00338511,0.001260795,0.0002799043],"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.001136228,0.0004186318,0.003612839,0.0005821705,0.0001349031,0.0005353024,0.0006491501,0.07676063,0.04883621,0.02391717,0.04245873,0.8009581],"study_design_scores_gemma":[0.0001790145,0.0007089531,0.001084118,0.0000660047,0.00008376976,0.001518499,0.0001932419,0.9100098,0.02817165,0.03431226,0.02351476,0.0001578547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03033757,0.003623633,0.9512881,0.0006631326,0.0001619789,0.0001725014,0.0003227034,0.01108522,0.002345016],"genre_scores_gemma":[0.300207,0.002171461,0.6891696,0.0005925212,0.0002855719,0.0003259101,0.001539233,0.0009667234,0.004741919],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004242891,"threshold_uncertainty_score":0.01731592,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009359691985560319,"score_gpt":0.2260400124968523,"score_spread":0.2166803205112919,"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."}}