Abstract
Schema matching is widely used in many database applications, such as ontology merging, data integration, data warehouse and dataspaces. The problem of schema matching is essentially to find the semantic correspondences between attributes of schemas to be matched. The query logs imply lots of valuable information about the schemas to be matched. Thus, we propose to employ Ant Colony Optimization (ACO) to solve the problem of schema matching based on the information implied in query logs. Our main idea is to firstly extract the features about schemas from the query logs, then, use the scoring function to measure the similarity of these features, finally employ the ant colony optimization to find the optimal matching result. We validate our approach with an experimental study, the results of which demonstrate that our approach is effective and has good performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
