{"title":"使用树对齐对XML文档和模式进行近似匹配","authors":"Guangming Xing","doi":"10.1145/2638404.2638517","DOIUrl":null,"url":null,"abstract":"Studying structural similarity between XML documents are important for many tasks like XML data classification and XML document management. In this paper, we formally introduce the edit distance between trees and tree grammars using tree alignments. A sketch of the proof for the correctness of the algorithm is presented followed by the analysis of the efficiency of the algorithm. Experiments are conducted to show the time efficiency and validness of the distance in the context of XML document clustering.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"63 2 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Approximate matching of XML documents with schemata using tree alignment\",\"authors\":\"Guangming Xing\",\"doi\":\"10.1145/2638404.2638517\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Studying structural similarity between XML documents are important for many tasks like XML data classification and XML document management. In this paper, we formally introduce the edit distance between trees and tree grammars using tree alignments. A sketch of the proof for the correctness of the algorithm is presented followed by the analysis of the efficiency of the algorithm. Experiments are conducted to show the time efficiency and validness of the distance in the context of XML document clustering.\",\"PeriodicalId\":91384,\"journal\":{\"name\":\"Proceedings of the 2014 ACM Southeast Regional Conference\",\"volume\":\"63 2 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2014 ACM Southeast Regional Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2638404.2638517\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2014 ACM Southeast Regional Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2638404.2638517","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Approximate matching of XML documents with schemata using tree alignment
Studying structural similarity between XML documents are important for many tasks like XML data classification and XML document management. In this paper, we formally introduce the edit distance between trees and tree grammars using tree alignments. A sketch of the proof for the correctness of the algorithm is presented followed by the analysis of the efficiency of the algorithm. Experiments are conducted to show the time efficiency and validness of the distance in the context of XML document clustering.