Nondeterministic 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 are developing RGIS, a GIS system 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 introduce the nondeterministic query, an extension to the SELECT statement, which allows the user (and RGIS) to trade off between the query's running time and the number of results. The results are a random sample of the deterministic results, which we argue is sufficient and appropriate. Herein we describe RGIS, the nondeterministic query extension, and its 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.

[1]  Peter A. Dinda,et al.  Scoped and approximate queries in a relational grid information service , 2003, Proceedings. First Latin American Web Congress.

[2]  Peter A. Dinda,et al.  GridG: generating realistic computational grids , 2003, PERV.

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

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

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

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

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

[8]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

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

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

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

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

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

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

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

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

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

[18]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

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

[20]  Massachusett Framingham,et al.  The Common Object Request Broker: Architecture and Specification Version 3 , 2003 .

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

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

[23]  Chuang Liu,et al.  A Constraint Language Approach to Grid Resource Selection , 2003 .

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

[25]  Steve Fisher.  Relational model for information and monitoring , 2001 .

[26]  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).

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

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

[29]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

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

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

[32]  Ibm Redbooks.  Understanding LDAP , 1998 .

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

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

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

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

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

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