On the complexity of queries in the logical data model

  • Gabriel M. Kuper
  • Moshe Y. Vardi
Data Models And Query Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 326)

Abstract

We investigate the complexity of query processing in the logical data model (LDM). We use two measures: data complexity, which is complexity with respect to the size of the data, and expression complexity, which is complexity with respect to the size of the expressions denoting the queries. Our investigation shows that while the operations of product and union are essentially first-order operations, the power set operation is inherently a higher-order operation and is exponentially expensive. We define a hierarchy of queries based on the depth of nesting of power set operations and show that this hierarchy corresponds to a natural hierarchy of Turing machines that run in multiply exponential time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4 References

  1. [AH87]
    Abiteboul, S., Hull, R.: IFO, a formal semantic database model. ACM Trans. on Database Systems, Dec. 1987.Google Scholar
  2. [Be62]
    Bennet, J.H.: On Spectra, Ph.D. Dissertation, Princeton University, 1962.Google Scholar
  3. [BK86]
    Bancilhon, F., Khoshafian, S.: A calculus for complex objects. Proc. ACM Symp. on Principles of Database Systems, 1986.Google Scholar
  4. [CH82]
    Chandra, A., Harel, D.: Structure and Complexity of Relational Queries. J. Computer and Systems Sciences 25(1982), pp. 99–128.Google Scholar
  5. [CKS81]
    Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1981), pp. 114–133.CrossRefGoogle Scholar
  6. [Co70]
    Codd, E.F.: A relational model of data for large shared data banks. Comm. ACM 13(1970), pp. 377–387.CrossRefGoogle Scholar
  7. [Co79]
    Codd, E.F.: Extending the database relational model to capture more meaning. ACM Trans. on Database Systems, 4(1979), pp. 397–434.Google Scholar
  8. [FT83]
    Fischer, P.C., Thomas, S.J.: Operators for non-first-normal-form relations. Proc. IEEE Computer Software Applications Conference, 1983, pp. 464–475.Google Scholar
  9. [HM81]
    Hammer, M., McLeod, D.: Database description with SDM: a semantic database model. ACM Trans. on Database Systems, 6(1981), pp. 351–386.Google Scholar
  10. [HS88]
    Hull, R., Su, J.: On the expressive power of database queries with intermediate types. Proc. ACM Symp. on Principles of Database Systems, 1988.Google Scholar
  11. [HU79]
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.Google Scholar
  12. [HY82]
    Hull, R., Yap, C.K.: The format model: a theory of database organization. Proc. ACM Symp. on Principles of Database Systems, 1982.Google Scholar
  13. [Ja82]
    Jacobs, B.E.: On database logic. J. ACM 29(1982), pp. 310–322.Google Scholar
  14. [JS82]
    Jaeschke, B., Schek, H.J.: Remarks on the algebra of non-first-normal-form relations. Proc. ACM Symp. on Principles of Database Systems, 1982.Google Scholar
  15. [Ku85]
    Kuper, G.M.: The logical data model: a new approach to database logic. Ph.D. Dissertation, Stanford University, 1985.Google Scholar
  16. [KV84]
    Kuper, G.M., Vardi, M.Y.: A new approach to database logic. Proc. ACM Symp. on Principles of Database Systems, 1984.Google Scholar
  17. [KV85]
    Kuper, G.M., Vardi, M.Y.: On the expressive power of the logical data model. Proc. SIGMOD, 1985.Google Scholar
  18. [Sh81]
    Shipman, D.: The functional model and the data language DAPLEX. ACM Trans. on Database Systems, 6(1981), pp. 140–173.Google Scholar
  19. [SS77]
    Smith, J.M., Smith, D.C.P.: Database abstractions: aggregation. Comm. ACM 20(1977), pp. 405–413.Google Scholar
  20. [St74]
    Stockmeyer, L.J.: The complexity of decision problems in automata theory and logic. Ph.D. Dissertation, MIT, 1974.Google Scholar
  21. [St76]
    Stockmeyer, L.J.: The polynomial time hierarchy. Theoretical Computer Science 3(1977), pp. 1–22.CrossRefGoogle Scholar
  22. [Va82]
    Vardi, M.Y.: The complexity of relational query language. Proc. ACM Symp. on Theory of Computing, 1982.Google Scholar
  23. [Vo83]
    Volger, H.: Turing machines with bounded alternation. Theoretical Computer Science 23(1983), pp. 333–337.Google Scholar

Copyright information

© Springer-Verlag 1983

Authors and Affiliations

  • Gabriel M. Kuper
    • 1
  • Moshe Y. Vardi
    • 2
  1. 1.IBM Watson Research CenterUSA
  2. 2.IBM Almaden Research CenterSpain

Personalised recommendations