ATreeGrep: Approximate Searching in Unordered Trees

An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This paper presents an approach to the nearest neighbor search problem for these trees. Given a database ¤ of unordered labeled trees and a query tree ¥ , the goal is to find those trees in ¤ that “approximately” contain ¥ . Our approach is based on storing the paths of the trees in a suffix array and then counting the number of mismatching paths between the query tree and a data tree. To speed up a search, we use a hash-based technique to filter out unqualified data trees at an early stage of the search. Experimental results obtained by running our techniques on phylogenetic trees and synthetic data demonstrate the good performance of the proposed approach. We also discuss the use of our work in XML and scientific database management.

• Type: Conference
• Year: 2002
• Where: SSDBM
• Authors: Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, Kaizhong Zhang
• Keywords: Data Trees, Database, Query Tree, SSDBM 2002, Unordered Labeled Trees