https://github.com/vortex2jm/search-machine
Search machine like a google using red black trees and ternary search trees
https://github.com/vortex2jm/search-machine
Last synced: about 2 months ago
JSON representation
Search machine like a google using red black trees and ternary search trees
- Host: GitHub
- URL: https://github.com/vortex2jm/search-machine
- Owner: vortex2jm
- Created: 2023-06-18T17:21:05.000Z (almost 2 years ago)
- Default Branch: red-black-tree-version
- Last Pushed: 2023-11-12T21:56:28.000Z (over 1 year ago)
- Last Synced: 2023-11-12T22:31:15.556Z (over 1 year ago)
- Language: C
- Homepage:
- Size: 136 KB
- Stars: 0
- Watchers: 1
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Search machine :gear:
#### Here we have two implementations of the same program to compare the efficiency
- The first approach is using generics **red black trees**
- The second approach is using generics **ternary search trees**
*Each one is in a different branch*
#### About
This app is divided in some parts:
- **Indexer**: This step creates the pages tree and link the pages. All pages have links between themselves, which are important to define the page rank later;
- **Page ranking**: It defines which page is more relevant in the result of search, in case one word is found in more than one page;
- **Terms tree**: This tree stores all terms of all pages. Each term has a pointer to a tree containing all pages that contains this term, sorted by page ranking;
- **Search processor**: It receives the program input, searches for a term in the _terms tree_ and print the result of search;