期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于结构化覆盖网的连续top-k联接查询算法 被引量：1

Algorithms of continuous top-k join query over structured overlay networks
原文传递
导出
摘要 由于分布式计算环境中数据的分散性,在结构化覆盖网上进行连续查询是一个富有挑战性的工作.本文首次提出基于结构化覆盖网连续top-k联接查询的算法,在对新数据做联接查询前,通过预计算排序函数的估值,对不可能最终影响top-k结果的数据裁剪,达到减少网络流量和计算负载目的.实验证明,这种方法在保证更多的节点参与到查询同时,能有效降低网络流量. It is challenging to process continuous queries over structured overlay networks due to the distribution characteristic of the environment. An algorithm based on top-k join queries over structured overlay networks is presented. In the proposed algorithms, the data that can not contribute the finale top-k results was discarded based on the pre-computing results of ranked functions. The performance of the algorithms was analyzed. Our algorithms reduced the network traffic while more nodes participate in the query process.
作者 赵科军 王新军 刘洋 仇一泓
机构地区 山东大学计算机科学与技术学院 山东大学网络信息中心
出处 《山东大学学报（工学版）》 CAS 北大核心 2009年第5期32-37,57,共7页 Journal of Shandong University（Engineering Science）
关键词 对等网 结构化覆盖网 连续查询 TOP-K P2P structured overlay network continuous query top-k
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献17

  • 1KARGER D, LEHMAN E, LEIGHTON F, et al. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web[C]//Proc of the 29th Annual ACM Symp on Theory of Computing. New York: ACM, 1997: 654-663.
  • 2STOICA I, MORRIS R, KARGER D, et al. Chord: a scalable peer-to-peer lookup service for intemet applications[ C]// Annum Conf of the Special Interest Group on Data Communication. New York: ACM, 2001:124-137.
  • 3RATNASAMY S, FRANCIS P, HANDLEY M, et al. A scalable content-addressable network [ C ]// SIGCOMM' 01. New York: ACM, 2001:168-175.
  • 4ROWSTRON A, RUSCHEL P. Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems [ C]//Int'l Conf on Distributed Systems Platforms. New York: ACM, 2001 : 135-141.
  • 5HUEBSCH R, HELLERSTEIN M, LANHAM N, et al. Querying the intemet with pier[C]//VLDB'02. Berlin: VLDB Endowment, 2002: 321-332.
  • 6GEDIK B, LIU L. PeerCQ: A decentralized and self-configuring peer-to-peer information monitoring system[ C]//23rd IEEE International Conference on Distributed Computing Systems, USA: IEEE Computer Society, 2003.
  • 7CHANG Y, BERGMAN L, CASTELLI V, et al. The onion technique: indexing for linear optimization queries[ C]// SIGMOD2000. New York: ACM, 2000:391-402.
  • 8HRISTIDIS V, PAPAKONSTANTINOU Y. Algorithms and applications for answering ranked queries using ranked views[J]. VLDB Journal, 2004, 13(1) :49-70.
  • 9FAGIN R, LOTEM A, NAOR M. Optimal aggregation algorithms for middleware [ C ]// In PODS. New York: ACM, 2001 : 102-113.
  • 10ChANDHURI S, GRAVANO L, MARIAN A. Optimizing topk selection queries over multimedia repositories[ J]. TKDE, 2004, 16(8) :992-1009.

同被引文献25

  • 1廖旭,张力.工作流管理系统中一种基于任务的委托模式[J].计算机工程与应用,2005,41(7):44-46. 被引量：5
  • 2TAN Pangning, STEINBACH MICHAEL, KUMAR VIP- IN. Introduction to data mining [ M ]. Beijing : Posts and Telecom Press, 2006.
  • 3邓纳姆MH.数据挖掘教程[M].北京:清华大学出版社,2005.
  • 4米哈尔斯基RS,布拉特科I,库巴特M.机器学习与数据挖掘:方法和应用[M].北京:电子工业出版社,2004.
  • 5STEINBACH M, KARYPIS G, KUMAR V. A compari- son of document clustering techniques[R]. Technical Re- prot Department of Computer and Information Science, Linkoping, 1995 : 143-150.
  • 6FASULO D. An analysis of recent work in clustering algorithms[ R ]. Techical Reprot UW-CSE-01-03-02, Uni- versity of Washington, 1999: 176-186.
  • 7ESTER M, KRIEGELH P, XU X W. Knowledge discovery in large spatial database focusing techniques for effi- cient class identification [ C ]// Proceedings of the 4th International Symposium on Advances in Spatial Databases, LNCS 951. London: Springer, 1995: 67-82.
  • 8ZHANG T. BIRCH: an efficient data clustering method for very large databases [ C ]// Proceedings of the ACM SIGMOD Intel Conf on Management of Data. Montreal: ACM Press, 1996: 73-84.
  • 9SHEIKHOLESLAMI G. Wave cluster: muli-resolution clustering approach for very large spatial databases [ C]//Proceedings of the 24th VLDB Conference. New York, USA: Morgan Kaufmann, 1998: 428-439.
  • 10HAN Jiawei, KAMBER M. Data mining: concepts and techniques [ M ]. San Francisco: Morgan Kaufmann Publishers, 2000.

引证文献1

二级引证文献5

山东大学学报（工学版）
2009年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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