Fast Compositional Queries in a Relational Grid Information Service

A Grid Information service (GIS) stores information about the resources of a distributed computing environment and answers questions about it. We have developed RGIS, a GIS system that, unlike previous efforts, is based on the relational data model. RGIS users can write SQL queries that search for complex compositions of resources that meet collective requirements. Executing these queries can be very expensive, however. In response, we have introduced three query techniques, nondeterminism, scoping, and approximation, that allow the user (and RGIS) to trade off between the query’s running time and the number of results. Herein we describe RGIS, our query techniques, and their implementation. Our evaluation shows that a meaningful tradeoff between query time and results returned is achievable, and that the tradeoff can be used to keep query time largely independent of query complexity. RGIS uses our techniques to bound query execution time. This strongly supports our general case for GIS systems based on the relational data model and RDBMSes.

[1]  Amin Vahdat,et al.  Active Names: flexible location and transport of wide-area resources , 1999, Proceedings DARPA Active Networks Conference and Exposition.

[2]  Ian T. Foster,et al.  The Anatomy of the Grid: Enabling Scalable Virtual Organizations , 2001, Int. J. High Perform. Comput. Appl..

[3]  Thomas R. Gross,et al.  Topology discovery for large ethernet networks , 2001, SIGCOMM '01.

[4]  Charles E. Perkins,et al.  Service Location Protocol , 1997, RFC.

[5]  Jim Waldo,et al.  The Jini architecture for network-centric computing , 1999, CACM.

[6]  Peter A. Dinda,et al.  Synthesizing Realistic Computational Grids , 2003, SC.

[7]  Renato J. O. Figueiredo,et al.  A case for grid computing on virtual machines , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[8]  Dong Lu,et al.  Synthesizing Realistic Computational Grids , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[9]  Peter A. Dinda,et al.  Key Concepts and Services of a Grid Information Service , 2002 .

[10]  Peter A. Dinda,et al.  A Unified Relational Approach to Grid Information Services , 2003, ICDCS 2003.

[11]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[12]  Rajesh Raman,et al.  Resource management through multilateral matchmaking , 2000, Proceedings the Ninth International Symposium on High-Performance Distributed Computing.

[13]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[14]  Ian T. Foster,et al.  Grid Services for Distributed System Integration , 2002, Computer.

[15]  Peter A. Dinda,et al.  An Extensible Toolkit for Resource Prediction In Distributed Systems , 1999 .

[16]  Simson L. Garfinkel,et al.  PGP: Pretty Good Privacy , 1994 .

[17]  Michael Mitzenmacher,et al.  The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[18]  Rajesh Raman,et al.  Matchmaking: distributed resource management for high throughput computing , 1998, Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244).

[19]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[20]  Ian T. Foster,et al.  Grid information services for distributed resource sharing , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[21]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[22]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[23]  Hari Balakrishnan,et al.  The design and implementation of an intentional naming system , 1999, SOSP.

[24]  Bernard P. Zajac,et al.  Pretty good privacy , 1994 .

[25]  Warren Smith,et al.  An Evaluation of Alternative Designs for a Grid Information Service , 2004, Cluster Computing.

[26]  K. Claffy,et al.  Topology discovery by active probing , 2002, Proceedings 2002 Symposium on Applications and the Internet (SAINT) Workshops.

[27]  Mark Crovella,et al.  Efficient algorithms for large-scale topology discovery , 2004, SIGMETRICS '05.

[28]  Beng Chin Ooi,et al.  Query Rewriting for SWIFT (First) Answers , 2000, IEEE Trans. Knowl. Data Eng..

[29]  Michael B. Jones,et al.  Overlook: scalable name service on an overlay network , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[30]  Frank Olken,et al.  Random Sampling from Databases , 1993 .

[31]  Thomas R. Gross,et al.  Topology discovery for large ethernet networks , 2001, SIGCOMM 2001.

[32]  Werner Nutt,et al.  The Relational Grid Monitoring Architecture: Mediating Information about the Grid , 2004, Journal of Grid Computing.

[33]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[34]  Matthew Doar,et al.  A better model for generating test networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[35]  Bill Cheswick,et al.  Mapping and Visualizing the Internet , 2000, USENIX Annual Technical Conference, General Track.

[36]  Michael J. Carey,et al.  On saying “Enough already!” in SQL , 1997, SIGMOD '97.

[37]  Butler W. Lampson,et al.  Designing a global name service , 1986, PODC '86.

[38]  Peter A. Dinda,et al.  FatNemo: Building a Resilient Multi-source Multicast Fat-Tree , 2004, WCW.

[39]  A. Watson,et al.  OMG (Object Management Group) architecture and CORBA (common object request broker architecture) specification , 2002 .

[40]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, SIGCOMM 2002.

[41]  Jennifer M. Schopf,et al.  A performance study of monitoring and information services for distributed systems , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[42]  Paul Albitz,et al.  DNS and BIND , 1994 .

[43]  Karsten Schwan,et al.  Dynamic Querying of Streaming Data with the dQUOB System , 2003, IEEE Trans. Parallel Distributed Syst..