Fields of Logic and Computation pp 49-60

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6300)

| Cite as

Database Theory, Yuri, and Me

  • Jan Van den Bussche

Abstract

Yuri Gurevich made many varied and deep contributions to logic for computer science. Logic provides also the theoretical foundation of database systems. Hence, it is almost unavoidable that Gurevich made some great contributions to database theory. We discuss some of these contributions, and, along the way, present some personal anecdotes connected to Yuri and the author. We also describe the honorary doctorate awarded to Gurevich by Hasselt University (then called Limburgs Universitair Centrum) in 1998.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)MATHGoogle Scholar
  2. 2.
    Abiteboul, S., Vianu, V.: Generic computation and its complexity. In: Proceedings 23rd ACM Symposium on the Theory of Computing, pp. 209–219 (1991)Google Scholar
  3. 3.
    Aho, A., Ullman, J.: Universality of data retrieval languages. In: Conference Record, 6th ACM Symposium on Principles of Programming Languages, pp. 110–120 (1979)Google Scholar
  4. 4.
    Ajtai, M., Gurevich, Y.: Datalog vs first-order logic. In: Proceedings 30th IEEE Symposium on Foundations of Computer Science, pp. 142–147 (1989)Google Scholar
  5. 5.
    Ajtai, M., Gurevich, Y.: Datalog vs first-order logic. J. Comput. Syst. Sci. 49(3), 562–588 (1994)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Blass, A., Gurevich, Y., Van den Bussche, J.: Abstract state machines and computationally complete query languages (extended abstract). In: Gurevich, Y., Kutter, P.W., Odersky, M., Thiele, L. (eds.) ASM 2000. LNCS, vol. 1912, pp. 22–33. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  7. 7.
    Blass, A., Gurevich, Y., Van den Bussche, J.: Abstract state machines and computationally complete query languages. Information and Computation 174(1), 20–36 (2002)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Blass, A., Gurevich, Y., Shelah, S.: Choiceless polynomial time. Annals of Pure and Applied Logic 100, 141–187 (1999)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Blass, A., Gurevich, Y., Shelah, S.: On polynomial time computation over unordered structures. Journal of Symbolic Logic 67(3), 1093–1125 (2002)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Van den Bussche, J., Van Gucht, D., Andries, M., Gyssens, M.: On the completeness of object-creating database transformation languages. J. ACM 44(2), 272–319 (1997)MathSciNetMATHGoogle Scholar
  11. 11.
    Chandra, A., Harel, D.: Computable queries for relational data bases. In: Proceedings 11th ACM Symposium in Theory of Computing, pp. 309–318 (1979)Google Scholar
  12. 12.
    Chandra, A., Harel, D.: Computable queries for relational data bases. J. Comput. Syst. Sci. 21(2), 156–178 (1980)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Chandra, A., Harel, D.: Structure and complexity of relational queries. In: Proceedings 21st IEEE Symposium on Foundations of Computer Science, pp. 333–347 (1980)Google Scholar
  14. 14.
    Chandra, A., Harel, D.: Structure and complexity of relational queries. J. Comput. Syst. Sci. 25, 99–128 (1982)CrossRefMATHGoogle Scholar
  15. 15.
    Dawar, A.: On the descriptive complexity of linear algebra. In: Hodges, W., de Queiroz, R. (eds.) Logic, Language, Information and Computation. LNCS (LNAI), vol. 5110, pp. 17–25. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  16. 16.
    Dawar, A., Richerby, D., Rossman, B.: Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. Annals of Pure and Applied Logic 152(1-3), 31–50 (2008)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Gaifman, H., Vardi, M.: A simple proof that connectivity is not first-order definable. Bulletin of the EATCS 26, 43–45 (1985)Google Scholar
  18. 18.
    Grädel, E., Gurevich, Y.: Metafinite model theory. Information and Computation 140(1), 26–81 (1998)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Grohe, M.: The quest for a logic capturing PTIME. In: Proceedings 23rd Annual IEEE Symposium on Logic in Computer Science, pp. 267–271 (2008)Google Scholar
  20. 20.
    Grohe, M., Gurevich, Y., Leinders, D., Schweikardt, N., Tyszkiewicz, J., Van den Bussche, J.: Database query processing using finite cursor machines. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 284–298. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  21. 21.
    Grohe, M., Gurevich, Y., Leinders, D., Schweikardt, N., Tyszkiewicz, J., Van den Bussche, J.: Database query processing using finite cursor machines. Theory of Computing Systems 44(4), 533–560 (2009)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Gurevich, Y.: The word problem for some classes of semigroups (russian). Algebra and Logic 5(2), 25–35 (1966)Google Scholar
  23. 23.
    Gurevich, Y.: Toward logic tailored for computational complexity. In: Richter, M., et al. (eds.) Computation and Proof Theory. Lecture Notes in Mathematics, vol. 1104, pp. 175–216. Springer, Heidelberg (1998)Google Scholar
  24. 24.
    Gurevich, Y.: Logic and the challenge of computer science. In: Börger, E. (ed.) Current Trends in Theoretical Computer Science, pp. 1–57. Computer Science Press, Rockville (1988)Google Scholar
  25. 25.
    Gurevich, Y.: Evolving algebra 1993: Lipari guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. Oxford University Press, Oxford (1995)Google Scholar
  26. 26.
    Gurevich, Y., Leinders, D., Van den Bussche, J.: A theory of stream queries. In: Arenas, M., Schwartzbach, M.I. (eds.) DBPL 2007. LNCS, vol. 4797, pp. 153–168. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  27. 27.
    Gurevich, Y., Lewis, H.: The inference problem for template dependencies. In: Proceedings 1st ACM Symposium on Principles of Database Systems, pp. 221–229 (1982)Google Scholar
  28. 28.
    Gurevich, Y., Lewis, H.: The inference problem for template dependencies. Information and Control 55(1-3), 69–79 (1982)MathSciNetCrossRefMATHGoogle Scholar
  29. 29.
    Gurevich, Y., Lewis, H.: The word problem for cancellation semigroups with zero. Journal of Symbolic Logic 49(1), 184–191 (1984)MathSciNetCrossRefMATHGoogle Scholar
  30. 30.
    Immerman, N.: Relational queries computable in polynomial time. In: Proceedings 14th ACM Symposium on Theory of Computing, pp. 147–152 (1982)Google Scholar
  31. 31.
    Immerman, N.: Relational queries computable in polynomial time. Information and Control 68, 86–104 (1986)MathSciNetCrossRefMATHGoogle Scholar
  32. 32.
    Kolaitis, P.: Languages for polynomial-time queries: An ongoing quest. In: Gottlob, G., Vardi, M. (eds.) ICDT 1995. LNCS, vol. 893, pp. 38–39. Springer, Heidelberg (1995)Google Scholar
  33. 33.
    Kuper, G., Libkin, L., Paredaens, J. (eds.): Constraint Databases. Springer, Heidelberg (2000)MATHGoogle Scholar
  34. 34.
    Tarski, A.: What are logical notions? In: Corcoran, J. (ed.) History and Philosophy of Logic, vol. 7, pp. 143–154 (1986)Google Scholar
  35. 35.
    Vardi, M.: The complexity of relational query languages. In: Proceedings 14th ACM Symposium on the Theory of Computing, pp. 137–146 (1982)Google Scholar
  36. 36.
    Vardi, M.: The implication and finite implication problems for typed template dependencies. In: Proceedings 1st ACM Symposium on Principles of Database Systems, pp. 230–238 (1982)Google Scholar
  37. 37.
    Vardi, M.: The implication and finite implication problems for typed template dependencies. J. Comput. Syst. Sci. 28, 3–28 (1984)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jan Van den Bussche
    • 1
  1. 1.Hasselt University and transnational University of LimburgDiepenbeekBelgium

Personalised recommendations