Main goal of the project is to index certain documents based on given keywords that can be given manually or selected at random (See line 17 in main.py). After the trees are created, the method LSH (Locality Sensitive Hashing) is used to check the similarities between documents. The 4 trees implemented are: * K-D Tree * Quad Tree * Range Tree * R-
Details about the project can be found in the .pdf which is written in greek
Code written in python version 3
All functions are run from the main.py
-
0.3
- quad tree
-
0.2
- updates on all files, r-tree semi working
- 0.1
- Initial Commit
- File Handler, LSH, R-tree, range tree