Emptyheaded: A relational engine for graph processing
There are two types of high-performance graph processing engines: low-and high-level
engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures …
engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures …
Bivariate causal mixture model quantifies polygenic overlap between complex traits beyond genetic correlation
Accumulating evidence from genome wide association studies (GWAS) suggests an
abundance of shared genetic influences among complex human traits and disorders, such …
abundance of shared genetic influences among complex human traits and disorders, such …
Better bitmap performance with roaring bitmaps
Bitmap indexes are commonly used in databases and search engines. By exploiting bit‐
level parallelism, they can significantly accelerate queries. However, they can use much …
level parallelism, they can significantly accelerate queries. However, they can use much …
Roaring bitmaps: Implementation of an optimized software library
Compressed bitmap indexes are used in systems such as Git or Oracle to accelerate
queries. They represent sets and often support operations such as unions, intersections …
queries. They represent sets and often support operations such as unions, intersections …
Optimizing one-time and continuous subgraph queries using worst-case optimal joins
We study the problem of optimizing one-time and continuous subgraph queries using the
new worst-case optimal join plans. Worst-case optimal plans evaluate queries by matching …
new worst-case optimal join plans. Worst-case optimal plans evaluate queries by matching …
The fastlanes compression layout: Decoding> 100 billion integers per second with scalar code
The open-source FastLanes project aims to improve big data formats, such as Parquet, ORC
and columnar database formats, in multiple ways. In this paper, we significantly accelerate …
and columnar database formats, in multiple ways. In this paper, we significantly accelerate …
Speeding up set intersections in graph algorithms using simd instructions
In this paper, we focus on accelerating a widely employed computing pattern---set
intersection, to boost a group of graph algorithms. Graph's adjacency-lists can be naturally …
intersection, to boost a group of graph algorithms. Graph's adjacency-lists can be naturally …
Faster population counts using AVX2 instructions
Counting the number of ones in a binary stream is a common operation in database,
information-retrieval, cryptographic and machine-learning applications. Most processors …
information-retrieval, cryptographic and machine-learning applications. Most processors …
Stream VByte: Faster byte-oriented integer compression
Arrays of integers are often compressed in search engines. Though there are many ways to
compress integers, we are interested in the popular byte-oriented integer compression …
compress integers, we are interested in the popular byte-oriented integer compression …
Faster set intersection with SIMD instructions by reducing branch mispredictions
Set intersection is one of the most important operations for many applications such as Web
search engines or database management systems. This paper describes our new algorithm …
search engines or database management systems. This paper describes our new algorithm …