Laboratorio de Bases de Datos (LBD): Envíos recientes

Mostrando ítems 6-10 de 76

    • Microservice-oriented platform for internet of big data analytics: A proof of concept 

      Li, Zheng; Seco, Diego; Sánchez Rodríguez, Alexis Eloy (MDPI AG, 2019-03-01)
      [Abstract]: The ubiquitous Internet of Things (IoT) devices nowadays are generating various and numerous data from everywhere at any time. Since it is not always necessary to centralize and analyze IoT data cumulatively ...

    • A Novel Two-Phase Approach to Forest Harvesting Optimization Using Cable Logging 

      Rey, Carlos; Sandoval, Simón; Cabrera-Vives, Guillermo; Seco, Diego; Cerulo, Pierluigi; Li, Zheng (Multidisciplinary Digital Publishing Institute (MDPI), 2023-11)
      [Abstract]: Timber extraction is a vital process in forest harvesting, particularly in areas with high slopes where timber harvesting methods are not feasible. In such cases, logging towers employing extraction cables are ...

    • Worst-Case-Optimal Similarity Joins on Graph Databases 

      Arroyuelo, Diego; Bustos, Benjamin; Gómez-Brandón, Adrián; Hogan, Aidan; Navarro, Gonzalo; Reutter, Juan (Association for Computing Machinery (ACM), 2024-03-06)
      [Absctract]: We extend the concept of worst-case optimal equijoins in graph databases to the case where some nodes are required to be within the k-nearest neighbors (kNN) of others under some similarity function. We model ...

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

      Quijada Fuentes, Carlos; Rodríguez, M. Andrea; Seco, Diego (Elsevier Ltd, 2024-11)
      [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 ...

    • 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 (Association for Computing Machinery (ACM), 2024-03-23)
      [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 ...