A Novel Accuracy and Similarity Search Structure Based on Parallel Bloom Filters

<div>The maximum and minimum value of <svg height="15.5871pt" id="M155" style="vertical-align:-3.4294pt" version="1.1" viewbox="-0.0498162 -12.1577 37.4382 15.5871" width="37.4382pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M238 0V26C174 32 166 38 166 104V712C132 700 70 683 18 677V653C81 647 87 645 87 577V104C87 38 78 32 15 26V0H238Z" id="g121-106"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="253" vert-adv-y="253"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,3.289,0)"><path d="M257 449C165 449 37 374 37 209C37 98 119 -12 256 -12C355 -12 473 65 473 226C473 349 381 449 257 449ZM244 416C333 416 380 320 380 204C380 67 329 21 267 21C184 21 130 115 130 241C130 354 184 416 244 416Z" id="g121-109"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="510" vert-adv-y="510"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,9.919,0)"><path d="M463 437C426 431 375 425 327 422C297 440 264 449 231 449H230C153 449 51 396 51 283C51 215 94 168 139 149C123 129 91 103 51 88C50 78 53 60 62 46C75 25 100 2 136 -9C112 -28 73 -59 53 -79C38 -94 29 -113 29 -135C30 -192 91 -257 203 -257C336 -257 452 -160 452 -59C452 39 371 59 309 59C275 59 240 58 203 58C158 58 140 77 140 96C140 110 157 129 170 138C186 135 205 133 221 133C306 133 396 185 396 293C396 328 384 360 366 381L423 378C439 387 459 413 468 429L463 437ZM219 418C277 418 314 362 314 284C314 205 275 166 231 165C176 165 137 221 137 299C137 376 177 418 219 418ZM241 -11C285 -11 314 -14 339 -24C367 -36 384 -61 384 -95C384 -157 335 -206 240 -206C166 -206 108 -165 108 -110C108 -82 128 -54 154 -32C172 -17 195 -11 241 -11Z" id="g121-101"></path><glyph.data ascent="989" descent="-360" horiz-adv-x="468" vert-adv-y="468"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,18.242,0)"><path d="M619 670C619 686 593 712 555 712S459 686 410 634S335 504 320 430H250L219 400L222 388H312L258 73C223 -133 201 -166 187 -180C175 -191 158 -199 140 -199C123 -199 88 -188 74 -172C68 -166 63 -164 54 -171C38 -185 23 -201 23 -215C23 -236 60 -261 93 -261C122 -261 161 -247 207 -200C268 -138 300 -71 337 94C365 220 376 277 394 387L501 399L521 430H401C432 623 464 665 501 665C524 665 544 651 567 627C577 617 583 618 592 625C601 631 619 651 619 670Z" id="g113-103"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="642" vert-adv-y="642"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,26.594,-5.741)"><path d="M522 0V30C462 35 455 41 455 106V280C455 397 397 451 314 451C262 451 206 414 171 379V710C131 698 69 682 20 675V647C87 642 90 637 90 574V106C90 41 80 35 20 30V0H236V30C176 35 171 43 171 106V339C198 371 237 391 276 391C341 391 374 350 374 269V106C374 43 367 35 308 30V0H522Z" id="g58-102"></path><glyph.data ascent="1007" descent="-369" horiz-adv-x="544" vert-adv-y="544"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,31.545,-5.741)"><path d="M138 535C169 535 191 560 191 589C191 620 168 644 139 644S85 620 85 589C85 560 110 535 138 535ZM257 0V30C192 35 185 43 185 109V453C142 435 94 422 40 414V386C101 378 104 372 104 311V109C104 41 97 35 33 30V0H257Z" id="g58-103"></path><glyph.data ascent="1007" descent="-369" horiz-adv-x="275" vert-adv-y="275"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,33.938,-5.741)"><path d="M303 37L293 66C280 59 256 49 231 49S173 63 173 143V396H281C294 404 298 428 287 439H173V575L158 577L92 509V439H46L17 408L22 396H92V107C92 27 128 -12 192 -12C203 -12 218 -9 237 2L303 37Z" id="g58-114"></path><glyph.data ascent="1007" descent="-369" horiz-adv-x="312" vert-adv-y="312"></glyph.data></g></svg>.</div>

Computational Intelligence and Neuroscience

fig2

Figure 2

Figure 2: A Novel Accuracy and Similarity Search Structure Based on Parallel Bloom Filters 