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
An Encoder for Huffman tree using 3 priority queues - MinBinaryHeap, Min 4-AryBinaryHeap and PairingHeap. The encoder reads an input file that is to be compressed and generates two output files – the compressed version of the input file and the code table.
Returns Top 10 URL results and corresponding ranking scores for user entered search query.Implements conjunctive as well as disjunctive query processing and uses BM25 as the ranking function.Very Efficient, returns results for conjunctive queries in less than 50ms.