Skip to main content

MODELADO, DESCUBRIMIENTO, EXPLORACION Y ANALISIS DE DATA LAKES MEDIOAMBIENTALES [UDC]

PID2022-141027NB-C21

•
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 2022
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): 21
Encontrada(s) 1 página(s)

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)

Improving the Multi-Class Classification of Non-Functional Requirements in Spanish: A Study of Dataset Balancing and Performance

  • Limaylla-Lunarejo, María-Isabel
  • Condori Fernandez, Nelly
  • Rodríguez Luaces, Miguel
  • Karras, O.
Context In recent years, the multi-class classification of non-functional requirements has seen improvements through the use of Machine Learning algorithms. However, challenges such as data scarcity and class imbalance persist, particularly for languages other than English, such as Spanish. Objective This study aims to analyze the performance metrics of Machine Learning algorithms for classifying non-functional requirements translated into and originally written in Spanish. It evaluates the effectiveness of dataset balancing techniques and conducts cross-dataset validation to assess the generalizability of the models. Method A dataset balancing process was conducted using a combination of oversampling and undersampling techniques. Six algorithms were trained in two experiments using a hyperparameter tuning process, employing two different datasets: PROMISE_exp_translated and the newly PROMISE_exp_balanced. The best-performing models were further tested on unseen data to evaluate their generalizability. Results Logistic Regression and Naive Bayes demonstrated superior performance on the translated dataset, achieving f1-scores of 82% and 81%, respectively. Although overall performance decreased on the balanced dataset, specific underrepresented classes such as Portability and Fault Tolerance benefited from the balancing process. Conclusion Shallow Machine Learning algorithms are effective for classifying Spanish non-functional requirements, particularly when addressing data imbalance. The study highlights the importance of dataset balancing in improving classification performance for specific classes and provides insights into the challenges of generalizing models across datasets., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This research was partially supported by the following grants: TED2021-129245B-C21 (PLAGEMIS), partially funded by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR; PID2022-141027NB-C21 (EarthDL), partially funded by MCIN/AEI/10.13039/501100011033 and the EU/ERDF, "A way of making Europe" (1st and 3rd authors); and ED431G2019/04 and ED431C2022/19, partially funded by the Galician Ministry of Culture, Education, Professional Training, and University (2nd author). Funding for open access charge: Universidade da Coruña/CISUG., Xunta de Galicia; ED431G2019/04, Xunta de Galicia; ED431C2022/19
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

LITHEUM. A web-based lighting and thermal urban model for city energy assessment

  • Rodríguez-Álvarez, Jorge
  • Rodríguez Luaces, Miguel
  • Varela Rodeiro, Tirso
  • Alvaredo López, Natalia
  • Lamas Sardiña, Víctor Juan
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: This study presents Litheum (LIghting and THErmal Urban Model), an online urban building energy modelling (UBEM) tool that integrates morphological sensitivity analysis with interactive scenario development. By leveraging Geographic Information Systems and open-source technologies, the model addresses the accessibility challenges of previous UBEM tools, offering an intuitive web-based application suitable for diverse users, from homeowners to planners and policymakers, without requiring prior energy modelling expertise. Litheum applies a novel algorithm to calculate solar obstruction, optimizing computational requirements while capturing the spatial and temporal dynamics of urban contexts, an area where data-driven models often fall short. The energy calculation methods follow the EN ISO 52016–1 standard, balancing precision, flexibility, and reproducibility for large-scale applications. Unlike detailed dynamic building simulation tools, Litheum is optimized for urban energy planning and policy development. Pilot studies in three Spanish cities—Pontevedra, A Coruña, and Madrid—demonstrated the model's adaptability across varying urban scales. Feedback informed enhancements, including a solar control mode functionality for warmer climates. The online platform's design enables seamless interaction and rapid deployment in diverse urban settings. Future efforts will focus on expanding the platform's deployment in additional cities, integrating artificial intelligence to infer key building characteristics, such as glazing ratios, to improve robustness and processing efficiency. Litheum exemplifies the potential of open-source UBEM tools to facilitate energy assessment, fostering widespread adoption and better informed planning decisions., The research reported in this article was funded by MCIN/ AEI/10.13039/501100011033/ and by “European Union NextGenerationEU/PRTR, with the Grant TED2021–130779A-I00 The CITIC Database Lab authors acknowledge the support by the 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); and by MCIN/ AEI/10.13039/501100011033 ([EXTRA-Compact: PID2020–114635RB-I00]; “NextGenerationEU”/PRTR [SIGTRANS: PDC2021–120917-C21], [PLAGEMIS: TED2021–129245B-C21]; EU/ERDF A way of making Europe [EarthDL: PID2022–141027NB-C21] partially funded by MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe); by GAIN/Xunta de Galicia [GRC: ED431C 2021/53]; by UE FEDER [0079_ATEMPO_6_E], [0064_GRESINT_1_E] and by INE [CIDMEFEO]. Jorge Rodríguez-Álvarez acknowledges the support of the Ministry for Digital Transformation and Civil Service and Next-GenerationEU/RRF under Grant TSI-100925–2023–1 to support the development of the model with AI techniques; and MCIN/ AEI/10.13039/501100011033/and by ERDF A way of making Europe for the assistance in the continuation of the project for the adaptation of the model to rural areas with the Grant PID2021‐123961OA‐I00. Funding for open access charge: Universidade da Coruña/CISUG.
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)

The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space

  • Arroyuelo, Diego
  • Gómez-Brandón, Adrián
  • Hogan, Aidan
  • Navarro, Gonzalo
  • Reutter, Juan
  • Rojas-Ledesma, Javiel
  • Soto, Adrián
© ACM 2024. This is the author's version of the work (accepted manuscript or postprint). It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in ACM Transactions on Database Systems, https://doi.org/10.1145/3644824, [Absctract]: We present an indexing scheme for triple-based graphs that supports join queries in worst-case optimal (wco) time within compact space. This scheme, called a ring, regards each triple as a cyclic string of length 3. Each rotation of the triples is lexicographically sorted and the values of the last attribute are stored as a column, so we obtain the order of the next column by stably re-sorting the triples by its attribute. We show that, by representing the columns with a compact data structure called a wavelet tree, this ordering enables forward and backward navigation between columns without needing pointers. These wavelet trees further support wco join algorithms and cardinality estimations for query planning. While traditional data structures such as B-Trees, tries, and so on, require 6 index orders to support all possible wco joins over triples, we can use one ring to index them all. This ring replaces the graph and uses only sublinear extra space, thus supporting wco joins in almost no space beyond storing the graph itself. Experiments querying a large graph (Wikidata) in memory show that the ring offers nearly the best overall query times while using only a small fraction of the space required by several state-of-the-art approaches. We then turn our attention to some theoretical results for indexing tables of arity d higher than 3 in such a way that supports wco joins. While a single ring of length d no longer suffices to cover all d! orders, we need much fewer rings to index them all: O(2d) rings with a small constant. For example, we need 5 rings instead of 120 orders for d=5. We show that our rings become a particular case of what we dub order graphs, whose nodes are attribute orders and where stably sorting by some attribute leads us from an order to another, thereby inducing an edge labeled by the attribute. The index is then the set of columns associated with the edges, and a set of rings is just one possible graph shape. We show that other shapes, like for example a single ring instead of several ones of length d, can lead us to even smaller indexes, and that other more general shapes are also possible. For example, we handle d=5 attributes within space equivalent to 4 rings., We thank Amine Mhedhbi for help with Graphflow and Daniela Campos for help with CompactLTJ. This work was supported by ANID – Millennium Science Initiative Program – Code ICN17_002. Gómez-Brandón was supported in part by MCIN/AEI/10.13039/5011000-11033: grants PID2020- 114635RB-I00; by MCIN/AEI/10.13039/501100011033 and EU/ERDF "A way of making Europe": PID2022-141027NB-C21; by MCIN/AEI/10.13039/501100011033 and “Next-GenerationEU”/ PRTR: grants TED2021-129245B-C21, PDC2021-120917-C21 and by GAIN/ Xunta de Galicia: GRC: grants ED431C 2021/53, and CIGUS 2023-2026. Hogan was supported by FONDECYT Grant No. 1221926. Navarro was supported by FONDECYT Grant No. 1230755. Reutter was supported by FONDECYT Grant No. 1221799., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; CIGUS 2023-2026, Chile. Agencia Nacional de Investigación y Desarrollo; ICN17_002, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1221926, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1230755, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1221799
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Estimating the compressibility of raster data

  • Muñoz, Martita
  • Fuentes Sepúlveda, José
  • Hernández, Cecilia
  • Seco, Diego
©2025 Elsevier B.V. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/bync-nd/4.0/. This version of the article has been accepted for publication in Information Systems. The Version of Record is available online at https://doi.org/10.1016/j.is.2025.102624, [Abstract]: The raster data model is widely used in Geographic Information Systems and image processing. The continuous growth of raster data volume poses significant challenges for storage and management. Compact representations of rasters have emerged as a critical solution to address this issue, leveraging data locality to achieve efficient compression. In this context, the research community has proposed compressibility measures aiming to estimate the compressibility of data. Some measures, initially proposed for sequences, have been extended to two- and three-dimensional matrices. This work conducts an experimental analysis of measures applied to raster data compressibility estimation. The first approach applies a linearization function on raster data with matrix representation and then uses existing one-dimensional compressibility measures. The evaluation of the approach compares 1D compressibility measures with 2D measures, data compressors, Compact Data Structures (CDSs), and spatial locality estimation techniques. The results show that spatial locality, alphabet size, and noise directly influence raster compressibility, having more impact over measures like z, v, and g, compressors (bzip, gzip) and a CDS called k2-raster. The second approach introduces δ∆, a 2D compressibility measure sensitive to differences within the alphabet values. Its purpose is to refine the estimation of raster compressibility. Results indicate that δ∆ is affected by the actual values and their frequencies, aligning with the outcomes of some specific compressors. This alignment underscores the suitability of δ∆ for compressibility estimation tasks closely related to those performed by such compressors., This work was supported by the Agencia Nacional de Investigación y Desarrollo (ANID), Chile [grant numbers 21200810, 11220545, 11240971]; the Centre for Biotechnology and Bioengineering [grant number AFB240001]; the ANID – Millennium Science Initiative Program [grant number ICN17_002]; and PID2022-141027NB-C21 (EarthDL), TED2021-129245B-C21 (PLAGEMIS). Partially funded by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR., Chile. Agencia National de Investigación y Desarrollo; 21200810, Chile. Agencia National de Investigación y Desarrollo; 11220545, Chile. Agencia National de Investigación y Desarrollo; 11240971, Centro de Biotecnología y Bioingeniería (Chile); AFB240001, Chile. Agencia National de Investigación y Desarrollo; ICN17_002
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

CompactLTJ: Space & Time Efficient Leapfrog Triejoin on Graph Databases

  • Arroyuelo, Diego
  • Campos, Daniela
  • Gómez-Brandón, Adrián
  • Linker, Yuval
  • Navarro, Gonzalo
  • Rojas, Carlos
  • Vrgoč, Domagoj
Financiado para publicación en acceso aberto: CRUE-CSIC, [Abstract]: Leapfrog Triejoin (LTJ) is arguably the most practical and popular worst-case-optimal (wco) algorithm for solving basic graph patterns in graph databases. Its main drawback is that it needs the database triples (subject, predicate, object) represented as paths in a trie, for each of the six orders of subject, predicate, and object. The resulting blowup in space makes most systems disregard LTJ or implement it only partially, which makes their corresponding algorithms non-wco. In this paper we show that, by using compact data structures, it is possible to build an index that at the same time matches the query time performance of the fastest classic wco index, and uses a fraction of the space of non-wco indices (which are much slower). Concretely, we make use of compact tree representations to store functional tries using one bit per trie edge, instead of one pointer, and further reduce the space by storing partial tries. Our most compact variant uses 5–6 times less space than classic wco implementations and 2–3 times less than classic non-wco systems. At solving queries, it is on par with the fastest classic wco system, and 30–40 times faster than non-wco systems. We further incorporate improved query resolution strategies into CompactLTJ variants, which makes it considerably faster than classic wco systems as well, on queries that do not output too many results. Finally, we show how CompactLTJ can incorporate dynamism without altering its performance, even under very demanding update regimes. We leave a public fully-functional implementation of CompactLTJ that can be directly used by practitioners., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. Supported by ANID – Millennium Science Initiative Program – Code ICN17_002, Chile. A.G. is funded in part by MCIN/AEI/10.13039/5011000-11033: grant PID2020-114635RB-I00 (EXTRACompact); by MCIN/AEI/10.130-39/501100011033 and “Next-GenerationEU”/PRTR: grant TED2021-129245B-C21 (PLAGEMIS); by MCIN/A-EI/10.13039/501100011033 and EU/ERDF “A way of making Europe”: PID2022-141027NB-C21 EARTHDL Xunta de Galicia, grant: ED431C 2025/34; and CITIC receives subsidies from Xunta de Galicia and FEDER Galicia (Ref. ED431G 2023/01). G.N. is funded in part by Fondecyt Grant 1-230755, Chile., Chile. Agencia National de Investigación y Desarrollo; ICN17_002, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1-230755, Xunta de Galicia; ED431C 2025/34, Xunta de Galicia; ED431G 2023/01
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Systematic Mapping of AI-Based Approaches for Requirements Prioritization

  • Limaylla-Lunarejo, María-Isabel
  • Condori Fernández, Nelly
  • Rodríguez Luaces, Miguel
[Abstract]: Context and Motivation: Requirements prioritization (RP) is a main concern of requirements engineering (RE). Traditional prioritization techniques, while effective, often involve manual effort and are time-consuming. In recent years, thanks to the advances in AI-based techniques and algorithms, several promising alternatives have emerged to optimize this process. Question: The main goal of this work is to review the current state of requirement prioritization, focusing on AI-based techniques and a classification scheme to provide a comprehensive overview. Additionally, we examine the criteria utilized by these AI-based techniques, as well as the datasets and evaluation metrics employed. For this purpose, we conducted a systematic mapping study (SMS) of studies published between 2011 and 2023. Results: Our analysis reveals a diverse range of AI-based techniques in use, with fuzzy logic being the most commonly applied. Moreover, most studies continue to depend on stakeholder input as a key criterion, limiting the potential for full automation of the prioritization process. Finally, there appears to be no standardized evaluation metric or dataset across the reviewed papers, focusing on the need for standardized approaches across studies. Contribution: This work provides a systematic categorization of current AI-based techniques used for automating RP. Additionally, it updates and expands existing reviews, offering a valuable resource for practitioners and nonspecialists., The study was funded by the MCIN/AEI and “NextGenerationEU”/PRTR TED2021-129245B-C21 (PLAGEMIS), MCIN/AEI and the EU/ERDF, “A way of making Europe” PID2022-141027NB-C21 (EarthDL), Galician Ministry of Culture, Education, Professional Training, and University (Grants ED431G2019/04, ED431C2022/19)., Xunta de Galicia; ED431G2019/04, Xunta de Galicia; ED431C2022/19
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Multilevel Representations of Multiple Geographical Objects

  • Gutiérrez-Asorey, Pablo
  • Brisaboa, Nieves R.
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Paramá, José R.
  • Varela Rodeiro, Tirso
[Abstract]: In this work, we explore different solutions for the problem of representing and querying geographical objects at different scales (zoom levels). In Geographic Information Systems (GIS), the maps we see when looking at the world at a planetary scale versus seeing the detailed coast of one province of a particular country are typically different, since GIS stores several maps, each with the appropriate level of detail for visualizing at a different scale. With the technique presented in this paper, it is possible to store and query the data of multiple geographical objects at different levels of scale, drastically reducing space consumption., This work was supported by the 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); and by Spain’s INE (National Statistics Institute); MICIU/AEI/10.13039/501100011033 EU/ERDF A way of making Europe: [OASSIS-UDC: ED431G 2023/01], [EarthDL: PID2022-141027NB-C21]); [AGRARD: PID2024-155657OB-C22]; by UE FEDER [0079_ATEMPO_6_E], [0064 _GRESINT_1_E]., Xunta de Galicia; ED431G 2023/01
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Low-code framework for IoT data warehousing and visualization

  • Lamas Sardiña, Víctor Juan
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
[Abstract]: networks. However, developing web-based data warehousing systems for IoT data remains costly and complex. While studies address sensor variability and data ingestion architectures, they often overlook the critical data warehouse component needed to manage IoT data volume and variability. Additionally, Model-Driven Engineering techniques have been used to create dashboards for urban activities but lack advanced map-based visualizations, which are essential for geospatial data. Objectives: This study aims to address the challenges of creating IoT data warehouses for geosciences, encouraging scientists to share sensor data analysis results using a simple, user-friendly, and cost-effective approach. Methods: The proposed framework integrates (i) a Domain-Specific Language metamodel to define sensors, dimensions, and measurement parameters, (ii) a Software Product Line for IoT data warehouse creation, and (iii) a low-code platform with command-line and web interfaces. The approach was validated through four case studies: meteorological, traffic and air quality, coastal, and oceanic monitoring systems. Results: The framework enables efficient IoT data warehouse creation with customized spatial, temporal, and attribute aggregation. Case studies demonstrate adaptability across domains, supporting real-time data ingestion, sensor mobility, and advanced visualization. Conclusion: The study presents a scalable, user-friendly framework for IoT data warehousing in geosciences using SPL and DSL technologies, addressing domain-specific challenges and empowering non-expert users. Future work includes usability assessments and expansion to other domains., 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); partially funded by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR: [PLAGEMIS: TED2021-129245B-C21]; partially funded by MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe: [EarthDL: PID2022-141027NB-C21]; partially funded by Galicia Marine Science programme, which is part of the Complementary Science Plans for Marine Science of Ministerio de Ciencia, Innovación Universidades included in the Recovery, Transformation and Resilience Plan (PRTR-C17.I1), funded through Xunta de Galicia with NextGenerationEU and the European Maritime Fisheries and Aquaculture Funds.
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

GIS-Publisher: Simplifying web-based GIS application development for enhanced data dissemination

  • Lamas Sardiña, Víctor Juan
  • Castro, David de
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
Permanent link to code/repository used for this code version: https://github.com/ElsevierSoftwareX/SOFTX-D-24-00402, Link to developer documentation/manual: https://github.com/lbdudc/gis-publisher#readme, [Abstract]: Geographic Information Systems (GIS) are complex systems that store, organize, process, and present geographically referenced data. Developing GIS requires specialized knowledge of algorithms, data structures, and geospatial concepts, along with the ability to implement scalable and efficient solutions for managing massive volumes of spatial data from various sources and providing user-friendly interfaces. This article introduces GIS-Publisher, a tool built using the Software Product Line (SPL) approach, which is a method of systematically creating a family of software products from shared core assets managing similarities and controlling variability. With GIS-Publisher, users without software development expertise can quickly and easily create web applications from directories containing shapefiles, a popular format for geographic data. The tool automates system deployment across various environments, including local computers, Secure Shell (SSH) remote servers, and Amazon Web Services (AWS) instances. Additionally, GIS-Publisher enables users to specify different styles using Styled Layer Descriptions (SLDs) for each shapefile, providing complete control over the visual representation of geographic data. This study details the features, benefits, and implementation of GIS-Publisher, demonstrating how it can accelerate GIS development and deployment., 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); partially funded by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR: [PLAGEMIS: TED2021-129245B-C21]; partially funded by MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe: [EarthDL: PID2022-141027NB-C21]; partially funded by GAIN/Xunta de Galicia : [GRC:ED431C 2021/53]., Xunta de Galicia; ED431C 2021/53
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)

Urbanformanalyzer: An Open-Source Workflow to Derive Orientation-Specific Building Envelope Attributes From Cadastral Data

  • García-González, Daniel
  • Rodríguez-Álvarez, Jorge
  • Rodríguez Luaces, Miguel
  • Ladra, Susana
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG The package containing the complete project, algorithm for extracting envelope descriptors for each building, and the use case for predicting glazed surfaces, is available for download at https://gitlab.lbd.udc.es/dgarcia/urbanformanalyzer., [Abstract] Detailed building-envelope information is essential for robust urban-scale energy performance analyses. However, national energy certificate databases in Spain and other countries often lack key attributes such as orientation-specific external perimeter measurements and glazing ratios. This paper introduces UrbanFormAnalyzer, an open-source Python library developed with QGIS, which automatically derives orientation-specific external perimeters and additional envelope descriptors from cadastral geometries. The workflow establishes a standard input structure to support integration with varied cadastral sources. As an example, we offer an adapter for the Spanish Cadastre that downloads and preprocesses their KML files, converting them into the required format. The spatial processing stage then calculates the perimeters by cardinal orientation, distinguishing exposed from adjacent walls. To illustrate a potential downstream application, the enhanced datasets are matched with national energy certificates to explore the estimation of orientation-specific glazing ratios, where such data are available. While predictive accuracy remains limited, the case study highlights how UrbanFormAnalyzer could support the creation of reproducible and harmonized building envelope data suitable for a range of analytical applications, including large-scale energy modeling, planning, and renovation assessment., This work was partially funded by Ministry for Digital Transformation and Civil Service and “NextGenerationEU”/PRTR under grant TSI-100925-2023-1. Moreover, 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). Furthermore, this work was supported by GRC: ED431C 2025/34, funded by GAIN/Xunta de Galicia, and PID2022-141027NB-C21 (EarthDL): partially funded by MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe. Funding for open access charge: Universidade da Coruña/CISUG., Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; ED431C 2025/34, https://gitlab.lbd.udc.es/dgarcia/urbanformanalyzer
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Space-Efficient Data Structures for the Inference of Subsumption and Disjointness Relations

  • Fuentes Sepúlveda, José
  • Gatica, Diego
  • Navarro, Gonzalo
  • Rodríguez, M. Andrea
  • Seco, Diego
The data that support the findings of this study are openly available in GBP at https://github.com/dgaticar., [Abstract]: Conventional database systems function as static data repositories, storing vast amounts of facts and offering efficient query processing capabilities. The sheer volume of data these systems store has a direct impact on their scalability, both in terms of storage space and query processing time. Deductive database systems, on the other hand, require far less storage space since they derive new knowledge by applying inference rules. The challenge is how to efficiently obtain the required derivations, compared to having them in explicit form. In this study, we concentrate on a set of predefined inference rules for subsumption and disjointness relations, including their negations. We use compact data structures to store the facts and provide algorithms to support each type of relation, minimizing even further the storage space requirements. Our experimental findings demonstrate the feasibility of this approach, which not only saves space but is often faster than a baseline that uses well-known graph traversal algorithms implemented on top of a traditional adjacency list representation to derive the relations., This work was funded by: ANID Millennium Science Initiative Program - Code ICN17_002; ANID Grant 77190038 and FONDECYT Grant 11220545 (1st author); PFCHA/Doctorado Nacional/2020-21201986 (2nd author); FONDECYT Grant1-230755 (3rd author); GRC: ED431C 2021/53, partially funded by GAIN/Xunta de Galicia; PID2022-141027NB-C21(EarthDL), TED2021-129245B-C21 (PLAGEMIS), PID2020-114635RB-I00 (EXTRACompact), PDC2021-121239-C31(FLATCity-POC), and PDC2021-120917-C21 (SIGTRANS): partially funded by MCIN/AEI/10.13039/501100011033 and“NextGenerationEU”/PRTR (5th author). CITIC is funded by the Xunta de Galicia through the collaboration agreementbetween the Department of Culture, Education, Vocational Training and Universities and the Galician Universities forthe reinforcement of the research centers of the Galician University System (CIGUS)., Chile. Agencia National de Investigación y Desarrollo; ICN17_002, Chile. Agencia National de Investigación y Desarrollo; 77190038, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico; 11220545, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico; 1-230755, Chile. Comisión Nacional de Investigación Científica y Tecnológica; 2020-21201986, Xunta de Galicia; ED431C2021/53
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Zombit: Exploiting Runs in Bitvectors

  • Gómez-Brandón, Adrián
The data that support the findings of this study are openly available in zombit-vector at https://github.com/adriangbrandon/zombit-vector. Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: Introduction: Bitvectors are a fundamental building block of many compact data structures. In this work, we propose a new compressed representation for bitvectors, named zombit-vector, which compresses bitvectors with 𝑘 runs by splitting the bitvector into fixed-length blocks and classifying them into three possible types depending on their content. Methods: It supports the typical operations over bitvectors in 𝑂(1) time, but select in 𝑂(log 𝑛) time. The total space required for this structure is 𝑂(√𝑘𝑛) + 𝑜(√𝑘𝑛) bits. In addition, we introduce an extension pzombit-vector where the blocks have variablelength. The variable-length partitioning adapts better to the distribution of the data, reducing space needs but requiring 𝑂(log 𝑛) time for all operations. Results: We include experiments on synthetic data and over two real-world scenarios. The synthetic scenario shows the competitiveness of our techniques against well-known state-of-the-art alternatives. That experiment confirms that pzombit-vector is able to use one-tenth of zombit-vector, but becomes 5 times slower. Our experiments with real applications demonstrate that the proposed techniques are practical and applicable in real-world scenarios., Funding: Ministerio de Ciencia e Innovación, Grant/Award Nos: PID2020-114635RB-I00; TED2021-129245B-C21; PID2022-141027NB-C21; Xunta de Galicia, Grant/Award No: ED431C 2025/34; and CITIC receives subsidies from Xunta de Galicia and FEDER Galicia (Ref. ED431G 2023/01). Funding for open access charge: Universidade da Coruña/CISUG., Xunta de Galicia; ED431C 2025/34, Xunta de Galicia; ED431G 2023/01
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

TRGST: An enhanced generalized suffix tree for topological relations between paths

  • Quijada Fuentes, Carlos
  • Rodríguez, M. Andrea
  • Seco, Diego
©2024 Elsevier B.V. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/ licenses/bync-nd/4.0/. This version of the article has been accepted for publication in Journal of Controlled Release. The Version of Record is available online at https://doi.org/10.1016/j.is.2024.102406, Versión aceptada, [Abstract]: This paper introduces the TRGST data structure, which is designed to handle queries related to topological relations between paths represented as sequences of stops in a network. As an example, these paths could correspond to stops on a public transport network, and a query of interest is to retrieve paths that share at least k consecutive stops. While topological relations among spatial objects have received extensive attention, the efficient processing of these relations in the context of trajectory paths, considering both time and space efficiency, remains a relatively less explored domain. Taking inspiration from pattern matching implementations, the TRGST data structure is constructed on the foundation of the Generalized Suffix Tree. Its purpose is to provide a compact representation of a set of paths and to efficiently handle topological relation queries by leveraging the pattern search capabilities inherent in this structure. The paper provides a detailed account of the structure and algorithms of TRGST, followed by a performance analysis utilizing both real and synthetic data. The results underscore the remarkable scalability of the TRGST in terms of both query time and space utilization., This work was funded by: ANID Millennium Science Initiative Program, Chile - Code ICN17_002 (1st and 2nd author); ANID, Chile PFCHA/Doctorado Nacional/21200101 (1st author); CYTED, Spain grant 519RT0579 (1st and 3rd author); Ministerio de Ciencia e Innovación, Spain (partially funded by MCIN/AEI/10.13039/501100011033 and \u201CNextGenerationEU\u201D/PRTR) PID2022-141027NB-C21 EarthDL, TED2021-129245B-C21 PLAGEMIS, PID2020-114635RB-I00 EXTRACompact, PDC2021-121239-C31 FLATCity-POC, PDC2021-120917-C21 SIGTRANS; and GAIN/Xunta de Galicia, Spain GRC: ED431C 2021/53 (3rd author)., Chile. Agencia Nacional de Investigación y Desarrollo; ICN17_002, Chile. Ministerio de Educación; 21201986, Chile. Agencia Nacional de Investigación y Desarrollo; 519RT0579, Xunta de Galicia; ED431C 2021/53
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Clustering-Based Compression for Raster Time Series

  • Muñoz, Martita
  • Fuentes Sepúlveda, José
  • Hernández, Cecilia
  • Navarro, Gonzalo
  • Seco, Diego
  • Silva-Coira, Fernando
Real world datasets, and scripts to generate the synthetic and semi-synthetic datasets are available at https://figshare.com/s/5ad53959f8eed8a83f83., [Abstract]: A raster time series is a sequence of independent rasters arranged chronologically covering the same geographical area. These are commonly used to depict the temporal evolution of represented variables. The T-k2-raster is a compact data structure that performs very well in practice for compact representations for raster time series. This structure classifies each raster as a snapshot or a log and encodes logs concerning their reference snapshots, which are the immediately preceding selected snapshots. An enhanced version of the T-k2-raster, called Heuristic T-k2-raster, incorporates a heuristic for automating the selection of snapshots. In this study, we investigate the optimality of the heuristic employed in Heuristic T-k2- raster by comparing it with a dynamic programming approach. Our experimental evaluation demonstrates that Heuristic T-k2-raster is a near-optimal solution, achieving compression performance almost identical to the dynamic programming method. These results indicate that variations of the structure that maintain the temporal order of the rasters are unlikely to significantly improve compression. Consequently, we explore an alternative approach based on clustering, where rasters are grouped according to their similarity, regardless of their temporal order. Our experimental evaluation reveals that this clustering-based strategy can enhance compression in scenarios characterized by cyclic behavior., This work was supported by the Agencia Nacional de Investigación y Desarrollo [21200810 to M.M. and FONDECYT grants 11220545 to J.F. and 1-230755 to G.N.]; the Centre for Biotechnology and Engineering [FB0001 to M.M., C.H., and G.N.]; the Agencia Nacional de Investigación y Desarrollo – Millennium Science Initiative Program [ICN17_002 to M.M., J.F., and G.N.]; and PID2022-141027NB-C21 (EarthDL), TED2021-129245B-C21 (PLAGEMIS), PID2020-114635RB-I00 (EXTRACompact), PDC2021-121239-C31 (FLATCITY-POC), and PDC2021-120917-C21 (SIGTRANS): partially funded by MCIN/AEI/10.13039/501100011033 and ’NextGenerationEU’/PRTR, GRC: ED431C 2021/53, partially funded by GAIN/Xunta de Galicia [D.S. and F.S.]. 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)., Chile. Agencia National de Investigación y Desarrollo; 21200810, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico; 11220545, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico; 1-230755, Chile. Centre for Biotechnology and Engineering; FB0001, Chile. Agencia National de Investigación y Desarrollo; ICN17_002, Xunta de Galicia; ED431C2021/53
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

DSL-Xpert 2.0: Enhancing LLM-driven code generation for domain-specific languages

  • Lamas Sardiña, Víctor Juan
  • García-González, Daniel
  • Sala, Luca
  • Rodríguez Luaces, Miguel
The tool is available to download at https://github.com/lbdudc/dsl-xpert, along with the user manual. Regarding the text-to-DSL experiments, the framework used is available at https://github.com/lucasala1997/text-to-DSL., [Abstract]: Context: Domain-specific languages (DSLs) are crucial for modeling specialized concepts and offer more fluency and efficiency compared to general-purpose languages. However, their adoption is often slowed by steep learning curves, limited tools, and complex implementations. While large language models (LLMs) have the ability to generate DSL code from natural language, their effectiveness in niche areas is limited due to insufficient training on specific DSL definitions. Objectives: This paper introduces DSL-Xpert 2.0, a tool designed to overcome these challenges by utilizing LLMs to generate DSL code with ease. Methods: By integrating grammar prompting and few-shot learning, the tool effectively handles proprietary DSLs. Additionally, advanced features such as automatic grammar validation, input/output correction, and integration with platforms like OpenAI, HuggingFace, and WebLLM ensure robust and reliable results. These features also simplify workflows for both novice and expert users. The paper further demonstrates the tool's practical value with a running example that illustrates its workflow and includes a complementary user survey conducted across various DSLs of differing complexity. This survey, based on the Technology Acceptance Model (TAM), helps assess the tool’s impact on reducing the DSL learning curve. Results: DSL-Xpert 2.0’s user-friendly and flexible design supports a broad range of DSLs with minimal configuration. Its intuitive interface allows developers to focus on problem-solving, rather than technical issues. User survey results indicate that DSL-Xpert 2.0 significantly reduces the learning effort needed to work with DSLs, and it is perceived as both useful and easy to use. The paper also includes a detailed performance analysis across various LLMs, demonstrating the tool's adaptability and effectiveness. Conclusion: By simplifying DSL development and lowering the barriers to entry, DSL-Xpert 2.0 accelerates the adoption and innovation of DSLs, making it a valuable resource for domain-specific projects., Funding for open access charge: Universidade da Coruña/CISUG. CITIC, as a center accredited for excellence within the Galician University System and a member of the CIGUS Network, has been partially funded by GAIN/Xunta de Galicia: [ED431G 2023/01]; the authors have been partially funded by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR: [PLAGEMIS: TED2021-129245B-C21]; and MCIN/AEI/ 10.13039/501100011033 and EU/ERDF A way of making Europe: [EarthDL: PID2022-141027NB-C21]. GRC: ED431C 2025/34, partially funded by GAIN/Xunta de Galicia., Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; Xunta de Galicia, https://github.com/lbdudc/dsl-xpert, https://github.com/lucasala1997/text-to-DSL
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Stronger compact representations of object trajectories

  • Gómez-Brandón, Adrián
  • Navarro, Gonzalo
  • Paramá, José R.
  • Brisaboa, Nieves R.
  • Gagie, Travis
[Absctract]: GraCT and ContaCT were the first compressed data structures to represent object trajectories, demonstrating that it was possible to use orders of magnitude less space than classical indexes while staying competitive in query times. In this paper we considerably enhance their space, query capabilities, and time performance with three contributions. (1) We design and evaluate algorithms for more sophisticated nearest neighbor queries, finding the trajectories closest to a given trajectory or to a given point during a time interval. (2) We modify the data structure used to sample the spatial positions of the objects along time. This improves the performance on the classic spatio-temporal and the nearest neighbor queries, by orders of magnitude in some cases. (3) We introduce RelaCT, a tradeoff between the faster and larger ContaCT and the smaller and slower GraCT, offering a new relevant space-time tradeoff for large repetitive datasets of trajectories., For the A Coruña team: This work was supported by GAIN/Xunta de Galicia: GRC: grants ED431C 2021/53, and CIGUS 2023-2026; Ministerio de Ciencia e Innovación and EU/ERDF A way of making Europe under grant [PID2022-141027NB-C21];Ministerio de Ciencia e Innovación under grant [PID2020-114635RB-I00]; Ministerio de Ciencia e Innovación and Next-GenerationEU/PRTR under grants [TED2021-129245B-C21; PDC2021-120917-C21]; Gonzalo Navarro was funded by ANID – Millennium Science Initiative Program – Code ICN17_002 and by Fondecyt under grants [1-200038; 1-230755]. Travis Gagie was funded by Fondecyt under grant [1171058] and by NSERC Discovery under grant [RGPIN-07185-2020]., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; CIGUS 2023-2026, Chile. National Agency of Research and Development (ANID); ICN17_002, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1-200038, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1-230755, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1171058, Canada. Natural Science and Engineering Research Council (NSERC); RGPIN-07185-2020
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Automatic Criteria for Prioritizing Software Requirements in Spanish Projects

  • Limaylla-Lunarejo, María-Isabel
  • Condori Fernández, Nelly
  • Rodríguez Luaces, Miguel
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG The final version of the PrioReSpa dataset, including requirement descriptions, relevance label, F/NF classification, MoSCoW categorization, and Mandatory criteria, has been published on Zenodo. https://doi.org/10.5281/zenodo.15552978, [Abstract]: Requirements prioritization is a complex process for determining the implementation order of requirements based on business value, cost, time, and other factors. Despite the growing use of AI to automate prioritization, full automation remains limited because common criteria, such as stakeholder ranking, cost, and dependencies, still require human input. To mitigate this, we focus on criteria that can be obtained automatically. We identified three such criteria: (1) Functional/Non-Functional (F/NF) classification, based on requirement purpose using pre-trained models; (2) MoSCoW categorization, which uses linguistic patterns and keywords to assess necessity; and (3) a Mandatory criterion derived from the similarity requirements process. In this study, we investigate the prioritization of requirements written in Spanish using automated criteria and automating the process with the LambdaMART algorithm. Additionally, we introduce PrioReSpa, a dataset of 401 requirements collected from a GIS project based on a software product line, each labeled with an importance score and the three prioritization criteria. Our findings demonstrate the effectiveness of using automated criteria for requirements prioritization. Results show that F/NF classification is the most influential criterion, followed by MoSCoW, while the Mandatory criterion had no impact. We trained LambdaMART models using XGBRanker and LGBMRanker implementations, performing hyperparameter optimization with Optuna. Both rankers obtained comparable NDCG performance, with LightGBM slightly outperforming in ranking metrics and XGBoost providing faster training. These findings demonstrate the viability of using LambdaMART algorithm to generate initial ranked lists of requirements, particularly for the top 10–20 priorities, reducing stakeholder involvement in early stages., This research was partially supported by the following grants: “NextGenerationEU”/PRTR; PID2022-141027NB-C21 (EarthDL), partially funded by MCIN/AEI/ 10.13039/ 501100011033 and the EU/ERDF, “A way of making Europe´´ (1st and 3rd authors); and 101134894-HORIZON-CL6-2023-GOVERNANCE-01 funded by: European Union´s Horizon Europe research and innovation programme, and ED431G-2023/04 funded by the Xunta de Galicia - Conselleria de Educación, Ciencia, Universidades e Formación and the EU/ERDF (2nd author). Funding for open access charge: Universidade da Coruña/CISUG., Xunta de Galicia; ED431G-2023/04