期刊文献+

云数据的划分存储和查询研究

Research on Partition Storage and Query of Cloud Data
原文传递
导出
摘要 随着网络数据、生产数据的大幅增长,数据存储和查询面临着严峻的挑战.数据划分技术可将海量数据分布存储在多台机器中,既能解决单机存储容量问题,也能通过划分区间来缩小数据查询范围.为此,研究了海量数据背景下数据划分存储和查询的方法,设计了将海量数据按角度和距离值计算其所属数据区间,并分布存储到该区间对应的机器文件中,从而实现了大数据量的文件以小数据量的文件存储,使得查询数据时可以先通过索引表找到所属的数据区间其所在文件,再进行查询即可,这样缩小了数据查询范围,而且还可以通过多机器协同查询,加快查询速度.对采用以上方法划分存储的数据进行了Top-K查询,验证了方法的有效性. With the increase of network data and production data, data storage and query are facing severe challenges. Data partitioning technology can be stored in a large number of data storage in a number of machines, both to solve the problem of single storage capacity, but also through the division of the range to narrow the range of data query. Therefore, on the background of data partitioning method for massive data storage and query, designed the massive data according to the angle and distance calculation in the data range, and stored in the distribution of the interval corresponding to the machine file, in order to achieve a large amount of data files with a small amount of data file storage, query the data can first find the index table by the interval data file, and then you can query, thus reducing the scope of data query, but also through multi robot collaborative query speed up queries. By using the above method to partition the data stored in the top-K query, the validity of the method is verified.
出处 《南开大学学报(自然科学版)》 CAS CSCD 北大核心 2017年第3期1-8,共8页 Acta Scientiarum Naturalium Universitatis Nankaiensis
基金 天津市自然科学基金(14ZCZDGX00032 14ZXDZGX00867 15ZXDSGX00090 15ZXHLGX00360 15ZXH LGX00380)
关键词 云数据 划分 存储 TOP-K查询 索引表 cloud data partition storage top-K query index table
  • 相关文献

参考文献4

二级参考文献17

  • 1陈东升.消费行为的模糊数学模型[J].经济经纬,2004,21(4):21-22. 被引量:4
  • 2冯玉才,万春.基于集群的数据库系统原型DMC[J].计算机工程与科学,2005,27(3):56-57. 被引量:3
  • 3徐顼,方永锋,张忠辅,封志宏,吴长虹.基于模糊数学的计算机性能评价和销售预测的研究[J].甘肃联合大学学报(自然科学版),2007,21(2):15-17. 被引量:2
  • 4张登银 张小英.IP电话技术原理与应用[M].北京:人民邮电出版社,2000..
  • 5Michael J M,Steve D,Bruce M G.Towards a HPC Framework for Integrated Processing of Geographical Data:Encapsulating the Complexity of Parallel Algorithms[J].Trans in GIS,2000,4(3):245-262.
  • 6杨冬青,马秀莉,唐世渭,等.数据库系统概念[M].北京:机械工业出版社,2006.
  • 7An N,Lu R,Qian L.A Siuasubramaniam,T Keefe.Storing Spatial Data On a Network of Workstations[J].Cluster Computing,1999:259-270.
  • 8Guttman A.R-trees:A Dynamic Index Structure for Spatial Searching[C] ∥Proc.ACM SIGMOD Int'1 Conf on Management of Data.1984:47-57.
  • 9Bohm C,Berchtold S,Keim D A.Searching in Hingh-dimensionalSpaces-index Structures for Improving the Performance of Multimedia Databases[J].ACM Computing Surveys,2001,33(3):322-373.
  • 10Wang Shaowen,Armstrong M P.A Quadtree Approach to Domain Decomposition for Spatial Interpolation in Grid Computing Environments[J].Parallel Computing,2003,29:1481-1504.

共引文献69

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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