Set operations over compressed binary relations

作者：

Highlights：

• We present algorithms for computing set operations over compressed binary relations.

• These operations extend the functionality of k2-trees.

• We evaluate the performance over real datasets of different nature.

• Set operations are computed efficiently and in compressed space.

摘要

•We present algorithms for computing set operations over compressed binary relations.•These operations extend the functionality of k2-trees.•We evaluate the performance over real datasets of different nature.•Set operations are computed efficiently and in compressed space.

论文关键词：Compact data structures,Compressed binary relations,Set operations,k2-trees

论文评审过程：Received 23 April 2017, Revised 26 May 2018, Accepted 7 October 2018, Available online 12 October 2018, Version of Record 22 October 2018.

论文官网地址：https://doi.org/10.1016/j.is.2018.10.001