Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: b data integration is an important preprocessing step for b mining. It is highly likely that several records on the b whose textual representations differ may represent the same real world entity. These records are called approximate duplicates. Data integration seeks to identify such approximate duplicates and merge them into integrated records. Many existing data integration algorithms make use of approximate string join, which seeks to (approximately) find all pairs of strings whose distances are less than a certain threshold. ,  propose a new mapping method to detect pairs of strings with similarity above a certain threshold. In our method, each string is first mapped to a point in a high dimensional grid space, then pairs of points whose distances are 1 are identified.  implement it using Oracle SQL and PL/SQL. Finally,  evaluate this method using real data sets. Experimental results suggest that our method is both accurate and efficient.
['Yingping Huang', 'Gregory R. Madey']
I am writing a research paper on a idea Web data integration using approximate string join
[{"from": "human", "value": "I am writing a research paper on a idea Web data integration using approximate string join"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: b data integration is an important preprocessing step for b mining. It is highly likely that several records on the b whose textual representations differ may represent the same real world entity. These records are called approximate duplicates. Data integration seeks to identify such approximate duplicates and merge them into integrated records. Many existing data integration algorithms make use of approximate string join, which seeks to (approximately) find all pairs of strings whose distances are less than a certain threshold. ,  propose a new mapping method to detect pairs of strings with similarity above a certain threshold. In our method, each string is first mapped to a point in a high dimensional grid space, then pairs of points whose distances are 1 are identified.  implement it using Oracle SQL and PL/SQL. Finally,  evaluate this method using real data sets. Experimental results suggest that our method is both accurate and efficient."}]