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

summary of roaring bitmap #36

Closed
brentp opened this issue Jun 4, 2016 · 3 comments
Closed

summary of roaring bitmap #36

brentp opened this issue Jun 4, 2016 · 3 comments

Comments

@brentp
Copy link

brentp commented Jun 4, 2016

Not sure if this is too high-level for this library, but
maybe something like:

typedef struct summary_s {
    uint32_t n_arrays 
    uint32_t n_rle
    uint32_t n_bitmap
    // and n_values_arrays, n_values_rle, n_values_bitmap ?
} summary_t

summary_t *roaring_bitmap_summary(roaring_bitmat_t *r)

from there, it's simpler to calculate sparsity and simple functions to show the different use of each container type.

@lemire
Copy link
Member

lemire commented Jun 4, 2016

Sure. This is easy. Do you want to define the variables of interest?

@brentp
Copy link
Author

brentp commented Jun 4, 2016

I think the main things of interested would be total % of containers of each type and % of values in each type of container.

also, total calculated memory-use (then easy to derive bits / int stored)

maybe also a measure of sparsity, e.g. how many empty (non-existent) containers. and/or entropy.

lemire added a commit that referenced this issue Jun 8, 2016
@lemire
Copy link
Member

lemire commented Jun 8, 2016

Implemented as per this commit

7fa04a6

Closing. Reopen if you disagree.

@lemire lemire closed this as completed Jun 8, 2016
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

2 participants