Pasar al contenido principal

EXPLOTACION ENRIQUECIDA DE TRAYECTORIAS CON ESTRUCTURAS DE DATOS COMPACTAS Y GIS

PID2020-114635RB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2020
Plan Estatal 2017-2020 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): 50
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 Artículo científico (JournalArticle)

ViQUF: De Novo Viral Quasispecies Reconstruction Using Unitig-Based Flow Networks

  • Freire, Borja
  • Ladra, Susana
  • Paramá, José R.
  • Salmela, Leena
This is the Accepted manuscript os the article; This version of the article has been accepted for publication, after peer review. The Version of Record is available online at: https://doi.org/10.1109/TCBB.2022.3190282., ViQUF is freely available at: https://github.com/borjaf696/ViQUF., [Abstract] During viral infection, intrahost mutation and recombination can lead to significant evolution, resulting in a population of viruses that harbor multiple haplotypes. The task of reconstructing these haplotypes from short-read sequencing data is called viral quasispecies assembly, and it can be categorized as a multiassembly problem. We consider the de novo version of the problem, where no reference is available. We present ViQUF, a de novo viral quasispecies assembler that addresses haplotype assembly and quantification. ViQUF obtains a first draft of the assembly graph from a de Bruijn graph. Then, solving a min-cost flow over a flow network built for each pair of adjacent vertices based on their paired-end information creates an approximate paired assembly graph with suggested frequency values as edge labels, which is the first frequency estimation. Then, original haplotypes are obtained through a greedy path reconstruction guided by a min-cost flow solution in the approximate paired assembly graph . ViQUF outputs the contigs with their frequency estimations. Results on real and simulated data show that ViQUF is at least four times faster using at most half of the memory than previous methods, while maintaining, and in some cases outperforming, the high quality of assembly and frequency estimation of overlap graph-based methodologies, which are known to be more accurate but slower than the de Bruijn graph-based approaches., This work has received funding from the EU H2020 under the Marie Sklodowska-Curie [GA 690941]. We wish to acknowledge the support received from the Centro de Investigación de Galicia “CITIC”, funded by Xunta de Galicia and the European Union (European Regional Development Fund- Galicia 2014-2020 Program), by grant ED431G 2019/01. This work was also supported by Xunta de Galicia/FEDER-UE under Grants [ED431C 2021/53; IG240.2020.1.185; IN852A 2018/14]; Ministerio de Ciencia e Innovación under Grants [TIN2016-78011-C4-1-R; FPU17/02742; PID2019-105221RB-C41; PID2020-114635RBI00]; and the Academy of Finland [grants 308030 and 323233 (LS)]. The authors also thank David Posada for his advice on viral evolution., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IG240.2020.1.185, Xunta de Galicia; IN852A 2018/14, Finlandia. Academy of Finland; 308030, Finlandia. Academy of Finland; 323233, https://github.com/borjaf696/ViQUF
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)

Two-Dimensional Block Trees

  • Brisaboa, Nieves R.
  • Gagie, Travis
  • Gómez-Brandón, Adrián
  • Navarro, Gonzalo
[Absctract]: The Block Tree is a data structure for representing repetitive sequences in compressed space, which reaches space comparable with that of Lempel–Ziv compression while retaining fast direct access to any position in the sequence. In this paper, we generalize Block Trees to two dimensions, in order to exploit repetitive patterns in the representation of images, matrices and other kinds of bidimensional data. We demonstrate the practicality of the two-dimensional Block Trees (2D-BTs) in representing the adjacency matrices of Web graphs, and raster images in GIS applications. For this purpose, we integrate our 2D-BT with the k2-tree—an efficient structure that exploits clustering and sparseness to compress adjacency matrices—so that it also exploits repetitive patterns. Our experiments show that this structure uses 60–80% of the space of the original k2-tree, while being 30% faster to three times slower when accessing cells., This work was supported by Centro de Investigación en TIC, as Research Center accredited by Galician University System, is funded by Xunta de Galicia, FEDER Galicia 2014-2020 80%, SXU 20% [grant number ED431G 2019/01 to N.R.B and A.G]; GAIN/Xunta de Galicia [grant number ED431C 2021/53 (GRC) to N.R.B and A.G]; Xunta de Galicia/FEDER-UE [grant numbers IN852D 2021/3 to N.R.B and A.G]; Ministerio de Ciencia e Innovación [grant numbers PID2020-114635RB-I00 and PDC2021-120917-C21 to N.R.B and A.G]; Fondo Nacional de Desarrollo Científico y Tecnológico [grant number 1-200038 to G.N., grant number 1171058 to T.G.]; Agencia Nacional de Investigación y Desarrollo (ANID) – Basal Funds, Chile [grant number FB0001 to T.G, A.G, and G.N]; and The Natural Sciences and Engineering Research Council Discovery Grant [grant number RGPIN-07185-2020 to T.G.]., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IN852D 2021/3, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1-200038, Chile. Agencia Nacional de Investigación y Desarrollo (ANID). Chile; FB0001, 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)

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 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 Artículo científico (JournalArticle)

Optimizing RPQs over a compact graph representation

  • Arroyuelo, Diego
  • Gómez-Brandón, Adrián
  • Hogan, Aidan
  • Navarro, Gonzalo
  • Rojas-Ledesma, Javiel
©2023 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-023-00811-2, [Absctract]: We propose techniques to evaluate regular path queries (RPQs) over labeled graphs (e.g., RDF). We apply a bit-parallel simulation of a Glushkov automaton representing the query over a ring: a compact wavelet-tree-based index of the graph. To the best of our knowledge, our approach is the first to evaluate RPQs over a compact representation of such graphs, where we show the key advantages of using Glushkov automata in this setting. Our scheme obtains optimal time, in terms of alternation complexity, for traversing the product graph. We further introduce various optimizations, such as the ability to process several automaton states and graph nodes/labels simultaneously, and to estimate relevant selectivities. Experiments show that our approach uses 3–5X less space, and is over 5 X faster, on average, than the next best state-of-the-art system for evaluating RPQs., This work was supported by ANID—Millennium Science Initiative Program—Code ICN17_002; Fondecyt Grant 1-230755; Fondecyt Grants 1221926 and 1-200038; Xunta de Galicia, FEDER Galicia 2014-2020 80%, SXU 20% Grant ED431G 2019/01; GAIN/Xunta de Galicia Grant ED431C 2021/53 (GRC); Xunta de Galicia/FEDER-UE Grant IN852D 2021/3; Ministerio de Ciencia e Innovación Grants PID2020-114635RB-I00 and PDC2021-120917-C21., Chile. Agencia Nacional de Investigación y Desarrollo; ICN17_002, 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); 1-221926, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IN852D 2021/3
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)

Faster compressed quadtrees

  • Bernardo, Guillermo de
  • Gagie, Travis
  • Ladra, Susana
  • Navarro, Gonzalo
  • 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.jcss.2022.09.001, Versión aceptada, An early partial version of this paper appeared in Proc. of the Data Compression Conference 2015., [Abstract]: Real-world point sets tend to be clustered, so using a machine word for each point is wasteful. In this paper we first show how a compact representation of quadtrees using O(1) bits per node can break this bound on clustered point sets, while offering efficient range searches. We then describe a new compact quadtree representation based on heavy-path decompositions, which supports queries faster than previous compact structures. We present experimental evidence showing that our structure is competitive in practice., Partially funded by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 690941. GdB and SL funded by MCIN/AEI/10.13039/501100011033 [grants PID2020-114635RB-I00 (EXTRACompact), PID2019-105221RB-C41 (MAGIST)], by MCIN/AEI/10.13039/501100011033, “NextGenerationEU/PRTR” [grants PDC2021-120917-C21 (SIGTRANS) , PDC2021-121239-C31 (FLATCITY-POC)], by GAIN/Xunta de Galicia [grant ED431C 2017/53 (GRC) ], and also supported by the Centro de Investigación de Galicia “CITIC”, funded by Xunta de Galicia , FEDER Galicia 2014-2020 80%, SXU 20% [grant ED431G 2019/01 (CSI) ]. TG funded by NSERC Discovery Grant RGPIN-07185-2020. GN and DS funded by ANID - Millennium Science Initiative Program - Code ICN17_002 , Chile. GN funded by FONDECYT Grant 1-200038 , Chile., Xunta de Galicia; ED431C 2017/53, Xunta de Galicia; ED431G 2019/01, Natural Sciences and Engineering Research Council of Canada; RGPIN-07185-2020, Chile. Agencia Nacional de Investigación y Desarrollo; ICN17_002, Chile. Comisión Nacional de Investigación Científica y Tecnológica; 1-200038
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Development of Digital Libraries with Software Product Line Engineering

  • Ramos-Vidal, Delfina
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
  • Saavedra Places, Ángeles
[Abstract]: Digital Libraries have become popular nowadays since important libraries all over the world started distributing their collections online, properly classified, and, in many cases, with access to the digital version of the resource. These programs have been beneficial to the general population as well as research groups in fields such as language and literature. Nonetheless, since their creation is a time-consuming and costly process, small organizations are forced to rely on obsolete or poorly designed software. However, most of the features, including the data model, are shared by this type of system, with minor variations depending on the type of resources to be handled. This article presents a Software Product Line (SPL) for the semi-automatic generation of Digital Libraries (DL). Our SPL allows developers to specify which DL features are required, which will define the data model variation and the generated source code. The specification is then transformed into a fully functional DL application with the specified features that is ready for deployment. We present the feature model, the SPL implementation, and a case study on three sample projects that enabled us to evaluate the resulting software, with a focus on development effort savings., Partially funded by: Xunta de Galicia GRC: ED431C 2021/53; MICIU/FEDER-UE, MAGIST: PID2019-105221RBC41; MICIU/FEDER-UE, EXTRACompact: PID2020-114635RB-I00; MIC IU/FEDER-UE BIZDEVOPSGLOBAL: RTI-2018-098309-B-C32; Xunta de Galicia/FEDER-UE, ConectaPeme, GEMA: IN852A 2018/14; MICIU/FEDER-UE, Red Aracne-Nodus, RED2018-102755-T; CITIC research centre funded by XUNTA and EU through the European Regional Development Fund- Galicia 2014–2020 Program, grant ED431G 2019/01., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IN852A 2018/14, Xunta de Galicia; ED431G 2019/01
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 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 Contribución de congreso (ConferenceOutput)

Efficient Multiscale Representations for Geographical Objects

  • Brisaboa, Nieves R.
  • Cortiñas, Alejandro
  • Gutiérrez-Asorey, Pablo
  • Varela Rodeiro, Tirso
  • Rodríguez Luaces, Miguel
The congress was held in Constance, Germany, April 28–29, [Abstract]: Maps need different representations of the same cartographic object in order to display it at several scale levels. When a user zooms in, the object should depict every detail as it is the main focus on the map. On the contrary, when the user zooms out, there is no need to display every single detail of the object as most would become as small as to be invisible. A common technique to speed up the display process is storing several representations for the same object at different scales. However, this technique raises redundancy, and therefore it increases space usage. This work aims at suppressing that redundancy by introducing four alternatives that use a unique representation for each cartographic object while still being able to retrieve simplified versions of them depending on the requested scale., This work was supported by the CITIC research center funded by Xunta/FEDER-UE 2014–2020 Program grant ED431G 2019/01. Partially funded by MCIU-AEI/ FEDER-UE [BIZDEVOPS: RTI2018-098309-B-C32]; by MICINN (PGE/ERDF) [EXTRA-Compact: PID2020-114635RB-I00; MAGIST: PID2019-105221RB-C41; SIGTRANS-UDC: PDC2021-120917-C21; FLATCITY-POC: PDC2021-121239-C31]; by Xunta de Galicia/FEDER-UE [GRC: ED431C 2021/53], 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)

Map algebra on raster datasets represented by compact data structures

  • Silva-Coira, Fernando
  • Paramá, José R.
  • Ladra, Susana
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: The increase in the size of data repositories has forced the design of new computing paradigms to be able to process large volumes of data in a reasonable amount of time. One of them is in-memory computing, which advocates storing all the data in main memory to avoid the disk I/O bottleneck. Compression is one of the key technologies for this approach. For raster data, a compact data structure, called (Formula presented.) -raster, have been recently been proposed. It compresses raster maps while still supporting fast retrieval of a given datum or a portion of the data directly from the compressed data. (Formula presented.) -raster's original work introduced several queries in which it was superior to competitors. However, to be used as the basis of an in-memory system for raster data, it is mandatory to demonstrate its efficiency when performing more complex operations such as the map algebra operators. In this work, we present the algorithms to run a set of these operators directly on (Formula presented.) -raster without a decompression procedure., This work was supported by the National Natural Science Foundation of China (Grant Nos. 31171944, 31640068), Anhui Provincial Natural Science Foundation (Grant No. 2019B319), Earmarked Fund for Anhui Science and Technology Major Project (202003b06020016). Information CITIC, Ministerio de Ciencia e Innovación, Grant/Award Numbers: PID2020-114635RB-I00; PDC2021-120917-C21; PDC2021-121239-C31; PID2019-105221RB-C41; TED2021-129245-C21; Xunta de Galicia, Grant/Award Numbers: ED431C 2021/53; IN852D 2021/3 (CO3)This work was partially supported by CITIC, 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). IN852D 2021/3(CO3): partially funded by UE, (ERDF), GAIN, convocatoria Conecta COVID. GRC: ED431C 2021/53: partially funded by GAIN/Xunta de Galicia. TED2021-129245B-C21; PDC2021-121239-C31; PDC2021-120917-C21: partially funded by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR. PID2020-114635RB-I00; PID2019-105221RB-C41: partially funded by MCIN/AEI/10.13039/501100011033. Funding for open access charge: Universidadeda Coruña/CISUG., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IN852D 2021/3 (CO3), National Natural Science Foundation of China; 31171944, National Natural Science Foundation of China; 31640068, Anhui Provincial Natural Science Foundation; 2019B319
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)

Improved structures to solve aggregated queries for trips over public transportation networks

  • Brisaboa, Nieves R.
  • Fariña, Antonio
  • Galaktionov, Daniil
  • Varela Rodeiro, Tirso
  • Rodríguez, M. Andrea
This is the Accepted Manuscript. This version of the article has been accepted for publication after peer review. The Version of Record is available online at https://doi.org/10.1016/j.ins.2021.10.079., [Abstract]: We address the problem of storing and analyzing large datasets of passenger trips over public transportation networks that are of interest to network administrators trying to balance transportation offers (e.g., frequency of vehicles) according to the historical demand. We exploit the fact that all passenger trips made within the same vehicle share the same trajectories to reduce their redundancy and provide a representation, based on well-known compact data structures, that not only reduces the space requirements of the original passenger’s trajectories but also efficiently supports querying. Our solution uses two complementary representations: T-Matrices which excels at querying the aggregated network load, and TTCTR which represents all passenger trips and aims at counting the trips following a given pattern (i.e., how many passengers started/ended a trip at a given location or moved from a given location to another). In addition, we propose XCTR, a variant of TTCTR, which efficiently answers a wider range of queries at the cost of a moderate performance loss for some queries and some space overhead. Overall, our representation can handle a dataset of ten million trips within approximately 65% of its original size while supporting a wide range of queries in the order of microseconds., This work was supported by the CITIC research center funded by Xunta/FEDER-UE 2014-2020 Program grant ED431G 2019/01. The Spanish group is partially funded by MCIU-AEI/ FEDER-UE [Datos 4.0: TIN2016-78011-C4-1-R, BIZDEVOPS: RTI2018-098309-B-C32, STEPS: RTC-2017-5908-7]; by MICINN (PGE/ERDF) [EXTRACompact: PID2020-114635RB-I00; SIGTRANS-UDC: PDC2021-120917-C21]; by Xunta de Galicia/FEDERUE [CSI: ED431G 2019/01; GRC: ED431C 2021/53; LEMSI: IG240.2020.1.185]; by Xunta de Galicia/GAIN [Innovapeme: IN848D-2017-2350417]; by Xunta de Galicia Conecta-Peme 2018 [Gema: IN852A 2018/14]; and by FPI Program [BES-2017-081390] (T.V.R.). M. A. Rodríguez is partially funded by Millennium Institute for Foundational Research on Data, Millennium Science Initiative Program - Code ICN17 002., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IG240.2020.1.185, Xunta de Galicia; IN848D-2017-2350417, Xunta de Galicia; IN852A 2018/14, Chile. Instituto Milenio Fundamentos de los Datos, IMFD; 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 Contribución de congreso (ConferenceOutput)

Succinct Data Structures in the Realm of GIS

  • Brisaboa, Nieves R.
  • Gutiérrez-Asorey, Pablo
  • Rodríguez Luaces, Miguel
  • Varela Rodeiro, Tirso
Presented at the 4th XoveTIC Conference, A Coruña, Spain, 7–8 October 2021., [Abstract] Geographic Information Systems (GIS) have spread all over our technological environment in the last decade. The inclusion of GPS technologies in everyday portable devices along with the creation of massive shareable geographical data banks has boosted the rise of geoinformatics. Despite the technological maturity of this field, there are still relevant research challenges concerning efficient information storage and representation. One of the most powerful techniques to tackle these issues is designing new Succinct Data Structures (SDS). These structures are defined by three main characteristics: they use a compact representation of the data, they have self-index properties and, as a consequence, they do not need decompression to process the enclosed information. Thus, SDS are not only capable of storing geographical data using as little space as possible, but they can also solve queries efficiently without any previous decompression. This work introduces how SDS can be successfully applied in the GIS context through several novel approaches and practical use cases., This work is partially funded by the CITIC research center funded by Xunta/FEDER-UE 2014-2020 Program, ED431G 2019/01. MICINN(PGE/ERDF) [EXTRA-Compact: PID2020-114635RB-I00], Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Memory-Efficient Assembly Using Flye

  • Freire, Borja
  • Ladra, Susana
  • Paramá, José R.
This is the Accepted manuscript os the article; This version of the article has been accepted for publication, after peer review. The Version of Record is available online at: https://doi.org/10.1109/TCBB.2021.3108843 ., [Abstract]: In the past decade, next-generation sequencing (NGS) enabled the generation of genomic data in a cost-effective, high-throughput manner. The most recent third-generation sequencing technologies produce longer reads; however, their error rates are much higher, which complicates the assembly process. This generates time- and space- demanding long-read assemblers. Moreover, the advances in these technologies have allowed portable and real-time DNA sequencing, enabling in-field analysis. In these scenarios, it becomes crucial to have more efficient solutions that can be executed in computers or mobile devices with minimum hardware requirements. We re-implemented an existing assembler devoted for long reads, more concretely Flye, using compressed data structures. We then compare our version with the original software using real datasets, and evaluate their performance in terms of memory requirements, execution speed, and energy consumption. The assembly results are not affected, as the core of the algorithm is maintained, but the usage of advanced compact data structures leads to improvements in memory consumption that range from 22% to 47% less space, and in the processing time, which range from being on a par up to decreases of 25%. These improvements also cause reductions in energy consumption of around 3–8%, with some datasets obtaining decreases up to 26%., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; IG240.2020.1.185, Xunta de Galicia; IN852A 2018/14, This research has received funding from: the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie [grant agreement No 690941]; CITIC Research Center, funded by “Consellería de Cultura, Educaci ón e Universidade from Xunta de Galicia”, supported in an 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/FEDER-UE under Grants [IG240.2020.1.185; IN852A 2018/14] and Ministerio de Ciencia e Innovación under Grants [TIN2016-78011-C4-1-R; PID2019-105221RB-C41; PID2020-114635RB- I00; FPU17/02742].
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Indexing and Retrieval of Scores by Humming based on Extracted Features

  • Romero-Velo, Hilda
  • Ladra, Susana
  • Paramá, José R.
  • Silva-Coira, Fernando
Cursos e Congresos, C-155, [Abstract] In order to be able to conduct searches over large collections of music scores with queries provided in audio format, this article considers recent literature in the field and proposes an implementation to extract specific features from music pieces. Afterwards, we index those features using modern Lempel-Ziv (LZ)-based data structures. These data structures take advantage of the intrinsic repetitiveness within music to reduce space consumption and, at the same time, to index the information optimizing the search time per query. Furthermore, taking advantage of this property-based representation framework, which does not depend on the way the music is portrayed, we enable the possibility to perform melodic searches by simply providing a query audio. This research branch is known as “query by humming” and has commonly been applied to audio sources. A preliminary study for its application in other forms of music representation is presented in this research., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53, Work funded by: 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), 80% through FEDER funds, Galicia Operational Programme FEDER 2014-2020, and the remaining 20% by the “Secretaría Xeral de Universidades” (Grant ED431G 2019/01), Xunta de Galicia/FEDERUE [ED431C 2021/53]; Ministry of Science and Innovation [PID2020-114635RBI00; PDC2021-120917-C21; PDC2021-121239-C31; PID2019-105221RB-C41; TED2021- 129245-C21]
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 Tesis doctoral (DoctoralThesis)

Development of efficient De Bruijn graph-based algorithms for genome assembly

  • Freire, Borja
[Abstract] During the last two decades, thanks to the development of new sequencing techniques, the study of the genome has become very popular in order to discover the genetic variation present in both humans and other organisms. The predominant mode of genome analysis is through the assembly of reads in one or multiple chains for as long as possible. The most traditional way of assembly is the one that involves reads from a single genome. In this field, in the last decade, third-generation readings have emerged with new challenges for which there are no efficient solutions. The first contribution that has been made in this thesis is Compact-Flye, a tool for the efficient assembly of third-generation reads on the Flye algorithm. This tool is based on the ingenious use of compact data structures to improve typical assembly steps such as counting and indexing k-mers. Apart from the assembly of a genome, there are techniques that seek to assemble all the genomes contained in a given sample. This assembly is known as multiple sequence assembly or haplotype reconstruction, a subject also treated in this thesis. Our first approach to solving this has been viaDBG, which is the first solution based on de Bruijn graphs that offers results comparable to current techniques in viral genome assembly while maintaining the efficiency of these graphs. Our second contribution is ViQUF, which is a natural improvement on its predecessor. ViQUF completely changes the algorithm of viaDBG but continues to be based on the same structures, although with some variations that allow it not only to improve results in terms of time and quality, but also to provide additionalinformation such as an estimate of the relative presence of each species in the sample., [Resumen] Durante las últimas dos décadas, gracias al desarrollo de nuevas técnias secuenciación, el estudio del genoma ha ganado mucha popularidad de cara a conocer la variación genética presente tanto seres humanos como otros organismos. El modo predominante de análisis del genoma es a través del ensamblaje de lecturas en una o múltiples cadenas lo más largas posibles. La manera más tradicional de ensamblaje es el que implica lecturas provenientes de un solo genoma. En este campo, en la última década han surgido las lecturas de tercera generación con nuevos retos para los que no existen soluciones eficientes. La primera aportación que se ha realizado en esta tesis es Compact-Flye una herramienta para el ensamblaje eficiente de lecturas de tercera generación sobre el algoritmo Flye. Esta herramienta está basada en el uso igenioso de estructuras compactas de datos para mejorar etapas típicas del ensamblaje como el conteo e indexación de k-mers. Al margen del ensamblaje de un genoma existen técnicas que buscan ensamblar todos los genomas contenidos en una muestra determinada. Este ensamblaje es conocido como ensamblaje múltiple de secuencias o reconstrucción de haplotipos, tema también tratado en esta tesis. Nuestra primera aproximación para la resolución de este ha sido viaDBG, que es la primera solución basada en grafos de de Bruijn que ofrece resultados comparables a las técnicas vigentes en ensamblaje de genomas víricos, mientras que mantiene la eficiencia de estos grafos. Nuestra segunda aportación es ViQUF, que es una mejora natural de su predecesor. ViQUF cambia totalmente la algoritmia de viaDBG, pero sigue cimentándose en las mismas estructuras aunque con alguna variación que le permite no solo mejorar resultados en tiempo y calidad. Sino que además le permite aportar más información como estimaciones relativa de cada especie en la muestra., [Resumo] Durante as dúas últimas décadas, grazas ao desenvolvemento de novas técnicas de secuenciación, o estudo do xenoma fíxose moi popular para descubrir a variación xenética presente tanto nos humanos como noutros organismos. O modo predominante de análise do xenoma é a través da ensamblaxe de lecturas nunha ou varias cadeas o maior tempo posible. A forma máis tradicional de ensamblar é a que implica lecturas dun só xenoma. Neste campo, na última década xurdiron lecturas de terceira xeración con novos retos para os que non existen solucións eficientes. A primeira contribución que se fixo nesta tese é Compact-Flye, unha ferramenta para a montaxe eficiente de lecturas de terceira xeración sobre o algoritmo Flye. Esta ferramenta baséase no uso intelixente de estruturas de datos compactas para mellorar os pasos típicos de montaxe, como contar e indexar k-mers. Ademais da montaxe dun xenoma, existen técnicas que buscan ensamblar todos os xenomas contidos nunha determinada mostra. Este conxunto coñécese como conxunto de secuencias múltiples ou reconstrución de haplotipos, tema tamén tratado nesta tesis. O noso primeiro enfoque para resolver isto foi viaDBG, que é a primeira solución baseada en gráficos de Bruijn que ofrece resultados comparables ás técnicas actuais de ensamblaxe de xenoma viral, mantendo a eficiencia destes gráficos. A nosa segunda incorporación é ViQUF, que é unha mellora natural con respecto ao seu predecesor. ViQUF cambia completamente o algoritmo de viaDBG pero segue baseándose nas mesmas estruturas, aínda que con algunha variación que lle permite non só mellorar os resultados en tempo e calidade. Pero tamén permite achegar máis información como estimacións relativas de cada especie da mostra., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IG240.2020.1.185, Xunta de Galicia; IN852A 2018/14, Quiero agradecer al Centro de Investigación de Galicia “CITIC”, financiado por la Xunta de Galicia y la Unión Europea (European Regional Development Fund- Galicia 2014-2020 Program), con la beca ED431G 2019/01. También agradecer a la Xunta de Galicia/FEDER-UE que ha financiado esta tesis a través de las becas [ED431C 2021/53; IG240.2020.1.185; IN852A 2018/14]; al Ministerio de Ciencia e Innovación con las becas [TIN2016- 78011-C4-1-R; FPU17/02742; PID2019-105221RB-C41; PID2020-114635RB-I00]; y a la academia de Finlandia [grants 308030 and 323233 (LS)].
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

A practical succinct dynamic graph representation

  • Coimbra, Miguel E.
  • Hrotkó, Joana
  • Francisco, Alexandre P.
  • Russo, Luís M.S.
  • Bernardo, Guillermo de
  • Ladra, Susana
  • Navarro, Gonzalo
©2022 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.2021.104862, [Abstract]: We address the problem of representing dynamic graphs using k2-trees. The k2-tree data structure is one of the succinct data structures proposed for representing static graphs, and binary relations in general. It relies on compact representations of bit vectors. Hence, by relying on compact representations of dynamic bit vectors, we can also represent dynamic graphs. However, this approach suffers of a well known bottleneck in compressed dynamic indexing. In this paper we present a k2-tree based implementation which follows instead the ideas by Munro et al. (PODS 2015) to circumvent this bottleneck. We present two dynamic graph k2-tree implementations, one as a standalone implementation and another as a C++ library. The library includes efficient edge and neighbourhood iterators, as well as some illustrative algorithms. Our experimental results show that these implementations are competitive in practice., This work was supported by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie [grant agreement No. 690941 ], namely while the first, third and fourth authors were visiting either the University of Chile or Enxenio SL. This work was partially funded by Fundação para a Ciência e a Tecnologia (FCT) [grants PTDC/CCI-BIO/29676/2017, PTDC/CPO-CPO/28495/2017, CMUP-ERI/TIC/0046/2014, UIDB/50021/2020 ], by MCIN-AEI/10.13039/501100011033 (PGE and ERDF) [grants RTC-2017-5908-7, PID2019-105221RB-C41, PID2020-114635RB-I00 ], by MCIN-AEI “NextGenerationEU”/PRTR [grants PDC2021-120917-C21, PDC2021-121239-C31 ], by Xunta de Galicia /GAIN (co-funded by ERDF) [grant ED431C 2021/53 ], and by ANID - Millennium Science Initiative Program - Code ICN17_002 . We also wish to acknowledge the support received from the Centro de Investigación de Galicia “CITIC”, funded by Xunta de Galicia , FEDER Galicia 2014-2020 80%, SXU 20% [grant ED431G 2019/01 ]., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED431G 2019/01, Portugal. Fundação para a Ciência e a Tecnologia; PTDC/CCI-BIO/29676/2017, Portugal. Fundação para a Ciência e a Tecnologia; PTDC/CPO-CPO/28495/2017, Portugal. Fundação para a Ciência e a Tecnologia; CMUP-ERI/TIC/0046/2014, Portugal. Fundação para a Ciência e a Tecnologia; UIDB/50021/2020, Chile. Agencia Nacional de Investigacion y Desarrollo; ICN17_002
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

SIGTRANS: Geographical Information System for the analysis and management of public TRANSport

  • Gutiérrez-Asorey, Pablo
  • Brisaboa, Nieves R.
  • Varela Rodeiro, Tirso
The conference was held in A Coruña, Spain. 5-6 October 2022, [Abstract]: Our project is aimed at the creation of SIGTRANS, a tool focused on addressing the need of efficiently storing and analyzing the vast amount of data related to the use of public transport networks. This is a highly relevant research topic given the changes urban mobility is experiencing, including but not limited to those motivated by climate change. We will provide transport authorities and operators with a system, combining the use of GIS technologies, compact data structures and advanced algorithms, to facilitate the exploration and exploitation of the available data. This data refers to both the offer in terms of infrastructure and mobility services available for the citizens, and the demand (that is, the use citizens are expecting out of these services). The analysis of this data will then serve as the foundation for further improvements to public transport services., This work was supported by the CITIC research center funded by Xunta de Galicia, FEDER Galicia 2014-2020 80%, SXU 20% [ED431G 2019/01 (CSI)]; MCIN/ AEI/10.13039/501100011033 [PID2020-114635RBI00], [PDC2021-120917-C21]; by GAIN/Xunta de Galicia [ED431C 2021/53] GRC and by Xunta de Galicia [ED481A/2021-183], Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED481A/2021-183
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Herramienta para la visualización de la movilidad durante la pandemia

  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
Publicado en Actas de las XXV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2021). Las XXV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2021) se han celebrado en Málaga del 22 al 24 de septiembre de 2021, como parte de las Jornadas SISTEDES, parte a su vez del VI Congreso Español de Informática (CEDI 20/21)., [Resumen]: En este artículo presentamos una herramienta prototipo desarrollada entre los meses de mayo a julio del 2020, durante la situación de pandemia por el COVID-19, para mostrar la información de movilidad proporcionada por el gobierno. La herramienta pretende ser una prueba de concepto de aplicación ligera de análisis de datos espaciales, y fruto de este desarrollo surgieron varias ideas que se están llevando a cabo en la actualidad, y una nueva línea de investigación relacionada con la generación ágil de aplicaciones de mapas con indicadores gráficos mediante un lenguaje específico de dominio. Describimos aquí la motivación, el diseño de la herramienta, y el producto desarrollado., Este trabajo ha sido parcialmente financiado por el CITIC (programa Xunta/FEDER-UE 2014-2020 [ED431G 2019/01]), MICIU (PGE/ERDF) [Ma- GIST: PID2019-105221RB-C41; Datos 4.0: TIN2016-78011-C4-1-R]; MICINN (PGE/ERDF) [EXTRA-Compact: PID2020-114635RB-I00], y por el programa FPI [BES-2017-081390]., Xunta de Galicia; ED431G 2019/01
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 Artículo científico (JournalArticle)

Compressed and queryable self-indexes for RDF archives

  • Cerdeira-Pena, Ana
  • Bernardo, Guillermo de
  • Fariña, Antonio
  • Fernández, Javier D.
  • Martínez-Prieto, Miguel A.
This version of the article has been accepted for publication, after peer review and is subject to Knowledge and Information Systems , 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/s10115-023-01967-7, [Abstract]: RDF compression and querying are consolidated topics in the Web of Data, with a plethora of solutions to efficiently store and query static datasets. However, as RDF data changes along time, it becomes necessary to keep different versions of RDF datasets, in what is called an RDF archive. For large RDF datasets, naive techniques to store these versions lead to significant scalability problems. In this paper, we present v-RDF-SI, one of the first RDF archiving solutions that aim at joining both compression and fast querying. In v-RDF-SI, we extend existing RDF representations based on compact data structures to provide efficient support of version-based queries in compressed space. We present two implementations of v-RDF-SI, named v-RDFCSA and v-HDT, based, respectively, on RDFCSA (an RDF self-index) and HDT (a W3C-supported compressed RDF representation). We experimentally evaluate v-RDF-SI over a public benchmark named BEAR, showing that v-RDF-SI drastically reduces space requirements, being up to 40 times smaller than the baselines provided by BEAR, and 4 times smaller than alternatives based on compact data structures, while yielding significantly faster query times in most cases. On average, the fastest variants of v-RDF-SI outperform the alternatives by almost an order of magnitude., The first three co-authors are members of the CITIC, which, as Research Center accredited by the Galician University System, is funded by Consellería de Cultura, Educación e Universidades from Xunta de Galicia, supported in an 80% through ERDF Funds, ERDF Operational Programme Galicia 2014–2020, and the remaining 20% by Secretaría Xeral de Universidades [Grant ED431G 2019/01]. The Spanish group is also funded by Xunta de Galicia/FEDER-UE [ED431C 2021/53]; by MICINN [Magist: PID2019-105221RB-C41; FLATCity-POC: PDC2021-121239-C31; SIGTRANS: PDC2021-120917-C21; EXTRA-Compact: PID2020-114635RB-I00; PID2019-105221RB-C41]; by MCIU-AEI/FEDER-UE [BIZDEVOPS: RTI2018-098309-B-C32]; and by Xunta de Galicia/Igape/IG240.2020.1.185., 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)

Utilización de estructuras compactas para la generalización cartográfica de información geográfica vectorial

  • Brisaboa, Nieves R.
  • Cortiñas, Alejandro
  • Gutiérrez-Asorey, Pablo
  • Rodríguez Luaces, Miguel
  • Varela Rodeiro, Tirso
Publicado en Actas de las XXV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2021). Las XXV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2021) se han celebrado en Málaga del 22 al 24 de septiembre de 2021, como parte de las Jornadas SISTEDES, parte a su vez del VI Congreso Español de Informática (CEDI 20/21)., [Resumen]: A pesar de la madurez tecnológica de los Sistemas de Información Geográfica, todavía existen retos de investigación relevantes en el campo relacionados con las problemáticas del almacenamiento y representación eficientes de la información. En este trabajo presentamos un proyecto de investigación en curso centrado en el desarrollo de nuevas estructuras de datos para almacenar información geográfica para contextos en los que se espera que se genere una cantidad de datos inmensa., Este trabajo ha sido parcialmente financiado por el CITIC (programa Xunta/FEDER-UE 2014-2020 [ED431G 2019/01]), MICIU (PGE/ERDF) [Ma- GIST: PID2019-105221RB-C41; Datos 4.0: TIN2016-78011-C4-1-R]; MICINN (PGE/ERDF) [EXTRA-Compact: PID2020-114635RB-I00], y por el programa FPI [BES-2017-081390], Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

A Compact Representation of Indoor Trajectories

  • Fariña, Antonio
  • Gutiérrez-Asorey, Pablo
  • Ladra, Susana
  • Penabad, Miguel R.
  • Varela Rodeiro, Tirso
[Abstract]: We present a system that combines indoor positioning with a compression algorithm for trajectories in the context of a nursing home. Our aim is to gather and effectively represent the location of the residents and caregivers along time, while allowing for efficient access to those data. We briefly show the system architecture that enables the automatic tracking of user’s movements and consequently the gathering of their locations. Then, we present indRep, our compact representation to handle positioning data using grammar-based compression, and provide two basic operations that enable pseudo-random access to the data. Finally, we include experiments that show that indRep is competitive with well-know general-purpose compressors in terms of compression effectiveness and also provides fast access to the compressed data. We expect both features would enable exploitation functionalities even in computers with rather low computational resources., Partially funded by the CITIC research center funded by Xunta/FEDER-UE 2014-2020 Program, grant ED431G 2019/01. MICIU(PGE/ERDF) [MaGIST: PID2019-105221RB-C41; Datos 4.0: TIN2016-78011-C4-1- R; STEPS: RTC-2017-5908-7; BIZDEVOPS: RTI2018-098309-B-C32]. MICINN(PGE/ERDF) [EXTRA-Compact: PID2020-114635RB-I00]. Xunta/GAIN(ERDF) [CEDCOVID: COV20/00604; GRC: ED431C 2021/53] and by FPI Program [BES-2017-081390]., 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)

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 Contribución de congreso (ConferenceOutput)

Re-ingeniería y Modernización de la Biblioteca Virtual Galega

  • Ramos-Vidal, Delfina
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
  • Saavedra Places, Ángeles
Publicado en Actas de las XXV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2021). Las XXV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2021) se han celebrado en Málaga del 22 al 24 de septiembre de 2021, como parte de las Jornadas SISTEDES, parte a su vez del VI Congreso Español de Informática (CEDI 20/21)., [Resumen]: La Biblioteca Virtual Galega (BVG) es una biblioteca digital de referencia en literatura gallega de todos los tiempos, para el público general y especialmente para centros de educación de enseñanza obligatoria de la comunidad. Esta plataforma almacena y da acceso a información bibliográfica de autores clásicos y actuales, as+AO0 como información multimedia correspondiente a ediciones digitales de sus obras. En este artículo se presenta el proyecto de re-ingeniería y modernización de esta biblioteca digital (desarrollada en 2002) utilizando una línea de producto software para la generación de bibliotecas digitales desarrollada por investigadores del Laboratorio de Bases de Datos (LBD)., Parcialmente financiado por: MICIU / FEDER-UE: MAGIST (PID2019-105221RB- C41), EXTRACompact (PID2020-114635RB-I00), Red Aracne-Nodus (RED2018- 102755-T), y BIZDEVOPSGLOBAL (RTI-2018-098309-B-C32); Xunta de Galicia / FEDER-UE, ConectaPeme, GEMA (IN852A 2018/14), GRC (ED431C 2017/58); MINECO-AEI / FEDER-UE Datos 4.0 (TIN2016-78011-C4-1-R) y Velocity (TIN2016-77158-C4-3-R); centro de investigación CITIC financiado por la Xunta y la UE a través del Fondo Europeo de Desarrollo Regional - Programa Galicia 2014-2020 (ED431G 2019/01)., Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; IN852A 2018/14
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Tool for SPARQL Querying over Compact RDF Representations

  • Ramos-Vidal, Delfina
  • Bernardo, Guillermo de
Presented at the 4th XoveTIC Conference, A Coruña, Spain, 7–8 October 2021., [Abstract] We present an architecture for the efficient storing and querying of large RDF datasets. Our approach seeks to store RDF datasets in very little space while offering complete SPARQL functionality. To achieve this, our proposal was built over HDT, an RDF serialization framework, and its interaction with the Jena query engine. We propose a set of modifications to this framework in order to incorporate a range of space-efficient compact data structures for data storage and access, while using high-level capabilities to answer more complicated SPARQL queries. As a result, our approach provides a standard mechanism for using low-level data structures in complicated query situations requiring SPARQL searches, which are typically not supported by current solutions., This research was funded by Xunta de Galicia/FEDER grant ED431G 2019/01, Xunta de Galicia/FEDER-UE grant IN852A 2018/14; Ministerio de Ciencia, Innovación y Universidades grants [TIN2016-78011-C4-1-R; PID2019-105221RB-C41]; Consellería de Cultura, Educación e Universidade/Consellería de Economía, Empresa e Innovación/GAIN/Xunta de Galicia grant ED431C 2021/53; and by MICINN (PGE/ERDF) grant PID2020-114635RB-I00., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; IN852A 2018/14, Xunta de Galicia; ED431C 2021/53
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 Artículo científico (JournalArticle)

Combining Multiple Granularity Variability in a Software Product Line Approach for Web Engineering

  • Horcas Aguilera, José Miguel
  • Cortiñas, Alejandro
  • Fuentes, Lidia
  • Rodríguez Luaces, Miguel
[Abstract] Context: Web engineering involves managing a high diversity of artifacts implemented in different languages and with different levels of granularity. Technological companies usually implement variable artifacts of Software Product Lines (SPLs) using annotations, being reluctant to adopt hybrid, often complex, approaches combining composition and annotations despite their benefits. Objective: This paper proposes a combined approach to support fine and coarse-grained variability for web artifacts. The proposal allows web developers to continue using annotations to handle fine-grained variability for those artifacts whose variability is very difficult to implement with a composition-based approach, but obtaining the advantages of the composition-based approach for the coarse-grained variable artifacts. Methods: A combined approach based on feature modeling that integrates annotations into a generic composition-based approach. We propose the definition of compositional and annotative variation points with custom-defined semantics, which is resolved by a scaffolding-based derivation engine. The approach is evaluated on a real-world web-based SPL by applying a set of variability metrics, as well as discussing its quality criteria in comparison with annotations, compositional, and combined existing approaches. Results: Our approach effectively handles both fine and coarse-grained variability. The mapping between the feature model and the web artifacts promotes the traceability of the features and the uniformity of the variation points regardless of the granularity of the web artifacts. Conclusions: Using well-known techniques of SPLs from an architectural point of view, such as feature modeling, can improve the design and maintenance of variable web artifacts without the need of introducing complex approaches for implementing the underlying variability., The work of the authors from the Universidad de Málaga is supported by the projects Magic P12-TIC1814 (post-doctoral research grant), MEDEA RTI2018-099213-B-I00 (co-financed by FEDER funds), Rhea P18-FR-1081 (MCI/AEI/FEDER, UE), LEIA UMA18-FEDERIA-157, TASOVA MCIU-AEI TIN2017-90644-REDT and, European Union’s H2020 research and innovation program under grant agreement DAEMON 101017109. The work of the authors from the Universidade da Coruña has been funded by MCIN/AEI/10.13039/501100011033, NextGenerationEU/PRTR, FLATCITY-POC: PDC2021-121239-C31 ; MCIN/AEI/10.13039/501100011033 EXTRACompact: PID2020-114635RB-I00 ; GAIN/Xunta de Galicia/ERDF CEDCOVID: COV20/00604 ; Xunta de Galicia/FEDER-UE GRC: ED431C 2021/53 ; MICIU/FEDER-UE BIZDEVOPSGLOBAL: RTI-2018-098309-B-C32 ; MCIN/AEI/10.13039/501100011033 MAGIST: PID2019-105221RB-C41, Junta de Andalucía; P12-TIC-1814, Universidad de Málaga; UMA18-FEDERIA-157, Xunta de Galicia; COV20/00604, Xunta de Galicia; ED431C 2021/53, Junta de Andalucía; P18-FR-1081
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)

Improving the Customization of Software Product Lines through the Definition of Local Features

  • Castro, David de
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
  • Saavedra Places, Ángeles
Traballo presentado en: SPLC '22: 26th ACM International Systems and Software Product Line Conference, Graz, Austria, September 12 - 16, 2022. © Author | ACM 2022. 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 2022, https://doi.org/10.1145/3546932.3547006, [Abstract]: Variability in software product lines (SPL) is mostly described with feature models. In basic feature models, the selection of a feature for a particular product determines whether or not the feature is present in the product in a global manner. Even though there are cardinality-based feature models that allow a subset of features to be specified a number of times for each product, it is not possible to customize each instance of the feature with specific details for different elements of the product. Some SPLs integrate model transformations and use domain specific languages to describe elements of the application that cannot be described using features (for example, the definition of the data model for a particular product). In this context, a stakeholder may require some features to be applied to some elements of the data model, but not globally (for example, not every entity in the data model may require an edition form). However, current feature models do not allow the stakeholder to specify this information. In this paper, we propose a solution that solves this problem using domain-specific languages. In addition to defining global features for the entire application, our proposal allows the stakeholder to define local features that are specific to some elements such as parts of the application or specific entities of the data model and, using the DSL to define the product, those local features can be assigned to these elements or entities. This specification of the scope of application of features opens the door to a higher degree of customization of the generated products, thus improving their quality., Partly funded by: MCIN/AEI/10.13039/501100011033, NextGenerationEU/PRTR, FLATCITY-POC: PDC2021-121239-C31; MCIN/AEI/10.13039/501100011033 EXTRACompact: PID2020-114635RB-I00; GAIN/Xunta de Galicia/ERDF CEDCOVID: COV20/00604; Xunta de Galicia/FEDER-UE GRC: ED431C 2021/53; MICIU/FEDER-UE BIZDEVOPSGLOBAL: RTI-2018-098309-B-C32; MCIN/AEI/10.13039/501100011033 MAGIST: PID2019-105221RB-C41., Xunta de Galicia; COV20/00604, 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 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)

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