Advertisement

Query processing in distributed ORION

  • B. Paul Jenq
  • Darrell Woelk
  • Won Kim
  • Wan-Lik Lee
Session 5: Query Processing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 416)

Abstract

In this paper we describe query processing strategies we have developed and implemented in the distributed version of the ORION object-oriented database system. The ORION query model is based on the ORION object-oriented data model. Further, we have adopted the response time as the primary objective function for query optimization. The query-processing strategies we have developed reflect our solutions to these requirements. In particular, our strategies are based on a dataflow execution model which represents a plan for executing a query concurrently at multiple sites. One important observation we bring out in our description of the ORION query-processing strategies is that most of the important techniques developed for optimizing and processing a relational query apply directly to an object-oriented query, despite the differences in the underlying data models.

Keywords

Query Processing Child Node Parent Node Query Optimization Root Cluster 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABIT84]
    Abiteboul, S., and N. Bidoit. “Non First Normal Form Relations to Represent Hierarchically Organized Data,” in Proc. ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984, pp. 191–200.Google Scholar
  2. [APER83]
    Apers, P., Hevner, A., and Yao, S.B. “Optimization Algorithms for Distributed Queries,” IEEE Transactions on Software Engineering, Vol. SE-9, No. 1, January 1983.Google Scholar
  3. [BANE87]
    Banerjee, J., et al. “Data Model Issues for Object-Oriented Applications,” ACM Trans. on Office Information Systems, January 1987.Google Scholar
  4. [BANE88]
    Banerjee, J., Kim, W., and Kim, K.C. “Queries in Object-Oriented Databases,” in Proc. of the International Conference on Data Engineering, Los Angeles, February 1988.Google Scholar
  5. [CHAN83]
    Chan, A., et al. “Overview of an Ada Compatible Distributed Database Manager,” Proc. of ACM SIGMOD, 1983.Google Scholar
  6. [DANI82]
    Daniels, D., et. al. “An Introduction to Distributed Query Compilation in R*,” IBM Research Report RJ3497, June 1982.Google Scholar
  7. [IEEE88]
    IEEE Computer Society, Database Engineering, special issue on Non-First Normal Form Relational Databases (ed. Z.M. Ozsoyoglu), Sept. 1988.Google Scholar
  8. [KIM87]
    Kim, W., et al. “Composite Object Support in an Object-Oriented Database System,” in Proc. 2nd Intl. Conf. on Object-Oriented Programming Systems, Languages, and Applications, Orlando, Florida, Oct. 1987.Google Scholar
  9. [KIM88]
    Kim, W., et al. “Integrating an Object-Oriented Programming System with a Database System,” in Proc. 2nd Intl. Conf. on Object-Oriented Programming Systems, Languages, and Applications, San Diego, Calif., Sept. 1988.Google Scholar
  10. [KIM89a]
    Kim, W., Kim, K-C., and Dale, A. “Indexing Techniques for Object-Oriented Databases,” to appear in Object-Oriented Concepts, Databases, and Applications, Addison-Wesley, 1989.Google Scholar
  11. [KIM89b]
    Kim, W. “A Model of Queries for Object-Oriented Databases, Proc. of the 15th International Conference on Very Large Data Bases, 1989.Google Scholar
  12. [KIMK88]
    Kim, K-C., Kim, W., and Woelk, D. “Acyclic Query Processing in Object-Oriented Databases,” Proc. Entity-Relationship Conference, Italy, November 1988.Google Scholar
  13. [LOHM85]
    Lohman, G., et al. “Query Processing in R*,” Query Processing in Database Systems, (eds. W. Kim, D. Reiner, and D. Batory), Springer-Verlag, 1985.Google Scholar
  14. [LORI83]
    Lorie, R. and W. Plouffe. “Complex Objects and Their Use in Design Transactions,” in Proc. Databases for Engineering Applications, Database Week 1983 (ACM), May 1983, pp. 115–121.Google Scholar
  15. [MAKI77]
    Makinouchi, A. “A Consideration of Normal Form of Not-necessarily Normalized Relations in the Relational Data Model,” in Proc. Intl Conf. on Very Large Data Bases, 1977, pp. 447–453.Google Scholar
  16. [MACK86]
    Mackert, L., and Lohman, G. “R* Optimizer Validation and Performance Evaluation for Distributed Queries,” Proc. of the 12th International Conference on Very Large Data Bases, 1986.Google Scholar
  17. [SELI79]
    Selinger, P.G. et. al. “Access Path Selection in a Relational Database Management System,” in Proc. ACM SIGMOD Intl. Conf. on Management of Data, Boston, Mass. pp 23–34, 1979.Google Scholar
  18. [VALD88]
    Valduriez, P., and Danforth S. “Query Optimization in FAD,” MCC Technical Report ACA-ST-316-88, September 1988.Google Scholar
  19. [YU87]
    YU, C., et. al. “Algorithms to Process Distributed Queries in Fast Local Networks,” IEEE Transactions on Computer, Vol. C-36, No. 10, October 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • B. Paul Jenq
    • 1
  • Darrell Woelk
    • 1
  • Won Kim
    • 1
  • Wan-Lik Lee
    • 1
  1. 1.Microelectronics and Computer Technology CorporationAustin

Personalised recommendations