Bidirectional expansion for keyword search on graph databases

Kacholia, Varun ; Pandit, Shashank ; Chakrabarti, Soumen ; Sudarshan, S. ; Desai, Rushi ; Karambelkar, Hrishikesh (2005) Bidirectional expansion for keyword search on graph databases In: VLDB '05 Proceedings of the 31st International Conference on Very large data bases, August 30 - September 02, 2005, Trondheim, Norway.

PDF - Other

Official URL:


Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on such graphs has received much attention lately. A central problem in this scenario is to efficiently extract from the data graph a small number of the "best" answer trees. A Backward Expanding search, starting at nodes matching keywords and working up toward confluent roots, is commonly used for predominantly text-driven queries. But it can perform poorly if some keywords match many nodes, or some node has very large degree. In this paper we propose a new search algorithm, Bidirectional Search, which improves on Backward Expanding search by allowing forward search from potential roots towards leaves. To exploit this flexibility, we devise a novel search frontier prioritization technique based on spreading activation. We present a performance study on real data, establishing that Bidirectional Search significantly outperforms Backward Expanding search.

Item Type:Conference or Workshop Item (Paper)
Source:Copyright of this article belongs to Proceedings of the VLDB Endowment International Conference.
ID Code:100084
Deposited On:12 Feb 2018 12:28
Last Modified:12 Feb 2018 12:28

Repository Staff Only: item control page