Skip to main content
SpringerLink
Log in

Semi-automatic extraction of hyponymies and overlappings from heterogeneous database schemes

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2000)

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

Included in the following conference series:

Abstract

This paper tackles the problem of semi-automatically extracting hyponymy and overlapping properties between entities belonging to pre-existing database schemes. The algorithm we propose consists of two phases: the first one derives basic hyponymies and overlappings starting from a particular scenario; the second one takes in input basic properties derived by the first phase and extracts further, more general hyponymies. In addition the paper shows some applications of derived hyponymies and overlappings.

This author is also supported by ISI-CNR

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. C. Batini and M. Lenzerini. A methodology for data schema integration in the entity relationship model. IEEE Transactions on Software Engineering, 10(6):650–664, 1984.

    Article  Google Scholar 

  2. M.W. Bright, A.R. Hurson, and S. Pakzad. Automated resolution of semantic heterogeneity in multidatabases. ACM Transactions on Database Systems, 19(2):212–253, 1994.

    Article  Google Scholar 

  3. S. Castano and V. De Antonellis. Semantic dictionary design for database interoperability. In Proc. of International Conference on Data Engineering (ICDE’97), pages 43–54, Birmingham, United Kingdom, 1997. IEEE Computer Society.

    Google Scholar 

  4. S. Chaudhuri and U. Dayal. An overview of data warehousing and olap technology. ACM SIGMOD RECORD, 26(l):65–74, 1997.

    Article  Google Scholar 

  5. P. Fankhauser, M. Kracker, and E.J. Neuhold. Semantic vs. structural resemblance of classes. ACM SIGMOD RECORD, 20(4):59–63, 1991.

    Article  Google Scholar 

  6. Z. Galil. Efficient algorithms for finding maximum matching in graphs. ACM Computing Surveys, 18:23–38, 1986.

    Article  MathSciNet  Google Scholar 

  7. W. Gotthard, P.C. Lockermann, and A. Neufeld. System-guided view integration for object-oriented databases. IEEE Transactions on Knowledge and Data Engineering, 4(1):1–22, 1992.

    Article  Google Scholar 

  8. A. Levy, A. Rajaraman, and J. Ordille. Querying heterogeneous information sources using source descriptions. In Proc. of 22th International Conference on Very Large Data Bases (VLDB’96), pages 251–262, Bombay, India, 1996. Morgan Kaufmann.

    Google Scholar 

  9. M. V. Mannino and W. Effelsberg. Matching techniques in global schema design. In Proc. of International Conference on Data Engineering (ICDE’84), pages 418–425, Los Angeles, California, USA, 1984. IEEE Computer Society.

    Google Scholar 

  10. E. Metais, J.N. Meunier, and G. Levreau. Database schema design: A perspective from natural language techniques to validation and view integration. In Proc. of International Conference on Conceptual Modeling (ER’93), pages 190–205, Dallas (Texas), USA, 1993. Lecture Notes in Computer Science, Springer-Verlag.

    Google Scholar 

  11. L. Palopoli, L. Pontieri, G. Terracina, and D. Ursino. Intensional and extensional integration and abstraction of heterogeneous databases. Data & Knowledge Engineering, Forthcoming.

    Google Scholar 

  12. L. Palopoli, D. Saccà, G. Terracina, and D. Ursino. A unified graph-based framework for deriving nominal interscheme properties, type conflicts and object cluster similarities. In Proc. of Fourth IFCIS Conference on Cooperative Information Systems (CoopIS’99), pages 34–45, Edinburgh, United Kingdom, 1999. IEEE Computer Society.

    Google Scholar 

  13. L. Palopoli, D. Saccà, and D. Ursino. An automatic technique for detecting type conflicts in database schemes. In Proc. of ACM Conference on Information and Knowledge Management (CIKM’98), pages 306–313, Bethesda, Maryland, USA, 1998. ACM Press.

    Google Scholar 

  14. L. Palopoli, D. Saccà, and D. Ursino. Semi-automatic techniques for deriving interscheme properties from database schemes. Data & Knowledge Engineering, 30(4):239–273, 1999.

    Article  Google Scholar 

  15. S. Spaccapietra and C. Parent. View integration: A step forward in solving structural conflicts. IEEE Transactions on Knowledge and Data Engineering, 6(2):258–274, 1994.

    Article  Google Scholar 

  16. J.D. Ullman. Information integration using logical views. In Proc. of International Conference on Database Theory (IGDT’97), pages 19–40, Delphi, Greece, 1997. Lecture Notes in Computer Science, Springer-Verlag.

    Google Scholar 

  17. D. Ursino. Deriving type conflicts and object cluster similarities in database schemes by an automatic and semantic approach. In Proc. of Symposium on Advances in Databases and Information Systems (ADBIS’99), pages 46–60, Maribor, Slovenia, 1999. Lecture Notes in Computer Science, Springer-Verlag.

    Chapter  Google Scholar 

  18. J. Widom. Research problems in data warehousing. In Proc. of International Conference on Information and Knowledge Management (CIKM’98), pages 25–30, Baltimore, Maryland, USA, 1995. ACM Press.

    Google Scholar 

  19. G. Wiederhold. Mediators in the architecture of future information systems. IEEE Computer, 25(3):38–49, 1992.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, Via P. Bucci, 87036, Rende (CS), Italy

    Luigi Palopoli, Domenico Saccà, Giorgio Terracina & Domenico Ursino

Authors
  1. Luigi Palopoli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Domenico Saccà
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giorgio Terracina
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Domenico Ursino
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing and Mathematical Sciences, Maritime Greenwich University Campus, 30 Park Row, London, SE10 9LS, UK

    Mohamed Ibrahim

  2. University of Linz, FAW, Altenbergerstr. 69, 4040, Linz, Austria

    Josef Küng

  3. Middlesex University, Bounds Green, London, UK

    Norman Revell

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Palopoli, L., Saccà, D., Terracina, G., Ursino, D. (2000). Semi-automatic extraction of hyponymies and overlappings from heterogeneous database schemes. In: Ibrahim, M., Küng, J., Revell, N. (eds) Database and Expert Systems Applications. DEXA 2000. Lecture Notes in Computer Science, vol 1873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44469-6_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-44469-6_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67978-3

  • Online ISBN: 978-3-540-44469-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation