Pasar al contenido principal

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

PID2021-122554OB-C33

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2021
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDADE DA CORUÑA

Resultados relacionados

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

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

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

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

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

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

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)

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)

Local features: Enhancing variability modeling in software product lines

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

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)

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)

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

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

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 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