KickStarter

Social networks like maps with real-time traffic are good examples of streaming graphs. These streaming graphs are processed and analyzed to answer the queries in real time. Conventional iterative graph processing algorithms estimate the results by approximating the intermediate values. Upon receiving a query, the computation is performed on these intermediate values. This setting gives proper results when the intermediate values are closer to actual values than the initial values, which is the case with monotonic graphs. A monotone function between the ordered sets preserves or reverses the given order. However, when an edge in deleted in such a graph, the monotonic structure get disrupted. And therefore these algorithms output incorrect results. The KickStarter, which is proposed, is expected to handle the problem of processing graphs correctly and efficiently even while the edge deletions are present. TO BE CONT’D

Faculty Supervisor:

Keval Vora

Student:

Partner:

Indian Institute of Technology Hyderabad

Discipline:

Computer science

Sector:

Technology; Other

University:

Simon Fraser University

Program: