使用常规树自动机作为XML模式

Proceedings IEEE Advances in Digital Libraries 2000 Pub Date : 2000-05-22 DOI:10.1109/ADL.2000.848373

Boris Chidlovskii

{"title":"使用常规树自动机作为XML模式","authors":"Boris Chidlovskii","doi":"10.1109/ADL.2000.848373","DOIUrl":null,"url":null,"abstract":"We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful than the XML DTDs and is closed under main algebraic operations. We introduce the XML query algebra based on the tree automata model, and discuss the query optimization and query pruning techniques. Finally we show the conversion of tree automata schema into XML DTDs.","PeriodicalId":426762,"journal":{"name":"Proceedings IEEE Advances in Digital Libraries 2000","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":"{\"title\":\"Using regular tree automata as XML schemas\",\"authors\":\"Boris Chidlovskii\",\"doi\":\"10.1109/ADL.2000.848373\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful than the XML DTDs and is closed under main algebraic operations. We introduce the XML query algebra based on the tree automata model, and discuss the query optimization and query pruning techniques. Finally we show the conversion of tree automata schema into XML DTDs.\",\"PeriodicalId\":426762,\"journal\":{\"name\":\"Proceedings IEEE Advances in Digital Libraries 2000\",\"volume\":\"74 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"60\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE Advances in Digital Libraries 2000\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ADL.2000.848373\",\"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 IEEE Advances in Digital Libraries 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ADL.2000.848373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 60

摘要

我们解决了紧凑XML模式的问题，并提出了正则树自动机来对XML数据建模。我们展示了树自动机模型比XML dtd更强大，并且在主要代数操作下是封闭的。介绍了基于树自动机模型的XML查询代数，讨论了查询优化和查询剪枝技术。最后，我们展示了树自动机模式到XML dtd的转换。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Using regular tree automata as XML schemas

We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful than the XML DTDs and is closed under main algebraic operations. We introduce the XML query algebra based on the tree automata model, and discuss the query optimization and query pruning techniques. Finally we show the conversion of tree automata schema into XML DTDs.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings IEEE Advances in Digital Libraries 2000

自引率

0.00%

发文量