Skip to main content

OASSIS-UDC: HACIA ORGANIZACIONES SOFTWARE MAS SOSTENIBLES: UN ENFOQUE HOLISTICO PARA PROMOVER LA SOSTENIBILIDAD ECONOMICA, HUMANA Y MEDIOAMBIENTAL

PID2021-122554OB-C33

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2021
State Plan 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDADE DA CORUÑA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 10
Encontrada(s) 1 página(s)

RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Uncharted dimensions, gaps, and future trends of serious games in software engineering

  • Kharbouch, Manal
  • Vizcaíno, Aurora
  • García-Berná, José Alberto
  • García, Félix
  • Toval, Ambrosio
  • Pedreira, Óscar
  • Idri, Ali
  • Fernández-Alemán, José Luis
[Abstract]: Objective: Serious Games (SG) are a rising trend in Software Engineering (SE) education, for this reason, and since this topic is still immature and further research was encouraged, it is important to investigate how SGs are integrated into SE education. In this line, this study explores the landscape of SGs in SE) education, focusing on their categorization according to their addressed SWEBOK areas and Bloom's levels, extracted their key elements, mechanics and dynamics, exploring in depth their most portrayed player profiles, finding what makes them successful SGs in this field, and last addressing their resulting challenges in the realm of SE education. Methodology: A systematic search was conducted across prominent databases: Science Direct, IEEE Xplore, ACM, Scopus, and Wiley. Initially, 125 papers met our initial inclusion criteria, from which 46 remained after rigorous full-text review. Utilizing snowball sampling, we added 28 additional studies, resulting in a total of 74 selected papers for comprehensive analysis. Results: Among the selected papers, which spanned from the early 2000s to May 2021, a notable increase in publications on SGs in SE was observed, particularly since 2010. The majority of these studies focused on validation research (60 %), followed by solution proposals (17.56 %) and evaluation research (13.51 %). Publication channels predominantly included conferences (79.73 %), underscoring the emerging nature of SGs in SE research, with a smaller proportion appearing in journal articles (20.27 %). Specific focus areas within SE, such as Software Engineering Management (33.78 %) and SE Professional Practice (13.51 %), received significant attention, while others, like SE Models and Methods, showed minimal representation. Furthermore, SGs were found to effectively target higher-order cognitive skills based on Bloom's Taxonomy, with notable implementations of game dynamics such as Teams and Realism to enhance learning experiences. Despite these advancements, there remains a predominant focus on player profiles like Achievers (48.64 %) and Players (47.30 %), suggesting potential gaps in addressing a broader spectrum of learner types within SGs designed for SE education. Conclusion; This study underscores the evolving role of SGs in SE education, emphasizing the need for diverse approaches to enhance engagement and educational outcomes. Future research should focus on optimizing SG potential across educational and industrial settings by expanding publication visibility, integrating artificial intelligence (AI), and conducting comprehensive evaluations of SGs tailored to SE contexts., This research is part of the OASSIS-UMU (PID2021-122554OB-C32) project, OASSIS-UCLM (PID2021-122554OB-C31) project, OASSIS-UDC (PID2021-122554OB-C33) project (supported by the Spanish Ministry of Science and Innovation), and the Network of Excellence in Software Quality and Sustainability (RED2022-134656-T). These projects are also funded by the European Regional Development Fund (ERDF).
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

A novel architecture for the detection, exploitation and historical archival of indoor semantic trajectories: A case study on nursing homes

  • Varela Rodeiro, Tirso
  • Gutiérrez-Asorey, Pablo
  • Brisaboa, Nieves R.
  • Penabad, Miguel R.
  • Cortiñas, Alejandro
This author accepted manuscript is deposited under a Creative Commons Attribution Noncommercial 4.0 International (CC BY-NC) licence. This means that anyone may distribute, adapt, and build upon the work for non-commercial purposes, subject to full attribution. If you wish to use this manuscript for commercial purposes, please contact permissions@emerald.com., [Abstract]: We introduce an automatic system, based on indoor positioning techniques, aimed at improving the quality of service of a nursing home. It tracks the location of both residents and caregivers and automatically detects the activities taking place. The system presents a hybrid approach for storing large amounts of data, using both a traditional relational database and an ad-hoc compact data structure, enabling compact storage of the information without compromising fast random access. Our proposal is complemented by a graphical user interface that can dynamically display collected trajectories within the facilities. Having access to all this information, our system will be able to evaluate the quality of health care offered to their residents, as well as assess the efficiency of the nursing home as a business., CITIC, as a center accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is cofinanced by the EU through the FEDER Galicia 2021-27 operational program (Ref. ED431G 2023/01); and by FEDER Galicia 2014-2020 80%, SXU 20% [CSI: ED431G 2019/01]; MCIN/AEI/10.13039/501100011033 ([EXTRA-Compact: PID2020-114635RB-I00]; “NextGenerationEU” /PRTR [SIGTRANS: PDC2021-120917-C21], [PLAGEMIS: TED2021-129245B-C21], [FLATCITY: PDC2021-121239-C31]; EU/ERDF A way of making Europe [OASSIS-UDC: PID2021-122554OB-C3], [EarthDL: PID2022-141027NB-C21]); by GAIN/Xunta de Galicia [GRC: ED431C 2021/53]; by UE FEDER [0079 ATEMPO 6 E],[0064 GRESINT 1 E]., Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

SPL-DB-Sync: Seamless database transformation during feature-driven changes

  • Ramos-Vidal, Delfina
  • Assunção, Wesley K.G.
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
  • Saavedra Places, Ángeles
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: Software Product Line (SPL) Engineering is a reuse-oriented approach to developing a suite of software products that share common components but vary in specific features. The advantages of SPLs (e.g., reducing development costs and time while improving quality) have already been proven in practice. However, despite the success in deriving new products from an SPL, challenges arise in evolving existing products. Altering the feature selection (e.g., adding or removing a feature) for an already existing product poses a challenge regarding the application data stored and managed by derived products, particularly when the features impact an already populated database. In many cases, these modifications imply loss of data or constraint violations. However, in both the state of the art and practice, there are no approaches to support feature and data evolution simultaneously for SPL products. This paper reports a novel evolution approach, SPL-DB-Sync, with actions required for database adjustments when adding or removing features for existing SPL products. Actions delineate modifications necessary within the database. These modifications are associated with the SPL features and linked to the components of the data model they influence. SPL-DB-Sync facilitates the automatic readjustment of the database while preserving clear traceability between features and elements of the data model. The applicability of our evolution model is detailed in four practical scenarios of in-production products of an SPL for Digital Libraries. The contributions of this work are: present a novel evolution approach for SPLs with databases; define an SPL Evolution Model considering data transformation/migration; advance the state of practice between software reuse and data management; and provide insights for practitioners that face the same challenges of evolving both business logic and its data in software products., CITIC is funded by the Xunta de Galicia, Spain through the collaboration agreement between the Department of Culture, Education, Vocational Training and Universities and the Galician universities for the reinforcement of the research centers of the Galician University System (CIGUS); GRC: ED431C 2021/53, partially funded by GAIN/Xunta de Galicia; TED2021-129245B-C21 (PLAGEMIS): partially funded by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR; PID2021-122554OB-C33 (OASSIS): partially funded by MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe; PID2022-141027NB-C21 (EarthDL): partially funded by MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe; PID2020-114635RB-I00 (EXTRACompact): partially funded by MCIN/ AEI/10.13039/501100011033 ; PRE2021-099351, partially funded by MCIN/AEI/10.13039/501100011033 and “FSE+”Fondo Social Europeo Plus” . Funding for open access charge: Universidade da Coruña/CISUG.
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Space/time-efficient RDF stores based on circular suffix sorting

  • Brisaboa, Nieves R.
  • Cerdeira-Pena, Ana
  • Bernardo, Guillermo de
  • Fariña, Antonio
  • Navarro, Gonzalo
This version of the article has been accepted for publication, after peer review and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s11227-022-04890-w, [Abstract]: The resource description framework (RDF) has gained popularity as a format for the standardized publication and exchange of information in the Web of Data. In this paper, we introduce RDFCSA, a compressed representation of RDF datasets that in addition supports efficient querying. RDFCSA regards the triples of the RDF store as short circular strings and applies suffix sorting on those strings, so that triple-pattern queries reduce to prefix searching on the string set. The RDF store is then represented compactly using a compressed suffix array (CSA), a proved technology in text indexing that efficiently supports prefix searches. Our experiments show that RDFCSA is competitive with state-of-the-art alternatives. It compresses the raw data to 60% of its size, close to the most compact alternatives. While most alternatives perform better in some kinds of triple-patterns than in others, RDFCSA features fast and consistent query times, a few microseconds per result in all cases. This enables efficiently supporting join queries by using either merge- or chaining-join strategies over the triple patterns coupled with some specific optimizations such as variable filling. Our experiments on binary joins show that RDFCSA is faster than the alternatives in most cases., Funding for the Spanish group: projects funded by MCIN/ AEI/10.13039/501100011033: PDC2021-121239-C31 (FLATCITY-POC)-“NextGenerationEU”/PRTR; PDC2021-120917-C21 (SIGTRANS)-“NextGenerationEU”/PRTR; PID2020-114635RB-I00 (EXTRACompact); PID2019-105221RB-C41 (MAGIST); PID2021-122554OB-C33 (OASSIS-UDC); and TED2021-129245B-C21 (PLAGEMIS-UDC); grant ED431C 2021/53 (GRC) funded by GAIN/Xunta de Galicia; and grant ED431G 2019/01 (CSI) funded by Xunta de Galicia, FEDER Galicia 2014-2020 80%, SXU 20%; Gonzalo Navarro is partially funded by Fondecyt 1-200038, and by ANID - Millennium Science Initiative Program - Code ICN17 002., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED431G 2019/01, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1-200038., Chile. Agencia National de Investigación y Desarrollo; ICN17_002
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

k2-MS: A Compact Data Structure for Raster Datasets

  • Saavedra, Miguel
  • Gutiérrez, Gilberto
  • Bernardo, Guillermo de
This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s10707-026-00578-y The data that support the findings of this study are available in WorldClim at https://www.worldclim.org/data/worldclim21.html. These data were derived from the following resource available in the public domain: WorldClim - Global Climate Data (Version 2.1)., [Abstract]: In this work, we present the compact data structure k2-MS for the representation of raster coverages. k2-MS is based on a sequence of binary matrices (each represented by a k2-tree), which correspond to the binary encoding of the thematic variable values of the raster. The properties of the k2-MS data structure allow it to benefit from the processor instructions PDEP and PEXT, significantly reducing the access time to the structure. Through a series of experiments on different datasets, we evaluated the performance of our structure by comparing it with the k2-raster, one of the most competitive structures reported in the literature. On average, when comparing the best configurations of both approaches, k2-MS is 48% faster for Window queries and 43% faster for Window Range queries, while requiring about 63% of the storage space used by the k2-raster., This work was funded by the FONDECYT Regular project 1230647. Guillermo de Bernardo was partially funded by GAIN/Xunta de Galicia (ref. ED431C 2025/34), GAIN and MRR funds. PRTR, (C17.I1), European Union through the Interreg Spain-Portugal / POCTEP (refs. 0079_ATEMPO_6_E and 0064_GRESINT_1_E), MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe (ref. PID2021-122554OB-C33) and MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR (ref. TED2021-129245B-C21). CITIC, as a center accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-financed by the EU through the FEDER Galicia 2021-27 operational program (ref. ED431G 2023/01). The APC was funded by FONDECYT Regular project 1230647., Chile. Fondo Nacional de Desarrollo Científico y Tecnológico; 1230647, Xunta de Galicia; ED431C 2025/34, Xunta de Galicia; ED431G 2023/01, Interreg España-Portugal; 0079_ATEMPO_6_E, Interreg España-Portugal; 0064_GRESINT_1_E
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Local Features: Enhancing Variability Modeling in Software Product Lines

  • Castro, David de
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
  • Saavedra Places, Ángeles
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract] Context and motivation: Software Product Lines (SPL) enable the creation of software product families with shared core components using feature models to model variability. Choosing features from a feature model to generate a product may not be sufficient in certain situations because the application engineer may need to be able to decide on configuration time the system’s elements to which a certain feature will be applied. Therefore, there is a need to select which features have to be included in the product but also to which of its elements they have to be applied. Objective: We introduce local features that are selectively applied to specific parts of the system during product configuration. Results: We formalize local features using multimodels to establish relationships between local features and other elements of the system models. The paper includes examples illustrating the motivation for local features, a formal definition, and a domain-specific language for specification and implementation. Finally, we present a case study in a real scenario that shows how the concept of local features allowed us to define the variability of a complex system. The examples and the application case show that the proposal achieves higher customization levels at the application engineering phase., This work has been partially funded by the following grants: 0064_GRESINT_1_E partially funded by EU through the Interreg Spain- Portugal/POCTEP; PID2022-141027NB-C21 (EarthDL): partially funded by MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe; PID2021-122554OB-C33 (OASSIS): partially funded by MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe; GRC: ED431C 2021/53, partially funded by GAIN/Xunta de Galicia; CITIC is funded by the Xunta de Galicia through the collaboration agreement between the Department of Culture, Education, Vocational Training and Universities and the Galician universities for the reinforcement of the research centers of the Galician University System (CIGUS)., Xunta de Galicia; ED431C 2021/53, España-Portugal. Programa Interreg VA España-Portugal (POCTEP); 0064_GRESINT_1_E
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Onto how compression yields energy-efficient text search

  • Fariña, Antonio
  • Poy, Olivia
  • Brisaboa, Nieves R.
  • Calero, Coral
  • Moraga, Mª Ángeles
  • Pedreira, Óscar
[Abstract]: In the last two decades, word-based text compression has shown to be the key to efficiently handling large collections of text not only due to yielding important storage savings but, more importantly, because it allowed boosting the performance of some traditional text retrieval systems. The reason is that when the appropriate compression techniques are chosen, compressed text search becomes much faster than searches on plain text, and retrieval/decompression could start at any part of the compressed data, hence allowing to keep the text collection compressed all the time. Word-based text compressors have been typically compared in terms of their compression effectiveness, encoding/decoding speed, and performance when searching for words. In this paper, we show that compression also has benefits in terms of energy efficiency when performing word-based searches. Particularly, our experiments considering searches performed over uncompressed text and text compressed with the most well-suited compressors for text databases showed energy savings of around 30–70%. These savings are obtained thanks to improvements in search time but also, rather unexpectedly, because compressed text searches typically require less power from the processor. We have also analyzed how small modifications to the Horspool search algorithm can lead to time savings and can reduce even further the power needs of the processor (up to 5–10%), and, consequently, the overall energy consumption., This work was partially funded by MCIN/AEI/10.13039/501100011033 and EU/ ERDF: grant PID2021-122554OB-C33 (OASSIS); by MCIN/AEI/ 10.13039/501100011033 and European Union NextGenerationEU/PRTR: grant TED2021-129245B-C21 (PLAGEMIS). Funding Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. The group from Castilla - La Mancha is funded in part by CECD (JCCM) and FEDER funds: grant SBPLY/21/180501/000115 (EMMA). The group from A Coruña is also funded in part by MCIN/ AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR: grants PDC2021-121239-C31 (FLATCITY-POC), PDC2021-120917-C21 (SIGTRANS), and PID2020-114635RB-I00 (EXTRA-Compact); by GAIN/Xunta de Galicia: grant GRC: ED431C 2021/53; by UE, (ERDF), GAIN, Convocatoria Conecta COVID: grant IN852D 2021/3 (CO3)., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IN852D 2021/3, Junta Castilla-La Mancha; SBPLY/21/180501/000115
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

New compressed indices for multijoins on graph databases

  • Arroyuelo, Diego
  • Barisione, Fabrizio
  • Fariña, Antonio
  • Gómez-Brandón, Adrián
  • Navarro Badino, Gonzalo
Funding for open access charge: Universidade da Coruña/CISUG ., [Abstract] A recent surprising result in the implementation of worst-case-optimal (WCO) multijoins in graph databases (specifically, basic graph patterns) is that they can be supported on graph representations that take even less space than a plain representation, and orders of magnitude less space than classical indices, while offering comparable performance. In this paper we uncover a wide set of new WCO space–time tradeoffs: we (1) introduce new compact indices that handle multijoins in WCO time, and (2) combine them with new query resolution strategies that offer better times in practice. As a result, we improve the average query times of current compact representations by a factor of up to 13 to produce the first 1000 results, and using twice their space, reduce their total average query time by a factor of 2. Our experiments suggest that there is more room for improvement in terms of generating better query plans for multijoins., Acknowledgments Supported by ANID – Millennium Science Initiative Program – Code ICN17_002, Chile. Antonio Fariña and Adrián Gómez-Brandón are funded in part by MCIN/AEI/10.13039/501100011033 and EU/ERDF “A way of making Europe”: grants PID2021-122554OB-C33 (OASSIS) and PID2022-141027NB-C21 (EARTHDL); by MCIN/AEI/10.13039/501 100011033 and “NextGenerationEU”/ PRTR: grant TED2021- 129245B-C21 (PLAGEMIS); and by GAIN/Xunta de Galicia: GRC: grant ED431C 2025/34. CITIC is funded by the Xunta de Galicia and co-financed by the EU through FEDER Galicia: grant ED431G 2023/01. Gonzalo Navarro is funded in part by Fondecyt Grant 1-230755, Chile. Funding for open access charge: Universidade da Coruña/CISUG ., Xunta de Galicia; ED431C 2025/34, Xunta de Galicia; ED431G 2023/01, Chile; ICN17_002, Chile; 1-230755
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Classic Distance Join Queries Using Compact Data Structures

  • Bernardo, Guillermo de
  • Penabad, Miguel R.
  • Corral, Antonio
  • Brisaboa, Nieves R.
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract] Distance-based Join Queries (DJQs) have multiple applications in spatial databases, Geographic Information Systems, and other areas. The 𝐾 Closest Pairs Query (𝐾CPQ) and the 𝜀 Distance Join Query (𝜀DJQ) are well-known DJQs that have been widely studied and can be solved using plane-sweep techniques, which are efficient but must keep the whole datasets in main memory. In this work, we propose DJQ algorithms that work with data represented using a 𝑘2-tree, a compact data structure for binary grids. Our algorithms solve 𝐾CPQ and 𝜀DJQ queries, as well as several window-constrained variants, taking advantage of the indexing capabilities of 𝑘2-trees to efficiently answer queries without the need to decompress the data. Our experimental evaluation with large datasets shows that 𝑘2-tree algorithms are up to 5 times faster than plane-sweep algorithms in 𝐾CPQ, and 5–30 times faster in 𝜀DJQ. In variants that are window-constrained, our algorithms are competitive in most scenarios and faster for large windows. Additionally, our algorithms are not very affected by the distribution of the data and yield much more predictable query times, showing up to 30 times smaller variance in query times than plane sweep, depending on the location of the query window., Guillermo de Bernardo, Miguel R. Penabad and Nieves R. Brisaboa are partially funded by MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe [PID2021-122554OB-C33 (OASSIS)]; by MCIN/AEI/10.13039/501100011033 [PID2020-114635RB-I00 (EXTRACompact), PID2019-105221RB-C41 (MAGIST)]; by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR [TED2021-129245B-C21 (PLAGEMIS), PDC2021-121239-C31 (FLATCITY-POC), PDC2021-120917-C21 (SIGTRANS)]; and by GAIN/Xunta de Galicia [ED431C 2021/53]. CITIC is funded by the Xunta de Galicia through the collaboration agreement between the Department of Culture, Education, Vocational Training and Universities and the Galician universities for the reinforcement of the research centers of the Galician University System (CIGUS) [ED431G 2019/01 (CSI)]. The work by Antonio Corral was partially funded by the EU ERDF and the Andalusian Government (Spain) under the project UrbanITA (ref. PY20_00809) and grant PID2021-124124OB-I00 funded by the Spanish Government MCIN/AEI/10.13039/501100011033 and the “ERDF A way of making Europe”. Funding for open access charge: Universidade da Coruña/CISUG., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

K Nearest Neighbor Join Algorithms for Spatial Data Using Compact and Plain Data Structures in Main Memory

  • Bernardo, Guillermo de
  • Rodríguez Penabad, Miguel
  • Corral, Antonio
  • Vassilakopoulos, Michael
  • Brisaboa, Nieves R.
Financiado para publicación en acceso aberto: CRUE-CSIC/Springer Nature Data sets used in the experimental evaluation of this work are available at https://doi.org/10.5281/zenodo.17544411, [Abstract] The K Nearest Neighbors Query (KNNQ) is a fundamental distance-based query with applications in Geographic Information Systems (GIS) and many other domains. The K Nearest Neighbors Join Query (KNNJQ) combines KNNQ with the join operation to find the K nearest neighbors from a dataset P to every object in another dataset Q. Due to the large number of distance computations involved, KNNJQ is an expensive operation that poses a challenge for in-memory systems. In this paper, we propose and evaluate novel in-memory algorithms for KNNQ and KNNJQ using the compact data structure k2-tree. The proposed algorithms exploit hierarchical spatial decomposition together with grouping, pre-processing and progressive pruning techniques. In addition, we develop two new plane-sweep algorithms for KNNQ and KNNJQ, that improve the brute-force algorithms by reducing redundant computations. We conduct an extensive experimental evaluation using real-world spatial datasets to evaluate the performance of our KNNQ and KNNJQ algorithms, comparing them with KD-tree and R*-tree based algorithms. Our results highlight the efficiency of pruning techniques in k2-trees, which reduce distance computations and response time by up to an order of magnitude in KNNJQ, in comparison with the equivalent KD-tree, R*-tree and plane-sweep algorithms., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. Guillermo de Bernardo, Miguel R. Penabad and Nieves R. Brisaboa are partially funded by GAIN/Xunta de Galicia [ED431C 2025/34]; by MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe [PID2021-122554OB-C33 (OASSIS)]; by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR [PID2024-155657OB-C22 (AGRARD)]; by GAIN and MRR funds. PRTR, (C17.I1). Complementary Plans Biotechnology applied to Health; by European Union through the Interreg Spain-Portugal / POCTEP [0079_ATEMPO_6_E, 0064_GRESINT_1_E]; and by Spain’s INE (National Statistics Intitute). CITIC, as a center accredited for excellence within the Galician University System and a member of the CIGUS Network, receives subsidies from the Department of Education, Science, Universities, and Vocational Training of the Xunta de Galicia. Additionally, it is co-financed by the EU through the FEDER Galicia 2021-27 operational program (Ref. ED431G 2023/01). The work by Antonio Corral and Michael Vassilakopoulos was funded by MCIN/AEI/10.13039/501100011033 and “ERDF A way of making Europe” grant PID2021-124124OB-I00., Xunta de Galicia; ED431C 2025/34, Xunta de Galicia; ED431G 2023/01, Interreg España-Portugal; 0079_ATEMPO_6_E, Interreg España-Portugal; 0064_GRESINT_1_E, https://doi.org/10.5281/zenodo.17544411