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
Bringing Efficient Advanced Queries to Distributed Hash Tables
- In Proceedings of IEEE LCN
, 2004
"... Interest in distributed storage is fueled by demand for reliability and resilience combined with ubiquitous availability. Peer-to-peer (P2P) storage networks are known for their decentralized control, self-organization, and adaptation. Advanced searching for documents and resources remains an open p ..."
Abstract
-
Cited by 19 (2 self)
- Add to MetaCart
(Show Context)
Interest in distributed storage is fueled by demand for reliability and resilience combined with ubiquitous availability. Peer-to-peer (P2P) storage networks are known for their decentralized control, self-organization, and adaptation. Advanced searching for documents and resources remains an open problem. The flooding approach favored by some P2P networks is ineffiencient in resource usage, but more scalable and resource-efficient solutions based on distributed hash tables (DHT) lack in query expressiveness and flexibility. In this paper, we address this issue and introduce new efficient, scalable, and completely distributed methods that strive to keep resource consumption by queries and index information as low as possible. We describe how to improve the handling of multiple subqueries combined through boolean set operators. The need for these operators is intensified by applications to go beyond simple exact keyword matches. We discuss, optimize, and analyze appropriate extensions to support range and prefix matching in DHTs.
Query Processing Over Peer-To-Peer Data Sharing Systems
, 2002
"... Peer-to-peer systems are mainly used for object sharing currently, but they can provide the infrastructure for many other applications. In this paper, we extend the idea of object sharing to data sharing on a peer-to-peer system. We propose a method, which is based on the CAN [9] system, for efficie ..."
Abstract
-
Cited by 16 (2 self)
- Add to MetaCart
Peer-to-peer systems are mainly used for object sharing currently, but they can provide the infrastructure for many other applications. In this paper, we extend the idea of object sharing to data sharing on a peer-to-peer system. We propose a method, which is based on the CAN [9] system, for efficiently evaluating range queries on such a system. The answers of the range queries are cached at the peers and then they are used to answer further range queries. The scalability and efficiency of our design is shown through simulation.
ART: sub-logarithmic decentralized range query processing with probabilistic guarantees
, 2012
"... © Springer Science+Business Media New York 2012 Abstract We focus on range query processing on large-scale, typically distributed infrastructures, such as clouds of thousands of nodes of shared-datacenters, of p2p distributed overlays, etc. In such distributed environments, efficient range query pro ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
© Springer Science+Business Media New York 2012 Abstract We focus on range query processing on large-scale, typically distributed infrastructures, such as clouds of thousands of nodes of shared-datacenters, of p2p distributed overlays, etc. In such distributed environments, efficient range query processing is the key for managing the distributed data sets per se, and for monitoring
DISTRIBUTED RESOURCE DISCOVERY: ARCHITECTURES AND APPLICATIONS IN MOBILE NETWORKS
, 2010
"... Aalto-yliopisto Teknillinen korkeakoulu Elektroniikan, tietoliikenteen ja automaation tiedekunta Tietoliikenne- ja tietoverkkotekniikan laitos ..."
Abstract
- Add to MetaCart
(Show Context)
Aalto-yliopisto Teknillinen korkeakoulu Elektroniikan, tietoliikenteen ja automaation tiedekunta Tietoliikenne- ja tietoverkkotekniikan laitos
ANSWERING COMPLEX QUERIES IN PEER-TO-PEER SYSTEMS
, 2006
"... Peer-to-peer (P2P) systems provide a robust, scalable and decentralized way to share and publish data. However, most existing P2P systems only support equality or keyword search queries. We believe that future P2P applications, such as digital libraries, resource discovery on a grid, or military app ..."
Abstract
- Add to MetaCart
Peer-to-peer (P2P) systems provide a robust, scalable and decentralized way to share and publish data. However, most existing P2P systems only support equality or keyword search queries. We believe that future P2P applications, such as digital libraries, resource discovery on a grid, or military applications, will require more complex query functionality, as users will publish semantically rich data. Towards the goal of supporting complex queries in P2P systems, this dissertation focuses on developing index structures that allow fast access to distributed data. We introduce first a general modular indexing framework that identifies and separates the different functional components of a P2P index structure. One of the benefits of such a framework is that it allows reusing the existing algorithms for different components rather than implementing everything anew. We can thus concentrate on creating algorithms that provide new functionality. We introduce P-Tree, a distributed fault-tolerant index structure. P-Trees support range queries in addition to equality queries in P2P systems in which
