ASIA unversity:Item 310904400/86988
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 94286/110023 (86%)
造访人次 : 21654754      在线人数 : 855
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    ASIA unversity > 資訊學院 > 資訊傳播學系 > 期刊論文 >  Item 310904400/86988


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/86988


    题名: Dual-Expansion Indexing for Moving Objects
    贡献者: 資訊傳播學系
    日期: 201404
    上传时间: 2014-11-13 06:56:15 (UTC+0)
    摘要: With the development of wireless communications and mobile computing technologies, the applications of moving objects have been developed in many topics, for example, traffic monitoring. Such applications need to track the current and near-future locations of the moving objects. This motivates the development of spatial-temporal indices to support efficient querying about such locations of the moving objects. Therefore, in this study, the authors propose a dual-expansion indexing (DEI) to support the current and near-future prediction of the moving objects. To filter out more number of the data blocks that do not contain the final result, the query region can be expanded in each of eight directions individually. To further reduce the number of the data blocks that should be examined, the qualified data blocks can be expanded according to the direction towards the query region. Moreover, only the objects moving to the query region will be checked in the query process of DEI. Therefore our method can reduce more number of retrieved data blocks and that of input/output operations than the existing method. Experimental results show that the query process of DEI is more efficient than that of the existing method.
    關聯: IET Software
    显示于类别:[資訊傳播學系] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML272检视/开启


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


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈