Skip to main content

On Referring Expressions in Information Systems Derived from Conceptual Modelling

  • Conference paper
  • First Online:
Conceptual Modeling (ER 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9974))

Included in the following conference series:

Abstract

We apply recent work on referring expression types to the issue of identification in Conceptual Modelling. In particular, we consider how such types yield a separation of concerns in a setting where an Information System based on a conceptual schema is to be mapped to a relational schema plus SQL queries. We start from a simple object-centered representation (as in semantic data models), where naming is not an issue because everything is self-identified (possibly using surrogates). We then allow the analyst to attach to every class a preferred “referring expression type”, and to specify uniqueness constraints in the form of generalized functional dependencies. We show (1) how a number of well-formedness conditions concerning an assignment of referring expressions can be efficiently diagnosed, and (2) how the above types attached to classes allow a concrete relational schema and SQL queries over it to be derived from a combination of the conceptual schema and queries over it.

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

Access this chapter

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

Institutional subscriptions

Notes

  1. 1.

    The outline is followed by a sequence of examples that illustrate intuitively the entire process. The remainder of the paper is a somewhat more formal development of the ideas.

  2. 2.

    This and other features of \({\mathcal{C}}\) were already available in Taxis [6] and GEM [9].

  3. 3.

    We explain the correspondence to a \({\mathcal{C}}_{{{\mathrm{AR}}}}\) schema in the next section.

  4. 4.

    To adhere to SQL’99 syntax, a formulation using a general assertion would be needed in most cases. For formal definitions of constraints, please see [2].

  5. 5.

    Allowing guards to have more than one table name is a straightforward extension.

  6. 6.

    Other options for both \(\mathop {\mathsf {Nm}}\nolimits \) and \(\mathop {\mathsf{Rep}}\nolimits \) are clearly possible, e.g., based on introducing variant record types.

  7. 7.

    We assume a non-null default value exists for each concrete domain.

  8. 8.

    We emphasize that such ideas have been present in database semantic models since Taxis [6] and GEM [9].

References

  1. Borgida, A., Toman, D., Weddell, G.: On referring expressions in query answering over first order knowledge bases. In: International Conference on Principles of Knowledge Representation and Reasoning, pp. 319–328 (2016)

    Google Scholar 

  2. Borgida, A., Toman, D., Weddell, G.: On Referring Expressions in Information Systems derived from Conceptual Modelling. Technical report CS-2016-03, Cheriton School of Computer Science, University of Waterloo (2016)

    Google Scholar 

  3. Guizzardi, G., Wagner, G., Guarino, N., van Sinderen, M.: An ontologically well-founded profile for UML conceptual models. Adv. Inf. Syst. Eng. CAiSE 2004, 112–126 (2004)

    Google Scholar 

  4. Halpin, T.A.: Modeling of linguistic reference schemes. Int. J. Inf. Syst. Model. Design 6(4), 1–23 (2015)

    Article  Google Scholar 

  5. Hull, R., King, R.: Semantic database modeling: survey, applications, and research issues. ACM Comput. Surv. 19(3), 201–260 (1987)

    Article  Google Scholar 

  6. Mylopoulos, J., Bernstein, P.A., Wong, H.K.T.: A language facility for designing database-intensive applications. ACM Trans. Database Syst. 5(2), 185–207 (1980)

    Article  Google Scholar 

  7. Toman, D., Weddell, G.: On Attributes, roles, and dependencies in description logics and the Ackermann case of the decision problem. In: Description Logics 2001, CEUR-WS, vol. 49, pp. 76–85 (2001)

    Google Scholar 

  8. Toman, D., Weddell, G.E.: On adding inverse features to the description logic \({\cal CFD}^{\forall }_{ \text{nc}}\). In: Pacific Rim International Conference on Artificial Intelligence, PRICAI 2014, pp. 587–599 (2014)

    Google Scholar 

  9. Zaniolo, C.: The database language GEM. In: ACM SIGMOD International Conference on Management of Data, pp. 207–218 (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Toman .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Borgida, A., Toman, D., Weddell, G. (2016). On Referring Expressions in Information Systems Derived from Conceptual Modelling. In: Comyn-Wattiau, I., Tanaka, K., Song, IY., Yamamoto, S., Saeki, M. (eds) Conceptual Modeling. ER 2016. Lecture Notes in Computer Science(), vol 9974. Springer, Cham. https://doi.org/10.1007/978-3-319-46397-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46397-1_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46396-4

  • Online ISBN: 978-3-319-46397-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics