Scaling Disk-Resident Learned Indexes For Database Systems. This project aims to investigate new disk-resident learned indexing algorithms to store and process data in database systems by advancing the state-of-the-art in memory-resident learned modeling. This project expects to generate new knowledge in the area of digital storage technologies utilising novel and efficient techniques in learned indexing for big data. This should provide significant benefits to enable modern database systems to ....Scaling Disk-Resident Learned Indexes For Database Systems. This project aims to investigate new disk-resident learned indexing algorithms to store and process data in database systems by advancing the state-of-the-art in memory-resident learned modeling. This project expects to generate new knowledge in the area of digital storage technologies utilising novel and efficient techniques in learned indexing for big data. This should provide significant benefits to enable modern database systems to scale with the massive growth of data, improve the efficiency of data processing, improve the effectiveness of projects that utilise big data, and dramatically reduce energy costs in Australian data centres when storing and retrieving data from databases and lower their carbon footprints.Read moreRead less
Big temporal graph processing in the Cloud. This project aims to develop efficient and scalable algorithms to process big temporal graphs in the Cloud. In particular, we will investigate three most representative types of queries over big temporal graphs including vertex-based queries, path-based queries, and subgraph-based queries. Expected outcomes of this project include theoretical foundations and scalable algorithms to process big temporal graphs as well as a system prototype for evaluation ....Big temporal graph processing in the Cloud. This project aims to develop efficient and scalable algorithms to process big temporal graphs in the Cloud. In particular, we will investigate three most representative types of queries over big temporal graphs including vertex-based queries, path-based queries, and subgraph-based queries. Expected outcomes of this project include theoretical foundations and scalable algorithms to process big temporal graphs as well as a system prototype for evaluation and to demonstrate the practical value. Success in this project should see significant benefits for many important applications such as cybersecurity, e-commerce, health and road networks.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE240100668
Funder
Australian Research Council
Funding Amount
$435,000.00
Summary
Towards Processing of Big Streaming Temporal Graphs. This project aims to develop efficient and scalable algorithms to process big streaming temporal graphs, which is in high demand for many data-intensive applications such as cybersecurity, crime monitoring, and e-marketing. In particular, I will investigate three most representative types of queries including vertex-based queries, path-based queries, and subgraph-based queries. Expected outcomes of this project include theoretical foundations ....Towards Processing of Big Streaming Temporal Graphs. This project aims to develop efficient and scalable algorithms to process big streaming temporal graphs, which is in high demand for many data-intensive applications such as cybersecurity, crime monitoring, and e-marketing. In particular, I will investigate three most representative types of queries including vertex-based queries, path-based queries, and subgraph-based queries. Expected outcomes of this project include theoretical foundations and scalable algorithms to process big streaming temporal graphs as well as a system prototype for evaluation and to demonstrate the practical value. Success in this project should see significant benefits for many important applications such as cybersecurity, e-commerce, health and social analysis.Read moreRead less
Next-Generation Distributed Graph Engine for Big Graphs. This project aims to develop an efficient and scalable distributed graph engine to process big graphs. In particular, we will investigate the foundations for the distributed real-time graph engine, focusing on graph storage and graph operators, and then provide solutions for a set of representative graph mining and query processing tasks. Expected outcomes of this project include theoretical foundations and a scalable real-time graph engin ....Next-Generation Distributed Graph Engine for Big Graphs. This project aims to develop an efficient and scalable distributed graph engine to process big graphs. In particular, we will investigate the foundations for the distributed real-time graph engine, focusing on graph storage and graph operators, and then provide solutions for a set of representative graph mining and query processing tasks. Expected outcomes of this project include theoretical foundations and a scalable real-time graph engine to process big graphs as well as a system prototype for evaluation and to demonstrate the practical value. Success in this project should see significant benefits for many important applications such as cybersecurity, e-commerce, health and road networks.Read moreRead less