Kacholia, Varun ; Pandit, Shashank ; Chakrabarti, Soumen ; Sudarshan, S. ; Desai, Rushi ; Karambelkar, Hrishikesh (2005) Bidirectional Expansion For Keyword Search on Graph Databases In: 31st International Conference on Very Large Data.
Full text not available from this repository.
Abstract
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 , 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 ResearchGate GmbH |
ID Code: | 128501 |
Deposited On: | 25 Oct 2022 06:45 |
Last Modified: | 15 Nov 2022 03:37 |
Repository Staff Only: item control page