Skip to content
No description, website, or topics provided.
C++ Rust Other
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
ThirdParty/stxxl
bin
include Merge remote-tracking branch 'origin/master' Nov 11, 2019
src
tests
.codecov.yml
.gitignore Can initialize, yay Nov 3, 2019
.travis.yml
CMakeLists.txt revert cmake changes Nov 7, 2019
Cargo.toml
LICENSE.txt
Makefile build stxxl first Nov 8, 2018
QuotientFilter_MQF.png
README.md
build.rs revert cmake changes Nov 7, 2019
doxygenConfigFile
r_eqn.gif
stxxlDiskConf.stxxl buffered mqf using stxxl Sep 29, 2018

README.md

MQF

Build Status codecov

Approximate membership query (AMQ) data structures provide approximate representation for data using a smaller amount of memory compared to the real data size. As the name suggests, AMQ answers if a particular element exists or not in a given dataset but with possible false positive errors. AMQ has many examples such as bloom filter, count-min sketch, Quotient Filter, and Counting Quotient Filter(CQF). Here, we are proposing a new AMQ data structure called Mixed Counting Quotient Filter (MQF).

CQF splits the hash-bits of an item into two components: quotient and remaining parts. Quotient Part is used to determine the target slot. The remaining is inserted into the target slot. The insertion algorithm uses a variant of linear probing to resolve collisions. CQF allows counting the number of instances inserted by using slots following the item's reminder as a counter. CQF has relatively complex scheme to encode counters so that it can distinguish counters from item's reminder.

alt text

MQF, Mixed Quotient Filter, is a variant of CQF. MQF uses the same probing technique as CQF. MQF has more metadata called fixed size counters and different encoding for the counters. The improvement makes mqf more memory efficient for wider range of zipifan distribution.

When an item is inserted more than one time, MQF first use the fixed size counter to the number of insertions(count). After the fixed size counter is full, MQF store the count in the following slot and fixed-size counter. MQF uses the necessary number of slots to store the count.

In other words, Fixed-size counters is used in counting and marking the slots used for counting. Fixed-size counters for all slots related to the same item store the counter's maximum value except the last one should store value strictly less than the maximum. When the maximum is reached in the last fixed counter, a new slot is added with empty fixed-size counter.

Advantages:

  • MQF supports counting and removing items. MQF uses variable size counters; therefore, It is memory efficient when count data that follows zipfian distribution where most the items occur once or twice but few items can happen in very high counts..
  • MQF has lower bits per element than Bloom filter and Count-min sketches (Ref).
  • MQF has good data locality which makes it efficient when running on secondary storage.
  • MQF supports add/remove labels for the item.
  • MQF can be iterated to get the items and counts inserted in the filter.
  • MQF supports merging function. Two or more filters can be merged into one filter.
  • MQF can be resized to bigger/ smaller filter.

Documentation

Building

apt-get install make g++ cmake zlib1g-dev libbz2-dev
make NH=1
make test NH=1
./mqf_test

Initialization

MQF Initialization requires the estimation of some parameters: number of slots, Key bits, fixed counter size, and labels size.

Fixed-size counter size is estimated from the shape of data distribution. If most of the items are singletons. The fixed-size counter should be limited to 1 bit. However, If a big portion of items is repeated more than one time, a bigger fixed-size counter will hold more counts and thus save slots.

The number of slots is estimated from the number of items expected to be inserted into the filter. Slots are used for inserting the remaining part of the hash of the items and the count. After calculating the required number of slots, multiply the result by 1.05 because MQF can't be filled by more than 95% of its capacity. Then, round the result to the nearest bigger power of two.

Key bits equal to log2(number of slots) + the remaining part bits. the remaining part bits is estimated from the desired accuracy using the formula below.

eqn

Label size is straightforward to be estimated. it can be set to zero if labels are not necessary.

  1. qf_init Initialize mqf .
void qf_init(QF *qf, uint64_t nslots, uint64_t key_bits, uint64_t label_bits,uint64_t fixed_counter_size, bool mem, const char *path, uint32_t seed);
  • Qf* qf : pointer to the Filter.
  • uint64_t nslots : Number of slots in the filter. Should be of power of two. Maximum number of items to be inserted depends on this number.
  • uint64_t key_bits: Number of bits in the hash values.
  • uint64_t label_bits: Number of bits in label value.
  • uint64_t fixed_counter_size: Fixed counter size. must be > 0.
  • bool mem: Flag to create the filter on memory. IF false, mmap is used.
  • const char * path: In case of mmap. Path of the file used to pack the filter.
  • uint32_t seed: useless value. To be removed
  1. qf_destroy
  2. estimate

Functions Supported

  1. Insert : Increment the counter for this item by count.
bool qf_insert(QF *qf, uint64_t key,
   uint64_t count,bool lock, bool spin);
  • Qf* qf : pointer to the Filter
  • uint64_t key : hash of the item to be inserted.
  • uint64_t count: Count to be added
  • bool lock: For Multithreading, Lock the * slot used by the current thread so that other threads can't change the value
  • bool spin: For Multithreading, If there is a lock on the target slot. wait until the lock is freed and insert the count.
  • returns True if the insertion succeeded.
  1. Count: Return the number of times key has been inserted, with any value, into qf.
uint64_t qf_count_key(const QF *qf, uint64_t key);
  • Qf* qf : pointer to the Filter
  • uint64_t key : hash of the item to be counted.
  • returns the number of times the item is inserted.
  1. Remove: Decrement the counter for this item by count.
bool qf_remove(QF *qf, uint64_t hash, uint64_t count, bool lock, bool spin);
  • Qf* qf : pointer to the Filter
  • uint64_t key : hash of the item to be removed
  • uint64_t count: Count to be removed
  • bool lock: For Multithreading, Lock the slot used by the current thread so that other threads can't change the value
  • bool spin: For Multithreading, If there is a lock on the target slot. wait until the lock is freed and insert the count.
  1. Add/Remove label to elements
uint64_t qf_add_label(const QF *qf, uint64_t key, uint64_t label, bool lock, bool spin);
uint64_t qf_get_label(const QF *qf, uint64_t key);
uint64_t qf_remove_label(const QF *qf, uint64_t key, bool lock, bool spin);
  • Qf* qf : pointer to the Filter
  • uint64_t key : hash of the item.
  • uint64_t label: label for the item.
  • bool lock: For Multithreading, Lock the slot used by the current thread so that other threads can't change the value
  • bool spin: For Multithreading, If there is a lock on the target slot. wait until the lock is freed and insert the count.
  1. Resize: resize the filter into a bigger or smaller one
QF* qf_resize(QF* qf, int newQ, const char * originalFilename=NULL, const char * newFilename=NULL);
  • Qf* qf : pointer to the Filter
  • uint64_t newQ: new number of slots(Q). the slot size will be recalculated to keep the range constant.
  • string originalFilename(optional): dump the current filter to the disk to free space for the new filter. Filename is provided as the content of the string.
  • string newFilename(optional): the new filter is created on disk. Filename is provided as the content of the string.
  • returns a pointer to the new filter
  1. Merge: merge more than one filter into a final one.
void qf_merge(QF *qfa, QF *qfb, QF *qfc);
void qf_multi_merge(QF *qf_arr[], int nqf, QF *qfr);
  1. Invertible Merge: Invertible merge offers addiotinal functionality to normal merge. Original source filter can be queried for each key. Invertiable merge function adds label for each key and creates index structure. The index is map of an integer and vector of integers where the integer is the value of the labels and vector on integers is the ids of the source filters.
void qf_invertable_merge(QF *qf_arr[], int nqf, QF *qfr,std::map<uint64_t, std::vector<int> > *inverted_index_ptr);
  • Qf* qf_arr : input array of filters
  • int nqf: number of filters
  • QF* qfr: pointer to the output filter.
  • map (uint64_t,vector(int) ) inverted_index_ptr: Pointer to the output index.
  1. Compare: check if two filters have the same items, counts and labels.
bool qf_equals(QF *qfa, QF *qfb);
  1. Intersect calculate the intersection between two filters.
void qf_intersect(QF *qfa, QF *qfb, QF *qfc);
  1. Subtract subtract the second filter from the first.
void qf_subtract(QF *qfa, QF *qfb, QF *qfc);
  1. Space: returns the space percent occupied by the inserted items.
int qf_space(QF *qf);

Miscellaneous Functions

  1. Capacity
  2. Copy
  3. Serialize/ Deserialize
  4. MMap read
You can’t perform that action at this time.