Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

pure in memory PascalHashTable #81

Open
amosbird opened this issue Dec 7, 2018 · 1 comment
Open

pure in memory PascalHashTable #81

amosbird opened this issue Dec 7, 2018 · 1 comment

Comments

@amosbird
Copy link

amosbird commented Dec 7, 2018

Does it make sense to support non-disk backed hash tables?

    PascalHashTable* table = PHNew(NULL,
        2000000, // table size: 20 elements
        0.7, // table load: 70%
        10, // inline size for key
        sizeof(data)); // value size
@amosbird
Copy link
Author

amosbird commented Dec 7, 2018

I just did some tests with shm backed hash tables. https://la.wentropy.com/hI-L

The fixed key sized hash table consumes the same amount RSS as unordered_map while variant key sized hash table doubles the memory consumption. Both hash tables are 3 times slower than unordered_map when doing insertion.

Is that a fair benchmark? What benefits can I get for using opic hash tables in memory only?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant