Distributed SQL queries with BubbleStorm

Authors:
Christof Leng;Wesley W. Terpstra
Affiliations:
Databases and Distributed Systems, Technische Universität Darmstadt, Germany;Databases and Distributed Systems, Technische Universität Darmstadt, Germany
Venue:
From active data management to event-based systems and more
Year:
2010

Citing 12
Cited 0

Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining

ACM Transactions on Computer Systems (TOCS)
Web Search for a Planet: The Google Cluster Architecture

IEEE Micro
Internet growth: is there a "Moore's law" for data traffic?

Handbook of massive data sets
Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Database Systems: An Application Oriented Approach, Complete Version (2nd Edition)

Database Systems: An Application Oriented Approach, Complete Version (2nd Edition)
Progressive Distributed Top-k Retrieval in Peer-to-Peer Networks

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
MINERVA: collaborative P2P search

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Computing separable functions via gossip

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Practical summation via gossip

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
ROAR: increasing the flexibility and performance of distributed search

Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Bit zipper rendezvous optimal data placement for general p2p queries

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current peer-to-peer (p2p) systems place the burden of application-level query execution on the application developer. Not only do application developers lack the expertise to implement good distributed algorithms, but this approach also limits the ability of overlay architects to apply future optimizations. The analogous problem for data management was solved by the introduction of SQL, a high-level query language for application development and amenable to optimization. This paper attempts to bridge the gap between current access-oriented p2p systems and relational database management systems (DBMS). We outline how to implement every relational operator needed for SQL queries in the BubbleStorm peer-to-peer overlay. The components of BubbleStorm map surprisingly well to components in a traditional DBMS.