Sciweavers

Share
EDBT
2004
ACM

Efficient Similarity Search for Hierarchical Data in Large Databases

9 years 4 months ago
Efficient Similarity Search for Hierarchical Data in Large Databases
Structured and semi-structured object representations are getting more and more important for modern database applications. Examples for such data are hierarchical structures including chemical compounds, XML data or image data. As a key feature, database systems have to support the search for similar objects where it is important to take into account both the structure and the content features of the objects. A successful approach is to use the edit distance for tree structured data. As the computation of this measure is NP-complete, constrained edit distances have been successfully applied to trees. While yielding good results, they are still computationally complex and, therefore, of limited benefit for searching in large databases. In this paper, we propose a filter and refinement architecture to overcome this problem. We present a set of new filter methods for structural and for content-based information in tree-structured data as well as ways to flexibly combine different filter ...
Karin Kailing, Hans-Peter Kriegel, Stefan Schö
Added 08 Dec 2009
Updated 08 Dec 2009
Type Conference
Year 2004
Where EDBT
Authors Karin Kailing, Hans-Peter Kriegel, Stefan Schönauer, Thomas Seidl
Comments (0)
books