User profiles for Guillermo de Bernardo
Guillermo de BernardoUniversidade da Coru�a Verified email at udc.es Cited by 329 |
Compact querieable representations of raster data
G De Bernardo, S �lvarez-Garc�a, NR Brisaboa…�- String Processing and�…, 2013 - Springer
In Geographic Information Systems (GIS) the attributes of the space (altitude, temperature,
etc.) are usually represented using a raster model. There are no compact representations of …
etc.) are usually represented using a raster model. There are no compact representations of …
Compressed representation of dynamic binary relations with applications
We introduce a dynamic data structure for the compact representation of binary relations R
⊆ A � B . The data structure is a dynamic variant of the k 2 -tree, a static compact …
⊆ A � B . The data structure is a dynamic variant of the k 2 -tree, a static compact …
Extending general compact querieable representations to GIS applications
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 …
is especially useful in Geographic Information Systems (GIS) to store information about …
Efficiently querying vector and raster data
Even though the field of spatial databases is more than 40 years old, most existing logical
data models are highly focused either on spatial objects (vector data models) or spatial fields (…
data models are highly focused either on spatial objects (vector data models) or spatial fields (…
Compact data structures for temporal graphs
In this paper we propose three compact data structures to answer queries on temporal graphs.
We define a temporal graph as a graph whose edges appear or disappear along time. …
We define a temporal graph as a graph whose edges appear or disappear along time. …
Space/time-efficient RDF stores based on circular suffix sorting
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 …
standardized publication and exchange of information in the Web of Data. In this paper, we …
[HTML][HTML] Classic distance join queries using compact data structures
Distance-based Join Queries (DJQs) have multiple applications in spatial databases,
Geographic Information Systems, and other areas. The K Closest Pairs Query (KCPQ) and the ε …
Geographic Information Systems, and other areas. The K Closest Pairs Query (KCPQ) and the ε …
Compressed dynamic binary relations
NR Brisaboa, G de Bernardo…�- 2012 Data Compression�…, 2012 - ieeexplore.ieee.org
We introduce a dynamic data structure for the compact representation of binary relations R
? A � B. Apart from checking whether two objects (a, b) ? A � B are related, and listing the …
? A � B. Apart from checking whether two objects (a, b) ? A � B are related, and listing the …
[HTML][HTML] A succinct data structure for self-indexing ternary relations
S Alvarez-Garcia, G de Bernardo, NR Brisaboa…�- Journal of Discrete�…, 2017 - Elsevier
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 …
theoretical and practical representations have been proposed to answer the usual queries in …
Compressed and queryable self-indexes for RDF archives
RDF compression and querying are consolidated topics in the Web of Data, with a plethora
of solutions to efficiently store and query static datasets. However, as RDF data changes …
of solutions to efficiently store and query static datasets. However, as RDF data changes …