ATreeGrep: Approximate searching in unordered trees

D. Shasha, J. T.L. Wang, Huiyuan Shan, Kaizhong Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

34 Scopus citations

Abstract

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 D of unordered labeled trees and a query tree Q, the goal is to find those trees in D that "approximately" contain Q. 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.

Original languageEnglish (US)
Title of host publicationProceedings - 14th International Conference on Scientific and Statistical Database Management, SSDBM 2002
EditorsJessie Kennedy
PublisherIEEE Computer Society
Pages89-98
Number of pages10
ISBN (Electronic)0769516327
DOIs
StatePublished - 2002
Event14th International Conference on Scientific and Statistical Database Management, SSDBM 2002 - Edinburgh, Scotland, United Kingdom
Duration: Jul 24 2002Jul 26 2002

Publication series

NameProceedings of the International Conference on Scientific and Statistical Database Management, SSDBM
Volume2002-January
ISSN (Print)1099-3371

Other

Other14th International Conference on Scientific and Statistical Database Management, SSDBM 2002
CountryUnited Kingdom
CityEdinburgh, Scotland
Period7/24/027/26/02

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems

Keywords

  • Algorithm design and analysis
  • Change detection algorithms
  • Computer science
  • Decision trees
  • Filters
  • Nearest neighbor searches
  • Object oriented databases
  • Object oriented modeling
  • Phylogeny
  • XML

Fingerprint Dive into the research topics of 'ATreeGrep: Approximate searching in unordered trees'. Together they form a unique fingerprint.

Cite this