Structural similarity search in trees
From: <Kai.Grossjohann_at_CS.Uni-Dortmund.DE>
Date: 9 Jul 2002 22:55:34 -0500
Message-ID: <vaf4rfe5ko8.fsf_at_lucy.cs.uni-dortmund.de>
Suppose I have a collection of labeled ordered trees (vulgo XML documents). Suppose I have a query on the tree structure. Suppose I want this query to be interpreted in a vague way.
Date: 9 Jul 2002 22:55:34 -0500
Message-ID: <vaf4rfe5ko8.fsf_at_lucy.cs.uni-dortmund.de>
Suppose I have a collection of labeled ordered trees (vulgo XML documents). Suppose I have a query on the tree structure. Suppose I want this query to be interpreted in a vague way.
Any key words to search for in the literature?
I know of similarity between trees, but that does not appear to apply here. First of all, the query is likely to be much smaller than the documents, and therefore the similarity is likely to be low. Secondly, the query may specify things which can't be expressed as trees. For instance, suppose people search for nodes labeled A which have either a child labeled B or a grandchild labeled C. This disjunction cannot be expressed as a tree.
The second question is the relationship between the similarity and the relevance. How do we know that a similar tree is also more relevant to the user? It would be nice to have a theoretical foundation for this.
kai
-- A large number of young women don't trust men with beards. (BFBS Radio)Received on Wed Jul 10 2002 - 05:55:34 CEST
