Publicacións nas que colabora con Gonzalo Navarro Badino (88)

2024

  1. Optimizing RPQs over a compact graph representation

    VLDB Journal, Vol. 33, Núm. 2, pp. 349-374

  2. Space & Time Efficient Leapfrog Triejoin

    Proceedings of the 7th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences and Systems, (GRADES) and Network Data Analytics, (NDA), GRADES-NDA 2024

  3. Space-efficient data structures for the inference of subsumption and disjointness relations

    Software - Practice and Experience

  4. Stronger compact representations of object trajectories

    Geo-Spatial Information Science

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

    Zenodo

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

    Zenodo

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

    ACM Transactions on Database Systems, Vol. 49, Núm. 2

  8. Worst-Case-Optimal Similarity Joins on Graph Databases

    Proceedings of the ACM on Management of Data, Vol. 2, Núm. 1, pp. 1-26

2023

  1. Compact representations of spatial hierarchical structures with support for topological queries

    Information and Computation, Vol. 292

  2. Evaluating Regular Path Queries on Compressed Adjacency Matrices

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. Faster compressed quadtrees

    Journal of Computer and System Sciences, Vol. 131, pp. 86-104

  4. Navigating planar topologies in near-optimal space and time

    Computational Geometry: Theory and Applications, Vol. 109

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

    Journal of Supercomputing, Vol. 79, Núm. 5, pp. 5643-5683

2022

  1. A practical succinct dynamic graph representation

    Information and Computation, Vol. 285

  2. Correction to: Graph Compression for Adjacency-Matrix Multiplication (SN Computer Science, (2022), 3, 3, (193), 10.1007/s42979-022-01084-2)

    SN Computer Science

  3. Datasets of Time- and Space-Efficient Regular Path Queries

    Zenodo

  4. Datasets of Time- and Space-Efficient Regular Path Queries

    Zenodo

  5. Efficient and compact representations of some non-canonical prefix-free codes

    Theoretical Computer Science, Vol. 907, pp. 11-25

  6. Graph Compression for Adjacency-Matrix Multiplication

    SN Computer Science, Vol. 3, Núm. 3

2021

  1. A Disk-Based Index for Trajectories with an In-Memory Compressed Cache

    Data Compression Conference Proceedings