期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
An Energy-Efficient Query Based on Variable Region for Large-Scale Smart Grid
1
作者 Yan Wang Qingxu Deng +2 位作者 Genghao Liu Xiuping Hao baoyan song 《China Communications》 SCIE CSCD 2016年第10期119-136,共18页
The state-of-the-art query techniques in power grid monitoring systems focus on querying history data, which typically introduces an unwanted lag when the systems try to discover emergency situations. The monitoring d... The state-of-the-art query techniques in power grid monitoring systems focus on querying history data, which typically introduces an unwanted lag when the systems try to discover emergency situations. The monitoring data of large-scale smart grids are massive, dynamic and highly dimensional, so global query, the method widely adopted in continuous queries in Wireless Sensor Networks(WSN), is rendered not suitable for its high energy consumption. The situation is even worse with increasing application complexity. We propose an energy-efficient query technique for large-scale smart grids based on variable regions. This method can query an arbitrary region based on variable physical windows, and optimizes data retrieve paths by a key nodes selection strategy. According to the characteristics of sensing data, we introduce an efficient filter into the each query subtree to keep non-skyline data from being retrieved. Experimental results show that our method can efficiently return the overview situation of any query region. Compared to TAG and ESA, the average query efficiency of our approach is improved by 79% and 46%, respectively; the total energy consumption of regional query is decreased by 82% and 50%, respectively. 展开更多
关键词 smart grid monitoring system wireless sensor network key node skyline query
下载PDF
Efficient Processing of Multi-way Joins Using MapReduce
2
作者 Linlin Ding Siping Liu +2 位作者 Yu Liu Aili Liu baoyan song 《国际计算机前沿大会会议论文集》 2015年第1期23-24,共2页
Multi-way join is critical for many big data applications such as data mining and knowledge discovery. Even though lots of research have been devoted to processing multi-way joins using MapReduce, there are still seve... Multi-way join is critical for many big data applications such as data mining and knowledge discovery. Even though lots of research have been devoted to processing multi-way joins using MapReduce, there are still several problems in general to be further improved, such as transferring numerous unpromising intermediate data and lacking of better coordination mechanisms. This work proposes an efficient multi-way joins processing model using MapReduce, named Sharing-Coordination-MapReduce (SC-MapReduce), which has the functions of sharing and coordination. Our SC-MapReduce model can filter the unpromising intermediatedata largely by using the sharing mechanism and optimize the multiple tasks coordination of multi-way joins. Extensive experiments show that the proposed model is efficient, robust and scalable. 展开更多
关键词 MAPREDUCE multi-way joins SHARING and COORDINATION
下载PDF
Efficient User Preferences-Based Top-k Skyline Using MapReduce 被引量:1
3
作者 Linlin Ding Xiao Zhang +2 位作者 Mingxin Sun Aili Liu baoyan song 《国际计算机前沿大会会议论文集》 2018年第1期7-7,共1页
下载PDF
Efficient k-dominant skyline query over incomplete data using MapReduce
4
作者 Linlin DING Shu WANG baoyan song 《Frontiers of Computer Science》 SCIE EI CSCD 2021年第4期151-164,共14页
Skyline queries are extensively incorporated in various real-life applications by filtering uninteresting data objects.Sometimes,a skyline query may return so many results because it cannot control the retrieval condi... Skyline queries are extensively incorporated in various real-life applications by filtering uninteresting data objects.Sometimes,a skyline query may return so many results because it cannot control the retrieval conditions especially for highdimensional datasets.As an extension of skyline query,the kdominant skyline query reduces the control of the dimension by controlling the value of the parameter k to achieve the purpose of reducing the retrieval objects.In addition,with the continuous promotion of Bigdata applications,the data we acquired may not have the entire content that people wanted for some practically reasons of delivery failure,no power of battery,accidental loss,so that the data might be incomplete with missing values in some attributes.Obviously,the k-dominant skyline query algorithms of incomplete data depend on the user definition in some degree and the results cannot be shared.Meanwhile,the existing algorithms are unsuitable for directly used to the incomplete big data.Based on the above situations,this paper mainly studies k-dominant skyline query problem over incomplete dataset and combines this problem with the distributed structure like MapReduce environment.First,we propose an index structure over incomplete data,named incomplete data index based on dominate hierarchical tree(ID-DHT).Applying the bucket strategy,the incomplete data is divided into different buckets according to the dimensions of missing attributes.Second,we also put forward query algorithm for incomplete data in MapReduce environment,named MapReduce incomplete data based on dominant hierarchical tree algorithm(MR-ID-DHTA).The data in the bucket is allocated to the subspace according to the dominant condition by Map function.Reduce function controls the data according to the key value and returns the k-dominant skyline query result.The effective experiments demonstrate the validity and usability of our index structure and the algorithm. 展开更多
关键词 k-dominant skyline query incomplete data MAPREDUCE index structure big data
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部