Advertisement

Query Processing in PIOS

  • Fausto Rabitti
  • Leonardo Benedetti
  • Federico Demi
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Abstract

An approach to query processing in object-oriented stores supporting physical data independence is proposed in this paper. In particular, the problem of query optimization (i.e. finding efficient execution plans for declarative queries) has been investigated. A set of rewrite rules has been defined in order to allow an algebraic optimization phase. A local search procedure, based on a cost model of the store, has been tailored to the task of physical optimization. To support the physical data independence in the store, a translation algorithm, dealing with the actual storage organization of the database, has been studied. A comprehensive example illustrates these mechanisms. Finally, performance results are presented.

Keywords

Query Processing Query Language Query Optimization Local Search Procedure Storage Schema 
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. 1.
    F. Rabitti, G. Mainetto, P. Zezula, S. Barneva, N. Aloia, L. Benedetti, S. Biscari, P. Carcaci, E. Criscuoli, F. Demi, F. Giannasio, and U. Pasquali. Design and Implementation of PIOS: a Physically Independent Object Server. In Technical Report FIDE/93/70, ESPRIT BRA Project No. 6309, FIDE-2 (Formally Integrated Data Environment), 1993Google Scholar
  2. 2.
    F. Rabitti, L. Benedetti, and F. Demi. Query Processing in PIOS. In Technical Report FIDE/94/83, ESPRIT BRA Project No. 6309, FIDE-2 (Formally Integrated Data Environment), 1994Google Scholar
  3. 3.
    M. Atkinson, F. Bancilhon, D. DeWitt, K. Dittrich, D. Maier, and S. Zdonik. The Object-Oriented Database System Manifesto. In Proceedings of DOOD-89, Kyoto, Japan, 1989Google Scholar
  4. 4.
    N. Aloia, S. Barneva, and F. Rabitti. Supporting Physical Independence in an Object Database Server. In Proceedings of ECOOP-92, 1992Google Scholar
  5. 5.
    P. Zezula and F. Rabitti. Object Store with Navigation Accelerator. In Information Systems Vol. 18, No. 7, Springer-Verlag, 1993Google Scholar
  6. 6.
    G. Shaw and S. Zdonik. An Object-Oriented Query Algebra. In Proceedings of DBPL-89, Salishan Lodge, Oregon, 1989Google Scholar
  7. 7.
    D. D. Sträube and M. T. Özsu. Queries and Query Processing in Object-Oriented Database Systems. In ACM Transactions on Information Systems Vol. 8, No. 4, 1990Google Scholar
  8. 8.
    S. Cluet. Langages et Optimisation de Requêtes pour Systèmes de Gestion de Base de Données Orientés-Objet. Thèse de doctorat présentée à l’Université de Paris-Sud — Centre d’Orsay, 1991Google Scholar
  9. 9.
    P. Jenq, D. Woelk, W. Kim, and W. Lee. Query Processing in Distributed ORION. In Proceedings of EDBT, Venice, Italy, 1990Google Scholar
  10. 10.
    A. Kemper and G Moerkotte. Advanced Query Processing in Object Bases Using Access Support Relations. In Proceeedings of VLDB-90, Brisbane, Australia, 1990Google Scholar
  11. 11.
    R. Lanzelotte, P. Valduriez, M. Ziane, and J. Cheiney. Optimization of Nonrecursive Queries in OODBs. In Proceedings of DOOD-91, 1991Google Scholar
  12. 12.
    R. Lanzelotte and P. Valduriez. Extending the Search Strategy in a Query Optimizer. In Proceedings of VLDB-91, Barcelona, Spain, 1991Google Scholar
  13. 13.
    A. Swami. Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques. In Proceedings of ACM-SIGMOD-89, 1989Google Scholar
  14. 14.
    C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1982Google Scholar
  15. 15.
    P. Selinger, M. Astrahan, D. Chamberlin, R. Lorie, and T. Price. Access Path Selection in a Relational Database Management System. In Proceedings of ACM-SIGMOD-79, 1979Google Scholar
  16. 16.
    Y. Ioannidis and Y. Cha Kang. Left-Deep vs. Bushy Trees: an Analysis of Strategy Spaces and its Implications for Query Optimization. In Proceedings of ACM-SIGMOD-91, 1991Google Scholar
  17. 17.
    R. Lanzelotte, P. Valduriez, and M. Ziane. On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces. In Proceedings of VLDB-93, Dublin, Ireland, 1993Google Scholar

Copyright information

© British Computer Society 1995

Authors and Affiliations

  • Fausto Rabitti
    • 1
  • Leonardo Benedetti
    • 1
  • Federico Demi
    • 1
  1. 1.IEI-CNRPisaItaly

Personalised recommendations