Skip to main content
SpringerLink
Log in
Book cover

International Conference on Model and Data Engineering

MEDI 2019: Model and Data Engineering pp 20–31Cite as

Fully Generic Queries: Open Problems and Some Partial Answers

  • Conference paper
  • First Online:

  • 745 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 11815))

Abstract

The class of fully generic queries on complex objects was introduced by Beeri, Milo and Ta-Shma in 1997. Such queries are still relevant as they capture the class of manipulations on nested big data, where output can be generated without a need for looking in detail at, or comparing, the atomic data elements. Unfortunately, the class of fully generic queries is rather poorly understood. We review the big open questions and formulate some partial answers.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Madelaine [22] has given a complete overview of the classes of morphisms corresponding to classes of queries expressible in different fragments of first-order logic, formed by the possible combinations of allowed features among existential quantification, universal quantification, conjunction, disjunction, negation, and equality.

  2. 2.

    A comparable result was shown by Ta-Shma [9, Claim 3.4], [24, Proposition 4.2.4].

  3. 3.

    Here, an automorphism of A is a permutation f of the atoms occurring in A such that \(f(A)=A\).

References

  1. Abiteboul, S., Beeri, C.: On the power of languages for the manipulation of complex objects. VLDB J. 4(4), 727–794 (1995)

    Article  Google Scholar 

  2. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)

    MATH  Google Scholar 

  3. Abiteboul, S., Vianu, V.: Computing with first-order logic. J. Comput. Syst. Sci. 50(2), 309–335 (1995)

    Article  MathSciNet  Google Scholar 

  4. Afrati, F., Ullman, J.: Optimizing multiway joins in a map-reduce environment. IEEE Trans. Knowl. Data Eng. 23(9), 1282–1298 (2011)

    Article  Google Scholar 

  5. 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 

  6. Arenas, M., Diaz, G.: The exact complexity of the first-order logic definability problem. ACM Trans. Database Syst. 41(2), 13:1–13:14 (2016)

    Article  MathSciNet  Google Scholar 

  7. Armbrust, M., Xin, R., et al.: Spark SQL: relational data processing in Spark. In: Proceedings 2015 International Conference on Management of Data, pp. 1383–1394. ACM (2015)

    Google Scholar 

  8. Bancilhon, F.: On the completeness of query languages for relational data bases. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, pp. 112–123. Springer, Heidelberg (1978). https://doi.org/10.1007/3-540-08921-7_60

    Chapter  Google Scholar 

  9. Beeri, C., Milo, T., Ta-Shma, P.: Towards a language for the fully generic queries. In: Cluet, S., Hull, R. (eds.) DBPL 1997. LNCS, vol. 1369, pp. 239–259. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-64823-2_14

    Chapter  Google Scholar 

  10. Blass, A., Gurevich, Y., Shelah, S.: Choiceless polynomial time. Ann. Pure Appl. Logic 100, 141–187 (1999)

    Article  MathSciNet  Google Scholar 

  11. Botoeva, E., Calvanese, D., Cogres, B., Xiao, G.: Expressivity and complexity of MongoDB queries. In: Kimelfeld, B., Amsterdamer, Y. (eds.) Proceedings 21st International Conference on Database Theory. LIPIcs, vol. 98, pp. 9:1–9:23. Schloss Dagstuhl-Leibniz Center for Informatics (2018)

    Google Scholar 

  12. Buneman, P., Cheney, J., Vansummeren, S.: On the expressiveness of implicit provenance in query and update languages. ACM Trans. Database Syst. 33(4), 28:1–28:47 (2008)

    Article  Google Scholar 

  13. Buneman, P., Naqvi, S., Tannen, V., Wong, L.: Principles of programming with complex objects and collection types. Theor. Comput. Sci. 149(1), 3–48 (1995)

    Article  MathSciNet  Google Scholar 

  14. Van den Bussche, J., Van Gucht, D., Vansummeren, S.: Well-definedness and semantic type checking for the nested relational calculus. Theor. Comput. Sci. 371(3), 183–199 (2007)

    Article  MathSciNet  Google Scholar 

  15. Chandra, A.: Programming primitives for database languages. In: Conference Record, 8th ACM Symposium on Principles of Programming Languages, pp. 50–62 (1981)

    Google Scholar 

  16. Chandra, A., Harel, D.: Computable queries for relational data bases. J. Comput. Syst. Sci. 21(2), 156–178 (1980)

    Article  MathSciNet  Google Scholar 

  17. Garcia-Molina, H., Ullman, J., Widom, J.: Database Systems: The Complete Book. Prentice Hall, Upper Saddle River (2009)

    Google Scholar 

  18. Grädel, E., Grohe, M.: Is polynomial time choiceless? In: Beklemishev, L.D., Blass, A., Dershowitz, N., Finkbeiner, B., Schulte, W. (eds.) Fields of Logic and Computation II. LNCS, vol. 9300, pp. 193–209. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23534-9_11

    Chapter  Google Scholar 

  19. Hull, R., Su, J.: Algebraic and calculus query languages for recursively typed complex objects. J. Comput. Syst. Sci. 47(1), 121–156 (1993)

    Article  MathSciNet  Google Scholar 

  20. Hull, R., Yap, C.: The format model, a theory of database organization. J. ACM 31(3), 518–537 (1984)

    Article  MathSciNet  Google Scholar 

  21. Kuper, G., Vardi, M.: The logical data model. ACM Trans. Database Syst. 18(3), 379–413 (1993)

    Article  MathSciNet  Google Scholar 

  22. Madelaine, F.: Mémoire d’habilitation à diriger des recherches, Université Blaise Pascal, Clermond-Ferrand (2012). https://tel.archives-ouvertes.fr/tel-01096078

  23. Paredaens, J.: On the expressive power of the relational algebra. Inf. Process. Lett. 7(2), 107–111 (1978)

    Article  MathSciNet  Google Scholar 

  24. Ta-Shma, P.: Genericity in Database Query Languages. Ph.D. thesis, Hebrew University (1997)

    Google Scholar 

  25. Tarski, A.: What are logical notions? History and philosophy of logic 7, 143–154 (1986). Edited by J. Corcoran

    Article  MathSciNet  Google Scholar 

  26. Zaharia, M., et al.: Spark: cluster computing with working sets. In: Proceedings 2nd USENIX Workshop on Hot Topics in Cloud Computing (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hasselt University, Hasselt, Belgium

    Dimitri Surinx, Jan Van den Bussche & Jonni Virtema

Authors
  1. Dimitri Surinx
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Van den Bussche
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jonni Virtema
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jan Van den Bussche .

Editor information

Editors and Affiliations

  1. UIUC Institute, Zhejiang University, Zhejiang, China

    Klaus-Dieter Schewe

  2. INPT-ENSEEIHT/IRIT, Toulouse, France

    Neeraj Kumar Singh

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Surinx, D., Van den Bussche, J., Virtema, J. (2019). Fully Generic Queries: Open Problems and Some Partial Answers. In: Schewe, KD., Singh, N. (eds) Model and Data Engineering. MEDI 2019. Lecture Notes in Computer Science(), vol 11815. Springer, Cham. https://doi.org/10.1007/978-3-030-32065-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-32065-2_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-32064-5

  • Online ISBN: 978-3-030-32065-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation