Title
Abstract
Abstract
Downloads
References
Terrizzano, P. Schwarz, M. Roth, and J. E. Colino, “Data Wrangling: The Challenging Journey from the Wild to the Lake,” in 7th Biennial Conference on Innovative Data Systems Research CIDR’15, 2015.
K. Morton, et al., “Support the Data Enthusiast: Challenges for Next-Generation Data- Analysis Systems,” Proceedings of the VLDB Endowment, vol. 7, no. 6, pp. 453–456, 2014.
J. Varga, et al., “Towards Next Generation BI Systems: The Analytical Metadata Challenge,” Data Warehousing and Knowledge Discovery - Lecture Notes in Computer Science, vol. 8646, pp. 89–101, 2014.
H. Alrehamy and C. Walker, “Personal Data Lake with Data Gravity Pull,” in IEEE Fifth International Conference on Big Data and Cloud Computing (BDCloud), 2015, pp. 160– 167.
P. a. Bernstein, J. Madhavan, and E. Rahm, “Generic Schema Matching, Ten Years Later,” Proceedings of the VLDB Endowment, vol. 4, no. 11, pp. 695–701, 2011.
F. M. Suchanek, S. Abiteboul, and P. Senellart, “PARIS: Probabilistic Alignment of Relations, Instances, and Schema,” Proceedings of the VLDB Endowment, vol. 5, no. 3, pp. 157–168, 2011.
F. Naumann, “Data profiling revisited,” ACM SIGMOD Record, vol. 42, no. 4, pp. 40– 49, 2014.
R. Hauch, A. Miller, and R. Cardwell, “Information Intelligence: Metadata for Information Discovery, Access, and Integration,” in ACM SIGMOD international conference, 2005, pp. 793–798.
V. Santos, F. A. Baia˜o, and A. Tanaka, “An architecture to support information sources discovery through semantic search,” in IEEE Inter- national Conference on IRI, 2011, pp. 276–282.
Z. Abedjan, L. Golab, and F. Naumann, “Profiling relational data: a survey,” The VLDB Journal, vol. 24, no. 4, pp. 557–581, 2015.
S. Lacoste-Julien, et al., “SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases,” in Proceedings of the 19th ACM SIGKDD international conference, 2013, p. 572.
M. Piernik, D. Brzezinski, and T. Morzy, “Clustering XML documents by patterns,” Knowledge and Information Systems, vol. 46, no. 1, pp. 185–212, 2016.
K. Murthy, et al., “Exploiting Evidence from Unstructured Data to En- hance Master Data Management,” Proceedings of the VLDB Endowment, vol. 5, no. 12, pp. 1862–1873, 2012.
M. Interlandi, K. Shah, S. D. Tetali, M. A. Gulzar, S. Yoo, M. Kim,T. Millstein, and T. Condie, “Titian: Data Provenance Support in Spark,” Proc. VLDB Endow., vol. 9, no. 3, pp. 216–227, 2015.
S. Bykau, et al., “Bridging the Gap between Heterogeneous and Seman- tically Diverse Content of Different Disciplines,” in IEEE Workshops on DEXA, 2010, pp. 305–309.
R. Touma, O. Romero, and P. Jovanovic, “Supporting Data Integration Tasks with Semi-Automatic Ontology Construction,” in ACM Workshop on DOLAP, 2015, pp. 89–98.
S. Moawed, et al., “A Latent Semantic Indexing-Based Approach to Determine Similar Clusters in Large-scale,” New Trends in Databases and Information Systems, pp. 267–276, 2014.
J. Vanschoren, J. N. van Rijn, B. Bischl, and L. Torgo, “OpenML: networked science in machine learning,” ACM SIGKDD Explorations Newsletter, vol. 15, no. 2, pp. 49–60, 2014.
R. Steorts, S. Ventura, M. Sadinle, and S. Fienberg, “A Comparison of Blocking Methods for Record Linkage,” in International Conference on Privacy in Statistical Databases, 2014, pp. 253–268.
Published
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.