Schema matching is the problem of finding mappings between different structured schemas. When retrieving information from digital libraries with heterogeneous schemas, the query over a target schema has to be transformed into a query over the schema of the digital library (the source schema) it has been submitted to. Schema mappings define the rules for this query transformation. In this paper we address the issue of automatically learning these mappings; furthermore, we evaluate their effectiveness in accessing distributed, heterogeneous digital libraries.
On the effectiveness of automatic schema matching over heterogeneous digital libraries
Renda ME;Straccia U
2005
Abstract
Schema matching is the problem of finding mappings between different structured schemas. When retrieving information from digital libraries with heterogeneous schemas, the query over a target schema has to be transformed into a query over the schema of the digital library (the source schema) it has been submitted to. Schema mappings define the rules for this query transformation. In this paper we address the issue of automatically learning these mappings; furthermore, we evaluate their effectiveness in accessing distributed, heterogeneous digital libraries.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
prod_160271-doc_126049.pdf
accesso aperto
Descrizione: On the Effectiveness of Automatic Schema Matching Over Heterogeneous Digital Libraries
Dimensione
184.42 kB
Formato
Adobe PDF
|
184.42 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.