期刊文献+

D-Tree Approach to Constructing Overlapping Location-Dependent Data Regions

D-Tree Approach to Constructing Overlapping Location-Dependent Data Regions
原文传递
导出
摘要 For the past few years, there has been an explosion in the number of individuals carrying wireless devices that are capable of conducting location-dependent information services (LDISs) and provide information based on locations specified in the queries. This paper examines the user's demand of vague queries, and then proposes system architecture of LDISs. In particular, based on D-tree index structure, it takes the method of membership function in fuzzy set theory to provide a more user-oriented approach to constructing overlapping location-dependent data regions, called complementary void overlapping data regions. This structure, carrying more information with less additional storage, brings balance between perceived usefulness and responsiveness, energy consumption, and bandwidth contention in wireless communications. The simulations show that this method is more flexible and practical in practice.
出处 《Tsinghua Science and Technology》 SCIE EI CAS 2005年第z1期824-829,共6页 清华大学学报(自然科学版(英文版)
基金 Supported by the National Natural Science Foundation of China (No. 70271001 ), China Postdoctoral Science Foundation (No. 2002032191 ) and Donghua Fund of Science and Technology of China
  • 相关文献

参考文献16

  • 1[1]Xu J,Zheng B,Lee W C,Lee D L.The D-tree:An index structure for planar point queries in location-based wireless services.IEEE Transactions on Knowledge and Data Engineering,2004,16(12):1526 - 1542.
  • 2[2]Zheng Baihua,Xu Jianliang,Lee Dik L.Cache invalidation and replacement strategies for location-dependent data in mobile environments.IEEE Transactions on Computers,2002,51 (10):1141 - 1153.
  • 3[3]Wherever you are,wherever you go,get the information you want to know.http://www-106.ibm.com/developerworks/ibm/library/i-lbs/.
  • 4[4]Location-based services overview.http://www.cs.berkeley.edu/ ~ mattkam/.
  • 5[5]Silva Alizio P,Mateus Geraldo R.A location-based service application for a mobile computing environment.Simulation,2003,79(5-6):340-363.
  • 6[6]Talib Z B Haji,Chen M,Townsend P.Three major extensions to Kirkpatrick's point location algorithm.In:Computer Graphics International (CGI'96) ,Korea,1996:112- 121.
  • 7[7]Teillaud Monique.Union and split operations on dynamic trapezoidal maps.Computational Geometry:Theory and Applications,2000,17(3 -4):153 - 163.
  • 8[8]Guttman Antonin.R-trees:A dynamic index structure for spatial searching.In:Proceedings of the International Conference on Management of Data Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data.New York:ACM Press,1984:47 - 57.
  • 9[9]Lai Liju,Li Demin,Hao Xu.Research on spatial data index structure based on D-tree.Computer Engineering (in Chinese),accepted (2005).
  • 10[10]Tan Aik Choon,Gilbert David,Deville Yves.Integrative machine learning approach for multi-class SCOP protein fold classification.In:Mewes H W,Frishman D,Heun V,Kramer S,eds.Proceedings of the German Conference on Bioinformatics (GCB 2003),2003:153 - 159.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部