String based key-value store for Java
-
Updated
May 24, 2023 - Java
String based key-value store for Java
Implementation of the Patricia Trie and the Hybrid Trie in Java
Implemented a search engine that retrieves products from a large database based on multiple attributes, by organizing data using appropriate data structures like HashMaps and TreeSets for different combination of attributes
A compression algorithm using huffman method
Trie Auto-completion Homework for Problem Solving with Python at the University of San Francisco
Autocomplete feature using react.js
A baby search engine for CS600 course project
The reasytries package contains classes and functions that efficiently store and search words passed by the user based on a trie data structure.
⚖️ A simple version of a distributed, fault-tolerant, Key-Value (KV) database (or store), with a few tweaks.
A text editor with spell-check and autocomplete functionality using efficient data structures
📄 Word Composition Problem - To find words constructed by concatenating shorter words also found in the file.
The purpose of this project is to create a simple version of a distributed, fault-tolerant, Key-Value (KV) database (or store).
A set of data structures utility classes
T9 Keyboard controled by numpad keyboard buttons
Add a description, image, and links to the trie topic page so that developers can more easily learn about it.
To associate your repository with the trie topic, visit your repo's landing page and select "manage topics."