分布式数据流处理系统动态负载管理研究
|
摘要
近年来,网络路由、入侵检测、传感器网络、股票分析、交通管理、移动通信、环境监测、健康状况监控、基于RFID的物品跟踪、电子商务交易信息以及数字化战场等应用领域的数据不断增长,给传统的数据处理技术带来了极大的挑战。这类应用具有数据量巨大、数据持续不断地到达且没有边界、具有一定的实时性以及数据具有时效性等特点,传统的数据处理方式已经难以适应这类应用的需要。近年来出现的数据流管理技术,为这一类应用提供了一条很好的途径,这一研究领域得到了研究工作者的密切关注。
负载管理是保证数据流处理系统正常运行,提高数据流处理系统性能的关键技术之一。现有的数据流处理系统存在扩展性不强、适应面狭窄等问题,难以适应分布式数据流处理的需要。本文对数据流处理系统的基本结构、工作原理、实现方法以及系统特点等进行了讨论,针对单位时间内输入系统的数据元组变化引起的系统过载问题,探讨了数据流处理系统负载管理模型的构建方法,并对负载平衡、负载丢弃以及分布式多数据流的连接操作等关键技术进行了深入地研究。主要工作和研究成果如下:
(1)提出了一种基于Chord扩展的层次型重叠网络vRing,通过对Chord进行扩展,充分利用网络的接近性构造vRing,从而形成一个分层的重叠网络,为系统的负载平衡提供一个合适的底层网络。在vRing的基础上,提出了一种分层的分布式动态数据流负载平衡算法vDDSLB。当某个节点超载时,负载平衡算法先在位于同一子域的节点间进行负载的迁移;当同一子域中的负载平衡仍不能满足需要时,再选择在整个系统范围内进行负载平衡。绝大部分的负载迁移活动都位于相应的子域内,减少了数据延迟和系统开销。
(2)提出了一种基于线性规划的分布式负载丢弃算法LPBDLS。目前的负载丢弃算法主要侧重于单个节点内部的处理,对于节点间的负载丢弃研究较少,本文提出的LPBDLS算法是一种分布式的负载丢弃算法,除了考虑CPU约束外,还将网络连接做为一个重要约束条件,提高了网络连接受限情况下的系统吞吐量。
(3)提出了一种多数据流分布式连接查询算法DMS-Join。由于数据流系统天然的分布性,将连接操作分布处理比集中式处理更适合多数据流系统的特点,在分布式环境下,网络传输带宽是一定的,本文提出的算法,在网络传输约束条件下,能够有效地完成多数据流的分布式连接操作问题。
(4)提出了一个基于vRing的动态分布式负载管理系统框架。该系统框架建立在Chord重叠网络的扩展vRing的基础之上,利用vRing的网络接近性和其分层的特性,设计了一个分层的动态分布式负载管理系统框架。
本文对负载管理技术的研究,为有效应对分布式数据流系统的负载问题提供了理论支持和应用借鉴,对进一步提高数据流系统性能以及更加深入的应用研究具有重要的意义。
Recently, there has been much interest in building stream processing applications, such as stock markets, network monitoring, security surveillance, financial analysis, online transaction, healthy monitor, RFID-based object tracing, sensor applications and pervasive environments. In these typical applications, data are usually unbounded, continuous, huge in amount, fast arriving, time various and out bursting. The traditional data processing, which can deal with the snapshot queries perfectly, can not satisfy the requirements of these data stream applications. In recent years, researchers begin pay more attention to data stream management technologies, such as constructing and optimization of data stream management system (DSMS), data stream mining and so on.
Load balancing is one of the key technologies to ensure the regular service and to improve the system performance of DSMS. The existed DSMS can not satisfy the requirement of distributed data stream processing because of the low scalability. In this dissertation, we study the basic structures, principles, realizations, characteristics and the main application fields. To deal with overload problems aroused by the variety of input data rate, we discuss the method of constructing load management system, further more study particularly the key technologies of load balancing, load-shedding and distributed multiple data stream join operation. The main work and contributions are the following:
(1) A hierarchical overlay network (vRing) is proposed first. Then, a load balancing algorithm (vDDSLB) is proposed based on the vRing overlay network. vRing is extended from Chord. By using the network proximity information, vRing becomes a hierarchical overlay network. vDDSLB is a hierarchical load balancing algorithm. It constructs on the basis of vRing. When a node becomes overloaded, vDDSLB will load balancing in the sub-domain first. If the locale load balancing can not satisfy the load balancing requirement, it will launch the global load balancing. Because the most of the scheduling work are happened in the sub-domain, the system performance will be increased and the latency of data tuple will be decreased.
(2) A load-shedding algorithm (LPBDLS) is proposed based on the linear programming method. The existed load-shedding algorithms focused on the query network located on a single node. LPBDLS is an inter-node distributed load-shedding algorithm. It takes the CPU power constraint not only, but also the network bandwidth constraint into account. The system throughputs are increased especially in tightly network bandwidth resource environment.
(3) A distributed multiple data stream join algorithm (DMS-Join) is proposed. For the inherence of distribution of data stream, it is better to put the join operators on different node than to put them on a single node. Our algorithm can achieve higher performance under the bandwidth constraint.
(4) A dynamic distributed load management system is proposed based on the hierarchical vRing overlay network. It takes advantages of the hierarchical feature and the network proximity of vRing to construct a hierarchical load management system.
The study of load management technology in this dissertation provides the theory and application support for DSMS, it may have potential and important effect to improve the performance of DSMS.
负载管理是保证数据流处理系统正常运行,提高数据流处理系统性能的关键技术之一。现有的数据流处理系统存在扩展性不强、适应面狭窄等问题,难以适应分布式数据流处理的需要。本文对数据流处理系统的基本结构、工作原理、实现方法以及系统特点等进行了讨论,针对单位时间内输入系统的数据元组变化引起的系统过载问题,探讨了数据流处理系统负载管理模型的构建方法,并对负载平衡、负载丢弃以及分布式多数据流的连接操作等关键技术进行了深入地研究。主要工作和研究成果如下:
(1)提出了一种基于Chord扩展的层次型重叠网络vRing,通过对Chord进行扩展,充分利用网络的接近性构造vRing,从而形成一个分层的重叠网络,为系统的负载平衡提供一个合适的底层网络。在vRing的基础上,提出了一种分层的分布式动态数据流负载平衡算法vDDSLB。当某个节点超载时,负载平衡算法先在位于同一子域的节点间进行负载的迁移;当同一子域中的负载平衡仍不能满足需要时,再选择在整个系统范围内进行负载平衡。绝大部分的负载迁移活动都位于相应的子域内,减少了数据延迟和系统开销。
(2)提出了一种基于线性规划的分布式负载丢弃算法LPBDLS。目前的负载丢弃算法主要侧重于单个节点内部的处理,对于节点间的负载丢弃研究较少,本文提出的LPBDLS算法是一种分布式的负载丢弃算法,除了考虑CPU约束外,还将网络连接做为一个重要约束条件,提高了网络连接受限情况下的系统吞吐量。
(3)提出了一种多数据流分布式连接查询算法DMS-Join。由于数据流系统天然的分布性,将连接操作分布处理比集中式处理更适合多数据流系统的特点,在分布式环境下,网络传输带宽是一定的,本文提出的算法,在网络传输约束条件下,能够有效地完成多数据流的分布式连接操作问题。
(4)提出了一个基于vRing的动态分布式负载管理系统框架。该系统框架建立在Chord重叠网络的扩展vRing的基础之上,利用vRing的网络接近性和其分层的特性,设计了一个分层的动态分布式负载管理系统框架。
本文对负载管理技术的研究,为有效应对分布式数据流系统的负载问题提供了理论支持和应用借鉴,对进一步提高数据流系统性能以及更加深入的应用研究具有重要的意义。
Recently, there has been much interest in building stream processing applications, such as stock markets, network monitoring, security surveillance, financial analysis, online transaction, healthy monitor, RFID-based object tracing, sensor applications and pervasive environments. In these typical applications, data are usually unbounded, continuous, huge in amount, fast arriving, time various and out bursting. The traditional data processing, which can deal with the snapshot queries perfectly, can not satisfy the requirements of these data stream applications. In recent years, researchers begin pay more attention to data stream management technologies, such as constructing and optimization of data stream management system (DSMS), data stream mining and so on.
Load balancing is one of the key technologies to ensure the regular service and to improve the system performance of DSMS. The existed DSMS can not satisfy the requirement of distributed data stream processing because of the low scalability. In this dissertation, we study the basic structures, principles, realizations, characteristics and the main application fields. To deal with overload problems aroused by the variety of input data rate, we discuss the method of constructing load management system, further more study particularly the key technologies of load balancing, load-shedding and distributed multiple data stream join operation. The main work and contributions are the following:
(1) A hierarchical overlay network (vRing) is proposed first. Then, a load balancing algorithm (vDDSLB) is proposed based on the vRing overlay network. vRing is extended from Chord. By using the network proximity information, vRing becomes a hierarchical overlay network. vDDSLB is a hierarchical load balancing algorithm. It constructs on the basis of vRing. When a node becomes overloaded, vDDSLB will load balancing in the sub-domain first. If the locale load balancing can not satisfy the load balancing requirement, it will launch the global load balancing. Because the most of the scheduling work are happened in the sub-domain, the system performance will be increased and the latency of data tuple will be decreased.
(2) A load-shedding algorithm (LPBDLS) is proposed based on the linear programming method. The existed load-shedding algorithms focused on the query network located on a single node. LPBDLS is an inter-node distributed load-shedding algorithm. It takes the CPU power constraint not only, but also the network bandwidth constraint into account. The system throughputs are increased especially in tightly network bandwidth resource environment.
(3) A distributed multiple data stream join algorithm (DMS-Join) is proposed. For the inherence of distribution of data stream, it is better to put the join operators on different node than to put them on a single node. Our algorithm can achieve higher performance under the bandwidth constraint.
(4) A dynamic distributed load management system is proposed based on the hierarchical vRing overlay network. It takes advantages of the hierarchical feature and the network proximity of vRing to construct a hierarchical load management system.
The study of load management technology in this dissertation provides the theory and application support for DSMS, it may have potential and important effect to improve the performance of DSMS.
引文
[1]Brian Babcock,Shivnath Babu,Mayur Datar,Rajeev Motwani,Jennifer Widom.Models and Issues in Data Stream Systems[C].Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems.2002,Publisher ACM Press New York,NY,USA:1-16.
[2]金澈清,钱卫宁,周傲英.流数据分析与管理综述[J].软件学报,2004.15(08):1172-1181.
[3]李建中,张冬冬.滑动窗口规模的动态调整算法[J].软件学报,2004.15(12):1800-1814.
[4]Phillip B.Gibbons,Srikanta Tirthapura.Distributed streams algorithms for sliding windows[C].In proceedings of the 14 annual ACM symposium on parallel algorithms and architectures.2002,Publisher ACM Press New York,NY,USA:67-72.
[5]D.Carney,U.Cetintemel,M.Cherniack,C.Convey,S.Lee,et al.Monitoring Streams:A New Class of Data Management Applications[C].In proceedings of the 28th International Conference on Very Large Data Bases(VLDB'02),Hong Kong,China,August 2002.215-226.
[6]陈安龙.多数据流处理的关键技术研究:[博士学位论文].成都:四川大学,2006.
[7]I.Charitakis,K.Anagnostakis,E.Markatos.An Active Traffic Splitter Architecture for Intrusion Detection[C].Proceedings of the IEEE/ACM International Symposium on Modeling,Analysis and Simulation of Computer and Telecommunication Systems,October 2003,publisher:Washington,DC:IEEE Computer Society:238-241.
[8]金澈清.数据流上若干查询处理算法的研究:[博士学位论文].上海:复旦大学,2005.
[9]Babu S,Widom J(2001) Continuous queries over data streams[C].SIGMOD Record.2001.30(3):109-120.
[10]M.Datar,A.Gionis,P.Indyk,and R.Motwani.Maintaining stream statistics over sliding windows[J].SIAM Journal on Computing,2002.31(6):1794-1813.
[11]Utkarsh Srivastava,Jennifer Widom.Flexible time management in data stream systems[C].Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems.2004,Publisher:ACM Press New York,NY,USA:263-274.
[12]S.Muthukrishnan.Data Streams:Algorithms and Applications[C].Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms.2003,Publisher:Society for Industrial and Applied Mathematics Philadelphia,PA,USA:413-413.
[13]Lukasz Golab, M.Tamer Ozsu.Issues in Data Stream Management [J].ACM Special Interest Group on Management of Data Recoder.2004.32(2): 5-14.
[14]Babcock B, Datar M, Motwani R, O'Callaghan L.Maintaining variance and k-Medians over data stream windows [C].In: Neven F, ed.Proc.of the 22nd ACM SIGACT-SIGMOD-SIGART Symp.on Principles of Database Systems.San Diego: ACMPress, 2003.234-243.
[15]Xuemin Lin, Hongjun Lu, Jian Xu, Jeffrey Xu Yu.Continuously Maintaining Quantile Summaries of the Most Recent N Elements over a Data Stream [C].Proceedings of the 20th International Conference on Data Engineering.Publisher IEEE Computer Society Washington, DC, USA 2004.362 ～ 373
[16]Ashish Kumar Gupta and Dan Suciu.Stream Processing of XPath Queries with Predicates [C].SIGMOD 2003, June 912, 2003, San Diego, CA.419-430
[17]Arasu A, Babcock B, Babu S, McAlister J, Widom J (2002) Characterizing memory requirements for queries over continuous data streams [C].In: Proceedings of the 21st ACM SIGACTSIGMOD - SIGART symposium on principles of database systems,Madison, WI, 3-5 June 2002.221-232.
[18]Theodore Johnson, S.Muthukrishnan, Irina Rozenbaum.Sampling Algorithms in a Stream Operator [C].Proceedings of the 2005 ACM SIGMOD international conference on Management of data, Publisher: ACM Press New York, NY, USA, 2005.1-12.
[19]Vitter JS.Random sampling with a reservoir[J].ACM Trans, on Mathematical Software,1985.11(1):37～57.
[20]Gibbons PB, Matias Y.New sampling-based summary statistics for improving approximate query answers[C].In: Haas LM, Tiwary A, eds.SIGMOD 1998, Proc.of the ACM SIGMOD IntT Conf.on Management of Data.Seattle: ACM Press, 1998.331-342.
[21]Babcock B, Datar M, Motwani R.Sampling from a moving window over streaming data [C].In: Eppstein D, ed.Proc.of the 13th Annual ACM-SIAM Symp.on Discrete Algorithms.San Francisco: ACM/SIAM, 2002.633-634.
[22]S.Guha, N.Koudas and K.Shim.Data streams and histograms [C].ACM STOC, 2001.471-475.
[23]Gibbons PB, Matias Y, Poosala V.Fast incremental maintenance of approximate histograms[C].In: Jarke M, Carey MJ, Dittrich KR, Lochovsky FH, Loucopoulos P,Jeusfeld MA, eds.VLDB'97, Proc.of the 23rd IntT Conf.on Very Large Data Bases.Athens: Morgan Kaufmann, 1997.466-475.
[24]M.Greenwald and S.Khanna.Space-efficient online computation of quantile summaries [C].In Proc.of the 2001 ACM SIGMOD Intl.Conf.on Management of Data, 2001.58-66.
[25]Gilbert A, Guha S, Indyk P, Kotidis Y, Muthukrishnan S, Strauss M.Fast, small-space algorithms for approximate histogram maintenance[C].In: Reif JH, ed.Proc.of the 34th Annual ACM Symp.on Theory of Computing.Montreal: ACM Press, 2002.389-398.
[26]Datar M, Gionis A, Indyk P, Motwani R.Maintaining stream statistics over sliding windows [C].In: Eppstein D, ed.Proc.of the 13th Annual ACM-SIAM Symp.on Discrete Algorithms.San Francisco: ACM/SIAM, 2002.635-644.
[27]Babcock B, Datar M, Motwani R, O'Callaghan L.Maintaining variance and k-Medians over data stream windows [C].In: Neven F, ed.Proc.of the 22nd ACM SIGACT-SIGMOD-SIGART Symp.on Principles of Database Systems.San Diego: ACM Press, 2003.234-243.
[28]Matias Y, Vitter JS, Wang M.Dynamic maintenance of wavelet-based histograms [C].In: Abbadi AE, Brodie ML, Chakravarthy S, Dayal U, Kamel N, Schlageter G, Whang KY,eds.VLDB 2000, Proc.of the 26th Int'l Conf.on Very Large Data Bases.Cairo: Morgan Kaufmann, 2000.101-110.
[29]Gilbert AC, Kotidis Y, Muthukrishnan S, Strauss MJ.Surfing wavelets on streams:One-Pass summaries for approximate aggregate queries [C].In: Apers PMG, Atzeni P,Ceri S, Paraboschi S, Ramamohanarao K, Snodgrass RT, eds.VLDB 2001, Proc.Of the 27th Int'l Conf.on Very Large Data Bases.Roma: Morgan Kaufmann, 2001.79-88.
[30]Garofalakis M, Gibbons PB.Wavelet synopses with error guarantees[C].In: Franklin MJ,Moon B, Ailamaki A, eds.Proc.of the 2002 ACM SIGMOD Int'l Conf.on Management of Data.Madison: ACM Press, 2002.476-487.
[31]Graham Cormode, S.Muthukrishnan.An Improved Data Stream Summary: The Count-Min Sketch and Its Applications [J].Lecture Notes in Computer Science.Volume2976/2004.29-38.
[32]Gu, Xiaohui, Yu, Philip S.Optimal component composition for scalable stream processing [C].25th IEEE International Conference on Distributed Computing Systems Workshops,ICDCS 2005, 2005.773-782.
[33]Zhou, Yongiuan, Ooi, Beng Chin.Efficient dynamic operator placement in a locallydistributed continuous query system [C].On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE - OTM Confederated International Conferences, CoopIS, DOA, GADA, and ODBASE 2006, Proceedings, 2006.54-71.
[34]Amol Ghoting and Srinivasan Parthasarathy.Facilitating Interactive Distributed Data Stream Processing and Mining [C].Proceedings of the 18th International Parallel and Distributed Processing Symposium.IPDPS04.86-96.
[35]Le, Jia-Jin, Liu, Jian-Wei.DDSQP: A WSRF-based distributed data stream query system [C].Parallel and Distributed Processing and Applications - Third International Symposium,ISPA 2005, Proceedings, 2005.833-844.
[36]Arvind Arasu, Brian Babcock, Shivnath Babu, et.al.STREAM: The Stanford Data Stream Management System [C].IEEE Data Engineering Bulletin, Vol.26 No.1, March 2003.19-26.
[37]Daniel J.Abadi, Don Carney, Ugur Cetintemel, et al.Aurora: A Data Stream Management System [C].The International Journal on Very Large Data Bases.Volume 12, Number 2.2003.120-139.
[38]Abadi et al.Aurora: A new model and architecture for data stream management [J].VLDB Journal, 12(2): Sept.2003.120-139.
[39]J.-H.Hwang, M.Balazinska, A.Rasin, U.Cetintemel, M.Stonebraker, and S.Zdonik.High-availability algorithms for distributed stream processing [C].In 21st ICDE, Apr.2005.779-790.
[40]M.Balazinska, H.Balakrishnan, and M.Stonebraker.Load management and high availability in the medusa distributed stream processing system[C].In SIGMOD '04:Proceedings of the 2004 ACM SIGMOD international conference on Management of data,2004.929-930.
[41]Magdalena Balazinska, Hari Balakrishnan, Samuel Madden, and Michael Stonebraker.Fault Tolerance in the Borealis Distributed Stream Processing System [C].SIGMOD 2005: Proceedings of the ACM SIGMOD Internationa! Conference on Management of Data,2005.13-24.
[42]D.Abadi, Y.Ahmad, H.Balakrishnan, M.Balazinska, U.Cetintemel, M.Cherniack, J.Hwang, J.Jannotti, W.Lindner, S.Madden, A.Rasin, M.Stonebraker, N.Tatbul, Y.Xing,S.Zdonik, The Design of the Borealis Stream Processing Engine.In Proc.of the Second Biennial Conference on Innovative Data Systems Research (CIDR), Jan.2005.
[43]Yanif Ahmad, Bradley Berg, Ugur Cetintemel, et al.Distributed Operation in the Borealis Stream Processing Engine [C].Proceedings of the 2005 ACM SIGMOD international conference on Management of data.Baltimore, Maryland, June 2005.882-884.
[44]Sirish Chandrasekaran, Owen Cooper, Amol Deshpande.et al.TelegraphCQ: Continuous Dataflow Processing for an Uncertain World [C].In CIDR Conference, Asilomar, CA,January 2003.269-280.
[45]Sailesh Krishnamurthy,Sirish Chandrasekaran,Owen Cooper,et al.TelegraphCQ:An Architectural Status Report[J].Bulletin of the IEEE Computer Society,2003.26:11-18.
[46]R.Avnur and J.Hellerstein.Eddies:Continuously adaptive query processing[C].In ACM SIGMOD,2000.261-272.
[47]赵加奎,陈立军,杨东青,等.SQLDBA:基于数据流系统Argus的数据库系统性能实时监控工具[J].计算机研究与发展,2004.41:78-84.
[48]刘建伟.流数据查询系统结构及模式查询算法的研究:[博士学位论文].上海:东华大学,2005.
[49]王金栋.数据流系统中负载管理技术应用研究:[博士学位论文].南京:南京航空航天大学,2006.
[50]Sergio Ilarri,Eduardo Mena,Arantza Illarramendi.A mobile agents based architecture for the distributed processing of continuous location querier in a wireless environment:performance evaluation[C].Lecture notes in computer science.2004.VOL3268:355-364.
[51]张玲东,毛宇光,曹晨光等.数据流管理系统研究与进展.计算机应用研究,2005.6:12-15.
[52]Yongluan Zhou,Beng Chin Ooi,Klan-Lee Tan,Dynamic Load Management for Distributed Continuous Query Systems[C].Proceedings of the 21st International Conference on Data Engineering(ICDE'05).2005.Publisher IEEE Computer Society Washington,DC,USA:322-323.
[53]Hari Balakrishnan,Magdalena Balazinska,Don Carney et al..Retrospective on Aurora[J].The VLDB Journal,2004.13:370-383.
[54]D.Carney,U.Cetintemel,A.Rasin,S.Zdonik,M.Cherniack,M.Stonebraker.Operator Scheduling in a Data Stream Manager[C].In proceedings of the 29th International Conference on Very Large Data Bases(VLDB'03),Berlin,Germany,September 2003.838-849.
[55]Babcock B,Babu S,Datar M,Motwani R.Chain:Operator scheduling for memory minimization in data stream systems[C].Proc.of the 2003 ACM SIGMOD Int'l Conf.On Management of Data.San Diego:ACM,2003.253-264.
[56]Jaewoo Kang,Jeffrey F.Naughton,Stratis D.Viglas.Evaluating window joins over unbounded streams[C].In ICDE(Intl.Conf.on Data Engineering),March 2003.341-352.
[57]Moustafa A.Hammad,Michael J.Franklin,Walid G.Aref,et.al.Scheduling for shared window joins over data streams[C].Proc.of the 29th Int'l Conf.on Very Large Data Bases.Berlin:Morgan Kaufmann Publishers,2003.297-308.
[58]D.Grosu,A.T.Chronopoulos,and M.Y.Leung.Load balancing in distributed systems:An approach using cooperative games[C].Proc.16th IEEE Int.Parallel Distributed Processing Symp,Apr.2002.52-61.
[59]Yongluan Zhou,Beng Chin Ooi and Kian-Lee Tan.Dynamic Load Management for Distributed Continuous Query Systems[C].Proceedings of the 21st International Conference on Data Engineering.ICDE 2005.322-323.
[60]R.Diekmann,B.Monien,and R.Preis,Load balancing strategies for distributed memory machines[C].Multi-Scale Phenomena and Their Simulation.World Scientific,1997.255-266.
[61]Markus Lindermeier.Load Management for Distributed Object-Oriented Environments[C].In proceedings of International Symposium on Distributed Objects and Applications,Antwerp,Belgium.IEEE Computer Society,2000.59-68.
[62]M.Cherniack,H.Balakrishnan,M.Balazinska,D.Carney,U.Cetintemel,Y.Xing,S.Zdonik.Scalable Distributed Stream Processing[C].In proceedings of the First Biennial Conference on Innovative Database Systems(CIDR'03),Asilomar,CA,January 2003.257-268.
[63]M.A.Shah,J.M.Hellerstein,S.Chandrasekaran,and M.J.Franklin.Flux:An Adaptive Partitioning Operator for Continuous Query Systems[C].In Proc.of the ICDE Conference,2003.25-36.
[64]Magdalena Balazinska,Hari Balakrishnan,and Mike Stonebraker.Contract-Based Load Management in Federated Distributed Systems[C].1st Symposium on Networked Systems Design and Implementation(NSDI) San Francisco,CA,March 2004.197-210.
[65]Ying Xing.Load Distribution for Distributed Stream Processing[J].Lecture Notes in Computer Science.Volume 3268/2004.112-120.
[66]王金栋,周良,张磊等.分布式数据流处理中的负载分配策略[J].南京航空航天大学学报.2006.38(2):212-216.
[67]王金栋,周良,丁秋林等.基于立体重叠网络的网管模型[J].吉林大学学报.2006.42(1):62-67.
[68]王金栋,周良,张磊等.一类数据流边疆查询的降载策略研究[J].武汉大学学报.2005.38(6):133-137.
[69]Abhinandan Das,Johannes Gehrke,Mirek Riedewald.Approximate Join Processing Over Data Streams[C].In Proc.of the 2003 ACM SIGMOD Intl.Conf.on Management of Data.2003.40-51.
[70]Brian Babcock, Mayur Datar, Rajeev Motwani.Load Shedding for Aggregation Queries over Data Streams [C].Proceedings.20th International Conference on Data Engineering,30 March-2 April 2004.350-361.
[71]Hu, Zijing, Li, Hongyan; Qiu, Baojun, et al.Using control theory to guide load shedding in medical data stream management system [C].Advances in Computer Science - ASIAN 2005: 10th Asian Computing Science Conference, Proceedings, 2005.236-248.
[72]Chi Yun , Wang Haixun, Yu P S ,et al.Loadstar : Load Shedding in Data Stream Mining.In : Proceedings of the 31st VLDB Conference, 2005.1302-1305.
[73]R.Motwani, J.Widom and A.Arasu et al.Query processing, approximation, and resource management in a data stream management system [C].In Proceedings of CIDR, 2003.245-256.
[74]P.Indyk.Better algorithms for high-dimensional proximity problems via asymmetric embeddings.In Proc.of the 14th Annual ACM-SIAM Symp.on Discrete Algorithms, 2003.539-545.
[75]Bagchi, A.Chaudhary, D.Eppstein, et.al.Deterministic sampling and range counting in geometric streams [C].In proc.of 20th ACM Symp Computational Geometry 2004:144-151.
[76]GS Manku, R.Motwani, Approximate frequency counts over data streams [C], in Proceedings of 28th International Conference on Very Large Data Bases, August 2002.346-357.
[77]M.Charikar, K.Chen and M.Farach-Colton.Finding frequent items in data streams [J].Theoretical Computer Science 312.2004.3-15.
[78]Metwally, D.Agrawal, and A.El Abbadi.Efficient Computation of Frequent and Top-k Elements in Data Streams [C].In Proceedings of the 10th ICDT International Conference on Database Theory, 2005.398-412.
[79]Gupta and F.X.Zane.Counting inversions in lists.In Proc.of the 14th Annual ACM-SIAM Symp.on Discrete Algorithms, 2003.253-254.
[80]S.Ratnasamy, P.Francis, M.Handley, R.Karp, and S.Shenker.A Scalable Content-Addressable Network [C].In Proceedings of ACM SIGCOMM, Aug.2001.publisher ACM press 2001.161-172.
[81]Rowstron and P.Druschel.Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems [C].In International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, Nov.2001.329-350.
[82]Nicholas J.A.Harvey, Michael B.Jones, Stefan Saroiu, et.al.SkipNet: A Scalable Overlay Network with Practical Locality Properties [C].Information Processing Letters, Volume 90 , Issue 4,2004.205-208.
[83]David Andersen, Hari Balakrishnan, Frans Kaashoek, et al.Resilient Overlay Networks [C].Proc.18th ACM SOSP, Banff, Canada, October 2001, Publisher ACM Press New York,NY, USA, 2001,131-145.
[84]David R.Karger, Matthias Ruhl, Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems [J].Lecture Notes in Computer Science, 2005.131-140.
[85]Yu-Kwong Kwok, Lap-Sun Cheung.A new fuzzy-decision based load balancing system for distributed object computing [J].Journal of Parallel and Distributed Computing.2004.64, 238-253.
[86]J.W.Byers, J.Considine, and M.Mitzenmacher.Simple Load Balancing for Distributed Hash Tables [C].Proc.Second Int'l Workshop Peer-to-Peer Systems (IPTPS), Feb.2003.80-87.
[87]Z.Zhang, S.Shi, and J.Zhu.SOMO: Self-Organized Metadata Overlay for Resource Management in P2P DHT [C].Berkeley, CA, USA .Proc.of Second Int'l Workshop Peer-to-Peer Systems (IPTPS), 2003.170-182.
[88]Zhi Li, Prasant Mohapatra, QRON: QoS-Aware Routing in Overlay Networks [J], IEEE Journal on Selected Areas in Communications, VOL.2004.22( 1): 29-40.
[89]Jinyang Li, John Jannotti, Douglas S.J.De Couto, David R.Karger, and Robert Morris.A scalable location service for geographic ad hoc routing [C].In Proceedings of ACM MOBICOM.ACM, August 2000.120-130.
[90]C.Greg Plaxton, Rajmohan Rajaraman, and Andrea W.Richa.Accessing nearby copies of replicated objects in a distributed environment [C].In Proceedings of ACM SPAA.ACM,June 1997.311-320.
[91]I.Stoica, R.Morris, D.Karger, M.F.Kaashoek, et al..Chord: A scalable peer-to-peer lookup service for internet applications[C].San Deigo, CA.ACM SIGCOMM.2001.149-160.
[92]C.-Z.X.Haiying Shen.Hash-based proximity clustering for efi cient load balancing in heterogeneous DHT networks [J].Journal of Parallel and Distributed Computing, May 2008.68(5):686～702.
[93]Ouyang Lin; Guo Qing-ping.A Dynamic Load Balancing Technique of Distributed Stream Processing System.GDC 2008.52-57.
[94]Ying Xing, Stan Zdonik and Jeong Hyon Hwang.Dynamic Load Distribution in the Borealis Stream Processor [C].Proceedings of the 21st International Conference on Data Engineering.ICDE 2005.791-802.
[95]Lin Ouyang, Guo Qingping, Zhou Qin, Pu Qiumei.An adaptive control-based feedback load-shedding strategy.In: Guo Qingping.DCABES 2007 PROCEEDINGS.Wuhan:Hubei Sciene and Technology Press, 2007.464～466.
[96]Ouyang Lin; Guo Qing-ping.An Entropy-Based Data Summarization Algorithm in Data Stream System.PACHA '08.19-20 Dec.2008.872-876.
[97]Brian Babcock, Surajit Chaudhuri, Gautam Das.Dynamic Sample Selection for Approximate Query Processing [C].SIGMOD Conference 2003.539-550.
[98]N.Tatbul; S.Zdonik.Dealing with Overload in Distributed Stream Processing Systems.Data Engineering Workshops, 2006.Proceedings.22nd International Conference.2006.24-24.
[99]Babcock, B.; Datar, M.; Motwani, R.Load shedding for aggregation queries over data streams [C].Proceedings.20th International Conference on Data Engineering, 30 March-2 April 2004.350-361.
[100]Nesime Tatbul, Ugur Cetintemel, Stan Zdonik, et al.Load Shedding in a Data Stream Manager [C].In proceedings of the 29th International Conference on Very Large Data Bases (VLDB'03), Berlin, Germany, September 2003.309-320.
[101]Nesime Tatbul, U Cetintemel, Stan Zdonik.Staying FIT: Efficient Load SheddingTechniques for Distributed Stream Processing[C].VLDB 2007, Vienna, Austria.Septemble 2007.232-243.
[102]Stratis D.Viglas, Jeffrey F.Naughton.Rate-based query optimization for streaming information sources [C].In: SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of data [C].New York, NY, USA: ACM,2002.37-48.
[103]T.Urhan and M.J.Franklin.XJoin: A reactively-scheduled pipelined join operator.In Proc.TKDE, 2000.23(2):27～33.
[104]Stratis D.Viglas, Jeffrey F.Naughton, Josef Burger.Maximizing the output rate of multi-way join queries over streaming information sources [C].In: VLDB '2003:Proceedings of the 29th international conference on Very large data bases.VLDB Endowment, 2003.285-296.
[105]Vijayshankar Raman.Using state modules for adaptive query processing [C].In: ICDE.2003.353-364.
[106]Moustafa A.Hammad,Walid G.Aref.Stream Window Join:Tracking Moving Objects in Sensor-Network Databases[C].In:In SSDBM.2003.75-84.
[107]J.S.Gomes,Heyong-Ah Choi.Finding Optimal Join Tree for Multi-Join Stream Queries in a Production System[C].Distributed Computing Systems Workshops,2006.ICDCS Workshops 2006.26th IEEE International Conference on,2006.27-27.
[108]钱江波,王永利,陈征等.数据流窗口连接查询处理器研究[J].电子学报,2009.37(2):404-409.
[109]刘学军,钱江波.分布式数据流连接查询算法[J].计算机工程,2006.32(21):41-43.
[110]郭庆平,欧阳琳.一种分布式数据流连接查询算法[J].武汉理工大学学报,2009.31(3):29-32.
[2]金澈清,钱卫宁,周傲英.流数据分析与管理综述[J].软件学报,2004.15(08):1172-1181.
[3]李建中,张冬冬.滑动窗口规模的动态调整算法[J].软件学报,2004.15(12):1800-1814.
[4]Phillip B.Gibbons,Srikanta Tirthapura.Distributed streams algorithms for sliding windows[C].In proceedings of the 14 annual ACM symposium on parallel algorithms and architectures.2002,Publisher ACM Press New York,NY,USA:67-72.
[5]D.Carney,U.Cetintemel,M.Cherniack,C.Convey,S.Lee,et al.Monitoring Streams:A New Class of Data Management Applications[C].In proceedings of the 28th International Conference on Very Large Data Bases(VLDB'02),Hong Kong,China,August 2002.215-226.
[6]陈安龙.多数据流处理的关键技术研究:[博士学位论文].成都:四川大学,2006.
[7]I.Charitakis,K.Anagnostakis,E.Markatos.An Active Traffic Splitter Architecture for Intrusion Detection[C].Proceedings of the IEEE/ACM International Symposium on Modeling,Analysis and Simulation of Computer and Telecommunication Systems,October 2003,publisher:Washington,DC:IEEE Computer Society:238-241.
[8]金澈清.数据流上若干查询处理算法的研究:[博士学位论文].上海:复旦大学,2005.
[9]Babu S,Widom J(2001) Continuous queries over data streams[C].SIGMOD Record.2001.30(3):109-120.
[10]M.Datar,A.Gionis,P.Indyk,and R.Motwani.Maintaining stream statistics over sliding windows[J].SIAM Journal on Computing,2002.31(6):1794-1813.
[11]Utkarsh Srivastava,Jennifer Widom.Flexible time management in data stream systems[C].Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems.2004,Publisher:ACM Press New York,NY,USA:263-274.
[12]S.Muthukrishnan.Data Streams:Algorithms and Applications[C].Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms.2003,Publisher:Society for Industrial and Applied Mathematics Philadelphia,PA,USA:413-413.
[13]Lukasz Golab, M.Tamer Ozsu.Issues in Data Stream Management [J].ACM Special Interest Group on Management of Data Recoder.2004.32(2): 5-14.
[14]Babcock B, Datar M, Motwani R, O'Callaghan L.Maintaining variance and k-Medians over data stream windows [C].In: Neven F, ed.Proc.of the 22nd ACM SIGACT-SIGMOD-SIGART Symp.on Principles of Database Systems.San Diego: ACMPress, 2003.234-243.
[15]Xuemin Lin, Hongjun Lu, Jian Xu, Jeffrey Xu Yu.Continuously Maintaining Quantile Summaries of the Most Recent N Elements over a Data Stream [C].Proceedings of the 20th International Conference on Data Engineering.Publisher IEEE Computer Society Washington, DC, USA 2004.362 ～ 373
[16]Ashish Kumar Gupta and Dan Suciu.Stream Processing of XPath Queries with Predicates [C].SIGMOD 2003, June 912, 2003, San Diego, CA.419-430
[17]Arasu A, Babcock B, Babu S, McAlister J, Widom J (2002) Characterizing memory requirements for queries over continuous data streams [C].In: Proceedings of the 21st ACM SIGACTSIGMOD - SIGART symposium on principles of database systems,Madison, WI, 3-5 June 2002.221-232.
[18]Theodore Johnson, S.Muthukrishnan, Irina Rozenbaum.Sampling Algorithms in a Stream Operator [C].Proceedings of the 2005 ACM SIGMOD international conference on Management of data, Publisher: ACM Press New York, NY, USA, 2005.1-12.
[19]Vitter JS.Random sampling with a reservoir[J].ACM Trans, on Mathematical Software,1985.11(1):37～57.
[20]Gibbons PB, Matias Y.New sampling-based summary statistics for improving approximate query answers[C].In: Haas LM, Tiwary A, eds.SIGMOD 1998, Proc.of the ACM SIGMOD IntT Conf.on Management of Data.Seattle: ACM Press, 1998.331-342.
[21]Babcock B, Datar M, Motwani R.Sampling from a moving window over streaming data [C].In: Eppstein D, ed.Proc.of the 13th Annual ACM-SIAM Symp.on Discrete Algorithms.San Francisco: ACM/SIAM, 2002.633-634.
[22]S.Guha, N.Koudas and K.Shim.Data streams and histograms [C].ACM STOC, 2001.471-475.
[23]Gibbons PB, Matias Y, Poosala V.Fast incremental maintenance of approximate histograms[C].In: Jarke M, Carey MJ, Dittrich KR, Lochovsky FH, Loucopoulos P,Jeusfeld MA, eds.VLDB'97, Proc.of the 23rd IntT Conf.on Very Large Data Bases.Athens: Morgan Kaufmann, 1997.466-475.
[24]M.Greenwald and S.Khanna.Space-efficient online computation of quantile summaries [C].In Proc.of the 2001 ACM SIGMOD Intl.Conf.on Management of Data, 2001.58-66.
[25]Gilbert A, Guha S, Indyk P, Kotidis Y, Muthukrishnan S, Strauss M.Fast, small-space algorithms for approximate histogram maintenance[C].In: Reif JH, ed.Proc.of the 34th Annual ACM Symp.on Theory of Computing.Montreal: ACM Press, 2002.389-398.
[26]Datar M, Gionis A, Indyk P, Motwani R.Maintaining stream statistics over sliding windows [C].In: Eppstein D, ed.Proc.of the 13th Annual ACM-SIAM Symp.on Discrete Algorithms.San Francisco: ACM/SIAM, 2002.635-644.
[27]Babcock B, Datar M, Motwani R, O'Callaghan L.Maintaining variance and k-Medians over data stream windows [C].In: Neven F, ed.Proc.of the 22nd ACM SIGACT-SIGMOD-SIGART Symp.on Principles of Database Systems.San Diego: ACM Press, 2003.234-243.
[28]Matias Y, Vitter JS, Wang M.Dynamic maintenance of wavelet-based histograms [C].In: Abbadi AE, Brodie ML, Chakravarthy S, Dayal U, Kamel N, Schlageter G, Whang KY,eds.VLDB 2000, Proc.of the 26th Int'l Conf.on Very Large Data Bases.Cairo: Morgan Kaufmann, 2000.101-110.
[29]Gilbert AC, Kotidis Y, Muthukrishnan S, Strauss MJ.Surfing wavelets on streams:One-Pass summaries for approximate aggregate queries [C].In: Apers PMG, Atzeni P,Ceri S, Paraboschi S, Ramamohanarao K, Snodgrass RT, eds.VLDB 2001, Proc.Of the 27th Int'l Conf.on Very Large Data Bases.Roma: Morgan Kaufmann, 2001.79-88.
[30]Garofalakis M, Gibbons PB.Wavelet synopses with error guarantees[C].In: Franklin MJ,Moon B, Ailamaki A, eds.Proc.of the 2002 ACM SIGMOD Int'l Conf.on Management of Data.Madison: ACM Press, 2002.476-487.
[31]Graham Cormode, S.Muthukrishnan.An Improved Data Stream Summary: The Count-Min Sketch and Its Applications [J].Lecture Notes in Computer Science.Volume2976/2004.29-38.
[32]Gu, Xiaohui, Yu, Philip S.Optimal component composition for scalable stream processing [C].25th IEEE International Conference on Distributed Computing Systems Workshops,ICDCS 2005, 2005.773-782.
[33]Zhou, Yongiuan, Ooi, Beng Chin.Efficient dynamic operator placement in a locallydistributed continuous query system [C].On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE - OTM Confederated International Conferences, CoopIS, DOA, GADA, and ODBASE 2006, Proceedings, 2006.54-71.
[34]Amol Ghoting and Srinivasan Parthasarathy.Facilitating Interactive Distributed Data Stream Processing and Mining [C].Proceedings of the 18th International Parallel and Distributed Processing Symposium.IPDPS04.86-96.
[35]Le, Jia-Jin, Liu, Jian-Wei.DDSQP: A WSRF-based distributed data stream query system [C].Parallel and Distributed Processing and Applications - Third International Symposium,ISPA 2005, Proceedings, 2005.833-844.
[36]Arvind Arasu, Brian Babcock, Shivnath Babu, et.al.STREAM: The Stanford Data Stream Management System [C].IEEE Data Engineering Bulletin, Vol.26 No.1, March 2003.19-26.
[37]Daniel J.Abadi, Don Carney, Ugur Cetintemel, et al.Aurora: A Data Stream Management System [C].The International Journal on Very Large Data Bases.Volume 12, Number 2.2003.120-139.
[38]Abadi et al.Aurora: A new model and architecture for data stream management [J].VLDB Journal, 12(2): Sept.2003.120-139.
[39]J.-H.Hwang, M.Balazinska, A.Rasin, U.Cetintemel, M.Stonebraker, and S.Zdonik.High-availability algorithms for distributed stream processing [C].In 21st ICDE, Apr.2005.779-790.
[40]M.Balazinska, H.Balakrishnan, and M.Stonebraker.Load management and high availability in the medusa distributed stream processing system[C].In SIGMOD '04:Proceedings of the 2004 ACM SIGMOD international conference on Management of data,2004.929-930.
[41]Magdalena Balazinska, Hari Balakrishnan, Samuel Madden, and Michael Stonebraker.Fault Tolerance in the Borealis Distributed Stream Processing System [C].SIGMOD 2005: Proceedings of the ACM SIGMOD Internationa! Conference on Management of Data,2005.13-24.
[42]D.Abadi, Y.Ahmad, H.Balakrishnan, M.Balazinska, U.Cetintemel, M.Cherniack, J.Hwang, J.Jannotti, W.Lindner, S.Madden, A.Rasin, M.Stonebraker, N.Tatbul, Y.Xing,S.Zdonik, The Design of the Borealis Stream Processing Engine.In Proc.of the Second Biennial Conference on Innovative Data Systems Research (CIDR), Jan.2005.
[43]Yanif Ahmad, Bradley Berg, Ugur Cetintemel, et al.Distributed Operation in the Borealis Stream Processing Engine [C].Proceedings of the 2005 ACM SIGMOD international conference on Management of data.Baltimore, Maryland, June 2005.882-884.
[44]Sirish Chandrasekaran, Owen Cooper, Amol Deshpande.et al.TelegraphCQ: Continuous Dataflow Processing for an Uncertain World [C].In CIDR Conference, Asilomar, CA,January 2003.269-280.
[45]Sailesh Krishnamurthy,Sirish Chandrasekaran,Owen Cooper,et al.TelegraphCQ:An Architectural Status Report[J].Bulletin of the IEEE Computer Society,2003.26:11-18.
[46]R.Avnur and J.Hellerstein.Eddies:Continuously adaptive query processing[C].In ACM SIGMOD,2000.261-272.
[47]赵加奎,陈立军,杨东青,等.SQLDBA:基于数据流系统Argus的数据库系统性能实时监控工具[J].计算机研究与发展,2004.41:78-84.
[48]刘建伟.流数据查询系统结构及模式查询算法的研究:[博士学位论文].上海:东华大学,2005.
[49]王金栋.数据流系统中负载管理技术应用研究:[博士学位论文].南京:南京航空航天大学,2006.
[50]Sergio Ilarri,Eduardo Mena,Arantza Illarramendi.A mobile agents based architecture for the distributed processing of continuous location querier in a wireless environment:performance evaluation[C].Lecture notes in computer science.2004.VOL3268:355-364.
[51]张玲东,毛宇光,曹晨光等.数据流管理系统研究与进展.计算机应用研究,2005.6:12-15.
[52]Yongluan Zhou,Beng Chin Ooi,Klan-Lee Tan,Dynamic Load Management for Distributed Continuous Query Systems[C].Proceedings of the 21st International Conference on Data Engineering(ICDE'05).2005.Publisher IEEE Computer Society Washington,DC,USA:322-323.
[53]Hari Balakrishnan,Magdalena Balazinska,Don Carney et al..Retrospective on Aurora[J].The VLDB Journal,2004.13:370-383.
[54]D.Carney,U.Cetintemel,A.Rasin,S.Zdonik,M.Cherniack,M.Stonebraker.Operator Scheduling in a Data Stream Manager[C].In proceedings of the 29th International Conference on Very Large Data Bases(VLDB'03),Berlin,Germany,September 2003.838-849.
[55]Babcock B,Babu S,Datar M,Motwani R.Chain:Operator scheduling for memory minimization in data stream systems[C].Proc.of the 2003 ACM SIGMOD Int'l Conf.On Management of Data.San Diego:ACM,2003.253-264.
[56]Jaewoo Kang,Jeffrey F.Naughton,Stratis D.Viglas.Evaluating window joins over unbounded streams[C].In ICDE(Intl.Conf.on Data Engineering),March 2003.341-352.
[57]Moustafa A.Hammad,Michael J.Franklin,Walid G.Aref,et.al.Scheduling for shared window joins over data streams[C].Proc.of the 29th Int'l Conf.on Very Large Data Bases.Berlin:Morgan Kaufmann Publishers,2003.297-308.
[58]D.Grosu,A.T.Chronopoulos,and M.Y.Leung.Load balancing in distributed systems:An approach using cooperative games[C].Proc.16th IEEE Int.Parallel Distributed Processing Symp,Apr.2002.52-61.
[59]Yongluan Zhou,Beng Chin Ooi and Kian-Lee Tan.Dynamic Load Management for Distributed Continuous Query Systems[C].Proceedings of the 21st International Conference on Data Engineering.ICDE 2005.322-323.
[60]R.Diekmann,B.Monien,and R.Preis,Load balancing strategies for distributed memory machines[C].Multi-Scale Phenomena and Their Simulation.World Scientific,1997.255-266.
[61]Markus Lindermeier.Load Management for Distributed Object-Oriented Environments[C].In proceedings of International Symposium on Distributed Objects and Applications,Antwerp,Belgium.IEEE Computer Society,2000.59-68.
[62]M.Cherniack,H.Balakrishnan,M.Balazinska,D.Carney,U.Cetintemel,Y.Xing,S.Zdonik.Scalable Distributed Stream Processing[C].In proceedings of the First Biennial Conference on Innovative Database Systems(CIDR'03),Asilomar,CA,January 2003.257-268.
[63]M.A.Shah,J.M.Hellerstein,S.Chandrasekaran,and M.J.Franklin.Flux:An Adaptive Partitioning Operator for Continuous Query Systems[C].In Proc.of the ICDE Conference,2003.25-36.
[64]Magdalena Balazinska,Hari Balakrishnan,and Mike Stonebraker.Contract-Based Load Management in Federated Distributed Systems[C].1st Symposium on Networked Systems Design and Implementation(NSDI) San Francisco,CA,March 2004.197-210.
[65]Ying Xing.Load Distribution for Distributed Stream Processing[J].Lecture Notes in Computer Science.Volume 3268/2004.112-120.
[66]王金栋,周良,张磊等.分布式数据流处理中的负载分配策略[J].南京航空航天大学学报.2006.38(2):212-216.
[67]王金栋,周良,丁秋林等.基于立体重叠网络的网管模型[J].吉林大学学报.2006.42(1):62-67.
[68]王金栋,周良,张磊等.一类数据流边疆查询的降载策略研究[J].武汉大学学报.2005.38(6):133-137.
[69]Abhinandan Das,Johannes Gehrke,Mirek Riedewald.Approximate Join Processing Over Data Streams[C].In Proc.of the 2003 ACM SIGMOD Intl.Conf.on Management of Data.2003.40-51.
[70]Brian Babcock, Mayur Datar, Rajeev Motwani.Load Shedding for Aggregation Queries over Data Streams [C].Proceedings.20th International Conference on Data Engineering,30 March-2 April 2004.350-361.
[71]Hu, Zijing, Li, Hongyan; Qiu, Baojun, et al.Using control theory to guide load shedding in medical data stream management system [C].Advances in Computer Science - ASIAN 2005: 10th Asian Computing Science Conference, Proceedings, 2005.236-248.
[72]Chi Yun , Wang Haixun, Yu P S ,et al.Loadstar : Load Shedding in Data Stream Mining.In : Proceedings of the 31st VLDB Conference, 2005.1302-1305.
[73]R.Motwani, J.Widom and A.Arasu et al.Query processing, approximation, and resource management in a data stream management system [C].In Proceedings of CIDR, 2003.245-256.
[74]P.Indyk.Better algorithms for high-dimensional proximity problems via asymmetric embeddings.In Proc.of the 14th Annual ACM-SIAM Symp.on Discrete Algorithms, 2003.539-545.
[75]Bagchi, A.Chaudhary, D.Eppstein, et.al.Deterministic sampling and range counting in geometric streams [C].In proc.of 20th ACM Symp Computational Geometry 2004:144-151.
[76]GS Manku, R.Motwani, Approximate frequency counts over data streams [C], in Proceedings of 28th International Conference on Very Large Data Bases, August 2002.346-357.
[77]M.Charikar, K.Chen and M.Farach-Colton.Finding frequent items in data streams [J].Theoretical Computer Science 312.2004.3-15.
[78]Metwally, D.Agrawal, and A.El Abbadi.Efficient Computation of Frequent and Top-k Elements in Data Streams [C].In Proceedings of the 10th ICDT International Conference on Database Theory, 2005.398-412.
[79]Gupta and F.X.Zane.Counting inversions in lists.In Proc.of the 14th Annual ACM-SIAM Symp.on Discrete Algorithms, 2003.253-254.
[80]S.Ratnasamy, P.Francis, M.Handley, R.Karp, and S.Shenker.A Scalable Content-Addressable Network [C].In Proceedings of ACM SIGCOMM, Aug.2001.publisher ACM press 2001.161-172.
[81]Rowstron and P.Druschel.Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems [C].In International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, Nov.2001.329-350.
[82]Nicholas J.A.Harvey, Michael B.Jones, Stefan Saroiu, et.al.SkipNet: A Scalable Overlay Network with Practical Locality Properties [C].Information Processing Letters, Volume 90 , Issue 4,2004.205-208.
[83]David Andersen, Hari Balakrishnan, Frans Kaashoek, et al.Resilient Overlay Networks [C].Proc.18th ACM SOSP, Banff, Canada, October 2001, Publisher ACM Press New York,NY, USA, 2001,131-145.
[84]David R.Karger, Matthias Ruhl, Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems [J].Lecture Notes in Computer Science, 2005.131-140.
[85]Yu-Kwong Kwok, Lap-Sun Cheung.A new fuzzy-decision based load balancing system for distributed object computing [J].Journal of Parallel and Distributed Computing.2004.64, 238-253.
[86]J.W.Byers, J.Considine, and M.Mitzenmacher.Simple Load Balancing for Distributed Hash Tables [C].Proc.Second Int'l Workshop Peer-to-Peer Systems (IPTPS), Feb.2003.80-87.
[87]Z.Zhang, S.Shi, and J.Zhu.SOMO: Self-Organized Metadata Overlay for Resource Management in P2P DHT [C].Berkeley, CA, USA .Proc.of Second Int'l Workshop Peer-to-Peer Systems (IPTPS), 2003.170-182.
[88]Zhi Li, Prasant Mohapatra, QRON: QoS-Aware Routing in Overlay Networks [J], IEEE Journal on Selected Areas in Communications, VOL.2004.22( 1): 29-40.
[89]Jinyang Li, John Jannotti, Douglas S.J.De Couto, David R.Karger, and Robert Morris.A scalable location service for geographic ad hoc routing [C].In Proceedings of ACM MOBICOM.ACM, August 2000.120-130.
[90]C.Greg Plaxton, Rajmohan Rajaraman, and Andrea W.Richa.Accessing nearby copies of replicated objects in a distributed environment [C].In Proceedings of ACM SPAA.ACM,June 1997.311-320.
[91]I.Stoica, R.Morris, D.Karger, M.F.Kaashoek, et al..Chord: A scalable peer-to-peer lookup service for internet applications[C].San Deigo, CA.ACM SIGCOMM.2001.149-160.
[92]C.-Z.X.Haiying Shen.Hash-based proximity clustering for efi cient load balancing in heterogeneous DHT networks [J].Journal of Parallel and Distributed Computing, May 2008.68(5):686～702.
[93]Ouyang Lin; Guo Qing-ping.A Dynamic Load Balancing Technique of Distributed Stream Processing System.GDC 2008.52-57.
[94]Ying Xing, Stan Zdonik and Jeong Hyon Hwang.Dynamic Load Distribution in the Borealis Stream Processor [C].Proceedings of the 21st International Conference on Data Engineering.ICDE 2005.791-802.
[95]Lin Ouyang, Guo Qingping, Zhou Qin, Pu Qiumei.An adaptive control-based feedback load-shedding strategy.In: Guo Qingping.DCABES 2007 PROCEEDINGS.Wuhan:Hubei Sciene and Technology Press, 2007.464～466.
[96]Ouyang Lin; Guo Qing-ping.An Entropy-Based Data Summarization Algorithm in Data Stream System.PACHA '08.19-20 Dec.2008.872-876.
[97]Brian Babcock, Surajit Chaudhuri, Gautam Das.Dynamic Sample Selection for Approximate Query Processing [C].SIGMOD Conference 2003.539-550.
[98]N.Tatbul; S.Zdonik.Dealing with Overload in Distributed Stream Processing Systems.Data Engineering Workshops, 2006.Proceedings.22nd International Conference.2006.24-24.
[99]Babcock, B.; Datar, M.; Motwani, R.Load shedding for aggregation queries over data streams [C].Proceedings.20th International Conference on Data Engineering, 30 March-2 April 2004.350-361.
[100]Nesime Tatbul, Ugur Cetintemel, Stan Zdonik, et al.Load Shedding in a Data Stream Manager [C].In proceedings of the 29th International Conference on Very Large Data Bases (VLDB'03), Berlin, Germany, September 2003.309-320.
[101]Nesime Tatbul, U Cetintemel, Stan Zdonik.Staying FIT: Efficient Load SheddingTechniques for Distributed Stream Processing[C].VLDB 2007, Vienna, Austria.Septemble 2007.232-243.
[102]Stratis D.Viglas, Jeffrey F.Naughton.Rate-based query optimization for streaming information sources [C].In: SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of data [C].New York, NY, USA: ACM,2002.37-48.
[103]T.Urhan and M.J.Franklin.XJoin: A reactively-scheduled pipelined join operator.In Proc.TKDE, 2000.23(2):27～33.
[104]Stratis D.Viglas, Jeffrey F.Naughton, Josef Burger.Maximizing the output rate of multi-way join queries over streaming information sources [C].In: VLDB '2003:Proceedings of the 29th international conference on Very large data bases.VLDB Endowment, 2003.285-296.
[105]Vijayshankar Raman.Using state modules for adaptive query processing [C].In: ICDE.2003.353-364.
[106]Moustafa A.Hammad,Walid G.Aref.Stream Window Join:Tracking Moving Objects in Sensor-Network Databases[C].In:In SSDBM.2003.75-84.
[107]J.S.Gomes,Heyong-Ah Choi.Finding Optimal Join Tree for Multi-Join Stream Queries in a Production System[C].Distributed Computing Systems Workshops,2006.ICDCS Workshops 2006.26th IEEE International Conference on,2006.27-27.
[108]钱江波,王永利,陈征等.数据流窗口连接查询处理器研究[J].电子学报,2009.37(2):404-409.
[109]刘学军,钱江波.分布式数据流连接查询算法[J].计算机工程,2006.32(21):41-43.
[110]郭庆平,欧阳琳.一种分布式数据流连接查询算法[J].武汉理工大学学报,2009.31(3):29-32.