Conference Paper

Constraint Matching in Multiple Databases

2016 International Conference on Computers and Their Applications
Karamveer Yadav, Kasi Periyasamy

ABSTRACT


 

 Applications designed for shared domain often have different databases but there exists some commonality between these databases. In order to achieve coherency across these application databases, related database attributes and their respective content should be analyzed. One of the approaches to achieve this is schema matching and is widely accepted. In our previous work, we proposed a tool for schema matching using structural as well as linguistic matching. The present work further extends this towards content matching. We propose constraint matching not only for standard database constraints but also for application domain specific custom constraints. We came across set of validation rules for the constraint composition as well as constraint matching. This paper explains the procedure we adopted for constraint matching and the rationale for defining logical rules for constraint matching. 

CATA 2016



ISBN:
978–1–943436–02–6
PUBLISHER:
ISCA
CHIEF EDITOR:
Antoine Bossard
CONFERENCE VENUE:
Las Vegas, Nevada, USA
CONTACT DETAILS:
isca@ipass.net
Copyright © Search Innovations. All rights reserved