检索结果-内蒙古大学图书馆

BI-FILTERED FORWARDING: A QUASI-OPTIMAL ROUTING ALGORITHM FOR query DELIVERY IN WIRELESS SENSOR NETWORKS

INTERNATIONAL JOURNAL ON SMART SENSING AND INTELLIGENT SYSTEMS 2013年第3期6卷 993-1011页

作者： Zhang, Junhu Zhu, Xiujuan Peng, Hui Qingdao Technol Univ Coll Comp Engn Qingdao Peoples R China Renmin Univ China Sch Informat Beijing Peoples R China

A quasi-optimal query propagation algorithm Bi-Filtered Forwarding (BFF) for quickly routing a query throughout a wireless sensor network is proposed in this paper. BFF is implemented in a limited flooding manner for guaranteeing quick query propagation and low message consumption in wireless sensor networks. The experimental results show that in comparison with the flooding algorithm, BFF can greatly reduce the redundant message consumption during the procedure of real time query propagation throughout a wireless sensor network.

关键词： Real time routing distributed query processing query propagation constrained flooding wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Building the distributed geographic SQL workflow in the Grid environment

引用

INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE 2011年第7期25卷 1117-1145页

作者： Huang, Zhou Fang, Yu Chen, Bin Wu, Lun Pan, Mao Peking Univ Inst Remote Sensing Beijing 100871 Peoples R China Peking Univ GIS Beijing 100871 Peoples R China Peking Univ Minist Educ Key Lab Orogen Belts & Crustal Evolut Beijing 100871 Peoples R China

Over recent years, massive geospatial information has been produced at a prodigious rate, and is usually geographically distributed across the Internet. Grid computing, as a recent development in the landscape of distributed computing, is deemed as a good solution for distributed geospatial data management and manipulation. Thus, the Grid computing technology can be applied to integrate various distributed resources into a 'super-computer' that enables efficient distributed geospatial query processing. In order to realize this vision, an effective mechanism for building the distributed geospatial query workflow in the Grid environment needs to be elaborately designed. The workflow-building technology aims to automatically transform the global geospatial query into an equivalent distributed query process in the Grid. In response to this goal, detailed steps and algorithms for building the distributed geospatial query workflow in the Grid environment are discussed in this article. Moreover, we develop corresponding software tools that enable Grid-based geospatial queries to be run against multiple data resources. Experimental results demonstrate that the proposed methodology is feasible and correct.

关键词： Grid computing distributed query processing GSQL

来源：评论

学校读者我要写书评

暂无评论

MaD-WiSe: a distributed stream management system for wireless sensor networks

引用

SOFTWARE-PRACTICE & EXPERIENCE 2010年第5期40卷 431-451页

作者： Amato, Giuseppe Chessa, Stefano Vairo, Claudio ISTI CNR I-56124 Pisa Italy Univ Pisa Dept Comp Sci I-56127 Pisa Italy

Wireless sensor networks (WSN) are composed of several sensors having limited memory, processing power, communication bandwidth, and energy, which cooperate in performing a given task. The use of the database paradigm has emerged in the last few years as a viable solution to manage data in such a context. In this paper we present the MaD-WiSe system, a distributed query processing framework that moves the processing of the query into the network. MaD-WiSe reconsiders various aspects related to database system design and it reinterprets them according to the WSN constraints and requirements. In particular it considers the aspects related to the definition of a query language to formalize the queries, a stream model to manage data acquired by the sensors, a query algebra to define the operators that actually perform the query, and energy efficiency and query optimization strategies for saving energy. Copyright (c) 2010 John Wiley & Sons, Ltd.

关键词： sensor networks databases distributed query processing sensor data modelling wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A taxonomy of distributed query management techniques for wireless sensor networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2007年第7期20卷 889-908页

作者： Chatterjea, S. Havinga, P. Univ Twente Dept Comp Sci NL-7500 AE Enschede Netherlands

In the not too distant future, wireless sensor networks are envisioned to proliferate through the entire spectrum of the 'environmental monitoring' market allowing users to monitor a multitude of environments. Thousands or even millions of sensor nodes may span vast geographical areas enabling various environmental parameters to be monitored with significantly higher spatial and temporal resolutions than what is achievable using existing monitoring technologies. In order to manage the large amount of data that will be generated by these numerous sensor nodes, novel querying methods are needed to extract the required information in an energy-efficient manner. This paper studies the techniques used to manage the queries in a distributed manner and classifies the current state-of-the-art in this field into four main categories: in-network processing, acquisitional query processing, cross-layer optimization and data-centric data/query dissemination. This taxonomy not only illustrates how query management techniques have advanced over the recent past, but also allows researchers to identify the relevant features when designing sensor networks for different applications. Copyright (C) 2006 John Wiley & Sons, Ltd.

关键词： distributed query processing sensor networks

来源：评论

学校读者我要写书评

暂无评论

Procedure Graph Model for Automatic RFID Data processing Service Management

引用

IEEE INTERNET OF THINGS JOURNAL 2017年第3期4卷 713-722页

作者： Xu, Yang Agyemang, Brighter Wu, Shuai Liu, Ming Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Peoples R China

Process management is practical in the state-of-the-art of Internet of things research. However, this has become a bottleneck in recent years since an extreme amount of heterogeneous items have to be recorded and traced with radio frequency identification (RFID) tags. In a typical application of process synthesis management, each item will be involved with multiple processes but when those processes are interconnected, an extremely complex network emerges and has to be managed. Existing works on processing management systems, however, are always case-based and only focus on specific application domains. Thus, the general applied processing management model is rather limited. In this paper, we summarize the characteristics of the RFID application domains, and by abstraction, we propose an innovation of the RFID processing model. In this model, each RFID data were deemed as an operation record and all their processing services are logically interconnected and organized as a procedure graph. In addition, we abstract and summarize the basic RFID data processes into a few types. The advantage of this design is that the basic RFID data processing logic can be preprogrammed and in a real domain, the system can be dynamically programmed by automatically constructing the procedure graph nodes with those basic processes and mapping the interconnection logic according to the topology of the graph. As the last part of this paper, we designed a prototype system for medical instruments infection control to demonstrate our approach.

关键词： Data integrity validation distributed query processing process modeling theory radio frequency identification (RFID)

来源：评论

学校读者我要写书评

暂无评论

Optimization of decentralized multi-way join queries over pipelined filtering services

引用

COMPUTING 2012年第12期94卷 939-972页

作者： Tsamoura, Efthymia Gounaris, Anastasios Manolopoulos, Yannis Aristotle Univ Thessaloniki GR-54006 Thessaloniki Greece

The capability to optimize and execute complex queries over multiple remote services (e.g., web services) is of high significance for efficient data management in large scale distributed computing infrastructures, such as those enabled by grid and cloud computing technology. In this work, we investigate the optimization of queries that involve multiple data resources, each of which is processed by non-overlapping sets of remote filtering services. The main novelty of this work is the proposal of optimization algorithms that produce an ordering of calls to services so that the query response time is minimized. The distinctive features of our work lie in the consideration of direct, heterogenous links among services and of multiple data resources. To the best of our knowledge, there is no known algorithm for this problem and the evaluation results show that the proposed algorithms can yield significant performance improvements compared to naive approaches.

关键词： distributed query processing distributed query optimization Pipelined filter ordering

来源：评论

学校读者我要写书评

暂无评论

Dynamic query operator scheduling for wide-area remote access

引用

distributed AND PARALLEL DATABASES 1998年第3期6卷 217-246页

作者： Amsaleg, L Franklin, MJ Tomasic, A Inst Natl Rech Informat & Automat IRISA F-35042 Rennes France Univ Maryland Dept Comp Sci College Pk MD 20742 USA INRIA Rocquencourt F-78153 Le Chesnay France

distributed databases operating over wide-area networks such as the Internet must deal with the unpredictable nature of the performance of communication. The response times of accessing remote sources can vary widely due to network congestion, link failure, and other problems. In such an unpredictable environment, the traditional iterator-based query execution model performs poorly. We have developed a class of methods, called query scrambling, for dealing explicitly with the problem of unpredictable response times. query scrambling dynamically modifies query execution plans on-the-fly in reaction to unexpected delays in data access. In this paper we focus on the dynamic scheduling of query operators in the context of query scrambling. We explore various choices for dynamic scheduling and examine, through a detailed simulation, the effects of these choices. Our experimental environment considers pipelined and non-pipelined join processing in a client with multiple remote data sources and delayed or possibly bursty arrivals of data. Our performance results show that scrambling rescheduling is effective in hiding the impact of delays on query response time for a number of different delay scenarios.

关键词： distributed query processing mediators iterator execution model performance analysis query scrambling dynamic query optimization

来源：评论

学校读者我要写书评

暂无评论

Supporting quantified queries in distributed databases

引用

INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND distributed SYSTEMS 2014年第5期29卷 421-459页

作者： Badia, Antonio Dobbs, Michael Univ Louisville Comp Engn & Comp Sci Dept Louisville KY 40292 USA Amazon Seattle WA 98109 USA

We show that some relational queries, which we call quantified queries are not well supported in distributed environments. We give a formal definition of quantified queries, propose a language in which to express said queries and provide a procedure to compute answers in this new language in the context of distributed databases. The proposed language is made up of high-level, declarative operators (called generalised quantifiers), and therefore it can be used in combination with several distributed frameworks. Our approach is designed to be as general as possible;it assumes horizontally partitioned relations, but nothing else, so no data placement or replication is used. We present an implementation and algorithms for the new language, propose some basic optimisations and give experimental results which show that the new approach is indeed quite efficient and scales well.

关键词： distributed query processing relational query processing generalised quantifiers

来源：评论

学校读者我要写书评

暂无评论

A PARALLEL EXECUTION METHOD FOR MINIMIZING distributed query RESPONSE-TIME

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 1992年第3期3卷 325-333页

作者： WANG, CP CHEN, ALP SHYU, SC NATL TSING HUA UNIV DEPT COMP SCITAIPEI 30043TAIWAN IBM CORP SANTA TERESA LABSAN JOSECA 95150

Performance studies [6], [17] show that traditional semi-join processing methods are sometimes inefficient because of the storage and processing overhead. To remedy this problem, we propose a new semi-join processing method, called one-shot semi-join execution. This method allows parallel generation of all the semi-join projections, parallel transmission of all the semi-join projections, and parallel execution of all the semi-joins. We apply this method to optimize the response time for processing distributed queries. A response time model is established, which considers both data transmission time and local processing time. Based on this model, we develop and analyze an efficient query processing algorithm.

关键词： distributed query processing distributed DATABASES ONE-SHOT SEMIJOINS query OPTIMIZATION SEMI-JOIN processing

来源：评论

学校读者我要写书评

暂无评论

Parallel-Based Techniques for Managing and Analyzing the Performance on Semantic Graph

引用

PARALLEL processing LETTERS 2020年第2期30卷

作者： Algosaibi, Abdulelah Ragab, Khaled Albahli, Saleh King Faisal Univ Dept Comp Sci CCSIT Al Hufuf Saudi Arabia Qassim Univ Dept Informat Technol Coll Comp Buraydah Saudi Arabia

In recent years, data are generated rapidly that advanced the evolving of the linked data. Modern data are globally distributed over the semantically linked graphs. The nature of the distributed data over the semantic graph raised new demands on further investigation on improving performance on the semantic graphs. In this work, we analyzed the time latency as an important factor to be further investigated and improved. We evaluated the parallel computing on these distributed data in order to better utilize the parallelism approaches. A federation framework based on a multi-threaded environment supporting federated SPARQL query was introduced. In our experiments, we show the achievability and effectiveness of our model on a set of real-world quires through real-world Linked Open Data cloud. Significant performance improvement has noticed. Further, we highlight shortcomings that could open an avenue in the research of federated queries.

关键词： Semantic web distributed query processing query federation linked data join methods

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：