Skip to main content
added 4 characters in body
Source Link
N K
  • 1
  • 1

Quotient Filter

Time complexityTime complexity

The quotient filter offers a constant time complexity of O(1) on average with most operations. However, in the worst case, all operations might take logarithmic time complexity O(log(n)), where n is the number of buckets in the filter.

Space complexitySpace complexity

The quotient filter does not store the data items but a part of the fingerprint yielding a constant space complexity of O(1).

Reference: systemdesign.one

Quotient Filter

Time complexity

The quotient filter offers a constant time complexity of O(1) on average with most operations. However, in the worst case, all operations might take logarithmic time complexity O(log(n)), where n is the number of buckets in the filter.

Space complexity

The quotient filter does not store the data items but a part of the fingerprint yielding a constant space complexity of O(1).

Reference: systemdesign.one

Quotient Filter

Time complexity

The quotient filter offers a constant time complexity of O(1) on average with most operations. However, in the worst case, all operations might take logarithmic time complexity O(log(n)), where n is the number of buckets in the filter.

Space complexity

The quotient filter does not store the data items but a part of the fingerprint yielding a constant space complexity of O(1).

Reference: systemdesign.one

Source Link
N K
  • 1
  • 1

Quotient Filter

Time complexity

The quotient filter offers a constant time complexity of O(1) on average with most operations. However, in the worst case, all operations might take logarithmic time complexity O(log(n)), where n is the number of buckets in the filter.

Space complexity

The quotient filter does not store the data items but a part of the fingerprint yielding a constant space complexity of O(1).

Reference: systemdesign.one