Efficient Queries over Database
Project Description

In this project, students are guided to conduct research in the database field. Depending on students’ strength, they are given some particular database problems. For example, if they are good at geometry, some candidate problems include “how to find a nearest restaurant from a given location” and “how to find a shortest path from a source to a destination”. If they are good at programming, one of the candidate problems is “how to return results efficiently when users issue some queries”.

Requirement: Students are required to have their GPA/CGA at least 3.7 (out of 4.0).

Roles:
- to study some important problems in the field
- to implement some important algorithms in the field
- to conduct research

Outcomes:
- to know how to implement some important algorithms in the field
- to know how to conduct research

Supervisor
WONG Raymond Chi Wing
Quota
5
Course type
UROP1000
UROP1100
UROP2100
UROP3100
UROP4100
Applicant's Roles

- to study some important problems in the field
- to implement some important algorithms in the field
- to conduct research

Applicant's Learning Objectives

- to know how to implement some important algorithms in the field
- to know how to conduct research

Complexity of the project
Challenging