Dealing with Semantic Heterogeneity During Data Integration

Kedad, Zoubida; Métais, Elisabeth

doi:10.1007/3-540-47866-3_22

Cited by 21 publications

(8 citation statements)

References 17 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the database area, Embley et al (1999) have created ontologies for understanding web-based obituaries. Kedad and Metais (1999) propose to manage semantic heterogeneity by the use of a linguistic dictionary. propose that meta-level knowledge is needed to enable ontologies to evolve and subdivide, as necessary.…”

Section: Retrieval Scheme Underlying Approach Comments Abstractearchmentioning

confidence: 99%

A semantic-based approach to component retrieval

Sugumaran

Storey

2003

SIGMIS Database

View full text Add to dashboard Cite

There continues to be a great deal of pressure to design and develop information systems within a short period of time. This urgency has reinvigorated research on software reuse, particularly in component based software development. One of the major problems associated with component-based development is the difficulty in searching and retrieving reusable components that meet the requirement at hand. In part, this problem exists because of the lack of sophisticated query methods and techniques. In this research, a semantic-based approach to component retrieval is presented as a solution to this problem. This approach makes use of domain models containing the objectives, processes, actions, actors, and, an ontology of domain terms, their definitions, and relationships with other domain-specific terms. A reuse repository is developed that contains the components relevant for the creation of new applications, along with their attributes and methods. The natural language interface, domain model, and reusable repository are implemented in a prototype that uses Web and JavaBeans technologies. A sample session is provided for an online auction application to illustrate the usefulness of the proposed approach.

show abstract

Section: Retrieval Scheme Underlying Approach Comments Abstractearchmentioning

confidence: 99%

A semantic-based approach to component retrieval

Sugumaran

Storey

2003

SIGMIS Database

View full text Add to dashboard Cite

show abstract

“…Another research effort towards the application of NL techniques to facilitate the database design presents an automated database design system based on a naïve semantics ontology [StGU02]. Results on automatic documentation [BoWi04,ReML95], ontology creation [Kof05], and data cleaning [KeMe99,KeMe02], are not directly applicable to our environment, mostly due to the existence of complex transformations (e.g., functions and aggregations) in the ETL processes, which cannot be resolved using simply linguistic techniques. Research work regarding the validation of the model produced [MeML93,RoPr92], although orthogonal to our effort, still can be used for the validation of the outcome of our work.…”

Section: Application Of Nl In Databasesmentioning

confidence: 99%

Natural Language Processing and Information Systems

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This special issue consists of four revised and extended papers selected from the 17th International conference on Applications of Natural Language to Information Systems (NLDB 2012), which was organized in June 2012 in Groningen, the Netherlands. The NLDB conferences 1 bring together researchers interested in the use of natural language processing techniques in applications such as database querying, information systems architecture, software development, and more recently, various applications dealing with automatic enrichment of and advanced search in large volumes of web content.Authors of a selected number of contributions to the conference (12 full papers, 24 short papers, and 17 poster presentations) were asked to develop their paper into a journal article. After additional reviewing, 4 papers were selected for this special issue.'A semi supervised learning model for mapping sentences to logical forms with ambiguous supervision' by Minh Le Nguyen and Akira Shimazu proposes a novel method for bootstrapping a semantic parser from a combination of semantically annotated, but not disambiguated, data and unlabeled data. 'Wikimantic: Toward effective disambiguation and expansion of queries' by Christopher Boston, Hui Fang, Sandra Carberry, Hao Wu, and Xitong Liu is concerned with microblog (tweet) retrieval, and shows that a query disambiguation and expansion method which uses Wikipedia as knowledge resource improves retrieval performance. 'Inducing the contextual and prior polarity of nouns from the induced polarity preference of verbs' by Manfred Klenner and Stefanos Petrakis presents a new method for learning the prior negative or positive sentiment of a noun, based on statistics obtained from a large corpus annotated with syntactic dependency relations. 'Multidimensional topic analysis in political texts' by Cäcilia Zirn and Heiner Stuckenschmidt addresses the issue of automatic content analysis in the social sciences. In particular, it shows that a technique for creating topic models based on party manifestos and coalition contracts is able to predict which party was primarily responsible for the text of which ministry.On behalf of the authors of the selected papers, we would like to thank all reviewers for their detailed and constructive comments on the submitted manuscripts.

show abstract

“…Practical approaches to this problem (see e.g. [4,5,10,18]) are also based on operations on schemata, though no schema algebra is explicitly defined. Usually, a single schema is mapped onto a new schema inducing some kind of transformation of the instances.…”

Section: Introductionmentioning

confidence: 99%

Complete Conceptual Schema Algebras

Noack

Schewe

et al. 2013

Fundamenta Informaticae

View full text Add to dashboard Cite

A schema algebra comprises operations on database schemata for a given data model. Such algebras are useful in database design as well as in schema integration. In this article we address the necessary theoretical underpinnings by introducing a novel notion of conceptual schema morphism that captures at the same time the conceptual schema and its semantics by means of the set of valid instances. This leads to a category of schemata that is finitely complete and co-complete. This is the basis for a notion of completeness of schema algebras, if it captures all universal constructions in the category of schemata. We exemplify this notion of completeness for a recently introduced particular schema algebra.

show abstract

Dealing with Semantic Heterogeneity During Data Integration

Cited by 21 publications

References 17 publications

A semantic-based approach to component retrieval

A semantic-based approach to component retrieval

Natural Language Processing and Information Systems

Complete Conceptual Schema Algebras

Contact Info

Product

Resources

About