Schema matching is a basic problem in many database application domains, such as data integration, E-business, data warehousing, and semantic query processing. In current implementations, schema matching is typically performed manually, which has significant limitations. On the other hand, previous research papers have proposed many techniques to achieve a partial automation of the match operation for specific application domains. We present a taxonomy that covers many of these existing approaches, and we describe the approaches in some detail. In particular, we distinguish between schema-level and instance-level, element-level and structure-level, and language-based and constraint-based matchers. Based on our classification we review some previous match implementations thereby indicating which part of the solution space they cover. We intend our taxonomy and review of past work to be useful when comparing different approaches to schema matching, when developing a new match algorithm, and when implementing a schema matching component.

/pdf/a-survey-of-approaches-to-automatic-schema-matching-4n2e5qtrpt.pdf

A survey of approaches to automatic schema matching

Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. The problem of designing data integration systems is important in current real world applications, and is characterized by a number of issues that are interesting from a theoretical point of view. This document presents on overview of the material to be presented in a tutorial on data integration. The tutorial is focused on some of the theoretical issues that are relevant for data integration. Special attention will be devoted to the following aspects: modeling a data integration application, processing queries in data integration, dealing with inconsistent data sources, and reasoning on queries.

/pdf/data-integration-a-theoretical-perspective-58aesjvhuk.pdf

Data integration: a theoretical perspective

Ontologies tend to be found everywhere. They are viewed as the silver bullet for many applications, such as database integration, peer-to-peer systems, e-commerce, semantic web services, or social networks. However, in open or evolving systems, such as the semantic web, different parties would, in general, adopt different ontologies. Thus, merely using ontologies, like using XML, does not reduce heterogeneity: it just raises heterogeneity problems to a higher level. Euzenat and Shvaikos book is devoted to ontology matching as a solution to the semantic heterogeneity problem faced by computer systems. Ontology matching aims at finding correspondences between semantically related entities of different ontologies. These correspondences may stand for equivalence as well as other relations, such as consequence, subsumption, or disjointness, between ontology entities. Many different matching solutions have been proposed so far from various viewpoints, e.g., databases, information systems, and artificial intelligence. The second edition of Ontology Matching has been thoroughly revised and updated to reflect the most recent advances in this quickly developing area, which resulted in more than 150 pages of new content. In particular, the book includes a new chapter dedicated to the methodology for performing ontology matching. It also covers emerging topics, such as data interlinking, ontology partitioning and pruning, context-based matching, matcher tuning, alignment debugging, and user involvement in matching, to mention a few. More than 100 state-of-the-art matching systems and frameworks were reviewed. With Ontology Matching, researchers and practitioners will find a reference book that presents currently available work in a uniform framework. In particular, the work and the techniques presented in this book can be equally applied to database schema matching, catalog integration, XML schema matching and other related problems. The objectives of the book include presenting (i) the state of the art and (ii) the latest research results in ontology matching by providing a systematic and detailed account of matching techniques and matching systems from theoretical, practical and application perspectives.

Ontology Matching

Summary) The abstract should follow the structure of the article (relevance, degree of exploration of the problem, the goal, the main results, conclusion) and characterize the theoretical and practical significance of the study results. The abstract should not contain wording echoing the title, cumbersome grammatical structures and abbreviations. The text should be written in scientific style. The volume of abstracts (summaries) depends on the content of the article, but should not be less than 250 words. All abbreviations must be disclosed in the summary (in spite of the fact that they will be disclosed in the main text of the article), references to the numbers of publications from reference list should not be made. The sentences of the abstract should constitute an integral text, which can be made by use of the words “consequently”, “for example”, “as a result”. Avoid the use of unnecessary introductory phrases (eg, “the author of the article considers...”, “The article presents...” and so on.)

/pdf/ministry-of-education-and-science-of-the-russian-federation-7m2jn0xnm1.pdf

Ministry of Education and Science of the Russian Federation

The major change in the second edition of this book is the addition of a new chapter on probabilistic retrieval. This chapter has been included because I think this is one of the most interesting and active areas of research in information retrieval. There are still many problems to be solved so I hope that this particular chapter will be of some help to those who want to advance the state of knowledge in this area. All the other chapters have been updated by including some of the more recent work on the topics covered. In preparing this new edition I have benefited from discussions with Bruce Croft, The material of this book is aimed at advanced undergraduate information (or computer) science students, postgraduate library science students, and research workers in the field of IR. Some of the chapters, particularly Chapter 6 * , make simple use of a little advanced mathematics. However, the necessary mathematical tools can be easily mastered from numerous mathematical texts that now exist and, in any case, references have been given where the mathematics occur. I had to face the problem of balancing clarity of exposition with density of references. I was tempted to give large numbers of references but was afraid they would have destroyed the continuity of the text. I have tried to steer a middle course and not compete with the Annual Review of Information Science and Technology. Normally one is encouraged to cite only works that have been published in some readily accessible form, such as a book or periodical. Unfortunately, much of the interesting work in IR is contained in technical reports and Ph.D. theses. For example, most the work done on the SMART system at Cornell is available only in reports. Luckily many of these are now available through the National Technical Information Service (U.S.) and University Microfilms (U.K.). I have not avoided using these sources although if the same material is accessible more readily in some other form I have given it preference. I should like to acknowledge my considerable debt to many people and institutions that have helped me. Let me say first that they are responsible for many of the ideas in this book but that only I wish to be held responsible. My greatest debt is to Karen Sparck Jones who taught me to research information retrieval as an experimental science. Nick Jardine and Robin …

Information retrieval

57698;: <=:?>@: <&ACBD<=E=FHGJI K@L 6 8;:?M NDBDO BDPRQTS9UVFHG IWKDL 6 X B PYAYBD<=E@Z[KD\]6^X E M[<=UVFHG I_K `a6 b c=Ued=:?AYARU F KDbf6^ghB ij>@:?klk_U F K gm6 gh: ieQTS9UjE M[Ujn_K gm6,o Ue<9QWUe<9U F prq sut2vxwzyl{C|~}HwJT + w9  {Yv  {{Y[Wwz ^ wzzw  Kx   w u   w?qYl[ K@ q[qRW   {Yv  p[s t2v wzyl{|~}HwzT + w=w  v  K    w  [ {YzwC W  [?qRW¡ wz  vx p¢lsut2vxwzyl{C|~}HwJT + w= |~{C}HYw     w   |  v £Y{ [¤  W¡?qR[  |~{Y}HCw  {    wz,¥ ¦  [ {Yv wzY § ̈@{Yv {YyW{Yv_  v  K }HWv w  § ̈@{|~    }H©xw K C[|~v wa§  z ̈@{C|H~ K  [« |~wz£Ywz § y?wzv Cwvxwj¬[­ « vxwz x§ wJ   }r  vx_­  }Hwa§ « vxwz w¢§ wJ K  {C®© wzT|­2 ̈ }Hwzv  § wzvxx§ « vxw ̈x}Y§ wz

/pdf/information-integration-the-momis-project-demonstration-46vm93zdua.pdf

Information Integration: The MOMIS Project Demonstration

Automated techniques and tools are required to effectively locate services that fulfill a given user request in a mobility context. To this purpose, the use of semantic descriptions of services has been widely motivated and recommended for automated service discovery under highly dynamic and context-dependent requirements. Our aim in this work is to propose an ontology-based hybrid approach where different kinds of matchmaking strategies are combined together to provide an adaptive, flexible and efficient service discovery environment. The approach, in particular, exploits the semantic knowledge about the business domain provided by a domain ontology underlying service descriptions, and the semantic organization of services in a service ontology, at different levels of abstraction.

Flexible Semantic-Based Service Matchmaking and Discovery

Most private and public organizations have recently turned their attention to the process by which they operate, to improve service and product quality and customer satisfaction. To support business process reengineering, methods and tools for process modeling and analysis are required. The paper presents the ARTEMIS methodology and associated tool environment for business process analysis for reengineering. In the ARTEMIS methodological framework, business processes are modeled as workflows and are analyzed according to an organizational structure perspective and an operational structure perspective. With these two perspectives, the analyst can plan reengineering interventions based on the degree of autonomy/dependency of organization units in terms of coupling, and the inter-process semantic correspondences, in terms of data and operation similarity, respectively. The ARTEMIS methodology and associated tool environment have been conceived and applied in the framework of the PROGRESS research project. In the paper, we report on a reengineering case study of this project involving the Italian Ministry of Justice.

A methodology and tool environment for process analysis and reengineering

PREFer: A prescription-based food recommender system

Automated techniques and tools are required to effectively locate services that fulfil a given user request. To this purpose, the use of semantic descriptions of services has been widely motivated and recommended for automated service discovery under highly dynamic and contextdependent requirements in distributed environments. Our aim in this work is to propose a semantic-enriched framework to describe services and an ontology-based hybrid approach where such framework is exploited combining together different kinds of comparison strategies to provide a flexible and efficient matchmaking between service descriptions. For service discovery two matchmaking strategies are proposed: a deductive strategy based on Description Logics, with a reasoning procedure exploiting ontology knowledge to assess the type of match between services; a similarity-based strategy, exploiting retrieval metrics to measure the degree of match between services.

Michele Melchiori

Papers

Information Integration: The MOMIS Project Demonstration

Flexible Semantic-Based Service Matchmaking and Discovery

A methodology and tool environment for process analysis and reengineering

PREFer: A prescription-based food recommender system

Semantic-Enriched Service Discovery