HK PolyU Msc of Computing – Year 2 IT Semester 2

Poly U Msc of Computing – IT 2015-2016 Year Semester 2 completed on 2016-04-22

1) COMP5151 – Advanced Database System:
Final Grade: A

  1. Topics:
    1. Calculation of access cost of hash join, merge join, nested loop join, block nested join
    2. Equivalence Rule to transform a relational algebra tree to another relational algebra tree to produce better cost
    3. Dynamic programming to find the best execution plan
    4. Database Concurrency, Deadlock, Precedence Graph, Wait-Die and Wound-Wait, Timestamp Ordering, Optimistic Concurrency Control
    5. Database Recovery (Checkpoint – Undo and Redo)
    6. Distributed Computing, Semi Join
    7. Spatial Computing, R-tree, R-tree search query, R-tree intersection
    8. Multimedia Index Computing, Two-step processing, Multi-step processing
    9. Database Hardware, CUDA, GPL, SSD
  2. Assignment 1 – 100/100
  3. Assignment 2 – 100/100
  4. Midterm – 82/100
  5. Individual Project – Studied two research papers on OLTP Database Partitioning Tools: Horiculture and JECB and wrote a paper to show what I actually learnt.   Grade: 95/100
    1. Paper was consisted of Introduction, Problem Statement, Description on the concepts of the tools, Analysis and Comparison, and finally Conclusion.
    2. To show my understanding of both papers, I created my own example of database schema, stored procedures, foreign key constraints and workload trace and applied it throughout all the sections of the paper
    3. Horiculture used branch and bound algorithm to prune the size of search space to find the partition solution that yield the lowest cost. A partition solution may consist of horizontal partitioning of replicated table(s), read-only table(s), secondary index(es) and stored procedure routing parameter(s).
    4. JECB used foreign key relationships to join tables by columns to form join paths and join trees.  Then, the joined columns became the partition attributes of the tables. Compatible join attributes were merged and the finer one was used to construct join paths and join trees respectively. To avoid the explosion of search space, compatible join paths and join trees were merged to reduce the number of partition solutions that were constructed.  A partition solution was composed of a join tree and and an independent function.  An optimal solution was a partition solution where the independent function returned the lowest distributed cost.

HK PolyU Msc of Computing – Year 2 IT Semester 1

Poly U Msc of Computing – IT 2014-2015 Semester 1 completed on 2014-12-20

1) COMP5324 – Internet Information Retrieval:
Final Grade: A

  1. Quiz A – 19/22
  2. Quiz B
  3. Group Project – Build a search engine to query relevant documents
    1. Languages: Shell scripting, Java and C++
    2. Libraries:
      1. Apache Common Math Library
      2. Trove4j
      3. JChart
    3. Implemented Retrieval Models:
      1. Vector Space Model
      2. Boolean Retrieval Model
      3. LSI for Vector Space Model

2) COMP5325 – Distributed Computing:
Final Grade: B+

  1. Assignment 1
  2. Assignment 2
  3. Project – Build a tool to characterize YouTube Video Streaming Platform
    1. Java 7, Maven 3,  Apache Command CLI Library
    2. Argument:
      1. -v: video id
      2. -d: enable download mode
      3. -p: full path
      4. -f: filename
      5. -e: extension (mpf, flv, 3gpp, etc)
      6. -r: resolution (360p, 144p, 720p, 1440p)
      7. -x: proxy list

HK PolyU Msc of Computing – IT Semester 2

Poly U Msc of Computing – IT 2014-2015 Semester 2 completed on 2015-05-08
Results released on 2015-05-18

1) COMP5527 – Mobile Data Management: A

  1. Midterm – 72/100
  2. Individual Study Report – Mobile Crowsourcing (No grade)
  3. Group Project – MiniBlog (No grade)
    1. Written in Android and Spring Boot
    2. Functions:
      1. Authentication
      2. Create new user account
      3. Create, Delete, Edit and View online and offline posts
      4. Create, Delete, Edit and View online and offline comments
      5. Edit and View user profile in online or offline mode
      6. Search other users by name in online or offline mode
      7. View posts created by other users
    3. Open source libraries used:
      1.  Client-side
        1. Butterknife for Android UI dependency injection
        2. Retrofit
        3. OkHttp
        4. SugarORM
        5. Roboletric for Android Unit Testing
      2. Server-side
        1. Spring DBUnit for DBUnit Testing
        2. Sprint Boot
        3. Embedded Tomcat 8 to host Spring Boot application

2) COMP5323 – Web Database:

  1. Assignment 1 – 104/100
  2. Midterm – 29/50 (Already the highest mark)
  3. Group Project – Study paper “Cloud Service Placement”
    1. Solve dynamic subgraph matching problem using Gradin framework
    2. PowerPoint Presentation
    3. Group report summarizes the paper, its weakness and potential improvements, and answer 5 questions.

HK PolyU Msc of Computing – IT Semester 1

Poly U Msc of Computing – IT 2014-2015 Semester 1 completed on 2014-12-20

1) COMP5111 – Database Management:

  1. Midterm – 14.5/15
  2. Individual Study Report – JSON and XML Support in relational database – 9/10
  3. Group Project – Simple Course Enrollment System – 30/30
    1. Written in PHP, JQuery and Bootstrap backed by MySQL 5.5
    2. Functions:
      1. Authentication
      2. Change student password
      3. Show Academic history of logged in student
      4. Course Enrollment
      5. Drop Course

2) COMP5122 – E-Commerce fundamental and development:

  1. Assignment 2 – B+
  2. Assignment 2 – B+
  3. Project – E-Commerce website that sells luxury goods imported from Japan – B
    1. Spring MVC, Spring Security, Spring JDBC, JSP, JSTL, JQuery, Bootstrap 3 backed by MySQL 5.5
    2. Functions:
      1. Customer Login
      2. Register customer
      3. Shopping Cart
      4. Checkout Shopping Cart
      5. Search Products
      6. Browse Products
      7. Order Tracking
      8. View Customer Profile
      9. Edit Customer Profile