Survey and taxonomy of lossless graph compression and space-efficient graph representations
Various graphs such as web or social networks may contain up to trillions of edges.
Compressing such datasets can accelerate graph processing by reducing the amount of I/O …
Compressing such datasets can accelerate graph processing by reducing the amount of I/O …
The Bari Manifesto: An interoperability framework for essential biodiversity variables
Abstract Essential Biodiversity Variables (EBV) are fundamental variables that can be used
for assessing biodiversity change over time, for determining adherence to biodiversity policy …
for assessing biodiversity change over time, for determining adherence to biodiversity policy …
Semantic querying of integrated raster and relational data: a virtual knowledge graph approach
Ontology-based data access (OBDA) facilitates access to heterogeneous data sources
through the mediation of an ontology (eg OWL), which captures the domain of interest and is …
through the mediation of an ontology (eg OWL), which captures the domain of interest and is …
Efficient processing of raster and vector data
In this work, we propose a framework to store and manage spatial data, which includes new
efficient algorithms to perform operations accepting as input a raster dataset and a vector …
efficient algorithms to perform operations accepting as input a raster dataset and a vector …
Array DBMS: Past, present, and (near) future
RAR Zalipynis - Proceedings of the VLDB Endowment, 2021 - dl.acm.org
Array DBMSs strive to be the best systems for managing, processing, and even visualizing
big Nd arrays. The last decade blossomed with R&D in array DBMS, making it a young and …
big Nd arrays. The last decade blossomed with R&D in array DBMS, making it a young and …
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 …
Two-dimensional block trees
Abstract The Block Tree is a data structure for representing repetitive sequences in
compressed space, which reaches space comparable with that of Lempel–Ziv compression …
compressed space, which reaches space comparable with that of Lempel–Ziv compression …
[HTML][HTML] The effects of land use and land cover geoinformation raster generalization in the analysis of LUCC in Portugal
Multiple land use and land cover (LUC) datasets are available for the analysis of LUC
changes (LUCC) in distinct territories. Sometimes, different LUCC results are produced to …
changes (LUCC) in distinct territories. Sometimes, different LUCC results are produced to …
cKd-tree: A Compact Kd-tree
In the context of Big Data scenarios, the presence of extensive static datasets is not
uncommon. To facilitate efficient queries on such datasets, the utilization of multiple indexes …
uncommon. To facilitate efficient queries on such datasets, the utilization of multiple indexes …
[HTML][HTML] Using Predictive and Differential Methods with K2-Raster Compact Data Structure for Hyperspectral Image Lossless Compression
This paper proposes a lossless coder for real-time processing and compression of
hyperspectral images. After applying either a predictor or a differential encoder to reduce the …
hyperspectral images. After applying either a predictor or a differential encoder to reduce the …