Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Schema matching and embedded value mapping for databases with opaque column names and mixed continuous and discrete-valued data fields
Jaiswal A., Miller D., Mitra P. ACM Transactions on Database Systems38 (1):1-34,2013.Type:Article
Date Reviewed: Jul 30 2013

Schema matching is a key enabler for addressing data access and knowledge acquisition in this new era of data deluge. Streams from big data and heterogeneous databases produce huge demands for analytics and information discovery. In that sense, this paper represents very important progress, since it provides an algorithm for schema matching based on two key aspects from different databases. Continuous attribute matching and the use of value mapping can point the way to enhanced schema mapping. The challenges have been addressed with a global objective function minimization algorithm that matches columns with continuous value attributes, modeled with a Gaussian mixture model and an iterative descent algorithm that embeds value mappings to enhance schema matching accuracy.

To provide a context for their proposition, the authors present a thorough history of schema matching research for heterogeneous databases, contrasting their ideas with alternatives throughout the paper. For example, they propose the use of log-likelihood versus Euclidean distance metrics and demonstrate the effectiveness of their proposed methods with experimental tests. These approaches result in a dense but straightforward resource for the researcher eager to learn about state-of-the-art schema matching.

To strengthen the proposition of this paper, it would be interesting to advance the research on two fronts: a) develop more test cases besides the same old US Census Bureau dataset of 1990, and b) enhance the study beyond the traditional relational model that obeys first and second normal forms. The former is mandatory to position the method as a real breakthrough in the field of schema matching, and the latter is required to handle schema matching in a world where big data grows exponentially.

Reviewer:  Jair Merlo Review #: CR141410 (1310-0927)
Bookmark and Share
 
Data Translation (H.2.5 ... )
 
 
Data Mining (H.2.8 ... )
 
 
Data Warehouse And Repository (H.2.7 ... )
 
 
Database Administration (H.2.7 )
 
 
Database Applications (H.2.8 )
 
Would you recommend this review?
yes
no
Other reviews under "Data Translation": Date
A language-driven generalized numerical database translator
Daini O. BIT 25(1): 91-105, 1985. Type: Article
Jun 1 1986
Using semantic values to facilitate interoperability among heterogeneous information systems
Sciore E., Siegel M., Rosenthal A. ACM Transactions on Database Systems 19(2): 254-290, 1994. Type: Article
Mar 1 1995
Big data architecture evolution: 2014 and beyond
Mohammad A., Mcheick H., Grant E.  DIVANet 2014 (Proceedings of the 4th ACM International Symposium on Development and Analysis of Intelligent Vehicular Networks and Applications, Montreal, QC, Canada, Sep 21-26, 2014)139-144, 2014. Type: Proceedings, Reviews: (1 of 2)
Nov 12 2014
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy