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
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.