Location of Repository

Bidirectional Expansion For Keyword Search on Graph Databases

By Varun Kacholia Shashank P, Rushi Desai and Hrishikesh Karambelkar

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 Backward Expanding search, starting at node

Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.412.5202
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cse.iitb.ac.in/~sud... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.