View merging in the presence of incompleteness and inconsistency

View merging in the presence of incompleteness and inconsistency (2006)

Cached

Download Links

[www.cs.toronto.edu]

Other Repositories/Bibliography

DBLP

by Mehrdad Sabetzadeh , Steve Easterbrook

Venue:	Requir. Eng
Citations:	24 - 10 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	View merging in the presence of incompleteness and inconsistency	INFERENCE
AUTHOR NAME	Mehrdad Sabetzadeh	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science, University of Toronto	SVM HeaderParse 0.2
AUTHOR ADDR	Toronto, ON M5S 3G4, Canada.	SVM HeaderParse 0.2
AUTHOR NAME	Steve Easterbrook	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science, University of Toronto	SVM HeaderParse 0.2
AUTHOR ADDR	Toronto, ON M5S 3G4, Canada.	SVM HeaderParse 0.2
ABSTRACT	View merging, also called view integration, is a key problem in conceptual modeling. Large models are often constructed and accessed by manipulating individual views, but it is important to be able to consolidate a set of views to gain a unified perspective, to understand interactions between views, or to perform various types of analysis. View merging is complicated by incompleteness and inconsistency: Stakeholders often have varying degrees of confidence about their statements. Their views capture different but overlapping aspects of a problem, and may have discrepancies over the terminology being used, the concepts being modeled, or how these concepts should be structured. Once views are merged, it is important to be able to trace the elements of the merged view back to their sources and to the merge assumptions related to them. In this paper, we present a framework for merging incomplete and inconsistent graph-based views. We introduce a formalism, called annotated graphs, with a built-in annotation scheme for modeling incompleteness and inconsistency. We show how structure-preserving maps can be employed to express the relationships between disparate views modeled as annotated graphs, and provide a general algorithm for merging views with arbitrary interconnections. We provide a systematic way to generate and represent the traceability information required for tracing the merged view elements back to their sources, and to the merge assumptions giving rise to the elements.	SVM HeaderParse 0.2
YEAR	2006	INFERENCE
VENUE	Requir. Eng	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	174--193	INFERENCE
CITATIONS	47 found	ParsCit 1.0