Querying at Internet scale

  • Authors:
  • Brent Chun;Joseph M. Hellerstein;Ryan Huebsch;Shawn R. Jeffery;Boon Thau Loo;Sam Mardanbeigi;Timothy Roscoe;Sean Rhea;Scott Shenker;Ion Stoica

  • Affiliations:
  • Intel Research Berkeley;University of California at Berkeley;University of California at Berkeley;University of California at Berkeley;University of California at Berkeley;University of California at Berkeley;Intel Research Berkeley;University of California at Berkeley;University of California at Berkeley;University of California at Berkeley

  • Venue:
  • SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Internet. PIER utilizes a Distributed Hash Table (DHT) as its communication substrate in order to achieve scalability, reliability, decentralized control, and load balancing. PIER enhances DHTs with declarative and algebraic query interfaces, and underneath those interfaces implements multihop, in-network versions of joins, aggregation, recursion, and query/result dissemination. PIER is currently being used for diverse applications, including network monitoring, keyword-based filesharing search, and network topology mapping. We will demonstrate PIER's functionality by showing system monitoring queries running on PlanetLab, a testbed of over 300 machines distributed across the globe.