Repositorio Dspace

Listar Estructuras de datos por título

Listar Estructuras de datos por título

Ordenar por:Orden:Resultados:

  • Efficient Compression and Indexing of Trajectories 
    Rodríguez Brisaboa, Nieves; Gagie, Travis; Gómez Brandón, Adrián; Navarro, Gonzalo; R. Paramá, José (Springer, 2017)
    We present a new compressed representation of free trajec tories of moving objects. It combines a partial-sums-based structure that retrieves in constant time the position of the object at any instant, with a hierarchical ...
  • Efficient set operations over k2-trees 
    Rodríguez Brisaboa, Nieves; De Bernardo, Guillermo; Gutiérrez, Gilberto; Ladra, Susana; Penabad, Miguel R.; A. Troncoso, Brunny (2015 Data Compression Conference, 2015)
    k2-trees have been proved successful to represent in a very compact way different kinds of binary relations, such as web graphs, RDFs or raster data. In order to be a fully functional succinct representation for these ...
  • Scalable and Queryable Compressed Storage Structure for Raster Data 
    Ladra, Susana; Paramá, José R.; Silva-Coira, Fernando (The Computer Journal, 2017)
    Compact data structures are storage structures that combine a compressed represen- tation of the data and the access mechanisms for retrieving individual data without the need of decompressing from the beginning. The ...
  • Universal Indexes for Highly Repetitive Document Collections 
    Fariña, Antonio; Martínez-Prieto, Miguel Ángel; Navarro, Gonzalo; Claude, Francisco (Information Systems, 2016)
    Indexing highly repetitive collections has become a relevant problem with the emergence of large repositories of versioned documents, among other applications. These collections may reach huge sizes, but are formed mostly ...

Buscar en DSpace


Búsqueda avanzada

Listar

Mi cuenta