Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFoo, Chuan Shengen_US
dc.identifier.citationFoo, C. S. (2022). Optimizing query execution in large differential factbase. Final Year Project (FYP), Nanyang Technological University, Singapore.
dc.description.abstractDifferential factbase is a uniform exchangeable representation supporting efficient querying and manipulation, based on the existing concept of program facts. Such factbase is used to store relevant information of software changes. However, the existing factbase is not designed to scale. This project explores the creation of a system which utilizes a graph database for the efficient storage of program facts. The program facts were successfully modelled as a graph data model and imported into a graph database. The system provides multiple interfaces for users to interact with the graph database either visually or through REST APIs. From benchmark results obtained, the querying engine of graph database outperformed the original querying engine of differential factbase in terms of query execution times.en_US
dc.publisherNanyang Technological Universityen_US
dc.subjectEngineering::Computer science and engineering::Data::Data storage representationsen_US
dc.subjectEngineering::Computer science and engineering::Information systems::Information interfaces and presentationen_US
dc.titleOptimizing query execution in large differential factbaseen_US
dc.typeFinal Year Project (FYP)en_US
dc.contributor.supervisorLi Yien_US
dc.contributor.schoolSchool of Computer Science and Engineeringen_US
dc.description.degreeBachelor of Science in Data Science and Artificial Intelligenceen_US
item.fulltextWith Fulltext-
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)
Files in This Item:
File Description SizeFormat 
FYP SCSE21-0328 Foo Chuan Sheng.pdf
  Restricted Access
2.86 MBAdobe PDFView/Open

Page view(s)

Updated on Sep 23, 2023


Updated on Sep 23, 2023

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.