Buscar
Mostrando ítems 1-6 de 6
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 ...
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 ...
Improved Compressed String Dictionaries
(ACM, 2019-11-03)
[Abstract] We introduce a new family of compressed data structures to efficiently store and query large string dictionaries in main memory. Our main technique is a combination of hierarchical Front-coding with ideas from ...
Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication
(IEEE Computer Society, 2018-03)
[Abstract] Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In ...
Worst-Case-Optimal Similarity Joins on Graph Databases
(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 ...