Skip to main content
SpringerLink
Log in

Using Feature-Based Description Logics to avoid Duplicate Elimination in Object-Relational Query Languages

  • Technical Contribution
  • Published:
KI - Künstliche Intelligenz Aims and scope Submit manuscript

Abstract

A sound inference procedure is presented for removing operations that eliminate duplicates in queries formulated in a bag-algebra. The procedure is shown complete for positive queries over finite databases, and operates by appeal to logical consequence problems for feature-based description logics in which a TBox embeds an object-relational schema. For unions of conjunctive queries in which an embedded schema excludes cover constraints, the procedure runs in PTIME, and in EXPTIME otherwise.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. Thus, arithmetic operations on n denote cardinal arithmetic.

References

  1. Abiteboul S, Hull R, Vianu V (1995) Foundations of databases. Addison-Wesley, Boston

    MATH  Google Scholar 

  2. Calvanese D, De Giacomo G, Lembo D, Lenzerini M, Poggi A, Rodriguez-Muro M, Rosati R, Ruzzi M, Savo DF (2011) The MASTRO system for ontology-based data access. Semant Web 2(1):43–53

    Google Scholar 

  3. Chaudhuri S, Vardi MY (1993) Optimization of real conjunctive queries. In: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp 59–70

  4. DeHaan D, Toman D, Weddell G (2003) Rewriting aggregate queries using description logics. In: International Workshop on Description Logics, CEUR-WS, vol 81, pp 103–112

  5. Ioannidis YE, Ramakrishnan R (1995) Containment of conjunctive queries: beyond relations as sets. ACM Trans Database Syst 19(3):288–324

    Google Scholar 

  6. Khizder V, Toman D, Weddell G (2007) Adding ABoxes to a description logic with uniqueness constraints via path agreements. In: International Workshop on Description Logics, pp 339–346

  7. Khizder VL, Toman D, Weddell G (2000) Reasoning about duplicate elimination with description logic. In: International Conference on Deductive and Object Oriented Databases. DOOD, pp 1017–1032

  8. McIntyre S, Borgida A, Toman D, Weddell G (2019) On limited conjunctions and partial features in parameter-tractable feature logics. AAAI Conf Art Intell AAAI 2019:2995–3002

    Google Scholar 

  9. McIntyre S, Toman D, Weddell G (2019) FunDL—a family of feature-based description logics, with applications in querying structured data sources. In: Description logic, theory combination, and all that—essays dedicated to Franz Baader on the occasion of His 60th Birthday, pp 404–430

  10. Pinto FD, Lembo D, Lenzerini M, Mancini R, Poggi A, Rosati R, Ruzzi M, Savo DF (2013) Optimizing query rewriting in ontology-based data access. In: Joint 2013 EDBT/ICDT Conferences, pp 561–572

  11. St. Jacques J, Toman D, Weddell G (2016) Object-relational queries over \({\cal{CFDI}}_{\text{nc}}\) knowledge bases: OBDA for the SQL-Literate. In: Int. Joint Conf. on Artificial Intelligence (IJCAI), pp 1258–1264

Download references

Author information

Authors and Affiliations

  1. Cheriton School of Computer Science, University of Waterloo, 200 University Ave. W., Waterloo, ON, N2L3G1, Canada

    David Toman & Grant Weddell

Authors
  1. David Toman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grant Weddell
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David Toman.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Toman, D., Weddell, G. Using Feature-Based Description Logics to avoid Duplicate Elimination in Object-Relational Query Languages. Künstl Intell 34, 355–363 (2020). https://doi.org/10.1007/s13218-020-00666-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13218-020-00666-7

Search

Navigation