Abstract
In Entity-Relationship (ER) modeling connection traps are a known problems. But the literature does not seem to have provided an adequate treatment of it. Moreover, it seems to be only a special case of a more fundamental problem of whether a piece of information can be represented by a database that is specified by an ER schema. To develop a systematic treatment for this problem, in this paper we suggest adopting a semiotic approach, which enables the separation of topological connections at the syntactic level and semantic connections, and an examination of the inter-relationships between them. Based on this, we propose and describe the notion of ‘classes of a path’ in an ER schema, and then indicate its implications to ER modeling.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Codd, E.F.: A Relational Model of Data for Large Shared Data Banks. Com. of ACM, Vol.13,No.6 (1970), pp.377–387
Date, C.J.: Introduction to Database Syatems. 5th edn. Addison Wesley, Reading (1995)
Cardenas, A.F.: Data Base Management Systems. 2nd edn. Allyn and Bacon, inc. Boston (1985)
ter Bekke, J.H.: Semantic Data Modeling. Prentice Hall. New York (1992)
Howe, D.R.: Data analysis for data base design, Edward Arnold. (1983)
Howe, D.R.: Data analysis for data base design, 2nd edition, Edward Arnold (1989)
Mortimer, A.: Information Structure Design for Databases. Butterworth-Heinemann, Oxford (1993)
Conolly, T.M., et al Connolly, T., Begg, C., and Strachan, A’: Database Systems–A practical approach to design, implementation and management. 2nd edn. Addison-Wesley Publishing Company, Wokingham, England (1999)
Stamper, R.: Organisational semiotics, in Information systems: An emerging discipline? Eds Mingers, J. and Stowell, F. McGraw Hill, London (1997)
Andersen, P. B.: A Theory of Computer Semiotics, Cambridge University Press (1997)
Feng, J.: An Analysis of Some Connection Problems in an EER Schema by using a Set of ‘Info Concepts,’ in Computing and Information Systems, M. Crowe ed, Vol 5,No. 2 (1998) pp. 63–72.
Harel, D.: On visual formalisms. ACM Communications, Vol 31,No 5 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feng, J., Crowe, M. (1999). The Notion of ‘Classes of a Path’ in ER Schemas. In: Eder, J., Rozman, I., Welzer, T. (eds) Advances in Databases and Information Systems. ADBIS 1999. Lecture Notes in Computer Science, vol 1691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48252-0_17
Download citation
DOI: https://doi.org/10.1007/3-540-48252-0_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66485-7
Online ISBN: 978-3-540-48252-9
eBook Packages: Springer Book Archive