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

INFORMATION AND SOFTWARE TECHNOLOGY 2002年第4期44卷 197-206页

作者： Papadimos, V Maier, D Oregon Hlth Sci Univ OGI Sch Sci & Engn Dept Comp Sci & Engn Beaverton OR 97006 USA

We propose a flexible and robust framework for distributed query processing based on mutant query, plans (MQP). A MQP is an XML representation of a query plan that can also include verbatim XML data, references to resource locations (URLs), or abstract resource names (URNs). Servers work using local, possibly incomplete knowledge, partially evaluate as much of the query plan as they can, incorporate the partial results into a new, mutated query plan and transfer it to some other server that can continue processing. We have implemented an initial version of this framework, and present preliminary performance results. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： distributed query processing partial evaluation XML

来源：评论

学校读者我要写书评

暂无评论

Pronto: A Software-Defined Networking based System for Performance Management of Analytical Queries on distributed Data Stores

引用

PROCEEDINGS OF THE VLDB ENDOWMENT 2014年第13期7卷 1661-1664页

作者： Xiong, Pengcheng Hacigumus, Hakan NEC Labs Amer Irving TX 75063 USA

Nowadays data analytics applications are accessing more and more data from distributed data stores, creating large amount of data traffic on the network. Therefore, distributed analytic queries are prone to suffer from bad performance in terms of query execution time when they encounter a network resource contention, which is quite common in a shared network. Typical distributed query optimizers do not have a way to solve this problem because historically they have been treating the network underneath as a black box: they are unable to monitor it, let alone to control it. However, we are entering a new era of software-defined networking (SDN), which provides visibility into and control of the network's state for the applications including distributed database systems. In this demonstration, we present a system, called Pronto that leverages the SDN capabilities for a distributed query processor to achieve performance improvement and differentiation for analytical queries. The system is the real implementation of our recently developed methods on commercial SDN products. The demonstration shows the shortcomings of a distributed query optimizer, which treats the underlying network as a black box, and the advantages of the SDN-based approach by allowing the users to selectively explore various relevant and interesting settings in a distributed query processing environment.

关键词： Information management Application programs distributed database systems query languages query processing Software defined networking Analytical queries distributed data stores distributed query processing Performance improvements Performance management query execution time Software defined networking (SDN) Underlying networks

来源：评论

学校读者我要写书评

暂无评论

Using Federated Catalogs to Improve Semantic Integration among Spatial Data Infrastructures

引用

TRANSACTIONS IN GIS 2011年第5期15卷 707-722页

作者： de Andrade, Fabio Gomes Baptista, Claudio de Souza Leite, Fabio Luiz, Jr. Paraiba Fed Inst Sci Educ & Technol Campina Grande Paraiba Brazil Univ Campina Grande Campina Grande Paraiba Brazil State Univ Paraiba Campina Grande Paraiba Brazil

Nowadays, Spatial Data Infrastructures (SDIs) play an important role in government agencies, at different levels: global, national, and local. They aim to improve the management and sharing of geospatial data. Nonetheless, these SDIs have been developed as information islands, in which a user's query is compared to metadata described only in their own catalog services. The lack of interaction among SDIs limits the potential of these infrastructures in providing geospatial data to a larger audience. This article presents a distributed architecture, based on a federation of SDIs which interact among themselves, using query propagation. This propagation facilitates data discovery and sharing. We also describe a distributed query processing service used to enable the resource discovery in distributed infrastructures.

关键词： INFRASTRUCTURE Metadata catalogs government agencies E-discovery spatial data distributed query processing geospatial data federations National Spatial Data Infrastructure

来源：评论

学校读者我要写书评

暂无评论

DYNAMIC REMATERIALIZATION - processing distributed QUERIES USING REDUNDANT DATA

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1983年第3期9卷 228-232页

作者： WONG, E UNIV CALIF BERKELEY ELECTR RES LABBERKELEYCA 94720

A new approach to distributed query processing focusing on how data available at each site change as processing proceeds is proposed. A distributed database system is a collection of autonomous processors, communicating through a general communication medium and accessing separate and possibly overlapping fragments of a database. The dynamics of materialization, which is the collection of data and partial results available for processing at any given time, is used to put the issue of redundancy and parallelism into better focus. By studying this approach, new algorithms were discovered as well as an improved framework for their evaluation, in which new algorithm classes can be devised in a natural way.

关键词： query processing distributed Databases distributed query processing

来源：评论

学校读者我要写书评

暂无评论

A systematic approach to the integration of overlapping partitions in service-oriented data grids

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2011年第6期27卷 667-680页

作者： Sunercan, H. Kevser Alpdemir, M. Nedim Cicekli, Nihan Kesim TUBITAK BILGEM UEKAE ILTAREN Ankara Turkey METU Dept Comp Engn Ankara Turkey

This paper aims to provide a service-oriented data integration solution over data Grids for cases where distributed data sources are partitioned with overlapping sections of various proportions. This is an interesting variation which combines both replicated and partitioned data within the same data management framework. Thus, the data management infrastructure has to deal with specific challenges regarding the identification, access and aggregation of partitioned data with varying proportions of overlapping sections. In order to provide a solution we have extended a well-known data access and integration middleware, namely Open Grid Services Architecture-Data Access and Integration distributed query processing (OGSA-DAI DQP), with distributed query processing facilities, by incorporating the new 'UnionPartitions' operator into its algebra in order to cope with various unusual forms of horizontally partitioned databases. Our solution extends OGSA-DAI DQP in two aspects: (1)a new operator type is added to the algebra to handle the union of the partitions with different characteristics, and (2)OGSA-DAI DQP Federation Description is extended to include some more metadata to facilitate the successful execution of the newly introduced operator. (C) 2010 Elsevier B.V. All rights reserved.

关键词： distributed query processing Data partitioning Service-oriented data grid Data integration

来源：评论

学校读者我要写书评

暂无评论

Dear Mobile Agent, Could You Please Find Me a Parking Space? 1

引用

21st European Conference on Advances in Databases and Information Systems (ADBIS)

作者： Urra, Oscar Ilarri, Sergio Univ Zaragoza Dept Comp Sci & Syst Engn I3A Zaragoza Spain

ISBN: (数字)9783319671628

ISBN: (纸本)9783319671628;9783319671611

Vehicular ad hoc networks (VANETs) have attracted a great interest in the last years due to their potential utility for drivers in applications that provide information about relevant events (accidents, emergency brakings, etc.), traffic conditions or even available parking spaces. To accomplish this, the vehicles exchange data among them using wireless communications that can be obtained from different sources, such as sensors or alerts sent by other drivers. In this paper, we propose searching of parking spaces by using a mobile agent that jumps from one vehicle to another to reach the parking area and obtain the required data directly. We perform an experimental evaluation with promising results that show the feasibility of our proposal.

关键词： Vehicular networks Mobile agents distributed query processing Data management Parking spaces

来源：评论

学校读者我要写书评

暂无评论

Preference-aware Skyline Service Discovery in the Mobile Cloud System

Preference-aware Skyline Service Discovery in the Mobile Clo...

引用

IEEE 24th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Go, Yunmin Song, Hwangjun POSTECH Pohang Univ Sci & Technol Div IT Convergence Engn Pohang South Korea POSTECH Pohang Univ Sci & Technol Dept Comp Sci & Engn Pohang South Korea

ISBN: (纸本)9781467362351

Recently, the mobile cloud computing received much attention since it can provide various and powerful services for the mobile user. The service discovery technology in mobile cloud computing is very important to efficiently provide the mobile services. In this paper, we proposed a novel preference-aware skyline service discovery system in the mobile cloud system. The objective of our system is to discover preferable services in the mobile cloud system. Our proposed mobile cloud system is composed of zone-based overlay network. In the overlay network, querying user generates the query with user preference extracted by a Singular Value Decomposition method from the user's service access history. The generated query is sent to the mobile cloud system, and then the query is handled by the distributed skyline query processing mechanism to discover user preferable services with low networking communication cost in the mobile cloud system. We conduct experiments to evaluate the performance of our proposed system.

关键词： Preference-aware Service discovery distributed query processing Mobile cloud system Skyline

来源：评论

学校读者我要写书评

暂无评论

HYPERSONIC: A Hybrid Parallelization Approach for Scalable Complex Event processing 22

HYPERSONIC: A Hybrid Parallelization Approach for Scalable C...

引用

International Conference on Management of Data (SIGMOD)

作者： Yankovitch, Maor Kolchinsky, Ilya Schuster, Assaf Technion Israel Inst Technol Haifa Israel

ISBN: (纸本)9781450392495

The ability to promptly and efficiently detect arbitrarily complex patterns in massive real-time data streams is a crucial requirement in many modern applications. The ever-growing scale of these applications and the sophistication of the patterns involved makes it imperative to employ advanced solutions that can optimize pattern detection. One of the most prominent and well-established ways to achieve the above goal is to apply complex event processing (CEP) in a parallel manner, using a multi-core machine and/or a distributed environment. However, the inherent tightly coupled nature of CEP severely limits the scalability of the parallelization methods currently available. In this paper, we introduce a novel parallelization mechanism for efficient complex event processing over data streams. This mechanism is based on a hybrid two-tier model combining multiple layers of parallelism. By employing a fine-grained load balancing model, this multi-layered approach leads to a substantial increase in event detection throughput, while at the same time reducing the latency and the memory consumption. An extensive experimental evaluation on multiple real-life datasets shows that our approach consistently outperforms state-of-the-art CEP parallelization methods by a factor of two to three orders of magnitude.

关键词： Complex Event processing Parallel query processing distributed query processing query Optimization

来源：评论

学校读者我要写书评

暂无评论

Spatial Search in Networked Systems 11

Spatial Search in Networked Systems

引用

11th International Conference on Network and Service Management (CNSM)

作者： Uddin, Misbah Stadler, Rolf Clemm, Alexander KTH Royal Inst Technol ACCESS Linnaeus Ctr Stockholm Sweden Cisco Syst San Jose CA USA

ISBN: (纸本)9783901882777

Information in networked systems often has spatial properties: routers, sensors, or virtual machines have coordinates in a geographical or virtual space, for instance. In this paper, we propose a peer-to-peer design for a spatial search system that processes queries, such as range or nearest-neighbor queries, on spatial information cached on nodes inside a networked system. Key to our design is a protocol that creates a distributed index of object locations and adapts to object and node churn. The index builds upon the concept of the minimum bounding rectangle, to efficiently encode a large set of locations. We present a search protocol, which is based on an echo protocol and performs query routing. Simulations show the efticiency of the protocol in pruning the search space, thereby reducing the protocol overhead. For many queries, the protocol efficiency increases with the network size and approaches that of an optimal protocol for large systems. The protocol overhead depends on the network topology and is lower if neighboring nodes are spatially close. As a key difference to works in spatial databases, our design is bottom-up, which makes query routing network-aware and thus efficient in networked systems.

关键词： network search spatial search distributed spatial index distributed query processing

来源：评论

学校读者我要写书评

暂无评论

Case for dynamic deployment in a grid-based distributed query processor

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2012年第1期28卷 171-183页

作者： Mukherjee, A. Watson, P. Newcastle Univ Sch Comp Sci Newcastle Upon Tyne NE1 7RU Tyne & Wear England

Grid computing enables users to perform computationally expensive applications on distributed resources acquired dynamically. Users are allowed to combine structured data and analysis components into new applications from distributed sites into new applications. distributed query processing offers an established way of structuring such computations, and well-known tools like OGSA-DAI and OGSA-DQP provide respectively a common interface to heterogeneous databases, and a way of exploiting distributed resources. Such significant benefits are however often undermined by high communication costs due to the need to move data between distributed resources. This paper describes an approach that addresses this by dynamically deploying query processing engines, analysis services and databases within virtual machines, on an internet-scale, so as to reduce communication costs. Results of internet-scale experiments are presented to demonstrate the performance benefits. Further, the use of dynamic deployment features based on requirements allows the creation of an ad-hoc runtime engine and thus opens up the possibility of creating a virtual marketplace for software and hardware resources. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Grid computing Virtual organizations Web services distributed query processing Dynamic deployment Virtual machines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：