Schema profiling of document-oriented databases

被引:47
作者
Gallinucci, Enrico [1 ,2 ]
Golfarelli, Matteo [1 ,2 ]
Rizzi, Stefano [1 ,2 ]
机构
[1] Univ Bologna, DISI, Viale Risorgimento 2, I-40136 Bologna, Italy
[2] CINI, Via Solaria 113, I-00198 Rome, Italy
基金
欧盟地平线“2020”;
关键词
NoSQL; Document-oriented databases; Schema discovery; Decision trees;
D O I
10.1016/j.is.2018.02.007
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In document-oriented databases, schema is a soft concept and the documents in a collection can be stored using different local schemata. This gives designers and implementers augmented flexibility; however, it requires an extra effort to understand the rules that drove the use of alternative schemata when sets of documents with different -and possibly conflicting- schemata are to be analyzed or integrated. In this paper we propose a technique, called schema profiling, to explain the schema variants within a collection in document-oriented databases by capturing the hidden rules explaining the use of these variants. We express these rules in the form of a decision tree (schema profile). Consistently with the requirements we elicited from real users, we aim at creating explicative, precise, and concise schema profiles. The algorithm we adopt to this end is inspired by the well-known C4.5 classification algorithm and builds on two original features: the coupling of value-based and schema-based conditions within schema profiles, and the introduction of a novel measure of entropy to assess the quality of a schema profile. A set of experimental tests made on both synthetic and real datasets demonstrates the effectiveness and efficiency of our approach. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:13 / 25
页数:13
相关论文
共 33 条
[1]  
[Anonymous], 2014, C4. 5: programs for machine learning
[2]  
[Anonymous], 2004, SIGMOD, DOI DOI 10.1145/1007568.1007612
[3]  
Bernstein PA, 2011, PROC VLDB ENDOW, V4, P695
[4]   Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data [J].
Bex, Geert Jan ;
Gelade, Wouter ;
Neven, Frank ;
Vansummeren, Stijn .
ACM TRANSACTIONS ON THE WEB, 2010, 4 (04)
[5]  
Bohannon P., 2006, P 32 INT C VERY LARG, P307
[6]   EXTENSIONS TO THE CART ALGORITHM [J].
CRAWFORD, SL .
INTERNATIONAL JOURNAL OF MAN-MACHINE STUDIES, 1989, 31 (02) :197-217
[7]  
Dai Wei., 2014, International Journal of Database Theory and Application, V7, P49, DOI DOI 10.14257/IJDTA.2014.7.1.05
[8]  
Deng HT, 2011, LECT NOTES COMPUT SC, V6792, P293, DOI 10.1007/978-3-642-21738-8_38
[9]  
Domingos P., 2000, Proceedings. KDD-2000. Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P71, DOI 10.1145/347090.347107
[10]  
Dong XL, 2013, PROC INT CONF DATA, P1245, DOI 10.1109/ICDE.2013.6544914