W3C home > Mailing lists > Public > public-esw-thes@w3.org > August 2012

data integration by mapping concept schemes

From: Thomas Bandholtz <thomas.bandholtz@innoq.com>
Date: Mon, 27 Aug 2012 12:33:06 +0200
Message-ID: <503B4CE2.2020605@innoq.com>
To: public-esw-thes@w3.org
Hi Antoine,

my use case is data integration.

Dataset A has defined concept scheme (or collection or subclass)
a:cities as a value set.
Dataset B has defined concept scheme (or collection or subclass) b:areas
as a value set.

Now I want to have some agent X to query both (and further) datasets.
I want a query builder where users can pick cross-dataset search
conditions from a list.

To support this, X defines a concept scheme x:location which is the set
union of a:cities and b:area.
Each concept in x:location will have skos:inScheme a:cities and/or
b:area, sure.
The set of referred concept schemes can be inferred from this.
But I would like to describe the intention in one explicit statement.

This is why I am looking for a mapping relation between such subsets of
concepts.

Best regards,
Thomas

Am 22.08.2012 21:15, schrieb Antoine Isaac:
> (3)
> I'm not sure I get the question. If they exist, such mapping
> properties could be very difficult to semantically define. Would a
> concept scheme be broader, equivalent, narrower than another one?
> Rather, I'd say that the property you're after indicates that some
> concepts from these two concept schemes are connected. For this I
> think one could use general linkage properties between datasets, such
> as voiD's linksets [2]. 


-- 
Thomas Bandholtz
Principal Consultant

innoQ Deutschland GmbH
Krischerstr. 100, 
D-40789 Monheim am Rhein, Germany
http://www.innoq.com
thomas.bandholtz@innoq.com
+49 178 4049387

http://innoq.com/de/themen/linked-data (German)
https://github.com/innoq/iqvoc/wiki/Linked-Data (English)
Received on Monday, 27 August 2012 10:33:31 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 19:46:19 UTC