Advertisement

First-Order Definable Counting-Only Queries

  • Jelle Hellings
  • Marc Gyssens
  • Dirk Van Gucht
  • Yuqing Wu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10833)

Abstract

For several practical queries on bags of sets of objects, the answer does not depend on the precise composition of these sets, but only on the number of sets to which each object belongs. This is the case k = 1 for the more general situation where the query answer only depends on the number of sets to which each group of at most k objects belongs. We call such queries k-counting-only. Here, we focus on \(k\)-SyCALC, k-counting-only queries that are first-order definable. As \(k\)-SyCALC is semantically defined, however, it is not surprising that it is already undecidable whether a first-order query is in 1-SyCALC. Therefore, we introduce SimpleCALC-\(k\), a syntactically defined (strict) fragment of \(k\)-SyCALC. It turns out that many practical queries in \(k\)-SyCALC can already be expressed in SimpleCALC-\(k\). We prove that the k-counting-only queries form a non-collapsing hierarchy: for every k, there exist (k+1)-counting-only queries that are not k-counting-only. This result specializes to both SimpleCALC-\(k\) and \(k\)-SyCALC. Finally, we establish a strong dichotomy between 1-SyCALC and SimpleCALC-\(k\) on the one hand and 2-SyCALC on the other hand by showing that satisfiability, validity, query containment, and query equivalence are decidable for the former two languages, but not for the latter one.

References

  1. 1.
    Abiteboul, S., Hull, R., Vianu, V. (eds.): Foundations of Databases: The Logical Level. Addison-Wesley, Reading (1995)Google Scholar
  2. 2.
    Anderson, I.: Combinatorics of Finite Sets. Dover Publications, Mineola (2011)Google Scholar
  3. 3.
    Bachmair, L., Ganzinger, H., Waldmann, U.: Set constraints are the monadic class. In: Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science, pp. 75–83 (1993)Google Scholar
  4. 4.
    Badia, A., Van Gucht, D., Gyssens, M.: Querying with generalized quantifiers. In: Ramakrishnan, R. (ed.) Applications of Logic Databases. SECS, vol. 296, pp. 235–258. Springer, Boston (1995).  https://doi.org/10.1007/978-1-4615-2207-2_11CrossRefGoogle Scholar
  5. 5.
    Bayer, A.E., Smart, J.C., McLaughlin, G.W.: Mapping intellectual structure of a scientific subfield through author cocitations. J. Am. Soc. Inf. Sci. Tech. 41(6), 444–452 (1990)CrossRefGoogle Scholar
  6. 6.
    Calders, T., Goethals, B.: Non-derivable itemset mining. Data Min. Knowl. Discov. 14(1), 171–206 (2007)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Fletcher, G.H.L., Van Den Bussche, J., Van Gucht, D., Vansummeren, S.: Towards a theory of search queries. ACM Trans. Database Syst. 35(4), 28:1–28:33 (2010)CrossRefGoogle Scholar
  8. 8.
    Goethals, B.: Survey on frequent pattern mining. Technical report, University of Helsinki (2003)Google Scholar
  9. 9.
    Grädel, E., Otto, M.: On logics with two variables. Theor. Comput. Sci. 224(1–2), 73–113 (1999)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Grohe, M.: Finite variable logics in descriptive complexity theory. Bull. Symb. Log. 4, 345–398 (1998)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Gyssens, M., Paredaens, J., Van Gucht, D., Wijsen, J., Wu, Y.: An approach towards the study of symmetric queries. Proc. VLDB Endow. 7(1), 25–36 (2013)CrossRefGoogle Scholar
  12. 12.
    Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53–87 (2004)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Kuske, D., Schweikardt, N.: First-order logic with counting. In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, pp. 1–12 (2017)Google Scholar
  14. 14.
    Lewis, H.R.: Complexity results for classes of quantificational formulas. J. Comput. Syst. Sci. 21(3), 317–353 (1980)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004).  https://doi.org/10.1007/978-3-662-07003-1CrossRefzbMATHGoogle Scholar
  16. 16.
    Quine, W.V.: Selected Logic Papers. Harvard University Press, Cambridge (1995)Google Scholar
  17. 17.
    Sayrafi, B., Van Gucht, D.: Differential constraints. In: Proceedings of the 24th Symposium on Principles of Database Systems, pp. 348–357. ACM (2005)Google Scholar
  18. 18.
    Sayrafi, B., Van Gucht, D., Gyssens, M.: Measures in databases and data mining. Technical report TR602, Indiana University (2004). https://www.cs.indiana.edu/cgi-bin/techreports/TRNNN.cgi?trnum=TR602
  19. 19.
    Väänänen, J.: Generalized quantifiers, an introduction. In: Väänänen, J. (ed.) ESSLLI 1997. LNCS, vol. 1754, pp. 1–17. Springer, Heidelberg (1999).  https://doi.org/10.1007/3-540-46583-9_1CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Jelle Hellings
    • 1
  • Marc Gyssens
    • 1
  • Dirk Van Gucht
    • 2
  • Yuqing Wu
    • 3
  1. 1.Hasselt UniversityHasseltBelgium
  2. 2.Indiana UniversityBloomingtonUSA
  3. 3.Pomona CollegeClaremontUSA

Personalised recommendations