Buscar
Mostrando ítems 1-7 de 7
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes
(Springer, 2016-09-21)
[Abstract] For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when ...
GraCT: A Grammar Based Compressed Representation of Trajectories
(Springer, 2016-09-21)
[Abstract] We present a compressed data structure to store free trajectories of moving objects (ships over the sea, for example) allowing spatio-temporal queries. Our method, GraCT, uses a k2k2 -tree to store the absolute ...
Grammar compressed sequences with rank/select support
(Elsevier BV, 2016-10-14)
[Abstract] Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. Several recent applications need ...
Universal indexes for highly repetitive document collections
(Elsevier Ltd, 2016-11)
[Abstract] 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 ...
Aggregated 2D range queries on clustered points
(Elsevier Ltd, 2016-09)
[Abstract] Efficient processing of aggregated range queries on two-dimensional grids is a common requirement in information retrieval and data mining systems, for example in Geographic Information Systems and OLAP cubes. ...
Efficient Representation of Multidimensional Data over Hierarchical Domains
(Springer, 2016-09-21)
[Abstract] We consider the problem of representing multidimensional data where the domain of each dimension is organized hierarchically, and the queries require summary information at a different node in the hierarchy of ...
A succinct data structure for self-indexing ternary relations
(Elsevier BV, 2016-10-27)
[Abstract] The representation of binary relations has been intensively studied and many different theoretical and practical representations have been proposed to answer the usual queries in multiple domains. However, ternary ...