Fast top-k search with relaxed graph simulation

Abstract : Graph pattern matching has been widely used in large spectrum of real applications. In this context, different models along with their appropriate algorithms have been proposed. However, a major drawback on existing models is their limitation to find meaningful matches resulting in a number of failing queries. In this paper we introduce a new model for graph pattern matching allowing the relaxation of queries in order to avoid the empty-answer problem. Then we develop an efficient algorithm based on optimization strategies for computing the top-k matches according to our model. Our experimental evaluation on four real datasets demonstrates both the effectiveness and the efficiency of our approach.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01887427
Contributor : Abdelmalek Habi <>
Submitted on : Thursday, October 4, 2018 - 10:10:06 AM
Last modification on : Friday, January 11, 2019 - 5:07:43 PM

Identifiers

  • HAL Id : hal-01887427, version 1

Citation

Abdelmalek Habi, Brice Effantin, Hamamache Kheddouci. Fast top-k search with relaxed graph simulation. The 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Aug 2018, Barcelona, Spain. ⟨hal-01887427⟩

Share

Metrics

Record views

72