CONDITIONS FOR INTEROPERABILITY

Nick Rossiter, Michael Heather

Abstract

Interoperability for information systems remains a challenge both at the semantic and organisational levels. The original three-level architecture for local databases needs to be replaced by a categorical four-level one based on concepts, constructions, schema types and data together with the mappings between them. Such an architecture provides natural closure as further levels are superfluous even in a global environment. The architecture is traversed by means of the Godement calculus: arrows may be composed at any level as well as across levles. The necessary and sufficient conditions for interoperability are satisfied by composable (formal) diagrams both for intension and extension in categories that are cartesian closed and locally cartesian closed. Methods like partial categories and sketches in schema design can benefit from Freyd’s punctured diagrams to identify precisely type-forcing natural transformations. Closure is better achieved in standard full categories. Global interoperability of extension can be achieved through semantic annotation but only if applied at run time.

References

  1. Barr, M. and Wells, C. (1999).
  2. Les Publications Centre de Johnstone, P. (2002). Sketches of an Elephant, A Topos Theory Compendium, Oxford Logic Guides 43. Clarendon, Oxford.
  3. Kelly, G. and Street, R. (1974). Review on the elements of 2-categories,. Proceedings Sydney Category Theory Seminar 1972-73, Lecture Notes in Mathematics, Springer-Verlag, 420:75-103.
  4. Lane, S. M. and Moerdijk, I. (1991). Sheaves in Geometry and Logic. Springer-Verlag.
  5. Lellahi, S. and Spyratos, N. (1990). Towards a categorial data model supporting structured objects and inheritance. East/West Database Workshop, pages 86-105.
  6. Rossiter, B. and Heather, M. (2004). Data structures in natural computing: Databases as weak or strong anticipatory systems. CASYS'03, Sixth International Conference on Computing Anticipatory Systems, Liège, Belgium, AIP Conference Proceedings, 718:392-405.
  7. Rossiter, N. (2003). From classical to quantum databases with applied pullbacks. 'th Meeting Peripatetic Seminar on Sheaves and Logic, Institut de Recherche Mathématique Avancée,Strasbourg University 15-16 February.
  8. Rossiter, N. and Heather, M. (2003). Four-level architecture for closure in interoperability. EFIS2003, Fifth International Workshop on Engineering Federated Information Systems, Coventry, UK, 17-18 July, pages 83-88.
  9. Simmons, H. (1989). Lecture notes on category theory. Logic in IT Initiative, SERC.
  10. Soo, V., Lee, C., Li, C., Chen, S., and Chen, C. (2003). Automated semantic annotation and retrieval based on sharable ontology and case-based learning techniques. Int Conf Digital Libraries Archive, pages 61-72.
  11. Tsichritzis, D. (1978). Ansi/x3/sparc dbms framework 1978, report of the study group on database management systems. Information Systems, 3.
Download


Paper Citation


in Harvard Style

Rossiter N. and Heather M. (2005). CONDITIONS FOR INTEROPERABILITY . In Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 972-8865-19-8, pages 92-99. DOI: 10.5220/0002530200920099


in Bibtex Style

@conference{iceis05,
author={Nick Rossiter and Michael Heather},
title={CONDITIONS FOR INTEROPERABILITY},
booktitle={Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2005},
pages={92-99},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002530200920099},
isbn={972-8865-19-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - CONDITIONS FOR INTEROPERABILITY
SN - 972-8865-19-8
AU - Rossiter N.
AU - Heather M.
PY - 2005
SP - 92
EP - 99
DO - 10.5220/0002530200920099