Survey and taxonomy of lossless graph compression and space-efficient graph representations

M Besta, T Hoefler - arXiv preprint arXiv:1806.01799, 2018 - arxiv.org
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 …

Draps: Dynamic and resource-aware placement scheme for docker containers in a heterogeneous cluster

Y Mao, J Oak, A Pompili, D Beer… - 2017 IEEE 36th …, 2017 - ieeexplore.ieee.org
Virtualization is a promising technology that has facilitated cloud computing to become the
next wave of the Internet revolution. Adopted by data centers, millions of applications that …

Graph pattern detection and structural redundancy reduction to compress named graphs

T Sultana, MD Hossain, M Umair, MN Khan, A Alam… - Information …, 2023 - Elsevier
The flexible paradigm of Resource Description Framework (RDF) has accelerated the raw
data published on the web. Therefore, the volume of generated RDF data has increased …

Scale-out processing of large RDF datasets

L Cheng, S Kotoulas - IEEE Transactions on Big Data, 2015 - ieeexplore.ieee.org
Distributed RDF data management systems become increasingly important with the growth
of the Semantic Web. Regardless, current methods meet performance bottlenecks either on …

KOGNAC: efficient encoding of large knowledge graphs

J Urbani, S Dutta, S Gurajada, G Weikum - arXiv preprint arXiv …, 2016 - arxiv.org
Many Web applications require efficient querying of large Knowledge Graphs (KGs). We
propose KOGNAC, a dictionary-encoding algorithm designed to improve SPARQL querying …

HDT-MR: A scalable solution for RDF compression with HDT and MapReduce

JM Giménez-García, JD Fernández… - The Semantic Web …, 2015 - Springer
HDT a is binary RDF serialization aiming at minimizing the space overheads of traditional
RDF formats, while providing retrieval features in compressed space. Several HDT-based …

Fast compression of large semantic web data using X10

L Cheng, A Malik, S Kotoulas, TE Ward… - … on Parallel and …, 2015 - ieeexplore.ieee.org
The Semantic Web comprises enormous volumes of semi-structured data elements. For
interoperability, these elements are represented by long strings. Such representations are …

Consistent utility-preserving masking of a dataset in a distributed environment

S Antonatos, S Braghin, A Gkoulalas-Divanis… - US Patent …, 2019 - Google Patents
Distributed, consistent utility-preserving data masking is provided by retrieving an original
value from a data table; initiating a communication with a mapping service to ascer tain …

A MapReduce-based Approach to Scale Big Semantic Data Compression with HDT

JM Gimenez, JD Fernandez… - IEEE Latin America …, 2017 - ieeexplore.ieee.org
Data generation and publication on the Web has increased over the last years. This
phenomenon, usually known as “Big Data”, poses new challenges related with Volume …

Design and evaluation of parallel hashing over large-scale data

L Cheng, S Kotoulas, TE Ward… - … Conference on High …, 2014 - ieeexplore.ieee.org
High-performance analytical data processing systems often run on servers with large
amounts of memory. A common data structure used in such environment is the hash tables …