skip to main content
10.1145/1265530.1265556acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article

Non-linear prefixes in query languages

Published:11 June 2007Publication History

ABSTRACT

In first order logic there are two main extensions to quantification: generalized quantifiers and non-linear prefixes. While generalized quantifiers have been explored from a database perspective, non-linear prefixes have not-most likely because of complexity concerns. In this paper we first illustrate the usefulness of non-linear prefixes in query languages by means of example queries. We then introduce the subject formally, distinguishing between two forms of non-linearity: branching and cumulation. To escape complexity concerns, we focus on monadic quantifiers. In this context, we show that branching does not extend the expressive power of first order logic when it is interpreted over finite models, while cumulation does not extend the expressive power when it is interpreted over bounded models. Branching and cumulation do, however, allow us to formulate some queries in a succinct and elegant manner. When branching and cumulation are interpreted over infinite models, we show that the resulting language can be embedded in an infinitary logic proposed by Libkin. We also discuss non-linear prefixes from an algorithmic point of view.

References

  1. Abiteboul, S., Hull, R. and and Vianu, V. Foundations of Databases, Addison-Wesley, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Badia, A., A Family of Query Languages with Generalized Quantifiers: its Definition, Properties and Expressiveness, Ph.d. thesis, Indiana University, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Badia, A. Safety, Domain Independence and Generalized Quantification, Data and Knowledge Engineering, vol. 38, n. 2, August 2001, pages 147--172, Elsevier Publishers. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Badia, A. and Cao, B. Processing and Optimization of Generalized Quantification Queries, under submission.Google ScholarGoogle Scholar
  5. A. Blass and Y. Gurevich Henkin quantifiers and complete problems, Annals of Pure and Applied Logic, 32(1):1--16, 1986.Google ScholarGoogle ScholarCross RefCross Ref
  6. Barwise, J. On Branching Quantifiers in English, Journal of Philosophical Logic, v. 8, 1979, pages 47--80Google ScholarGoogle Scholar
  7. Barwise, J. and R. Cooper, Generalized Quantifiers and Natural Language, Linguistic and Philosophy, volume 4, 1981.Google ScholarGoogle ScholarCross RefCross Ref
  8. Generalized Quantifiers in Natural Language, van Benthem, J. and ter Meulen, A., eds. Foris Publications, 1985.Google ScholarGoogle Scholar
  9. Dawar, A. and Hella, L., The Expressive Power of Finitely Many Generalized Quantifiers, in Proceedings of the 9th IEEE Symposium on Logic In Computer Science, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  10. Enderton, H. Finite Partially-Ordered Quantifiers, in Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, vol. 16 (1970), pp. 393--397.Google ScholarGoogle ScholarCross RefCross Ref
  11. Enderton, H. A Mathematical Introduction to Logic, Academic Press, 1972.Google ScholarGoogle Scholar
  12. Grumbach, S. and Tollu, C., Query Languages with Counters, in Proceedings of the International Conference on Database Theory, Lecture Notes in Computer Science, number 333, Springer-Verlag, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Gyssens, M., Van Gucht, D. and Badia, A., Query Languages with Generalized Quantifiers, in Application of Logic Databases, Ramakrishnan, Ragu ed., Kluwer Academic Publishers, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Hella, L., Definability Hierarchies of Generalized Quantifiers, Annals of Pure and Applied Logic, volume 43, 1989.Google ScholarGoogle ScholarCross RefCross Ref
  15. Hella, L., Luosto, K. and Vaananen, J. The Hierarchy Theorem for Generalized Quantifiers, J. Symbolic Logic, 61(3), p. 802--817, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  16. Hella, L., Libkin, L., Nurmonen, J. and Wong, Limsoon Logics with Aggregate Operators, Journal of the ACM, 48(4), 2001, pages 880--907. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Leon Henkin, Some Remarks on Infinitely Long Formulas, in Infinitistic Methods, Warsaw, 1959, pp. 167--183.Google ScholarGoogle Scholar
  18. Herre, L., Krynicki, M., Pinus, A. and Vaananen, J. The Hartig Quantifier: A Survey, The Journal of Symbolic Logic, 56(4), 1991, pages 1153--1183. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Hintikka, J. Quantifiers vs. Quantification Theory, Linguistic Inquiry, 5(2), 1974, pages 153--177.Google ScholarGoogle Scholar
  20. Hsu, P. Y. and Parker, D. S., Improving SQL with Generalized Quantifiers, in Proceedings of the Tenth International Conference on Data Engineering, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Keenan, E. Beyond the Frege Boundary, Linguistics and Philosophy, v. 15, 1992.Google ScholarGoogle Scholar
  22. Keenan, E. Natural Language, Sortal Reducibility and Generalized Quantifiers, Journal of Symbolic Logic, v. 58, n. 1, 1993, pages 314--325.Google ScholarGoogle Scholar
  23. Keenan, E. and Moss, L., Generalized Quantifiers and the Expressive Power of Natural Language, in {8}.Google ScholarGoogle Scholar
  24. Keenan, E. and Westerstahl, D., Generalized Quantifiers in Linguistics and Logic, in {8}.Google ScholarGoogle Scholar
  25. Keisler, J. and Walkoe, W. The Diversity of Quantifier Prefixes, Journal of Symbolic Logic, v. 38, pages 79--85, 1973.Google ScholarGoogle Scholar
  26. Kolaitis, P. and Väanänen, J., Generalized Quantifiers and Pebble Games on Finite Structures, Annals of Pure and Applied Logic, Elsevier, v. 74, 1995, pages 23--75.Google ScholarGoogle Scholar
  27. Libkin, L. Expressive Power of SQL, Theoretical Computer Science, 296 (2003), pages 379--404. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Lindstrom, P., First Order Predicate Logic with Generalized Quantifiers, Theoria, volume 32, 1966.Google ScholarGoogle Scholar
  29. Luosto, K. Hierarchies of Monadic Generalized Quantifiers, Journal of Symbolic Logic, 65(3), 2000, pages 1241--1263.Google ScholarGoogle ScholarCross RefCross Ref
  30. Mostowski, A., On a Generalization of Quantifiers, Fundamenta Mathematica, volume 44, 1957.Google ScholarGoogle Scholar
  31. Pirotte, A., High Level Data Base Query Languages, in Logic and Databases, Gallaire and Minker, eds., Plenum Press, 1978, pages 409--436.Google ScholarGoogle Scholar
  32. Quantz, J. how to Fit Generalized Quantifiers into Terminological Logics, Proceedings of the 10th European Conference on Artificial Intelligence, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Rao, S. and Van Gucht, D. and Badia, A., Providing Better Support for a Class of Decision Support Queries, Proceedings of the ACM SIGMOD International Conference on Management n of Data, Montreal, Canada, 1996, pages 217--227. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Ross, K. and Chatziantoniou, D., Groupwise Processing of Relational Queries, in Proceedings of the 23rd VLDB Conference, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Scha, R. Distributive, Collective and Cumulative Quantification, in Truth, Interpretation and Information; selected papers from the 3rd Amsterdam Colloquium, Dordrecht, Holland, 1984, pages 131--158.Google ScholarGoogle Scholar
  36. M. Sevenster, Henkin Quantifiers: Logic, Games, and Computation, The bulletin of the EATCS no 89, pages 136--155, June 2006.Google ScholarGoogle Scholar
  37. Sher, G. Ways of Branching Quantifiers, Linguistics and Philosophy, v. 13, 1990.Google ScholarGoogle Scholar
  38. Spaan, M. Parallel Quantification, in J. van der Does and J. van Eyck (eds.) Generalized Quantifier Theory and Applications, CSLI Lecture Notes, 1993.Google ScholarGoogle Scholar
  39. The TPC-H Benchmark, online at http:nnwww.tpc.org.Google ScholarGoogle Scholar
  40. Ullman, J. D., Principles of Database and Knowledge Base Systems, Computer Science Press, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Vaananen, J. Unary Quantifiers on Finite Models, Journal of Logic, Language and Information, v. 6, 1997, pages 275--304. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Walkoe, W. Finite Partially-Ordered Quantification, Journal of Symbolic Logic, v. 35, n. 4, pages 535--555, 1970.Google ScholarGoogle Scholar
  43. Westerstahl, D., Quantifiers in Formal and Natural Languages, in Handbook of Philosophical Logic, volume IV, Gabbay, D. and Guenther, F., eds., Reidel Publishing Company, 1989.Google ScholarGoogle Scholar
  44. Westerstahl, D. Iterated Quantifiers, in Dynamics, Polarity and Quantification, Kanazawa and Pinon, eds., CSLI, Stanford University, 1994, pages 173--209.Google ScholarGoogle Scholar
  45. Westerstahl, D. Branching Quantifiers and Natural Language, in Garderfons, P. (ed.) Generalized Quantifiers: Linguistic and Logical Approaches, Dordrecht, 1987.Google ScholarGoogle Scholar

Index Terms

  1. Non-linear prefixes in query languages

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      PODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
      June 2007
      328 pages
      ISBN:9781595936851
      DOI:10.1145/1265530

      Copyright © 2007 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 11 June 2007

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate476of1,835submissions,26%
    • Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!