Skip to main content
Log in

Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

Conjunctive database queries have been extended with a mechanism for object creation to capture important applications such as data exchange, data integration, and ontology-based data access. Object creation generates new object identifiers in the result that do not belong to the set of constants in the source database. The new object identifiers can be also seen as Skolem terms. Hence, object-creating conjunctive queries can also be regarded as restricted second-order tuple-generating dependencies (SO-tgds), considered in the data exchange literature. In this paper, we focus on the class of single-function object-creating conjunctive queries, or sifo CQs for short. The single-function symbol can be used only once in the head of the query. We give a new characterization for oid-equivalence of sifo CQs that is simpler than the one given by Hull and Yoshikawa and places the problem in the complexity class NP. Our characterization is based on Cohen’s equivalence notions for conjunctive queries with multiplicities. We also solve the logical entailment problem for sifo CQs, showing that also this problem belongs to NP. Results by Pichler et al. have shown that logical equivalence for more general classes of SO-tgds is either undecidable or decidable with as yet unknown complexity upper bounds.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Balder ten Cate, Richard L. Halpert & Phokion G. Kolaitis

Notes

  1. http://www.w3.org/TR/rdb-direct-mapping/.

  2. IRIs stand for internationalized resource identifiers and extend the syntax of uniform resource identifiers (URIs) to a much wider repertoire of characters. They naturally embody global identifiers that refer to the same resource on the Web and can be used across different mapping assertions to refer to that resource.

  3. Since constants are atomic data elements, no constant is allowed to be of the form \(f(d_1,\ldots ,d_k)\).

  4. The motivation for MV queries was to model the semantics of positive SQL queries with nested EXISTS subqueries. While queries under standard SQL semantics return multisets of tuples, only the relations mentioned in the top level SQL block contribute to the multiplicities of answers, whereas relations mentioned in the subquery do not.

References

  1. Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2000)

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

    MATH  Google Scholar 

  3. Abiteboul, S., Kanellakis, P.: Object identity as a query language primitive. J. ACM 45(5), 798–842 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Abiteboul, S., Vianu, V.: Procedural languages for database queries and updates. J. Comput. Syst. Sci. 41(2), 181–229 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  5. Abiteboul, S., Vianu, V.: Datalog extensions for database queries and updates. J. Comput. Syst. Sci. 43(1), 62–124 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. Alexe, B., Tan, W.C., Velegrakis, Y.: STBenchmark: towards a benchmark for mapping systems. Proc. VLDB Endow. 1(1), 230–244 (2008)

    Article  Google Scholar 

  7. Arenas, M., Pérez, J., Reutter, J., Riveros, C.: The language of plain SO-TGDS: composition, inversion and structural properties. J. Comput. Syst. Sci. 79(6), 737–1002 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  8. Arocena, P., Glavic, B., Miller, R.: Value invention in data exchange. In: Proceedings of the SIGMOD Conference, pp. 157–168. ACM (2013)

  9. Arocena, P.C., Ciucanu, R., Glavic, B., Miller, R.J.: Gain control over your integration evaluations. Proc. VLDB Endow. 8(12), 1960–1971 (2015)

  10. Van den Bussche, J., Paredaens, J.: The expressive power of complex values in object-based data models. Inf. Comput. 120, 220–236 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. 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)

    Article  MathSciNet  MATH  Google Scholar 

  12. ten Cate, B., Kolaitis, P.: Structural characterizations of schema-mapping languages. Commun. ACM 53(1), 101–110 (2010)

    Article  Google Scholar 

  13. Chandra, A., Merlin, P.: Optimal implementation of conjunctive queries in relational data bases. In: Proceedings of the 9th ACM Symposium on the Theory of Computing, pp. 77–90. ACM (1977)

  14. Cohen, S.: Equivalence of queries that are sensitive to multiplicities. VLDB J. 18, 765–785 (2009)

    Article  Google Scholar 

  15. Cohen, S., Nutt, W., Sagiv, Y.: Containment of aggregate queries. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) Database Theory—ICDT 2003. Lecture Notes in Computer Science, vol. 2572, pp. 111–125. Springer, Berlin (2003)

  16. Fagin, R., Haas, L., M. Hernández, R.M., Popa, L., Velegrakis, Y.: Clio: schema mapping creation and data exchange. In: Borgida, A., Chaudhuri, V., Giorgini, P., Yu, E. (eds.) Conceptual Modeling: Foundations and Applications. Lecture Notes in Computer Science, vol. 5600, pp. 198–236. Springer, Berlin (2009)

  17. Fagin, R., Kolaitis, P., Nash, A., Popa, L.: Towards a theory of schema-mapping optimization. In: Proceedings of the 27th ACM Symposium on Principles of Database Systems, pp. 33–42 (2008)

  18. Fagin, R., Kolaitis, P., Popa, L.: Composing schema mappings: second-order dependencies to the rescue. ACM Trans. Database Syst. 30(4), 994–1055 (2005)

    Article  Google Scholar 

  19. Feinerer, I., Pichler, R., Sallinger, E., Savenkov, V.: On the undecidability of the equivalence of second-order tuple generating dependencies. Inf. Syst. 48, 113–129 (2015)

    Article  Google Scholar 

  20. Friedman, M., Levy, A.Y., Millstein, T.D.: Navigational plans for data integration. In: AAAI/IAAI, pp. 67–73 (1999)

  21. Garcia-Molina, H., Papakonstantinou, Y., Quass, D., Rajaraman, A., Sagiv, Y., Ullman, J., Vassalos, V., Widom, J.: The TSIMMIS approach to mediation: data models and languages. J. Intell. Inf. Syst. 8(2), 117–132 (1997)

    Article  Google Scholar 

  22. Hull, R., Yoshikawa, M.: ILOG: declarative creation and manipulation of object identifiers. In: McLeod, D., Sacks-Davis, R., Schek, H. (eds.) Proceedings of the 16th International Conference on Very Large Data Bases, pp.455–468. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1990)

  23. Hull, R., Yoshikawa, M.: On the equivalence of database restructurings involving object identifiers. In: Proceedings of the 10th ACM Symposium on Principles of Database Systems, pp. 328–340. ACM Press, New York (1991)

  24. Kifer, M., Wu, J.: A logic for programming with complex objects. J. Comput. Syst. Sci. 47(1), 77–120 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  25. Klug, A., Price, R.: Determining view dependencies using tableaux. ACM Trans. Database Syst. 7, 361–380 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  26. Kolaitis, P., Pichler, R., Sallinger, E., Savenkov, V.: Nested dependencies: structure and reasoning. In: Proceedings of the 33rd ACM Symposium on Principles of Database Systems (2014)

  27. Lenzerini, M.: Data integration: A theoretical perspective. In: Proceedings 21st ACM Symposium on Principles of Database Systems, pp. 233–246 (2002)

  28. Levy, A.Y., Rajaraman, A., Ordille, J.J.: Querying heterogeneous information sources using source descriptions. In: Vijayaraman, T., Buchmann, A., Mohan, C., Sarda, N. (eds.) Proceedings of the 22nd International Conference on Very Large Data Bases, pp. 251–262. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1996)

  29. Maier, D.: A logic for objects. In: Workshop on Foundations of Deductive Databases and Logic Programming, pp. 6–26 (1986)

  30. Papakonstantinou, Y., Garcia-Molina, H., Widom, J.: Object exchange across heterogeneous information sources. In: ICDE, pp. 251–260 (1995)

  31. Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Semant. 10, 133–173 (2008)

    MATH  Google Scholar 

  32. Sequeda, J.F., Arenas, M., Miranker, D.P.: On directly mapping relational databases to RDF and OWL. In: International Conference on World Wide Web (WWW), pp. 649–658 (2012). doi:10.1145/2187836.2187924

  33. Ullman, J.D.: Information integration using logical views. Theor. Comput. Sci. 239(2), 189–210 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

We thank the anonymous referees for their careful comments which helped improve the presentation of the paper. The work by Angela Bonifati has been partially supported by the ANR through the grant Datacert: Coq deep specification of security aware data integration (ANR-15-CE39-0009). The work by Werner Nutt has been partially supported by the grant CANDy of the Free University of Bozen-Bolzano.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jan Van den Bussche.

Additional information

Work done while the author Angela Bonifati was affiliated with University of Lille 1 and INRIA Links.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bonifati, A., Nutt, W., Torlone, R. et al. Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries. The VLDB Journal 25, 381–397 (2016). https://doi.org/10.1007/s00778-016-0421-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-016-0421-x

Keywords

Navigation