You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
We likely need this to be super efficient for the use-case where the tree has been created and we want to save it to a file, which we must be able to quickly read back into memory on a new program.
File size could be 200GB for the number of users we are catering for. Serde may not be fast enough. Here are some other options.
"Because, you can kind of mimic a hashmap in terms of key value pairs with an arrow table. Serializing/deserializing would be super fast. You can paralleize access to it and it will be way more efficient in terms of memory/space. But you'll take a knock on random access."
We likely need this to be super efficient for the use-case where the tree has been created and we want to save it to a file, which we must be able to quickly read back into memory on a new program.
File size could be 200GB for the number of users we are catering for. Serde may not be fast enough. Here are some other options.
The text was updated successfully, but these errors were encountered: