一个可查询的同态XML压缩器

Baydaa T. Al-Hamadani1, R. Alwan, Joan Lu
{"title":"一个可查询的同态XML压缩器","authors":"Baydaa T. Al-Hamadani1, R. Alwan, Joan Lu","doi":"10.1109/IIT.2009.5413789","DOIUrl":null,"url":null,"abstract":"XML has becoming the standard way for representing and transforming data over the World Wide Web. The annoying problem with XML documents is that they have a very high ratio of redundancy, which makes these documents storage demanding and require a large network band-width for transmission. To remedy this problem, a lot of approaches had been conducted in order to compress XML documents. Some of these approaches supply querying the compressed documents, while others compress the XML documents for archival purposes. In this paper we propose a new XML compression technique that obeys the structure of the XML documents and provides the ability to querying the compressed document with both content and structure (CAS) queries type. XML elements and attributes names are encoded by using fixed-point dictionary-based technique. Other XML data are organized into special containers according to their path from the root attribute, and the containers are compressed using the same fixed-point technique. Using different types of XML documents and different styles of user queries, the XQPoint has been experimented to test its effectiveness in both the compression ratio and the querying performance.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"XQPoint: A queriable homomorphic XML compressor\",\"authors\":\"Baydaa T. Al-Hamadani1, R. Alwan, Joan Lu\",\"doi\":\"10.1109/IIT.2009.5413789\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"XML has becoming the standard way for representing and transforming data over the World Wide Web. The annoying problem with XML documents is that they have a very high ratio of redundancy, which makes these documents storage demanding and require a large network band-width for transmission. To remedy this problem, a lot of approaches had been conducted in order to compress XML documents. Some of these approaches supply querying the compressed documents, while others compress the XML documents for archival purposes. In this paper we propose a new XML compression technique that obeys the structure of the XML documents and provides the ability to querying the compressed document with both content and structure (CAS) queries type. XML elements and attributes names are encoded by using fixed-point dictionary-based technique. Other XML data are organized into special containers according to their path from the root attribute, and the containers are compressed using the same fixed-point technique. Using different types of XML documents and different styles of user queries, the XQPoint has been experimented to test its effectiveness in both the compression ratio and the querying performance.\",\"PeriodicalId\":239829,\"journal\":{\"name\":\"2009 International Conference on Innovations in Information Technology (IIT)\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Innovations in Information Technology (IIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IIT.2009.5413789\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Innovations in Information Technology (IIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIT.2009.5413789","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

XML已经成为在万维网上表示和转换数据的标准方式。XML文档的恼人问题是它们具有非常高的冗余比率,这使得这些文档的存储要求很高,并且需要很大的网络带宽进行传输。为了解决这个问题,已经采用了许多方法来压缩XML文档。其中一些方法提供对压缩文档的查询,而另一些方法则压缩XML文档以用于存档。在本文中,我们提出了一种新的XML压缩技术,该技术遵循XML文档的结构,并提供了以内容和结构(CAS)查询类型查询压缩文档的能力。XML元素和属性名通过使用基于定点字典的技术进行编码。其他XML数据根据其从根属性开始的路径组织到特殊的容器中,并且使用相同的定点技术压缩容器。使用不同类型的XML文档和不同样式的用户查询,对XQPoint进行了实验,以测试其在压缩比和查询性能方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
XQPoint: A queriable homomorphic XML compressor
XML has becoming the standard way for representing and transforming data over the World Wide Web. The annoying problem with XML documents is that they have a very high ratio of redundancy, which makes these documents storage demanding and require a large network band-width for transmission. To remedy this problem, a lot of approaches had been conducted in order to compress XML documents. Some of these approaches supply querying the compressed documents, while others compress the XML documents for archival purposes. In this paper we propose a new XML compression technique that obeys the structure of the XML documents and provides the ability to querying the compressed document with both content and structure (CAS) queries type. XML elements and attributes names are encoded by using fixed-point dictionary-based technique. Other XML data are organized into special containers according to their path from the root attribute, and the containers are compressed using the same fixed-point technique. Using different types of XML documents and different styles of user queries, the XQPoint has been experimented to test its effectiveness in both the compression ratio and the querying performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信