Efficiently Processing Pattern-based Structure Queries over Large Graphs

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

Advances in electronic data collections are leading to an exciting new research area - Big Data. Driven by a number of key applications, this project aims at a major field in Big Data: pattern-based structure matching. The problems involved are computationally hard (NP-Complete or NP-Hard). The investigation aims to cover the three key components: fundamentals, indexing, and query processing. The anticipated outcome includes a set of new theorems and novel data processing techniques. If successful the project is expected to significantly contribute to technology development and the scientific foundations of Big Data analysis.