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
This project Orchid-Fst implements a fast text string dictionary search data structure: Finite state transducer (short for FST) in c++ language.This FST C++ open source project has much significant advantages.
A complete search engine experience built on top of 75 GB Wikipedia corpus with subsecond latency for searches. Results contain wiki pages ordered by TF/IDF relevance based on given search word/s. From an optimized code to the K-Way mergesort algorithm, this project addresses latency, indexing, and big data challenges.
This is a DSA project which works like the utility command 'sort' in Linux. The program makes use of external sorting algorithm which makes it possible to sort files larger than the primary memory.
This project contains basic functions of a DBMS (External Merge sort, Merge Join, Hash Join, Duplicate Elimination) that are designed to work in real-life and extreme circumstances (Huge input data, extremely low available memory).