移动数据库中多通道数据传播的广播索引方案分类

A. Waluyo, B. Srinivasan, D. Taniar
{"title":"移动数据库中多通道数据传播的广播索引方案分类","authors":"A. Waluyo, B. Srinivasan, D. Taniar","doi":"10.1109/AINA.2004.1283913","DOIUrl":null,"url":null,"abstract":"Data broadcasting strategy is known as a scalable way to disseminate information to mobile users. However, with a very large set of broadcast items, the query access time of mobile clients raise accordingly, due to high waiting time for mobile clients to find their data of interest. One possible solution is to split the database information into several broadcast channels. In this paper, we introduce taxonomy of index dissemination for multibroadcast channel based on B* tree structure. We consider three indexing schemes namely: (i) nonreplicated indexing scheme (NRI), (ii) partially-replicated indexing scheme (PRI), and (iii) fully-replicated indexing scheme (FRI). Simulation model is developed to find out the access time performance of each scheme.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"A taxonomy of broadcast indexing schemes for multi channel data dissemination in mobile databases\",\"authors\":\"A. Waluyo, B. Srinivasan, D. Taniar\",\"doi\":\"10.1109/AINA.2004.1283913\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data broadcasting strategy is known as a scalable way to disseminate information to mobile users. However, with a very large set of broadcast items, the query access time of mobile clients raise accordingly, due to high waiting time for mobile clients to find their data of interest. One possible solution is to split the database information into several broadcast channels. In this paper, we introduce taxonomy of index dissemination for multibroadcast channel based on B* tree structure. We consider three indexing schemes namely: (i) nonreplicated indexing scheme (NRI), (ii) partially-replicated indexing scheme (PRI), and (iii) fully-replicated indexing scheme (FRI). Simulation model is developed to find out the access time performance of each scheme.\",\"PeriodicalId\":186142,\"journal\":{\"name\":\"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2004.1283913\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2004.1283913","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 45

摘要

数据广播策略是一种向移动用户传播信息的可扩展方式。但是,当广播项集非常大时,移动客户端的查询访问时间也会相应增加,因为移动客户端需要等待很长时间才能找到自己感兴趣的数据。一种可能的解决方案是将数据库信息拆分为几个广播通道。本文介绍了基于B*树结构的多广播信道索引传播分类法。我们考虑了三种索引方案,即:(i)非复制索引方案(NRI), (ii)部分复制索引方案(PRI)和(iii)完全复制索引方案(FRI)。建立了仿真模型,分析了各方案的访问时间性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A taxonomy of broadcast indexing schemes for multi channel data dissemination in mobile databases
Data broadcasting strategy is known as a scalable way to disseminate information to mobile users. However, with a very large set of broadcast items, the query access time of mobile clients raise accordingly, due to high waiting time for mobile clients to find their data of interest. One possible solution is to split the database information into several broadcast channels. In this paper, we introduce taxonomy of index dissemination for multibroadcast channel based on B* tree structure. We consider three indexing schemes namely: (i) nonreplicated indexing scheme (NRI), (ii) partially-replicated indexing scheme (PRI), and (iii) fully-replicated indexing scheme (FRI). Simulation model is developed to find out the access time performance of each scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信