Buscar
Mostrando ítems 1-10 de 16
GraCT: A Grammar-based Compressed Index for Trajectory Data
(Elsevier Ltd, 2019)
[Abstract]: We introduce a compressed data structure for the storage of free trajectories of moving objects that efficiently supports various spatio-temporal queries. Our structure, dubbed GraCT, stores the absolute positions ...
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. ...
Space/time-efficient RDF stores based on circular suffix sorting
(Springer Nature, 2023-03)
[Abstract]: The resource description framework (RDF) has gained popularity as a format for the standardized publication and exchange of information in the Web of Data. In this paper, we introduce RDFCSA, a compressed ...
Extending general compact querieable representations to GIS applications
(Elsevier, 2020-01)
[Abstract]: The raster model is commonly used for the representation of images in many domains, and is especially useful in Geographic Information Systems (GIS) to store information about continuous variables of the space ...
An index for moving objects with constant-time access to their compressed trajectories
(Taylor & Francis, 2021)
[Abstract]: As the number of vehicles and devices equipped with GPS technology has grown explosively, an urgent need has arisen for time- and space-efficient data structures to represent their trajectories. The most commonly ...
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 ...
Navigating planar topologies in near-optimal space and time
(Elsevier B.V., 2023-02)
[Abstract]: We show that any embedding of a planar graph can be encoded succinctly while efficiently answering a number of topological queries near-optimally. More precisely, we build on a succinct representation that ...
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space
(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 ...