Efficient and Scalable Similarity Query Processing on Big Streaming Graphs

点击翻译按钮获取中文摘要

This project aims to develop novel approaches for efficient and scalable similarity queries on big streaming graphs which are large-scale graphs where graph nodes and edges may arrive or expire at high speed. Three key challenges are expected to be addressed including high speed, large variety, and big volume of streaming graphs. Expected outcomes include new theories, novel indexing and query processing techniques, and advanced distributed algorithms 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 e-commerce, cybersecurity, health, social networks, and bio-informatics.