An Efficient Broadcast Scheme for Wireless Data Schedule Under a New Data Affinity Model

南華大學機構典藏系統 > 科技學院 > 資訊管理學系 > 期刊論文 > Item 987654321/25081

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://nhuir.nhu.edu.tw/handle/987654321/25081

题名:	An Efficient Broadcast Scheme for Wireless Data Schedule Under a New Data Affinity Model
作者:	吳光閔;Wu, Guang-Ming;Wang, Chin-Bin;Tsaih, Derchian;Ho, Yun-Ting
貢獻者:	資訊管理學系
日期:	2005
上传时间:	2017-07-18 15:47:50 (UTC+8)
摘要:	Data schedule in broadcasting is playing a more importance role due to increasing demand for large client popularity and vast amount of information. For system with multipoint queries, data records which queried by same query are broadcasted contiguously to reduce the average access time. Several techniques have been used in clustering data by defining the affinity between them. The data affinity function defined was mainly aiming at minimizing the linear Query Distance. However, our work showing that in order to minimize the average access time, the objective function shall be in quadratic form. We propose a MinimumGap algorithm(MG) which merge relevant segments base on this new affinity function. Through extensive experiments, the results show not only the query’s access time can be reduced by using this new affinity function, by using a dummy segment to speed our algorithm, the scheme we proposed have significant saving on both time complexity and memory space complexity.
關聯:	Lecture Notes in Computer Science vol. 3391 pp.390-400
显示于类别:	[資訊管理學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	363	检视/开启

在NHUIR中所有的数据项都受到原著作权保护.

TAIR相关文章