{"title":"关于挖掘XML完整性约束","authors":"S. Fajt, I. Holubová, M. Nečaský","doi":"10.1109/ICDIM.2011.6093314","DOIUrl":null,"url":null,"abstract":"Since XML documents can appear in any semi-structured form, structural and integrity constraints are often imposed on the data that are to be modified or processed. These constraints are formally defined in a schema. But, despite the obvious advantages, the presence of a schema is not mandatory and many XML documents are not joined with any. Consequently, no integrity constrains are specified as well. In this paper we focus on extension of approaches for inferring an XML schema from a sample set of XML documents with mining primary and foreign keys. In particular we consider the keys in the context of XSD, i.e. absolute and relative as well as simple and composite keys. We propose a novel approach called KeyMiner and depict its efficiency experimentally using real-world and synthetic data.","PeriodicalId":355775,"journal":{"name":"2011 Sixth International Conference on Digital Information Management","volume":"122 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On mining XML integrity constraints\",\"authors\":\"S. Fajt, I. Holubová, M. Nečaský\",\"doi\":\"10.1109/ICDIM.2011.6093314\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since XML documents can appear in any semi-structured form, structural and integrity constraints are often imposed on the data that are to be modified or processed. These constraints are formally defined in a schema. But, despite the obvious advantages, the presence of a schema is not mandatory and many XML documents are not joined with any. Consequently, no integrity constrains are specified as well. In this paper we focus on extension of approaches for inferring an XML schema from a sample set of XML documents with mining primary and foreign keys. In particular we consider the keys in the context of XSD, i.e. absolute and relative as well as simple and composite keys. We propose a novel approach called KeyMiner and depict its efficiency experimentally using real-world and synthetic data.\",\"PeriodicalId\":355775,\"journal\":{\"name\":\"2011 Sixth International Conference on Digital Information Management\",\"volume\":\"122 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Sixth International Conference on Digital Information Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDIM.2011.6093314\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Sixth International Conference on Digital Information Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDIM.2011.6093314","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Since XML documents can appear in any semi-structured form, structural and integrity constraints are often imposed on the data that are to be modified or processed. These constraints are formally defined in a schema. But, despite the obvious advantages, the presence of a schema is not mandatory and many XML documents are not joined with any. Consequently, no integrity constrains are specified as well. In this paper we focus on extension of approaches for inferring an XML schema from a sample set of XML documents with mining primary and foreign keys. In particular we consider the keys in the context of XSD, i.e. absolute and relative as well as simple and composite keys. We propose a novel approach called KeyMiner and depict its efficiency experimentally using real-world and synthetic data.