Skip to main content
SpringerLink
Log in

A Model Theory for Generic Schema Management

  • Conference paper
  • First Online:
Database Programming Languages (DBPL 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2397))

Included in the following conference series:

Abstract

The core of a model theory for generic schema management is developed. This theory has two distinctive features: it applies to a variety of categories of schemas, and it applies to transformations of both the schema structure and its integrity constraints. A subtle problem of schema integration is considered in its general form, not bound to any particular category of schemas. The proposed solution, as well as the overall theory, is based entirely on schema morphisms that carry both structural and semantic properties. Duality results that apply to the schema and the data levels are established. These results lead to the main contribution of this paper: a formal schema and data management framework for generic schema management. Implications of this theory are established that apply to integrity problems in schema integration. The theory is illustrated by a particular category of schemas with object-oriented features along with typical database integrity constraints.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alagić, S.: Semantics of temporal classes, Information and Computation 163, pp. 60–102, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  2. Alagić, S.: Constrained matching is type safe, Proc. of the Sixth Int. Workshop on Database Programming Languages, LNCS 1369, Springer-Verlag, pp. 78–96, 1998.

    Google Scholar 

  3. Alagić, S. and M. Alagić, Order-sorted model theory for temporal executable specifications, Theoretical Computer Science 179, pp. 273–299, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  4. Bernstein, P. A., A. Halevy, R. A. Pottinger: A vision for management of complex models, A CM SIGMOD Record 29(4), pp. 54–63, 2000.

    Google Scholar 

  5. Bernstein, P.A. and E. Rahm: Data warehouse scenarios for model management, ER 2000, LNCS 1920, Springer-Verlag, pp. 1–15.

    Google Scholar 

  6. Batini, C., M. Lenzerini, S. B. Navathe: A comparative analysis of methodologies for database schema integration, ACM Comp. Surveys 18(4), pp. 323–364, 1986.

    Article  Google Scholar 

  7. P. Buneman, S. Davidson, W. Fan, C. Hara, W-C. Tan, Reasoning about keys for XML, DBPL 2001 (Databases and Programming Languages), Lecture Notes in Computer Science (this volume).

    Google Scholar 

  8. Buneman, P., S. Davidson, and A. Kosky: Theoretical aspects of schema merging, EDBT 1992, pp. 152–167.

    Google Scholar 

  9. P. Buneman, W. Fan, J. Simeon and S. Weinstein, Constraints for semistructured data and XML, A CM SIGMOD Record 30(1), pp. 47–54, 2001.

    Article  Google Scholar 

  10. Fan, W. and L. Libkin, On XML integrity constraints in the presence of DTDs, PODS 2001, pp. 114–125.

    Google Scholar 

  11. Goguen, J. and R. Burstall, Institutions: Abstract model theory for specification and programming, Journal of the ACM 39(1), pp. 92–146, 1992.

    Article  MathSciNet  Google Scholar 

  12. Goguen, J.: Types as theories, in: G. M. Reed, A. W. Roscoe and R. F. Wachter, Topology and Category Theory in Computer Science, Clarendon Press, Oxford, pp. 357–390, 1991.

    Google Scholar 

  13. Goguen, J. and J. Meseguer, Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations, Theoretical Computer Science 105, pp. 217–273, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  14. Haxthausen, A.E. and F. Nickl: Pushouts of order-sorted algebraic specifications, in M. Wirsing and M. Nivat, eds., Algebraic Methodology and Software Tech. (AMAST 96), LNCS 1101, Springer-Verlag, pp. 132–147, 1996.

    Chapter  Google Scholar 

  15. Hull, R.: Relative information capacity of simple relational database schemata, SIAM Journal of Computing 15(3), pp. 856–886, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  16. Hull, R.: Managing semantic heterogeneity in databases: A theoretical perspective, PODS 1997, 51–61.

    Google Scholar 

  17. Kalinichenko, L.A.: Methods and tools for equivalent data model mapping construction, EDBT 1990, LNCS 416, Springer-Verlag, pp. 92–119.

    Google Scholar 

  18. Liskov, B. and J. M. Wing: A behavioral notion of subtyping, ACM TOPLAS 16, pp. 1811–1841.

    Google Scholar 

  19. Mac Lane, S.: Categories for a Working Mathematician, Springer, 1998.

    Google Scholar 

  20. Madhavan, J., P. A. Bernstein, E. Rahm: Generic schema matching with Cupid, VLDB 2001, pp. 49–58.

    Google Scholar 

  21. Miller, R. J., Y. E. Ioannidis, R. Ramakrishnan, Schema equivalence in heterogeneous systems: Bridging theory and practice, Information Systems 19(1), pp. 3–31, 1994.

    Article  Google Scholar 

  22. Rahm, E. and P.A. Bernstein: On matching schemas automatically. VLDB Journal 10(4), pp. 334–350, 2001.

    Article  MATH  Google Scholar 

  23. Spaccapietra, S., C. Parent, Y. Dupont: Model independent assertions for integration of heterogeneous schemas, VLDB Journal 1, pp. 81–126, 1992.

    Article  Google Scholar 

  24. Spaccapietra, S. and C. Parent: View integration: A step forward in solving structural conflicts, IEEE TKDE 6(2), pp. 258–274, 1994.

    Google Scholar 

  25. W3C: XML Schema, http://www.w3c.org/XML/schema, 2001.

Download references

Author information

Author notes

  1. Suad Alagić

    Present address: Computer Science Department, University of Southern Maine, 96 Falmouth Street, P.O. Box 9300, Portland, ME, 04104-9300

Authors and Affiliations

  1. Microsoft Research, One Microsoft Way, Redmond, WA, 98052-6399

    Suad Alagić & Philip A. Bernstein

Authors
  1. Suad Alagić
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philip A. Bernstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Univesità di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Giorgio Ghelli

  2. Department of Computer Science, Concordia University, 1455 De Maisonneuve Blvd. West, Montréal, Québec, Canada, H3G 1M8

    Gösta Grahne

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alagić, S., Bernstein, P.A. (2002). A Model Theory for Generic Schema Management. In: Ghelli, G., Grahne, G. (eds) Database Programming Languages. DBPL 2001. Lecture Notes in Computer Science, vol 2397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46093-4_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-46093-4_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44080-2

  • Online ISBN: 978-3-540-46093-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation