%0 Journal Article %1 palopoli2003 %A Palopoli, L. %A Sacca, D. %A Terracina, G. %A Ursino, D. %D 2003 %J Knowledge and Data Engineering, IEEE Transactions on %K bipartite closeness, conflicts cooperative data database databases, distributed graph-based graphs, heterogeneous homonymies, information matchings, maximum metrics, object schemes, semantic semantics, similarities, sources, subscheme synonymies, systems, techniques, type warehouses, weight weighted %N 2 %P 271--294 %R 10.1109/TKDE.2003.1185834 %T Uniform techniques for deriving similarities of objects and subschemes in heterogeneous databases %V 15 %X The availability of automatic tools for inferring semantics of database schemes is useful to solve several database design problems such as that of obtaining cooperative information systems or data warehouses from large sets of data sources. In this context, a main problem is to single out similarities or dissimilarities among scheme objects (interscheme properties). This paper presents graph-based techniques for a uniform derivation of interscheme properties including synonymies, homonymies, type conflicts, and subscheme similarities. These techniques are characterized by a common core: the computation of maximum weight matchings on some bipartite weighted graphs derived using a suitable metrics to measure semantic closeness of objects. The techniques have been implemented in a system prototype. Several experiments conducted with it, and (in part) accounted for in the paper, confirmed the effectiveness of our approach.

@article{palopoli2003, abstract = {The availability of automatic tools for inferring semantics of database schemes is useful to solve several database design problems such as that of obtaining cooperative information systems or data warehouses from large sets of data sources. In this context, a main problem is to single out similarities or dissimilarities among scheme objects (interscheme properties). This paper presents graph-based techniques for a uniform derivation of interscheme properties including synonymies, homonymies, type conflicts, and subscheme similarities. These techniques are characterized by a common core: the computation of maximum weight matchings on some bipartite weighted graphs derived using a suitable metrics to measure semantic closeness of objects. The techniques have been implemented in a system prototype. Several experiments conducted with it, and (in part) accounted for in the paper, confirmed the effectiveness of our approach.}, added-at = {2007-05-04T05:48:10.000+0200}, author = {Palopoli, L. and Sacca, D. and Terracina, G. and Ursino, D.}, biburl = {https://www.bibsonomy.org/bibtex/272f452812ed56463317b5f92e05b88b4/p_ansell}, description = {Context-aware business processes}, doi = {10.1109/TKDE.2003.1185834}, interhash = {8ad11183a86bddd8a9c77e5037008337}, intrahash = {72f452812ed56463317b5f92e05b88b4}, issn = {1041-4347}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, keywords = {bipartite closeness, conflicts cooperative data database databases, distributed graph-based graphs, heterogeneous homonymies, information matchings, maximum metrics, object schemes, semantic semantics, similarities, sources, subscheme synonymies, systems, techniques, type warehouses, weight weighted}, number = 2, owner = {peter}, pages = {271--294}, pdf = {HonoursResearch/Palopoli2003-UniformTechniquesForDerivingSimilaritiesOfObjectsAndSubschemesInHeterogeneousDatabases.pdf}, timestamp = {2007-05-04T05:48:12.000+0200}, title = {Uniform techniques for deriving similarities of objects and subschemes in heterogeneous databases}, volume = 15, year = 2003 }