Laboratorio de Bases de Datos (LBD): Envíos recentes
Mostrando ítems 71-75 de 76
-
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 ... -
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 ... -
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. ... -
Parallel construction of wavelet trees on multicore architectures
(Springer U K, 2016-10-05)[Abstract] The wavelet tree has become a very useful data structure to efficiently represent and query large volumes of data in many different domains, from bioinformatics to geographic information systems. One problem ...