{
    "componentChunkName": "component---src-templates-note-note-js",
    "path": "/notes/bloom-filters",
    "result": {"data":{"mdx":{"body":"var _excluded = [\"components\"];\nfunction _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n/* @jsxRuntime classic */\n/* @jsx mdx */\n\nvar _frontmatter = {};\nvar layoutProps = {\n  _frontmatter: _frontmatter\n};\nvar MDXLayout = \"wrapper\";\nreturn function MDXContent(_ref) {\n  var components = _ref.components,\n    props = _objectWithoutProperties(_ref, _excluded);\n  return mdx(MDXLayout, _extends({}, layoutProps, props, {\n    components: components,\n    mdxType: \"MDXLayout\"\n  }), mdx(\"blockquote\", null, mdx(\"p\", {\n    parentName: \"blockquote\"\n  }, \"It's important to note that while Bloom filters provide fast membership queries, they can sometimes produce false positives (indicating an element is present when it's not). The probability of false positives can be controlled by adjusting the size of the filter and the number of hash functions used. The trade-off lies between memory usage and the acceptable level of false positives.\")), mdx(\"p\", null, \"\", mdx(\"a\", {\n    parentName: \"p\",\n    \"href\": \"/notes/Probabilistic-Data-Structures\",\n    \"title\": \"Probabilistic Data Structures\"\n  }, \"Probabilistic Data Structures\"), \"\"), mdx(\"p\", null, \"\", mdx(\"a\", {\n    parentName: \"p\",\n    \"href\": \"/notes/explore-further\",\n    \"title\": \"explore further\"\n  }, \"explore further\"), \"\"), mdx(\"p\", null, \"\", mdx(\"a\", {\n    parentName: \"p\",\n    \"href\": \"/notes/video-ideas\",\n    \"title\": \"video ideas\"\n  }, \"video ideas\"), \"\"));\n}\n;\nMDXContent.isMDXComponent = true;","inboundReferences":[{"id":"1de5a10a-7e21-5539-bc1b-34cb143a9e75","slug":"video-ideas"}]}},"pageContext":{"slug":"bloom-filters","node":{"childMdx":{"slug":"bloom-filters"}}}},
    "staticQueryHashes": []}