neelkshah / pandora

Hi there 👋

• 📫 More detailed stuff here
• 🔭 Working on a data systems project
• 🌱 Learning data systems
• 📫 How to reach me: neelkshah398 at gmail

pandora's Issues

Hash Array

Hash Array stores key value pairs in linked lists based on hashing function. It is made up of an array along with metrics to track number of key value pairs added or removed.

initial questions

• What are our objectives?
• What are the tools we shall use?
• Have we identified first steps?
• Do we have a timeline for the same?

Hashing function

Implement a hashing function

• a reasonable starting point is modular hashing
• implement multiple variants
• Create test bench
• Find and benchmarks against standards

Keys can be of type String or Integer

Implement iterator interface for LinkedList

HashTable resize and shrink implementation requires a method to iterate over the LinkedList and access its key value pairs one by one.

Standardize use of int types across project

Currently different types of ints are being used. For e.g.

1. int for config constants
2. uint64 for key values
3. uint32 for HashTable attributes

What is the best approach to be consistent across int type usage?

Soft delete for Linked List

Slices shift sub slices when deleting. It's better if we use a soft delete, consider 2^64 value (64 1s) to be the soft delete value.

Linked List

Implement a linked list

• that stores key value pairs
• that can store a configurable number of pairs in a single node
• create tests
• compare against standard benchmarks

Key can be of type: String or Integer and values can only be of type Integer

Project structure

We need a project structure that is in keeping with convention.

Hash function chooser

An enum for different types of hash functions and a chooser that takes and enum and returns the corresponding function.