Approximate Querying of Semistructured Data Using a Relational Database System
Gong Yu-chan · 2005
An approach to approximate querying of general graph structured semistructured data is proposed based on a relational database system.A similarity measure for paths based on nesting structures and text values was brought out,from which the similarity between the target query node and a data source node was derived.To get the source nodes similar to the target query node,firstly the paths whose lengths were within an interval were extracted from the data source,then a similarity join process between them and the query paths was carried out using a relational database system.Finally the query result nodes were returned in a descend order of their similarity to the target query node.To make the similarity join process more efficient,the concept of q-windows was introduced and several necessary conditions were used to decrease the time of calculating costly similarity function.The experiments prove the effectiveness of the approach.