The paper deals with an algebraic approach to the problem of approximate tree embeding based on the power of posets. The main contribution is how to construct a search tree for the set of XML documents.
The paper deals with an algebraic approach to the problem of approximate tree embeding based on the power of posets. The main contribution is how to construct a search tree for the set of XML documents. (en)