{"id":17664653,"url":"https://github.com/rishiloyola/d-left","last_synced_at":"2026-03-04T00:39:42.257Z","repository":{"id":88156608,"uuid":"51585746","full_name":"rishiloyola/d-left","owner":"rishiloyola","description":"data structure to store data, rapidly, memory-efficiently and with less collision ","archived":false,"fork":false,"pushed_at":"2017-04-09T09:52:36.000Z","size":12,"stargazers_count":5,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-05-08T00:53:23.316Z","etag":null,"topics":["bloom-filter","d-left","hashing","kernel"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/rishiloyola.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2016-02-12T12:19:16.000Z","updated_at":"2017-03-10T18:42:58.000Z","dependencies_parsed_at":null,"dependency_job_id":"e6281780-43cd-4709-9303-2110fcdd793e","html_url":"https://github.com/rishiloyola/d-left","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rishiloyola%2Fd-left","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rishiloyola%2Fd-left/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rishiloyola%2Fd-left/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rishiloyola%2Fd-left/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rishiloyola","download_url":"https://codeload.github.com/rishiloyola/d-left/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252978729,"owners_count":21834914,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["bloom-filter","d-left","hashing","kernel"],"created_at":"2024-10-23T20:42:52.640Z","updated_at":"2026-03-04T00:39:37.216Z","avatar_url":"https://github.com/rishiloyola.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# d-left\nA d-left is a data structure designed to store data, rapidly, memory-efficiently and with very less collision probability compare to Bloom Filter. Check out this [experiment](https://www.eecs.harvard.edu/~michaelm/postscripts/aller2006.pdf) to increase the capacity and to reduce the false positive of Bloom Filter.\n\n### Advantages :\n* Separation of data and use of fingerprints allows checking of several locations per memory access.\n* Multiple hash functions significatly reduces collision probability.\n* Number of memory accesses rarely exceeds d+1.\n\n### Run\n```\ngcc -c murmur3.c hash.c main.c\ngcc -o test main.o murmur3.o\n./test\n```\n\n### Dependency\n[Murmur3 hashing](https://github.com/PeterScott/murmur3)\n\n### Refereces\n1. [Algorithms - ESA 2006](https://books.google.co.in/books?id=eKOoCAAAQBAJ\u0026pg=PA688\u0026lpg=PA688\u0026dq=d-left+deletion+hashing\u0026source=bl\u0026ots=_t4AgfeEqs\u0026sig=6pc27jDRL5SybempvGOaUr62jlE\u0026hl=en\u0026sa=X\u0026redir_esc=y#v=onepage\u0026q=d-left%20hashing\u0026f=false)\n2. [Slide](http://www.arl.wustl.edu/~jst/cse/577/lec/exactMatch.pdf)\n\n\n### Usage\n```c\nint main(int argc, char const *argv[])\n{\n\tstruct Table T1;\n\tinit(\u0026T1);\n\tbool output;\n\tfor (int i = 0; i \u003c 10; i++) {\n\t\toutput = inserting(i, \u0026T1);\n\t}\n\toutput = delete(5, \u0026T1);\n\toutput = delete(1, \u0026T1);\n\toutput = lookup(5, \u0026T1);\n\treturn 0;\n}\n```\n\n### Config\nChange the below parameters to generate the hash table of suitable size.\n```c\nconst int BUCKET_HEIGHT = 2;\nconst int SUBTABLE_SIZE = 5;\nconst int TABLE_SIZE = 13;\nconst uint32_t SEED = 42;\n```\n##### Note: \n* Currently it only supports **uint32_t** data type.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frishiloyola%2Fd-left","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frishiloyola%2Fd-left","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frishiloyola%2Fd-left/lists"}