Relative Select

TL;DR

This paper presents a method to efficiently perform select queries on related strings by leveraging existing support on one string and adding minimal extra information, aiding in the storage of coloured de Bruijn graphs.

Contribution

It introduces a technique to extend select query support from a single string to similar strings with minimal additional storage, improving data structure efficiency.

Findings

Supports fast select queries on related strings with minimal extra info

Enables efficient storage of coloured de Bruijn graphs

Reduces complexity of select operations on multiple strings

Abstract

Motivated by the problem of storing coloured de Bruijn graphs, we show how, if we can already support fast select queries on one string, then we can store a little extra information and support fairly fast select queries on a similar string.