| Budget Amount *help |
¥3,900,000 (Direct Cost: ¥3,000,000、Indirect Cost: ¥900,000)
Fiscal Year 2014: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2013: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2012: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
|
|---|
| Outline of Final Research Achievements |
Trees are used for representing and processing various data such as XML documents and mathematical formulas. We studied efficient tree matching and retrieval algorithms. This study focuses on the algorithms for unordered trees that generally require high computation cost. We first proposed an unordered tree matching algorithm that is especially effective for narrow trees and developed a program that can calculate the similarity of mid sized trees within reasonable processing time. For processing large tree databases, we developed efficient indices that can detect candidate trees from the database. For the case that tree structure is important for retrieval, we made a metric space-based index that converts each tree to a feature vector then makes a metric space for the vectors. Then, we apply a pivot-based indexing technique.
|
