2018 Fiscal Year Final Research Report
Research on queries in uncertain and streaming graphs
| Project/Area Number |
15K21069
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Multimedia database
Information network
|
|---|
| Research Institution | Osaka University (2016-2018)
Nagoya University (2015) |
|---|
Principal Investigator |
Sasaki Yuya 大阪大学, 情報科学研究科, 助教 (40745147)
|
|---|
| Project Period (FY) |
2015-04-01 – 2019-03-31
|
| Keywords | グラフ / 曖昧性 / 時系列 / グラフ問合せ |
|---|
| Outline of Final Research Achievements |
In this research project, we study query processing on uncertain graphs and streaming graphs. In uncertain graphs, we develop an efficient algorithm for computing network reliability, which is a probability that given vertices are connected each other in graphs whose edges have existent probabilities. In streaming graphs, we develop a framework for predicting future graphs. Moreover, we develop an advanced route search query, pattern detection techniques on probabilistic streaming data, and interpolation techniques for incomplete road data.
|
| Free Research Field |
情報科学
|
| Academic Significance and Societal Importance of the Research Achievements |
本研究はデータの曖昧性と時系列性をもつグラフの有効な利用方法を開拓し，効率的な計算技術を開発した．曖昧なグラフやストリーミンググラフは通信ネットワーク設計や都市計画など重要な応用例が多い．一方で，計算に掛かる時間やメモリ使用量が大きくなることが多いため，有用にも関わらず曖昧性や時系列変化が有効に活用されていないことが多い．本研究にて提案した効率的な計算アルゴリズムは効果的なグラフの一助となると考えている．
|
