Results 1 -
6 of
6
The Architecture of PIER: an Internet-Scale Query Processor
- In CIDR
, 2005
"... This paper presents the architecture of PIER , an Internetscale query engine we have been building over the last three years. PIER is the first general-purpose relational query processor targeted at a peer-to-peer (p2p) architecture of thousands or millions of participating nodes on the Internet. ..."
Abstract
-
Cited by 88 (8 self)
- Add to MetaCart
This paper presents the architecture of PIER , an Internetscale query engine we have been building over the last three years. PIER is the first general-purpose relational query processor targeted at a peer-to-peer (p2p) architecture of thousands or millions of participating nodes on the Internet. It supports massively distributed, database-style dataflows for snapshot and continuous queries. It is intended to serve as a building block for a diverse set of Internet-scale informationcentric applications, particularly those that tap into the standardized data readily available on networked machines, including packet headers, system logs, and file names
SeLeNe Report: Service-based Architecture
, 2003
"... In this report we present the “Grid ” architecture and propose a possible set of services that could be applicable in the case of SeLeNe. Generally, a service-based architecture is proposed that allows a user to submit requests to the SeLeNe Network (the “educational grid”) for the completion of som ..."
Abstract
- Add to MetaCart
In this report we present the “Grid ” architecture and propose a possible set of services that could be applicable in the case of SeLeNe. Generally, a service-based architecture is proposed that allows a user to submit requests to the SeLeNe Network (the “educational grid”) for the completion of some specific task. Although different services may reside at different physical sites, “authority ” sites should be used for providing extended services (such as in a super-peer model). Service placement produces a number of possible architectural alternatives. 1
WP3 Deliverable 3: A Grid Service Framework for Self e-Learning Networks
"... In this report we propose a set of services that are applicable in the case of SeLeNe in alignment to the Open Grid Services Architecture (OGSA). In general, a service-based architecture is proposed that allows a user to submit requests to the SeLeNe Network, viewed as a whole, for the completion of ..."
Abstract
- Add to MetaCart
(Show Context)
In this report we propose a set of services that are applicable in the case of SeLeNe in alignment to the Open Grid Services Architecture (OGSA). In general, a service-based architecture is proposed that allows a user to submit requests to the SeLeNe Network, viewed as a whole, for the completion of some specific task. At this point, the SeLeNe project concentrates on providing services for the utilization of Learning Objects ' (LO) metadata based on the RDF/S standards. Service placement produces a number of possible architectural alternatives. Finally, we present issues not extensively covered by the SeLeNe project but constitute basic challenges for future work.
Roll No: 03D11013 under the guidance of
"... Peer-to-Peer (P2P) refers to a class of systems and applications that employ distributed resources like storage, cycles, content, human presence available at the edges of the Internet, to perform a critical function in a decentralized manner. Peer-to-peer systems have been increasing in popularity i ..."
Abstract
- Add to MetaCart
(Show Context)
Peer-to-Peer (P2P) refers to a class of systems and applications that employ distributed resources like storage, cycles, content, human presence available at the edges of the Internet, to perform a critical function in a decentralized manner. Peer-to-peer systems have been increasing in popularity in recent years as they are used by millions of users to share massive amounts of data over the Internet. P2P systems involves decentralized, self-organizing, highly dynamic loose coupling of many autonomous computers. Applications based on P2P networks promise scalabilty, no central administration of control, robustness to dynamic load and failures. Hence they need scalable and self organizing data structures and algorithms. The purpose of this work is to survey the different existing techniques for querying over these overlay networks. We start this by first looking at exact search and then move on to one-dimensional and multi-dimensional range queries. Finally we look at aggregation queries on P2P systems. The last
PEER TO PEER CATALOG MANAGER FOR NETTRAVELER MIDDLEWARE SYSTEM By
, 2007
"... Distributed and mobile database systems hold the promise of interconnecting mobile de-vices, workstations, and enterprise servers to share data and computational resources. In these environments, query optimizers will be as good as the metadata they use in the optimization pro-cess. These metadata a ..."
Abstract
- Add to MetaCart
(Show Context)
Distributed and mobile database systems hold the promise of interconnecting mobile de-vices, workstations, and enterprise servers to share data and computational resources. In these environments, query optimizers will be as good as the metadata they use in the optimization pro-cess. These metadata are kept in the catalog (data dictionary) of the system. Several approaches currently in use for metadata management assume that the catalog is either: a) centralized, b) fully replicated system-wide, or c) distributed among various well-known sites. However, the dynamic nature of mobile and wide-area networks results in constant changes to the metadata, as well as changes in the sites holding such metadata. Hence, it is of paramount importance to have a catalog system that dynamically adapts to these changes. This work presents a decentralized framework for metadata management that copes with this situation. Our approach is based on a Peer-to-Peer (P2P) catalog management organization, which uses consistent hashing as the mechanism to locate metadata objects throughout the system. Each metadata object is associated with a well-known key. Our framework makes the system more scalable since there is no central metadata reposi-tory, and metadata can be found through an efficient search mechanism. It also provides efficient mechanisms to handle the arrival and departure of hosts and the metadata associated with these hosts. ii
Access Control in XML PDMS Query Answering by
, 2007
"... Peer data management system (PDMS) is a decentralized system, in which each peer is autonomous and has its own schema and database. With the help of pairwise schema mapping built between any two relevant peers, a query at one peer can be rewritten and broadcast to the whole PDMS. Then answers from m ..."
Abstract
- Add to MetaCart
(Show Context)
Peer data management system (PDMS) is a decentralized system, in which each peer is autonomous and has its own schema and database. With the help of pairwise schema mapping built between any two relevant peers, a query at one peer can be rewritten and broadcast to the whole PDMS. Then answers from multiple peers are returned to the querying peer. In our thesis, we exploit the access control issues in the query-answering process of the XML PDMS. We propose a formal syntax for access control policy (ACP) to specify the fine-grained access control privileges on peers ’ local XML database. We also design several query-answering algorithms that aim to handle access control in the PDMS, define the algorithm properties of Information Leakage Free and Completeness, and analyze every designed query-answering algorithm on the two properties. A comprehensive cost model, which consists of the major tasks and primitive operations, is proposed by us to assess the query-answering algorithms. We implement the designed query-answering algorithms, compare their running time, and test the scalability in different facets. ii Table of Contents Abstract................................... ii
