Pasar al contenido principal

Resultados relacionados

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

RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Indexación de colecciones musicales beneficiándose de la repetitividad

  • Romero-Velo, Hilda
  • Ladra, Susana
  • Paramá, José R.
  • Silva-Coira, Fernando
O congreso tivo lugar en Ciudad Real os días del 12 al 14 de septiembre de 2023, [Abstract]: Con el fin de poder realizar búsquedas por contenido en grandes colecciones de documentos musicales, se realiza un estudio de las últimas iniciativas y se proponen mejoras en eficiencia que explotan la repetitividad intrínseca a cada una de las obras. A diferencia de la búsqueda más común basada en audio, en este artículo se trabaja directamente con las características extraídas de las partituras representadas digitalmente siguiendo una propuesta publicada recientemente. En ella se indexan tales características utilizando el conocido motor de búsqueda Elasticsearch. Aquí presentamos una aproximación alternativa buscando optimizar el espacio utilizando dos técnicas de indexación comprimida de la familia Lempel–Ziv (LZ) centradas en el procesamiento de textos repetitivos. Tras el contraste de los resultados obtenidos frente a una selección de consultas, se constata una clara disminución en los espacios requeridos por nuestra aproximación sin impactar, o incluso mejorando, los tiempos de búsqueda por consulta. Esto abre las puertas a futuras investigaciones y desarrollos en el ámbito informático-musical acercándose a más usuarios gracias a la reducción de recursos computacionales, Trabajo financiado por: CITIC, centro de investigación acreditado por el sistema Universitario Gallego, financiado por “Consellería de Cultura, Educación e Universidade de la Xunta de Galicia”, un 80 % a través fondos FEDER, Galicia Programa Operacional FEDER 2014-2020, y el 20 % restante por la “Secretaría Xeral de Universidades” (Grant ED431G 2019/01), Xunta de Galicia/FEDER-UE [ED431C 2021/53; IN852D 2021/3 (CO3)]; Ministerio de Ciencia e Innovación [PID2020-114635RB-I00; PDC2021-120917-C21; PDC2021- 121239-C31; PID2019-105221RB-C41; TED2021-129245-C21], Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

UVL.js: Experiences on using UVL in the JavaScript Ecosystem

  • Lamas Sardiña, Víctor Juan
  • Limaylla-Lunarejo, María-Isabel
  • Rodríguez Luaces, Miguel
  • Romero-Organvidez, David
  • Galindo, José A.
  • Benavides, David
Provided the code related to the paper. You can find the JavaScript version of the parser at this link: https://github.com/Universal-Variability-Language/uvl-parser, and the UVLHub code for integration at https://github.com/diverso-lab/uvlhub. Presented at VaMoS 2025: 19th International Working Conference on Variability Modelling of Software-Intensive Systems, Rennes - France, February 4 - 6, 2025., [Abstract]: The Universal Variability Language (UVL) was developed as a community-driven effort to create a simple yet extensible language for feature modeling, promoting tool interoperability within the software product line community. Although UVL is supported by several tools like FeatureIDE, Flamapy, and Pure::variants, it currently lacks direct support for web environments. To address this, we introduce a JavaScript-based UVL parser built with the ANTLR framework. This parser makes UVL models accessible directly within browser-based environments, eliminating the need for extra installations and enhancing UVL’s usability for web-based tools. Furthermore, the parser can be used in back-end environments with JavaScript runtime environments such as Node.js. The parser has been successfully tested with more than 1,000 UVL models available on UVLHub and supports various UVL language levels and conversion strategies. We demonstrate its integration through two use cases: UVLHub, a public repository for UVL models developed using open science principles, and an application lifecycle management tool for software product lines. This JavaScript UVL parser is the first of its kind, unlocking new possibilities for web and JavaScript applications to take advantage of the advancements in UVL technology., Partly funded by: 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 EU/ERDF A way of making Europe; 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). This work was also partially supported by FEDER/Ministry of Science, Innovation and Universities/Junta de Andalucía/State Research Agency/CDTI with the following grants: Data-pl (PID2022-138486OB-I00), TASOVA PLUS research network (RED2022-134337-T), AquaIA (GOPG-SE-23-0011) and MIDAS (IDI-20230256). David Romero-Organvidez is supported by PREP2022-000335, financed by MICIN/AEI/10.13039/501100011033 and by FSE+., Junta de Andalucía; GOPG-SE-23-0011, https://github.com/Universal-Variability-Language/uvl-parser, https://github.com/diverso-lab/uvlhub
RUC. Repositorio da Universidade da Coruña
Publicación 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
Publicación Contribución de congreso (ConferenceOutput)

A methodology to retire a software product line

  • Cortiñas, Alejandro
  • Krüger, Jacob
  • Lamas Sardiña, Víctor Juan
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
O congreso tivo lugar en Ciudad Real os días del 12 al 14 de septiembre de 2023, [Abstract]: The development of a family of software systems with customization based on a common platform is made possible through software product-line engineering. By employing this approach, an organization can configure a system to adapt to changing customer requirements and also reap long-term benefits such as reduced development and maintenance costs. Typically used for a long-living family of systems that are continuously evolved, a product line may eventually be retired and replaced by a successor due to outdated technology that cannot be easily replaced, making it more feasible to develop a new product line. Previous work has mentioned retiring product lines, but without much detail. This paper aims to fill this gap by presenting a process for retiring and replacing a product line, with the aim of helping practitioners retire product lines more systematically and with fewer issues. Additionally, the paper highlights open research directions that need to be addressed in the future, MAGIST: PID2019-105221RB-C41, partially funded by MCIN/ AEI/10.13039/501100011033; 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, Xunta de Galicia; ED431C 2021/53
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Augmented Thresholds for MONI

  • Martínez-Guardiola, César
  • Brown, Nathaniel K.
  • Silva-Coira, Fernando
  • Köppl, Dominik
  • Gagie, Travis
  • Ladra, Susana
© 2023 IEEE. This version of the article has been accepted for publication, after peer review. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The Version of Record is available online at: https://doi.org/10.1109/DCC55655.2023.00035, [Abstract]: MONI (Rossi et al., 2022) can store a pangenomic dataset T in small space and later, given a pattern P, quickly find the maximal exact matches (MEMs) of P with respect to T. In this paper we consider its one-pass version (Boucher et al., 2021), whose query times are dominated in our experiments by longest common extension (LCE) queries. We show how a small modification lets us avoid most of these queries which significantly speeds up MONI in practice while only slightly increasing its size., CMG, FSC and SL supported by CITIC, as Research Center accredited by Galician University System, funded by “Consellería de Cultura, Educación e Universidade from Xunta de Galicia”, supported 80% through ERDF Funds, ERDF Operational Programme Galicia 2014-2020, and the remaining 20% by “Secretaría Xeral de Universidades” (Grant ED431G 2019/01); Xunta de Galicia/ERDF under Grant [ED431C 2021/53]; GAIN/ERDF under Grant [IN852D 2021/3];Ministe-rio de Ciencia e Innovación MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR under Grants [TED2021-129245B-C21; PID2020-114635RB-I00; PDC2021-121239-C31; PID2019-105221RB-C41; RTI-2018-098309-B-C32]. NKB and TG supported by National Institutes of Health (NIH) NIAID (grant no. HG011392), the National Science Foundation NSF IIBR (grant no. 2029552) and the Natural Science and Engineering Research Council (NSERC) Discovery Grant (grant no. RGPIN-07185-2020) and a CGS-M scholarship. DK was supported by JSPS KAKENHI Grant Numbers JP22H03551, JP21K17701, and JP21H05847., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IN852D 2021/3, United States. National Institute of Allergy and Infectious Diseases; HG011392, United States. National Science Foundation; 2029552, Canada. Natural Science and Engineering Research Council; RGPIN-07185-2020, Japan Society for the Promotion of Science; JP22H03551, Japan Society for the Promotion of Science; JP21K17701, Japan Society for the Promotion of Science; JP21H05847
RUC. Repositorio da Universidade da Coruña
Publicación 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
[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
Publicación Contribución de congreso (ConferenceOutput)

Cache-Friendly Compressed Boolean Matrices

  • Fariña, Antonio
  • Gómez-Brandón, Adrián
  • Gómez-Colomer, Asunción
  • Navarro, Gonzalo
Traballo presentado en: String Processing and Information Retrieval, 32nd International Symposium, SPIRE 2025, London, UK, September 8–11, 2025. 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/978-3-032-05228-5_9 Part of the book series: Lecture Notes in Computer Science (LNCS; volume 16073), [Abstract]: We introduce a new compressed representation of sparse Boolean matrices that enjoys reference locality properties. We build on an existing representation based on LOUDS-deployed cardinal trees, and design one based instead on DFUDS. While this brings various complications, we show that the resulting matrix representation is considerably faster to carry out sums and multiplications, with speedups of up to 60%., This work is supported by ANID – Millennium Science Initiative Program – Code ICN17_002, and Fondecyt Grant 1-230755; CITIC is funded by the Xunta de Galicia and co-financed by the EU through FEDER Galicia [ED431G 2023/01]; MCIN/AEI and EU/ERDF A way of making Europe Grants [PID2022-141027NB-C21 (EarthDL), PID2021-122554OB-C33 (Oassis)]; MCIN/AEI and NextGenerationEU/PRTR Grants [PID2020-114635RB-I00 (EXTRACOMPACT), TED2021-129245B-C21 (PLAGEMIS)]., Xunta de Galicia; ED431G 2023/01, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1-230755
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Efficient algorithms to calculate the Hausdorff distance on point sets represented by a k2-tree

  • Domínguez, Fernando
  • Gutiérrez, Gilberto
  • Rodríguez Penabad, Miguel
  • Romero, Miguel
  • Santolaya, Fernando
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: http://dx.doi.org/10.1007/s10707-025-00557-9 Data used in this article was made publicly available in Zenodo: https://doi.org/10.5281/zenodo.16258820, [Abstract]: The Hausdorff distance is a measure of the similarity between two sets of points. It has been used in many different fields, such as comparing MRI images or transportation routes. There have been different approaches to compute the Hausdorff distance; some algorithms operate in main memory, while others store the set of points in secondary memory. In order to avoid secondary memory, compact data structures, such as k2-tree, can be used. They are able to index large sets of points in main memory, and they can be efficiently queried while minimizing storage. We present in this article two efficient algorithms (HDKP1 and HDKP2) to compute the Hausdorff distance over two data sets that are stored in k2-trees. These algorithms provide a time- and space-efficient solution. The performance of our algorithms was evaluated through a series of experiments together with the most promising algorithms from the state of the art. Based on the results, it was concluded that our approach is competitive or exceeds current algorithms., Authors from University of Bío-Bío were supported in part by [grant numbers 2230534 IF/R, 2130520 IF/R] and by Agencia Nacional de Investigación y Desarrollo (ANID), FONDECYT 1230647 and 11251944. The author from University of A Coruña was partially supported by TED2021-129245B-C21 (PLAGEMIS): partially funded by MCIN/AEI/10.13039/501100011033 and NextGeneration EU/PRTR; PID2020-114635RB-I00 (EXTRACompact): partially funded by MCIN/ AEI/10.13039/501100011033; GRC: ED431C 2021/53, partially funded by GAIN/Xunta de Galicia; CITIC, as a center accredited for excellence co-financed by the EU through the FEDER Galicia 2021-27 operational program (Ref. ED431G 2023/01)., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED431G 2023/01, Universidad del Bío-Bío; 2230534 IF/R, Universidad del Bío-Bío; 2130520 IF/R, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico; 1230647, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico; 11251944
RUC. Repositorio da Universidade da Coruña
Publicación 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
Publicación 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
Publicación 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
Publicación Contribución de congreso (ConferenceOutput)

DSLXpert: LLM-driven Generic DSL Code Generation

  • García-González, Daniel
  • Lamas Sardiña, Víctor Juan
  • Rodríguez Luaces, Miguel
Presented at: In ACM/IEEE 27th International Conference on Model Driven Engineering Languages and Systems (MODELS Companion ’24), September 22–27, 2024, Linz, Austria, [Abstract]: Nowadays, large language models (LLMs) are an extremely useful and fast tool to complement and help in many jobs and current problems. However, there are cases where a pretty specific vocabulary is used in which these models were not previously trained, leading to less satisfactory results. More specifically, these models are less effective when dealing with less-known or unpublished domain-specific languages (DSLs). Within this field, the automatic generation of code based on such languages, starting from natural language, would speed up the development times of any related project, as well as the understanding of such DSLs. Therefore, this paper presents a tool in which developers can perform what is known as semantic parsing. In other words, the developer can ask a pre-trained LLM to translate a natural language instruction into the vocabulary of the established DSL. Thus, by setting the DSL grammar as context (grammar prompting) and providing usage examples (few-shot learning), the LLM can quickly generate reliable domain-specific code, significantly improving the quality of life of the developers. A video demonstration of the tool is shown in the following link: https://zenodo.org/records/12610506., 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-129245BC21]; partially funded by MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe: [EarthDL: PID2022-141027NBC21]; partially funded by GAIN/Xunta de Galicia: [GRC: ED431C2021/53 and ED431G 2023/01], Xunta de Galicia; ED431C2021/53, Xunta de Galicia; ED431G 2023/01
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Evolución eficiente de bases de datos en la reingeniería de bibliotecas digitales

  • Ramos-Vidal, Delfina
  • Brisaboa, Nieves R.
O congreso tivo lugar en Ciudad Real os días del 12 al 14 de septiembre de 2023, [Resumen]: A principios de los años 2000, hubo un gran esfuerzo mundial por desarrollar bibliotecas digitales que facilitasen el acceso a documentos digitalizados a través de Internet, dando lugar a grandes sistemas de información que permiten gestionar y consultar el contenido de estas bibliotecas. Dos décadas después, estos sistemas han ido quedando obsoletos y se quieren completar. En este artículo proponemos una herramienta para faciliar la evolución de grandes bases de datos documentales, Este trabajo lo subvencionan el CITIC, financiado por Xunta de Galicia, FEDER Galicia 2014-2020 80 %, SXU 20 % [CSI:ED431G 2019/01]; PRE2021-099351, MCIN/AEI+”FSE+”; GRC[ED431C 2021/53]: GAIN/Xunta de Galicia; TED2021-129245B-C21(PLAGEMIS): MCIN/AEI+”NextGenerationEU/PRTR; PID2020-114635RB-I00(EXTRACompact): MCIN/AEI; PID2021-122554OB-C33 (OASSIS): MCIN/AEI+EU/ERDF A way of making Europe; PDC2021-120917-C21 (SIGTRANS): MCIN/AEI+“NextGenerationEU”/PRTR, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; PRE2021-099351
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

An Experimental Evaluation of k2-Tree on External Memory

  • Gutiérrez Retamal, Gilberto
  • Romero, Miguel
  • Rodríguez Penabad, Miguel
  • Santolaya, Fernando
  • Caniupán, Mónica
  • Torres, Rodrigo
This is the peer reviewed version of the following article: G. Gutiérrez, M. Romero, M. R. Penabad, F. Santolaya, M. Caniupán, and Rodrigo Torres, "An Experimental Evaluation of k2-Tree on External Memory", Software: Practice and Experience, 2025, which has been published in final form at https://doi.org/10.1002/spe.70028. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. This article may not be enhanced, enriched or otherwise transformed into a derivative work, without express permission from Wiley or by statutory rights under applicable legislation. Copyright notices must not be removed, obscured or modified. The article must be linked to Wiley’s version of record on Wiley Online Library and any embedding, framing or otherwise making available the article or pages thereof by third parties from platforms, services and websites other than Wiley Online Library must be prohibited., [Abstract]: The k2-tree compact data structure has gained great popularity to represent binary relationships in main memory. It presents a good performance and a good trade-off between storage and execution time. However, datasets being too large, or limited resources, may prevent the dataset from fitting into RAM even in compressed form. This work presents an experimental evaluation of a k2-tree in external memory (disk), in terms data access (I/O operation or cache misses) and execution time for 4 types of common queries. We compare the k2-tree with other data structures, namely a Quadtree (specifically, a Linear QuadTree, LQT) and the classical adjacency matrix, all of them being in external memory. We used for the test both synthetical as well as large, real world, datasets. Several aspects, such as the size of the memory cache and its replacement scheme, or specific parameters like the arity (k value) of the k2-tree were considered in the experiments. In terms of storage needs, the k2-tree clearly outperforms the other alternatives, in extreme cases needing only 1% of the LQT space, or 0.01% of the adjacency matrix (and for some large datasets neither the LQT nor the adjacency matrix could be built). In terms of performance, except for cases with small datasets, where the adjacency matrix is the best option for some queries, the k2-tree is either competitive or outperforms the alternatives., This work was supported by ANID Grant 1230647, ALBA group code 2130591 GI/VC, Project INES I + D 22-14, and Projects 2130520IF/R and 2230534IF/R (funded by DICREA/UBB). Miguel R. Penabad's work was partially funded by MCIN/AEI/10.13039/501100011033 and NextGenerationEU/PRTR projects (Grants TED2021-129245B-C21 (PLAGEMIS), PDC2021-121239-C31 (FLATCITY-POC), and PID2020-114635RB-I00 (EXTRACompact)); by GAIN/Xunta de Galicia project GRC: ED431C 2021/53; CITIC is funded by the Xunta de Galicia., Chile. Fondo Nacional de Desarrollo Científico y Tecnológico; 1230647, Universidad del Bío-Bío; 2130591 GI/VC, Chile. Agencia Nacional de Investigación y Desarrollo (ANID) – Programa InES I+D; 22-14, Universidad del Bío-Bío; 2230534 IF/R, Universidad del Bío-Bío; 2130520 IF/R, Xunta de Galicia; ED431C 2021/53
RUC. Repositorio da Universidade da Coruña
Publicación 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
Publicación Tesis doctoral (DoctoralThesis)

Compact Structures for the Representation of Trajectory Information

  • Gutiérrez-Asorey, Pablo
[Abstract] We live in an age of information and movement. Constantly on the move, tethered to our cell phones, searching the Internet for directions to the station, what time the next bus stops, what is the best route to the mall, where we are going to eat today, and so on. We get up and go to work or school, we go home, we go out partying... As a species it would seem that we are incapable of sitting still for long, we always yearn to get somewhere. Essentially none of this is new, nor should it be considered unique to the current age. They already used maps in ancient Babylon. What they didn’t have, however, were screens, and the whole parade of technologies that in the 21st century has become practically a new limb for citizens of developed countries. Those smartphones, those GPS, the reader of our traveler card on the bus, are systems that collect information about us; about how we move. Facilities such as shopping malls or hospitals can easily capture with technological solutions the movements of users and staff, but even indirectly, when making a card payment, or, again, validating a trip on a means of public transport with a traveler card, we are creating a record of our position and intention to move at a given instant of time. We are not talking about discrete amounts of information, either. With so much technology flooding us, it is to be expected that the positioning information of people and objects over a relatively large period of time (or even not that large, depending on the context) will reach massive sizes. Of course, any technological advance brings with it ripe opportunities for research on how to refine the new technologies and apply them to solve problems that matter to people and society at large. Thus, this thesis focuses on researching solutions for the representation of maps and the movements of people and objects on those maps over time. Our work focuses on facilitating the spatially and time-efficient representation of maps and trajectories using compact data structures capable of storing information in a compressed format while allowing its exploitation without the need for decompression. Our first contribution is a strategy for representing maps at different scales or zoom levels in a compact manner. Most systems that work with maps, such as Google Maps, store different versions of the same map at different levels of detail suitable for different zoom levels. This generates redundant information that needs to be stored. This is because, for example, although a coastline may look much more simplified at a low zoom, using far fewer geographic points than at a high zoom, the visible points will still exist at all successive zoom levels as well, only added to new points that provide more detail to the shape. Our proposal can represent different zoom levels without repeating any geographic points between them, thus greatly improving storage size when compared to typical solutions. Our second contribution is an indoor positioning system, capable of capturing user trajectories in a semantically annotated, motion-limited space (e.g., a shopping mall or medical facility where the layout of the space informs the possibilities of movement and it is possible to tag rooms and corridor segments with unique identifiers), and compressing them into a compact data structure with access times to the movements of any user in a given time period well below a millisecond. Finally, the last contribution of this thesis is the work done as part of an ambitious research project aimed at the analysis and exploitation of traveler movements in public transport networks. Using traveler card records, we offer solutions for storing and exploiting trips from an origin to a destination stop of users of the transport network., [Resumen] Vivimos en la era de la información y el movimiento. Constantemente en movimiento, enganchados a nuestros teléfonos móviles, buscando en Internet cómo llegar a la estación, a qué hora pasa el bus, cuál es la mejor ruta hasta el centro comercial, dónde vamos a comer hoy, etc. Nos levantamos y vamos al trabajo o a la escuela, volvemos a casa, salimos de fiesta. . . Como especie parecería que somos incapaces de permanecer quietos mucho tiempo, siempre anhelamos llegar a alguna parte. En esencia nada de esto es nuevo, ni deberían considerarse circunstancias exclusivas de la era actual. Ya se usaban mapas en la antigua Babilonia. No obstante, lo que no tenían eran pantallas, y todo el desfile de tecnologías que en el siglo 21 se han convertido en prácticamente una nueva extremidad para los ciudadanos de los países desarrollados. Los teléfonos inteligentes, los GPS, el lector de nuestra tarjeta de viajero en el autobús; son todos sistemas que recaban información sobre nosotros, sobre cómo nos movemos. Instalaciones como centros comerciales u hospitales pueden utilizar soluciones tecnológicas para conocer los movimientos de usuarios y personal con facilidad, pero, incluso de forma indirecta, al hacer un pago con tarjeta de crédito, o, de nuevo, al validar un viaje en un medio de transporte público con una tarjeta de viajero, estamos creando un registro, tanto de nuestra posición como de una intención de desplazamiento, en un instante de tiempo determinado. Por descontado, no estamos hablando de cantidades de información precisamente pequeñas. Con tanta tecnología inundando nuestras vidas, es de esperar que la información de posicionamiento de personas y objetos a lo largo de un periodo de tiempo relativamente grande (o no tan grande, esto depende del contexto) alcance tamaños masivos. Por supuesto, cualquier avance tecnológico trae consigo oportunidades de investigación en como afinar las nuevas tecnologías y aplicarlas para resolver problemas que importan a las personas y a la sociedad en general. Así pues, esta tesis se centra en investigar soluciones para la representación de mapas y los movimientos de personas y objetos en esos mapas. El trabajo realizado se centra en facilitar la representación eficiente, tanto desde el punto de vista espacial como del tiempo de acceso a los datos, de mapas y trayectorias, utilizando estructuras de datos compactas que almacenan la información en formato comprimido a la vez que permiten su explotación sin necesidad de un proceso previo de descompresión. Nuestra primera contribución es una estrategia para la representación de mapas a diferentes niveles de escala o zoom de forma compacta. La mayoría de sistemas que trabajan con mapas, como Google Maps y similares, guardan diferentes versiones de un mismo mapa a diferentes niveles de detalle adecuados para los distintos niveles de zoom. Esto genera una gran cantidad de información redundante que es necesario almacenar. Esto es debido a que, por ejemplo, aunque la línea de una costa se vea mucho más simplificada a un zoom bajo, utilizando muchos menos puntos geográficos que en un zoom alto, los puntos que sí se ven van a existir en todos los niveles sucesivos de zoom también, solo que sumados a nuevos puntos que confieren más detalle a la forma. Nuestra propuesta es capaz de representar diferentes niveles de zoom sin repetir ningún punto geográfico entre ellos, mejorando por tanto en términos de espacio de almacenamiento respecto a las soluciones típicas. Nuestra segunda contribución es un sistema de posicionamiento en interiores capaz de capturar las trayectorias de usuarios en un espacio con movimiento limitado y anotado semánticamente (por ejemplo, un centro comercial o instalación médica donde la distribución del espacio informa obviamente de las posibilidades de movimiento y es posible etiquetar salas y segmentos de pasillo con identificadores únicos), y comprimirlas en una estructura de datos compacta con tiempos de acceso a los movimientos de cualquier usuario en un periodo de tiempo determinado muy por debajo del milisegundo. Finalmente, la última contribución de esta tesis es el trabajo realizado como parte de un ambicioso proyecto de investigación destinado al análisis y explotación de los movimientos de viajeros en redes de transporte público. Utilizando registros de tarjetas de viajero, ofrecemos soluciones para almacenar y explotar los viajes de una parada de origen a otra de destino de usuarios de la red de transporte., [Resumo] Vivimos nunha era de información e movemento. Constantemente en movemento, atados aos nosos móbiles, buscando en Internet como chegar á estación, a que hora pasa o autobús, cal é a mellor ruta para ir ao centro comercial, onde imos comer hoxe, etc. Levantámonos e imos ao traballo ou ao colexio, chegamos á casa, saímos de festa... Como especie parece que somos incapaces de quedarnos moito tempo parados, sempre queremos chegar a algún sitio. En esencia nada disto é novo, nin debe ser visto como exclusivo da época actual. Xa usaban mapas na antiga Babilonia. Porén, o que non tiñan eran pantallas, e todo o desfile de tecnoloxías que no século XXI se converteron practicamente nunha nova extremidade para os cidadáns dos países desenvolvidos. Os móbiles intelixentes, os GPS, o lector da nosa tarxeta de viaxeiro no autobús, son sistemas que recollen información sobre nós; sobre como nos movemos. Instalacións como centros comerciais ou hospitais poden coñecer con solucións tecnolóxicas os movementos de usuarios e persoal con facilidade, pero, incluso indirectamente, realizando o pago con tarxeta, ou, de novo, validando unha viaxe nun medio de transporte público con nosa tarxeta de viaxeiro, estamos creando un rexistro da nosa posición e intención de movernos nun momento dado. Ademais, non estamos a falar de cantidades de información precisamente pequenas. Con tanta tecnoloxía que nos inunda, é de esperar que a información de posicionamento de persoas e obxectos durante un período de tempo relativamente grande (ou non tan grande, dependendo do contexto) alcance tamaños masivos. Por suposto, calquera avance tecnolóxico trae consigo oportunidades de investigación sobre como mellorar as novas tecnoloxías e aplicalas para resolver problemas que importan ás persoas e a sociedade en xeral. Así, esta tese céntrase en investigar solucións para a representación de mapas e os movementos de persoas e obxectos neses mapas ao longo do tempo. O traballo realizado céntrase en facilitar a representación eficiente, tanto dende o punto de vista espacial como no tempo de acceso aos datos, de mapas e traxectorias, utilizando estruturas de datos compactas que almacenan a información nun formato comprimido ao tempo que permiten a súa explotación sen necesidade de un proceso de descompresión previo. A nosa primeira contribución é unha estratexia para representar mapas a diferentes escalas ou niveis de zoom dun xeito compacto. A maioría dos sistemas que traballan con mapas, como Google Maps e similares, gardan diferentes versións do mesmo mapa en diferentes niveis de detalle pensados para diferentes niveis de zoom. Isto xera unha gran cantidade de información redundante que é necesario almacenar. Isto ocorre porque, por exemplo, aínda que unha liña de costa parece moito máis simplificada cun zoom baixo, utilizando moitos menos puntos xeográficos que cun zoom alto, os puntos visibles existirán en todos os niveis de zoom sucesivos. Ao aumentar o zoom, só se engadirán aos novos puntos que dan máis detalle á forma. A nosa proposta é capaz de representar diferentes niveis de zoom sen repetir ningún punto xeográfico entre eles, mellorando moito o almacenamento en comparación coas solucións típicas. A nosa segunda contribución é un sistema de posicionamento en interiores, capaz de captar as traxectorias dos usuarios nun espazo de movemento limitado e anotado semanticamente (por exemplo, un centro comercial ou centro médico onde a distribución do espazo informa obviamente das posibilidades de movemento e os cuartos e os segmentos do corredor pódense etiquetar con identificadores únicos) e comprimirse nunha estrutura de datos compacta con tempos de acceso aos movementos de calquera usuario nun período de tempo determinado moi por debaixo do milisegundo. Finalmente, a última contribución desta tese é o traballo realizado no marco dun ambicioso proxecto de investigación enfocado á análise e explotación dos movementos de viaxeiros nas redes de transporte público. Mediante os rexistros da tarxeta de viaxeiro, ofrecemos solucións para almacenar e explotar viaxes dunha parada de orixe a outra de destino dos usuarios da rede de transporte., Ministerio de Ciencia, Innovación e Universidades; BIZDEVOPS-GLOBAL; RTI2018-098309-B-C32, Ministerio de Economía y Competitividad; TIN2016-78011-c4-1-R, Xunta de Galicia; COV20/00604, Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; IN852A 2018/14, Xunta de Galicia; IG240.2020.1.185, Los trabajos llevados a cabo como parte de esta tesis han sido parcialmente financiados por el centro de investigación CITIC, financiado por la Xunta de Galicia a través del acuerdo de colaboración entre el Ministerio de Educación, Formación Profesional y Universidades, y las universidades gallegas para el refuerzo de los centros de investigación de la Red de Centros de Investigación del Sistema Universitario de Galicia (CIGUS); por el GRC: ED431C 2021/53, parcialmente financiado por GAIN/Xunta de Galicia, y por los siguientes proyectos de investigación y subvenciones: • MAGIST: PID2019-105221RB-C41, financiado por MCIN / AEI / 10.13039 / 501100011033. • EXTRACompact: PID2020-114635RB-I00, financiado por MCIN / AEI / 10.13039 / 501100011033. • SIGTRANS: PDC2021-120917-C21, financiado por MCIN / AEI / 10.13039 / 501100011033 and “NextGenerationEU”/PRTR». • PLAGEMIS: TED2021-129245B-C21, financiado por MCIN / AEI / 10.13039 / 501100011033 and “NextGenerationEU”/PRTR. • OASSIS: PID2021-122554OB-C33, financiado por MCIN / AEI / 10.13039 / 501100011033 and EU/ERDF A way of making Europe. • EarthDL: PID2022-141027NB-C21, financiado por MCIN / AEI / 10.13039 / 501100011033 and EU/ERDF A way of making Europe. • FLATCITY-POC: PDC2021-121239-C31, financiado por MCIN / AEI / 10.13039 / 501100011033 and “NextGenerationEU” / PRTR • STEPS: RTC-2017-5908-7, financiado por Ministerio de Ciencia, Innovación y Universidades, AEI, co-funded 80% by Fondos FEDER, Programa Retos Colaboración, 2017. • BIZDEVOPS: RTI2018-098309-B-C32, financiado por Ministerio de Ciencia, Innovación e Universidades. Convocatoria del 2018 para projectos I+D+i "Retos investigación". • Datos 4.0: TIN2016-78011-C4-1-R, financiado por Ministerio de Economía e Competitividade, Programa Retos da Sociedade, convocatoria de 2016. • CEDCOVID: COV20/00604, financiado por Axencia Galega de Innovación, Proxecto Programas Autonómicos. • Convocatoria Conecta COVID: IN852D 2021/3, financiado por UE, FEDER, GAIN, Convocatoria Conecta COVID. • GRC: ED431C 2017/58, financiado por GAIN / Xunta de Galicia. • GEMA: IN852A 2018/14, financiado por Xunta de Galicia / FEDER-UE, and ConectaPeme. • LEMSI: financiado por IG240.2020.1.185, Xunta de Galicia / Igape. El trabajo realizado en varias publicaciones como parte del desarrollo de esa tesis también estuvo financiado por el programa de becas FPI [BES-2017-081390], la beca Fondecyt #11221029 de la Universidad Austral de Chile, y por la beca predoctoral de la Xunta de Galicia ED481A-2021/183.
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Evaluating regular path queries on compressed adjacency matrices

  • Arroyuelo, Diego
  • Gómez-Brandón, Adrián
  • Navarro, Gonzalo
O software está dispoñible en: https://github.com/adriangbrandon/rpq-matrix, Dataset relacionado: https://zenodo.org/records/7254968, 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/s00778-024-00885-6, [Abstract]: Regular Path Queries (RPQs), which are essentially regular expressions to be matched against the labels of paths in labeled graphs, are at the core of graph database query languages like SPARQL and GQL. A way to solve RPQs is to translate them into a sequence of operations on the adjacency matrices of each label. We design and implement a Boolean algebra on sparse matrix representations and, as an application, use them to handle RPQs. Our baseline representation uses the same space and time as the previously most compact index for RPQs, outperforming it on the hardest types of queries—those where both RPQ endpoints are unspecified. Our more succinct structure, based on -trees, is 4 times smaller than any existing representation that handles RPQs. While slower, it still solves complex RPQs in a few seconds and slightly outperforms the smallest previous structure on the hardest RPQs. Our new sparse-matrix-based solutions dominate a good portion of the space/time tradeoff map, being outperformed only by representations that use much more space. They also implement an algebra of Boolean matrices that is of independent interest beyond solving RPQs., This work was supported by ANID - Millennium Science Initiative Program - Code ICN17_002, and Fondecyt Grant 1-230755; CITIC is funded by Xunta de Galicia and CIGUS; GAIN/Xunta de Galicia Grant ED431C 2021/53 (GRC); Xunta de Galicia/FEDER-UE Grant IN852D 2021/3; MCIN/AEI and NextGenerationEU/PRTR Grants [PID2020-114635RB-I00, TED2021-129245B-C21]. A preliminary version of this paper appears in Proc. SPIRE 2023, Chile. Agencia Nacional de Investigación y Desarrollo; ICN17_002, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1-230755, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IN852D 2021/3
RUC. Repositorio da Universidade da Coruña
Publicación 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
Publicación Artículo científico (JournalArticle)

Heuristic-based computation of tailored spanning trees to speed up compact planar graphs

  • Irribarra-Cortés, Ayleen
  • Asín-Achá, Roberto
  • Fuentes Sepúlveda, José
  • Seco, Diego
This is a pre-copyedited, author-produced version of an article accepted for publication in The Computer Journal following peer review. The version of record Ayleen Irribarra-Cortés, Roberto Asín-Achá, José Fuentes-Sepúlveda, Diego Seco, Heuristic-based computation of tailored spanning trees to speed up compact planar graphs, The Computer Journal, Volume 68, Issue 10, October 2025, Pages 1476–1484, is available online at: https://doi.org/10.1093/comjnl/bxaf051 The data and code of this article are available on public repositories. The implementation is available at the GitHub repository mentioned in Section 4.1. The datasets are available in the repository mentioned on Section 4.2., [Abstract]: In this work we address the problem of speeding up navigational queries over compact planar graphs. In particular, we work over one of the most practical representations for compact planar graphs, which is based on the decomposition of the graph into one arbitrary spanning tree and a second one induced by the former. We propose a new optimization model that captures the desired topological properties of the first spanning tree. For this model, we propose several heuristics, which we experimentally compare on our application domain. The experimental results support that the model indeed captures the main properties that allow us speeding up the main navigational queries over several benchmarks., This work was funded by ANID – Millennium Science Initiative Program – Code ICN17 002, Chile (1st and 3rd authors), PAI grant 77190038 (3rd author), FONDECYT grant 11220545 (3rd author), PFCHA / Doctorado Nacional / 2021-21211768 (1st author), TED2021-129245B-C21 (PLAGEMIS) and PID2020-114635RB-I00 (EXTRACompact): partially funded by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR, GRC: ED431C 2021/53, partially funded by GAIN/Xunta de Galicia [4th author]. 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; ICN17_002, Chile. Agencia National de Investigación y Desarrollo; 77190038, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico; 11220545, Xunta de Galicia; ED431C 2021/53
RUC. Repositorio da Universidade da Coruña
Publicación 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
Publicación 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
Publicación Contribución de congreso (ConferenceOutput)

How to Retire and Replace a Software Product Line

  • Cortiñas, Alejandro
  • Krüger, Jacob
  • Lamas Sardiña, Víctor Juan
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
Presented at: 27th ACM International Systems and Software Product Line Conference (SPLC '23), 28 August 2023- 1 September 2023, Tokyo, Japan © {Autor | ACM} 2023. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in SPLC '23: Proceedings of the 27th ACM International Systems and Software Product Line Conference - Volume A, https://doi.org/10.1145/3579027.3609004, [Abstract]: Software product-line engineering provides a framework for an organization to develop a family of similar, yet customized, software systems based on a common platform. This platform allows the organization to configure a system to changing customer requirements, while also achieving long-term benefits like reduced development and maintenance costs. Consequently, a product line is typically used for a long-living family of systems and is continuously evolved. However, at some point even a product line may be retired and potentially replaced by a successor, for instance, because of outdated technology that cannot be replaced easily and thus makes developing a new product line more feasible. Such a retiring of product lines is mentioned in previous work, but has not been investigated in detail. In this paper, we tackle this gap by describing a process for retiring and replacing a product line, which we defined based on a real-world action-research-like case study. Via this case study. we describe how our process can be executed in practice, what decisions must be considered, as well as the pros and cons we experienced with retiring a product line. We expect that these contributions will help practitioners retire product lines more systematically and with fewer problems. We also indicate open research directions that should be tackled in the future., PID2021-122554OB-C33 (OASSIS): partially funded by MCIN/AEI/-10.13039/501100011033 and EU/ERDF A way of making Europe; TED2021-129245B-C21 (PLAGEMIS): partially funded by MCIN/AEI/-10.13039/501100011033 and “NextGenerationEU”/PRTR; PDC2021-121239-C31 (FLATCITY-POC): partially funded by MCIN/AEI/10.130-39/501100011033 and “NextGenerationEU”/PRTR; PID2020-114635RB-I00 (EXTRACompact): partially funded by MCIN/ AEI/10.13039/50-1100011033; MAGIST: PID2019-105221RB-C41, partially funded by MCIN/ AEI/10.13039/501100011033; 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
RUC. Repositorio da Universidade da Coruña
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación Artículo científico (JournalArticle)

Classic distance join queries using compact data structures

  • Bernardo, Guillermo de
  • Penabad, Miguel R.
  • Corral, Antonio
  • Brisaboa, Nieves R.
[Abstract]: Distance-based Join Queries (DJQs) have multiple applications in spatial databases, Geographic Information Systems, and other areas. The K Closest Pairs Query (KCPQ) 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 k2-tree, a compact data structure for binary grids. Our algorithms solve KCPQ and 𝜀� DJQ queries, as well as several window-constrained variants, taking advantage of the indexing capabilities of K2 -trees to efficiently answer queries without the need to decompress the data. Our experimental evaluation with large datasets shows that k2-tree algorithms are up to 5 times faster than plane-sweep algorithms in KCPQ, 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, Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

SensorPublisher: Applying Software Product Lines to the Development of IoT Dashboards

  • Cortiñas, Alejandro
  • Lamas Sardiña, Víctor Juan
  • Rodríguez Luaces, Miguel
Presented at: 28th ACM International Systems and Software Product Line Conference (SPLC '24), September 2 - 6, 2024, Dommeldange, Luxembourg. © Autor | ACM 2024. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in SPLC '24: Proceedings of the 28th ACM International Systems and Software Product Line Conference, https://doi.org/10.1145/3646548.3672582, [Abstract]: Geosciences have witnessed a revolution in data collection thanks to the Internet of Things (IoT), which has made it possible to monitor complex phenomena using sensor networks. However, developing web-centric, sensor-based, data warehousing information systems presents challenges because of their complexity and cost. This paper presents an intuitive low-code development system (called SensorPublisher), based on a software product line (SPL) and a domain-specific language (DSL), that speeds up the creation of data warehousing applications for geographic sensor data. SensorPublisher allows the geoscientist to define the sensor network, to generate a software product, and to deploy the product to a local or a remote server. Our tool seeks to encourage scientists to share the outcomes of their sensor data analysis projects with their communities by means of a simple, user-friendly and cost-effective approach. We showcase the system in different geoscientific domains, such as meteorological monitoring services, traffic data and air quality monitoring in urban areas, and marine area monitoring systems. © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM., 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 \u201CNextGenerationEU\u201D/PRTR: [PLAGEMIS: TED2021-129245BC21]; [FLATCITY-POC: PDC2021-121239-C31]; [SIGTRANS: PDC2021-120917-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
Publicación Contribución de congreso (ConferenceOutput)

Worst-Case-Optimal Similarity Joins on Graph Databases

  • Arroyuelo, Diego
  • Bustos, Benjamin
  • Gómez-Brandón, Adrián
  • Hogan, Aidan
  • Navarro, Gonzalo
  • Reutter, Juan
© 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 Proceedings of the ACM on Management of Data, https:// doi.org/10.1145/3639294, [Absctract]: We extend the concept of worst-case optimal equijoins in graph databases to the case where some nodes are required to be within the k-nearest neighbors (kNN) of others under some similarity function. We model the problem by superimposing the database graph with the kNN graph and show that a variant of Leapfrog TrieJoin (LTJ) implemented over a compact data structure called the Ring can be seamlessly extended to integrate similarity clauses with the equijoins in the LTJ query process, retaining worst-case optimality in many relevant cases. Our experiments on a benchmark that combines Wikidata and IMGpedia show that our enhanced LTJ algorithm outperforms by a considerable margin a baseline that first applies classic LTJ and then completes the query by applying the similarity predicates. The difference is more pronounced on queries where the similarity clauses are more densely connected to the query, becoming of an order of magnitude in some cases., Funded by ANID – Millennium Science Initiative Program – Code ICN17_002. A.G. is funded in part by MCIN/AEI/10.13039/5011000-11033: grant PID2020-114635RB-I00 (EXTRACompact); by MCIN/A-EI/10.13039/501100011033 and EU/ERDF "A way of making Europe": PID2022-141027NBC21 (EARTHDL); by MCIN/AEI/10.13039/501100011033 and “Next-GenerationEU”/ PRTR: grants TED2021-129245B-C21 (PLAGEMIS), PDC2021-120917-C21 (SIGTRANS) and by GAIN/Xunta de Galicia: GRC: grants ED431C 2021/53, and CIGUS 2023-2026. A.H. was funded in part by Fondecyt Grant 1221926. G.N. was funded in part by Fondecyt Grant 1-230755. J.R. was funded in part by Fondecyt Grant 1221799., Chile. Agencia Nacional de Investigación y Desarrollo; ICN17_002, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; CIGUS 2023-2026, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1-230755, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1221926, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1221799
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Compacting Massive Public Transport Data

  • Letelier, Benjamin
  • Brisaboa, Nieves R.
  • Gutiérrez-Asorey, Pablo
  • Paramá, José R.
  • Varela Rodeiro, Tirso
This congress was held in Pisa, Italy, September 26–28, 2023, [Abstract]: In this work, we present a compact method for storing and indexing users’ trips across transport networks. This research is part of a larger project focused on providing transportation managers with the tools to analyze the need for improvements in public transportation networks. Specifically, we focus on addressing the problem of grouping the massive amount of data from the records of traveller cards as coherent trips that describe the trajectory of users from one origin stop to a destination using the transport network, and the efficient storage and querying of those trips. We propose two alternative methods capable of achieving a space reduction between 60 to 80% with respect to storing the raw trip data. In addition, our proposed methods are auto-indexed, allowing fast querying of the trip data to answer relevant questions for public transport administrators, such as how many trips have been made from an origin to a destination or how many trips made a transfer in a certain station., This work was partially supported by the CITIC research center funded by Xunta de Galicia, 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]; EU/ERDF A way of making Europe [OASSIS-UDC: PID2021-122554OB-C3]); by GAIN/Xunta de Galicia [GRC: ED431C 2021/53]; by UE FEDER [CO3: IN852D 2021/3]; by Xunta de Galicia [ED481A/2021-183], and by the Fondecyt grant #11221029 of Universidad Austral de Chile., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED481A/2021-183, Xunta de Galicia; IN852D 2021/3, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 11221029
RUC. Repositorio da Universidade da Coruña
Publicación 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
Publicación 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
Publicación 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
Publicación Contribución de congreso (ConferenceOutput)

Using Voting and Stacking Ensemble Techniques to Optimize Software Requirements Classification

  • Limaylla-Lunarejo, María-Isabel
  • Condori Fernández, Nelly
  • Rodríguez Luaces, Miguel
The conference was held in Honolulu, Hawaii, on 2–3 October 2025., [Abstract]: Background: Ensemble models play an important role in integrating multiple classifiers in a wide range of applications, such as medical diagnosis, sentiment analysis, and financial market trends. In Requirements Engineering (RE), automatic requirements classification can be improved by the utilization of these models. Aims: This paper analyses the performance metrics of voting and stacking ensemble models for requirements classification prediction. Moreover, a cross-dataset validation was performed for the meta-models generated using the stacking ensemble method. Methods: Some previously trained base models and two datasets of software requirements written in Spanish (translated PROMISE_exp and ReSpa dataset) were used to build the ensemble models. Results: The results indicate that the stacking model achieved a weighted F1-score of 0.828 using Support Vector Machine (SVM) and Multi-layer Perceptron (MLP) for translated PROMISE_exp dataset. For the ReSpa dataset, the stacking model achieved a weighted F1-score of 0.890 using Logistic Regression (LR). Conclusion: This study confirms a slight improvement in the performance of binary requirements classification using stacking ensemble methods over voting and most individual base models. Moreover, combining all models outperforms combinations that include only Shallow ML or DL models., Partially supported by TED2021-129245B-C21 (PLAGEMIS) and PID2022-141027NB-C21 (EarthDL), both funded by MCIN/AEI/10.13039/501100011033 and co-financed by the EU through “NextGenerationEU”/PRTR and ERDF. Additional support from the Galician Ministry, together with ERDF funding, is acknowledged via grants: ED431G-2023/04 and ED431C2022/19., Xunta de Galicia; ED431G-2023/04, Xunta de Galicia; ED431C2022/19
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Arquitectura para la Gestión del Ciclo de Vida de Líneas de Producto Software

  • Castro, David de
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
  • Saavedra Places, Ángeles
O congreso tivo lugar en Ciudad Real os días del 12 al 14 de septiembre de 2023, [Abstract]: La Gestión del Ciclo de Vida de Aplicaciones (conocido como ALM por su nombre en inglés, Application Lifecycle Management) coordina las actividades para desarrollar, mantener y evolucionar una aplicación, definiendo un marco que busca la eficiencia y efectividad en cada etapa del ciclo de vida. Aunque existen numerosas publicaciones sobre ALM, la aplicación de ALM en las Líneas de Producto Software (LPS) aún no ha sido abordada. En este trabajo se propone adaptar ALM para el desarrollo de LPS mediante la creación de una herramienta que maneje principalmente las áreas de desarrollo y operaciones para gestionar varias LPS y sus productos asociados, TED2021-129245B-C21 (PLAGEMIS): partially funded by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR; MAGIST: PID2019-105221RB-C41, partially funded by MCIN/ AEI/10.13039/501100011033; GRC: ED431C 2021/53, partially funded by GAIN/Xunta de Galicia, Xunta de Galicia; ED431C 2021/53
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Adapting the Database to Feature Changes in Software Product Line

  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
  • Saavedra Places, Ángeles
Traballo presentado na: SPLC '23: 27th ACM International Systems and Software Product Line Conference, Tokyo, Japan, 28 August 2023- 1 September 2023. © Author | ACM 2023. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in SPLC 2023, https://doi.org/10.1145/3579027.3608990, [Abstract]: Software Product Lines (SPL) support the development of families of software products that share a set of core assets but differ in certain features. To generate a new product, the engineer selects the desired features and the SPL assembles and adapts the implementation of the core assets. In real scenarios, we may need to update a product by adding a feature not initially selected. Similarly, we may need to remove a feature that is no longer necessary. Modifying the selection of features of a product in use poses a challenge from the point of view of the product's database. If the added/removed features affect the database schema, we may need to adapt the schema and the data stored in the database. This paper addresses this scenario and proposes an evolution model to define actions to be executed in the database when features are added or removed. Our proposal allows us to model those adaptations and to automate them when modifying the selection of features of a product. The evolution model describes changes to be made in the database, each composed of different actions that adapt certain elements of the database. Changes are associated with the features that may trigger their execution, and the change's actions are associated with the data model elements they affect. In this way, the evolution model supports automatic adaptation of the database, and we keep traceability between features and the elements of the data model they affect., Partially funded by: PID2021-122554OB-C33 (OASSIS) MCIN/AEI-/10.13039/501100011033 and EU/ERDF A way of making Europe; TED2021-129245B-C21 (PLAGEMIS) MCIN/AEI/10.13039/50110001-1033 and NextGenerationEU/PRTR; PDC2021-121239-C31 (FLATCITY-POC) MCIN/AEI/10.13039/501100011033 and NextGenerationEU/PRTR; PDC2021-120917-C21 (SIGTRANS) MCIN/AEI/10.-13039/501100011033 and NextGenerationEU/PRTR; PID2020-11463-5RB-I00 (EXTRACompact) MCIN/AEI/10.13039/501100011033; MAGIST: PID2019-105221RB-C41 MCIN/AEI/10.13039/501100011033; 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
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Herramienta SIG para la consulta y gestión de datos de transporte público masivos

  • Brisaboa, Nieves R.
  • Gutiérrez-Asorey, Pablo
  • Letelier, Benjamin
  • Varela Rodeiro, Tirso
O congreso tivo lugar en Ciudad Real os días del 12 al 14 de septiembre de 2023, [Resumen]: En este proyecto presentamos una herramienta para los administradores del transporte público orientada a facilitar el análisis y la explotación de información de los movimientos de la ciudadanía en la red de transportes. Esta línea de investigación es especialmente relevante en vista de los cambios que la movilidad urbana está experimentando en los últimos años, incluyendo aquellos propiciados por la implantación de tarjetas de viajero para validar el acceso al transporte público. La solución que proponemos combina tecnologías SIG con estructuras de datos compactas para el almacenamiento y consulta de datos de movilidad en redes de transporte. En este artículo nos centraremos en detallar nuestra estrategia para almacenar e indexar los datos de movilidad, This work was partially supported by the CITIC research center funded by Xunta de Galicia, FEDER Galicia 2014-2020 80 %, SXU 20 % [CSI: ED431G 2019/01]; MCIN/ AEI/10.13039/501100011033 ([EXTRA-Compact: PID2020-114635RB-I00], [MAGIST: PID2019-105221RB-C41]; “NextGenerationEU”/PRTR [SIGTRANS: PDC2021-120917-C21], [PLAGEMIS: TED2021-129245B-C21]; EU/ERDF A way of making Europe [OASSIS-UDC: PID2021-122554OB-C3]); by GAIN/Xunta de Galicia [GRC: ED431C 2021/53]; by UE FEDER [CO3: IN852D 2021/3], and by Xunta de Galicia [ED481A/2021-183], Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; IN852D 2021/3, Xunta de Galicia; ED481A/2021-183
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Development of a PLE Factory Environment with GitLab Integration and following ISO/IEC 26580

  • Buján, Alejandro
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
Versión aceptada de: A. Buján, A. Cortiñas, and M. Rodríguez Luaces, "Development of a PLE Factory Environment with GitLab Integration and following ISO/IEC 26580", presented at SPLC '24: Proceedings of the 28th ACM International Systems and Software Product Line Conference, ACM International Conference Proceeding Series, pp. 34 - 37, sept. 2024, https://doi.org/10.1145/3646548.3678013, [Abstract]: Product Line Engineering (PLE) is a strategic approach in software engineering. Existing PLE factory development environments often lack integration with modern development and version control platforms, limiting their efficiency. We present a PLE factory development environment that meets the ISO/IEC 26580 standard and integrates with GitLab and git repositories to manage feature catalogues, bill-of-features portfolios, shared assets, and product instances. Our tool uses the Universal Variability Language (UVL) for feature modeling, offering a feature model editor for domain analysis and a source code editor for domain implementation. For application engineering, it supports requirements analysis via a bill-of-features editor and product derivation using the spl-js-engine. The tool also defines a git branching model to automate product asset changes and includes real-time tracking and historical visualization of the derivation process for each product configuration. A demonstration of the tool is available at https://doi.org/10.5281/zenodo.12700667., 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]; [FLATCITYPOC: PDC2021-121239-C31]; 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
Publicación Contribución de congreso (ConferenceOutput)

Efficient Database Evolution in Digital Library Reengineering

  • Ramos-Vidal, Delfina
  • Brisaboa, Nieves R.
Cursos e Congresos, C-155, [Abstract] With the advancement of internet applications, extensive information systems were created to effectively manage and provide easy access to documents, which coincided with a global initiative to convert physical documents into digital format, making them accessible through the internet. After two decades, these databases are well-structured and organized, although the software used to manage them is gradually becoming outdated. Additionally, once the initial digitization and creation of metadata are completed, it is sensible to enhance the metadata further to provide more detailed information about the documents. In this article we propose a tool to facilitate the evolution of large documentary databases, Xunta de Galicia; ED431C 2021/53, CITIC is funded by the Xunta de Galicia through the collaboration agreement between the Consellería de Cultura, Educación, Formación Profesional e Universidades and the Galician universities for the reinforcement of the research centres of the Galician University System (CIGUS), and by PRE2021-099351, MCIN/AEI+”FSE+”;GRC[ED431C 2021/53]: GAIN/Xunta de Galicia; TED2021-129245B-C21(PLAGEMIS): MCIN/AEI+”NextGenerationEU“/PRTR; PID2020-114635RB-I00(EXTRACompact): MCIN/AEI; PID2021-122554OB-C33 (OASSIS): MCIN/AEI+EU/ERDF A way of making Europe; PDC2021-120917-C21 (SIGTRANS): MCIN/AEI+“NextGenerationEU”/PRTR
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Compact representations of spatial hierarchical structures with support for topological queries

  • Fuentes Sepúlveda, José
  • Gatica, Diego
  • Navarro, Gonzalo
  • Rodríguez, M. Andrea
  • Seco, Diego
©2023 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/byncnd/ 4.0/. This version of the article has been accepted for publication in Future Generation Computer Systems. The Version of Record is available online at https:// doi.org/10.1016/j.ic.2023.105029, [Abstract]: Among different spatial data models, the topological model for spatial regions explicitly represents common boundaries. This model pursues the efficiency of topology-related queries and the elimination of data redundancy. This paper proposes several space-efficient data structures to support access to the topological representation of two-dimensional regions that are organized in a multi-granular or hierarchical structure, such as the political and administrative partition of a country. In the context of these hierarchies, we focus on queries that search for inclusion, disjointness, and adjacency between regions. The proposed structures build upon compact planar graph embeddings, which show to have a good trade-off between space and time., This work was funded by: ANID Millennium Science Initiative Program - Code ICN17_002 ; PAI grant PAI77190038 (1st author); PFCHA/Doctorado Nacional/2020-21201986 (2nd author); FONDECYT Grant 1-200038 (3rd author); CYTED grant 519RT0579 (4th and 5th authors); GRC: ED431C 2021/53 , partially funded by GAIN/Xunta de Galicia (5th author); TED2021-129245B-C21 (PLAGEMIS), PDC2021-120917-C21 (SIGTRANS), PID2020-114635RB-I00 (EXTRACompact) and PID2019-105221RB-C41 (MAGIST), partially funded by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR (5th author). An early partial version of this paper appeared in Proc. DCC 2021 [1] ., Xunta de Galicia; ED431C 2021/53, Chile. Agencia Nacional de Investigación y Desarrollo; ICN17_002, Chile. Agencia Nacional de Investigación y Desarrollo; PAI77190038, Chile. Ministerio de Educación; PFCHA/Doctorado Nacional/2020-21201986, Chile. Comisión Nacional de Investigación Científica y Tecnológica; 1-200038, Chile. Agencia Nacional de Investigación y Desarrollo; 519RT0579
RUC. Repositorio da Universidade da Coruña
Publicación 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
Publicación 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
Publicación 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
Publicación Contribución de congreso (ConferenceOutput)

Seamless Data Migration between Database Schemas with DAMI-Framework: An Empirical Study on Developer Experience

  • Ramos-Vidal, Delfina
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
  • Saavedra Places, Ángeles
  • Assunção, Wesley K.G.
Traballo presentado na: 29th International Conference on Evaluation and Assessment in Software Engineering (EASE 2025), Istanbul (Turkey), 2025., [Abstract]: Many businesses depend on legacy systems, which often use outdated technology that complicates maintenance and updates. Therefore, software modernization is essential, particularly data migration between different database schemas. Established methodologies, like model transformation and ETL tools, facilitate this migration. However, these methodologies require deep knowledge of database languages and both the source and target schemas. This necessity renders data migration an error-prone and cognitively demanding task. Our objective is to alleviate developers’ workloads during schema evolution by proposing DAMI-Framework. This framework incorporates a domain-specific language (DSL) and a parser to facilitate data migration between database schemas. DAMI-DSL simplifies schema mapping, while the parser automates SQL script generation. To evaluate DAMI-Framework, we conducted an empirical evaluation with 21 developers to assess their experiences using our DSL versus traditional SQL. The study allows us to measure their perceptions of the DSL properties and user experience. The participants praised DAMI-DSL for its readability and ease of use. The findings indicate that our framework has positive impact in data migration efforts compared to SQL scripts, by reducing the lines of code and characters required for the migration by 18.3% and 35.6%, respectively., 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); GRC: ED431C 2021/53, GAIN/Xunta de Galicia; TED2021-129245B-C21: MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR; PID2021-122554OB-C33: MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe; PID2022-141027NB-C21: MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe; PRE2021-099351: MCIN/AEI/10.13039/501100011033 and “FSE+Fondo Social Europeo Plus”., Xunta de Galicia; ED431G 2023/01, Xunta de Galicia; ED431C 2021/53