Skip to main content
SpringerLink
Log in

Fast Compositional Queries in a Relational Grid Information Service

  • Published:
Journal of Grid Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. Adjie-Winoto, E. Schwartz, H. Balakrishnan and J. Lilley, “The Design and Implementation of an Intentional Naming System”, in Proceedings of the 17th ACM Symposium on Operating System Principles, December 1999.

  2. P. Albitz and C. Liu, DNS and BIND. O’Reilly and Associates, Inc., Sebastopol, California, 1992.

    Google Scholar 

  3. S. Birrer, D. Lu, F. Bustamante, Y. Qiao and P. Dinda, “Fatnemo: Building a Resilient Multisource Multicast Fat-Tree”, in Proceedings of the 9th Web Content Caching and Distribution Workshop (WCW), October 2004.

  4. S. Brin and L. Page, “The Anatomy of a Large-Scale Hypertextual Web Search Engine”, Computer Networks and ISDN Systems, Vol. 30, No. 1–7, pp. 107–117, 1998.

    Article  Google Scholar 

  5. M. Carey and D. Kossmann, “On Saying “Enough Already!” in sql”, in ACM SIGMOD Conference, 1997.

  6. B. Cheswick, H. Burch and S. Branigan, “Mapping and Visualizing the Internet”, in Proceedings of the USENIX Annual Technical Conference, June 2000.

  7. K. Czajkowski, S. Fitzgerald, I. Foster and C. Kesselman, “Grid Information Services for Distributed Resource Sharing”, in Proceedings of HPDC 2001, August 2001.

  8. P. Dinda and B. Plale, A Unified Relational Approach to Grid Information Services. Tech. Rep. GWD-GI-012-1, Global Grid Forum, February 2001. Informational Draft.

  9. P.A. Dinda and D.R. O’Hallaron, An extensible toolkit for resource prediction in distributed systems. Tech. Rep. CMU-C-99-138, School of Computer Science, Carnegie Mellon University, July 1999.

  10. M. Doar, “A Better Model for Generating Test Networks”, in Proceedings of GLOBECOM ’96, November 1996.

  11. B. Donnet, P. Raoult, T. Friedman and M. Crovella, “Efficient Algorithms for Large-Scale Topology Discovery”, in Proceedings of the 2005 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), June 2005, pp. 327–336.

  12. M. Faloutsos, P. Faloutsos and C. Faloutsos, “On Power–Law Relationships of the Internet Topology”, in SIGCOMM, 1999, pp. 251–262.

  13. R. Figueiredo, P.A. Dinda and J. Fortes, “A Case for Grid Computing on Virtual Machines”, in Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), May 2003.

  14. A.W. Cooke et al., “The Relationship Grid Monitoring Architecture”, Mediating Information about the Grid Journal of Grid Computing, Vol. 2, No. 4.

  15. I. Foster and C. Kesselman (eds.), The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann, 1999.

  16. I. Foster, C. Kesselman, J. Nick and S. Tuecke, “Grid Services for Distributed System Integration”, Computer, Vol. 35, No. 6, pp. 37–46, 2002.

    Article  Google Scholar 

  17. I. Foster, C. Kesselman and S. Tuecke, “The Anatomy of the Grid: Enabling Scalable Virtual Organizations”, International Journal of Supercomputer Applications, Vol. 15, pp. 200–222, 2001.

    Article  Google Scholar 

  18. S. Garfinkel, PGP: Pretty Good Privacy. O’Reilly and Associates, 1994.

  19. Global Grid Forum. Global Grid Forum Web Site. http://www.gridforum.org.

  20. Y. Hua Chu, S. Rao, S. Seshan and H. Zhang, “A Case for End System Multicast”, IEEE Journal on Selected Areas In Communication, Vol. 20, No. 8, 2002.

    Article  Google Scholar 

  21. B. Huffaker, D. Plummer, D. Moore and K. Claffy, “Topology Discovery by Active Probing”, in Proceedings of Symposium on Applications and the Internet, January 2002.

  22. IBM International Technical Support Organization. Understanding LDAP, IBM Corporation, 1998.

  23. International Telecommunication Union. Information Technology – Open Systems Interconnection – The Directory: Overview of Concepts, Models, and Services, August 1997.

  24. B.W. Lampson, “Designing a Global Name Service”, in 4th ACM Symposium on Principles of Distributed Computing, August 1986.

  25. C. Liu and I. Foster, A Constraint Language Approach to Grid Resource Selection. Tech. Rep. TR-2003-07, Department of Computer Science, University of Chicago, March 2003.

  26. B. Lowekamp, D.R. O’Hallaron and T.R. Gross, “Topology Discovery for Large Ethernet Networks”, in Proceedings of SIGCOMM 2001, August 2001.

  27. D. Lu and P.A. Dinda, “Synthesizing Realistic Computational Grids”, in Proceedings of ACM/IEEE SC 2003 (Supercomputing), November 2003.

  28. M. Mitzenmacher, “The Power of Two Choices in Randomized Load Balancing”, IEEE Transactions on Parallel and Distributed Computing, Vol. 12, No. 10, pp. 1094–1104, 2001.

    Article  Google Scholar 

  29. Object Management Group, The Common Object Request Broker: Architecture and Specification (version 2.3.1). Tech. Rep., Object Management Group, 1999.

  30. F. Olken, Random Sampling from Databases. PhD thesis, University of California, Berkeley, 1993.

  31. B. Plale, P. Dinda and G. von Laszewski, “Key Concepts and Services of a Grid Information Service”, in Proceedings of the 15th International Conference on Parallel and Distributed Computing Systmes (PDCS 2002), 2002.

  32. B. Plale, C. Jacobs, C. Moad, R. Parab and P. Vaidya, “Synthetic Database Benchmark/Workload for Grid Information Servers”, in Proceedings of the 4th IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2004), 2004.

  33. B. Plale and K. Schwan, “Dynamic Querying of Streaming Data with the dQUOB System”, IEEE Transactions on Parallel and Distributed Systems, Vol. 14, No. 4, pp. 422–432, 2003.

    Article  Google Scholar 

  34. R. Raman, M. Livny and M. Solomon, “Matchmaking: Distributed Resource Management for High Throughput Computing”, in Proceedings of the Seventh IEEE International Symposium on High Performance Distributed Computing (HPDC ’98), July 1998, pp. 140–146.

  35. R. Raman, M. Livny and M. Solomon, “Resource Management Through Multilateral Matchmaking”, in Proceedings of the Ninth IEEE International Symposium on High Performance Distributed Computing (HPDC 2000), July 2000, pp. 290–291.

  36. A. Rowstron and P. Druschel, “Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems”, in Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 2001.

  37. W. Smith, A. Waheed, D. Meyers and J.C. Yan, “An Evaluation of Alternative Designs for a Grid Information Service”, Cluster Computing, Vol. 4, pp. 29–37, 2001.

    Article  Google Scholar 

  38. N. Spring, R. Mahajan and D. Wetherall, “Measuring ISP Topologies with Rocketfuel”, in Proceedings of ACM/SIGCOMM, August 2002.

  39. I. Stoica, R. Morris, D. Karger, F. Kaashoek and H. Balakrishnan, “Chord: A scalable Peer-to-Peer Lookup Service for Internet Applications”, in Proceedings of ACM SIGCOMM 2001, 2001, pp. 149–160.

  40. K.-L. Tan, C.H. Goh and B.C. Ooi, “Query Rewriting for SWIFT (First) Answers”, IEEE Transactions on Knowledge and Data Engineering, Vol. 12, No. 5, pp. 694–714, Sept/Oct 2000.

    Article  Google Scholar 

  41. The Open Group, DCE 1.2.2: Introduction to OSF DCE. The Open Group, September 1997. http://www.opengroup.org/pubs/catalog/f201.htm.

  42. M. Theimer and M.B. Jones, “Overlook: Scalable Name Service on an Overlay Network”, in Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS 2002), July 2002.

  43. Transaction Processing Council. Tpc benchmarks. http://www.tpc.org.

  44. A. Vahdat, M. Dahlin, T. Anderson and A. Aggarwal, “Active Names: Flexible Location and Transport of Wide-Area Resources”, in USENIX Symposium on Internet Technology and Systems, October 1999.

  45. J. Veizades, E. Guttman, C. Perkins and S. Kaplan, Service Location Protocol. Internet RFC 2165, June 1997.

  46. J. Waldo, “The Jini Architecture for Network-Centric Computing”, Communications of the ACM, Vol. 42, No. 7, pp. 76–82, 1999.

    Article  Google Scholar 

  47. X. Zhang, J.L. Freschl and J.M. Schopf, “A Performance Study of Monitoring and Information Services for Distributed Systems”, in Proceedings of the 12th International Symposium on High Performance Distributed Computing (HPDC), 2003.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Northwestern University, 1890 Maple Avenue, Evanston, IL, 60201, USA

    Peter Dinda & Dong Lu

Authors
  1. Peter Dinda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dong Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Dinda.

Additional information

Effort sponsored by the National Science Foundation under Grants ANI-0093221, ACI-0112891, ANI-0301108, EIA-0130869, and EIA-0224449. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation (NSF).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dinda, P., Lu, D. Fast Compositional Queries in a Relational Grid Information Service. J Grid Computing 3, 131–150 (2005). https://doi.org/10.1007/s10723-005-9004-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10723-005-9004-6

Key words

Search

Navigation