Skip to content

Latest commit

 

History

History
21 lines (11 loc) · 1.04 KB

README.md

File metadata and controls

21 lines (11 loc) · 1.04 KB

Complex-Data-Management

The projects I did for my undergraduate course of Complex Data Management.

Summary of the projects:

  • O(n) time for database merge operations such as join, intersection etc between two sorted arrays.
  • Implementation of the R-tree data stracture for spatial data (or multi-dimensional data), as well as range and K Nearest Neighbors queries based on R-tree.
  • Implementation of spatial network algorithms such as Dijkstra and A*, and top-K queries.
  • Efficient containment and relevance retrieval queries methods between transactions and items.