Resumen: This work presents a new range searching algorithm for multidimensional databases. The proposed methodology is based on the idea of generating a navigation metadata structure, complementary to the database, that eases the navigation between the elements of the database. This metadata structure can be adapted to different problems and it is generated in a one time pre-procesing effort for each database. This work contains a complete description of the algorithm, including a study of its searching performance under different conditions compared with a brute force approach. Idioma: Inglés DOI: 10.1016/j.amc.2020.125510 Año: 2020 Publicado en: Applied Mathematics and Computation 386 (2020), 125510 [10 pp.] ISSN: 0096-3003 Factor impacto JCR: 4.091 (2020) Categ. JCR: MATHEMATICS, APPLIED rank: 7 / 265 = 0.026 (2020) - Q1 - T1 Factor impacto SCIMAGO: 0.971 - Computational Mathematics (Q1) - Applied Mathematics (Q1)