Summarizing relational database schema based on label propagation

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Real enterprise databases are usually composed of hundreds of tables, which make querying a complex database a really hard task for unprofessional users, especially when lack of documentation. Schema summarization helps to improve the usability of databases and provides a succinct overview of the entire schema. In this paper, we introduce a novel three-step schema summarization method based on label propagation. First, we exploit varied similarity properties in database schema and propose a measure of table similarity based on Radial Basis Function Kernel, which measures similarity properties comprehensively. Second, we find representative tables as labeled data and annotate the labeled schema graph. Finally, we use label propagation algorithm on the labeled schema graph to classify database schema and create a schema summary. Extensive evaluations demonstrate the effectiveness of our approach. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Yuan, X., Li, X., Yu, M., Cai, X., Zhang, Y., & Wen, Y. (2014). Summarizing relational database schema based on label propagation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8709 LNCS, pp. 258–269). Springer Verlag. https://doi.org/10.1007/978-3-319-11116-2_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free