Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases structural information is available and can be used to match such data. As a running example  use residential address information. Addresses are hierarchical structures and are present in many databases. Often they are the best, if not only, relationship beten autonomous data sources. Typically the matching has to be approximate since the representations in the sources differ. propose pq-grams to approximately match hierarchical information from autonomous sources.  define the pq-gram distance beten ordered labeled trees as an effective and efficient approximation of the ll-known tree edit distance.  analyze the properties of the pq-gram distance and compare it with the edit distance and alternative approximations. Experiments with synthetic and real world data confirm the analytic results and the scalability of our approach.
['Nikolaus Augsten', 'Michael H. Böhlen', 'Johann Gamper']
I am writing a research paper on a idea Approximate matching of hierarchical data using pq -grams
[{"from": "human", "value": "I am writing a research paper on a idea Approximate matching of hierarchical data using pq -grams"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases structural information is available and can be used to match such data. As a running example  use residential address information. Addresses are hierarchical structures and are present in many databases. Often they are the best, if not only, relationship beten autonomous data sources. Typically the matching has to be approximate since the representations in the sources differ. propose pq-grams to approximately match hierarchical information from autonomous sources.  define the pq-gram distance beten ordered labeled trees as an effective and efficient approximation of the ll-known tree edit distance.  analyze the properties of the pq-gram distance and compare it with the edit distance and alternative approximations. Experiments with synthetic and real world data confirm the analytic results and the scalability of our approach."}]