有效的空间数据广播

Chung-Hua Chu
{"title":"有效的空间数据广播","authors":"Chung-Hua Chu","doi":"10.1109/ICME.2012.100","DOIUrl":null,"url":null,"abstract":"Data broadcast is an advanced technique to realize large scalability and bandwidth utilization in a mobile computing environment. Three dimensional (3D) contents are emerging data in the data broadcast. However, traditional data broadcast did not consider 3D data to design a data schedule in a broadcast channel. Therefore, the above drawback leads to large access delay in the 3D data broadcast. In this paper, we remedy the problem by devising an indexing technique to index the 3D data of variant geometry shapes. We propose an indexing technique using a 3D data index tree to minimize average waiting time and average tuning time for broadcasting the 3D data. Experimental results show that our approach is able to generate broadcast programs including the 3D data indices with high quality and is very efficient in the 3D data broadcast.","PeriodicalId":273567,"journal":{"name":"2012 IEEE International Conference on Multimedia and Expo","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Effective Spatial Data Broadcasting\",\"authors\":\"Chung-Hua Chu\",\"doi\":\"10.1109/ICME.2012.100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data broadcast is an advanced technique to realize large scalability and bandwidth utilization in a mobile computing environment. Three dimensional (3D) contents are emerging data in the data broadcast. However, traditional data broadcast did not consider 3D data to design a data schedule in a broadcast channel. Therefore, the above drawback leads to large access delay in the 3D data broadcast. In this paper, we remedy the problem by devising an indexing technique to index the 3D data of variant geometry shapes. We propose an indexing technique using a 3D data index tree to minimize average waiting time and average tuning time for broadcasting the 3D data. Experimental results show that our approach is able to generate broadcast programs including the 3D data indices with high quality and is very efficient in the 3D data broadcast.\",\"PeriodicalId\":273567,\"journal\":{\"name\":\"2012 IEEE International Conference on Multimedia and Expo\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE International Conference on Multimedia and Expo\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICME.2012.100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Multimedia and Expo","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICME.2012.100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

数据广播是在移动计算环境中实现大可扩展性和带宽利用率的一种先进技术。三维内容是数据广播中的新兴数据。然而,传统的数据广播并没有考虑3D数据来设计广播信道中的数据调度。因此,上述缺点导致3D数据广播中的访问延迟较大。在本文中,我们通过设计一种索引技术来对不同几何形状的三维数据进行索引,从而解决了这个问题。我们提出了一种使用3D数据索引树的索引技术,以最小化广播3D数据的平均等待时间和平均调优时间。实验结果表明,该方法能够高质量地生成包含三维数据指标的广播节目,在三维数据广播中具有很高的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Effective Spatial Data Broadcasting
Data broadcast is an advanced technique to realize large scalability and bandwidth utilization in a mobile computing environment. Three dimensional (3D) contents are emerging data in the data broadcast. However, traditional data broadcast did not consider 3D data to design a data schedule in a broadcast channel. Therefore, the above drawback leads to large access delay in the 3D data broadcast. In this paper, we remedy the problem by devising an indexing technique to index the 3D data of variant geometry shapes. We propose an indexing technique using a 3D data index tree to minimize average waiting time and average tuning time for broadcasting the 3D data. Experimental results show that our approach is able to generate broadcast programs including the 3D data indices with high quality and is very efficient in the 3D data broadcast.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信