On-the-Fly Entity-Aware Query Processing in the Presence of Linkage

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Autoren

Organisationseinheiten

Externe Organisationen

  • Università degli Studi di Trento
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seiten (von - bis)429-438
Seitenumfang10
FachzeitschriftProceedings of the VLDB Endowment
Jahrgang3
Ausgabenummer1
PublikationsstatusVeröffentlicht - Sept. 2010

Abstract

Entity linkage is central to almost every data integration and data cleaning scenario. Traditional techniques use some computed similarity among data structure to perform merges and then answer queries on the merged data. We describe a novel framework for entity linkage with uncertainty. Instead of using the linkage information to merge structures a-priori, possible linkages are stored alongside the data with their belief value. A new probabilistic query answering technique is used to take the probabilistic linkage into consideration. The framework introduces a series of novelties: (i) it performs merges at run time based not only on existing linkages but also on the given query; (ii) it allows results that may contain structures not explicitly represented in the data, but generated as a result of a reasoning on the linkages; and (iii) enables an evaluation of the query conditions that spans across linked structures, offering a functionality not currently supported by any traditional probabilistic databases. We formally define the semantics, describe an efficient implementation and report on the findings of our experimental evaluation.

ASJC Scopus Sachgebiete

Zitieren

On-the-Fly Entity-Aware Query Processing in the Presence of Linkage. / Ioannou, Ekaterini; Nejdl, Wolfgang; Niederée, Claudia et al.
in: Proceedings of the VLDB Endowment, Jahrgang 3, Nr. 1, 09.2010, S. 429-438.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Ioannou, E, Nejdl, W, Niederée, C & Velegrakis, Y 2010, 'On-the-Fly Entity-Aware Query Processing in the Presence of Linkage', Proceedings of the VLDB Endowment, Jg. 3, Nr. 1, S. 429-438. https://doi.org/10.14778/1920841.1920898
Ioannou, E., Nejdl, W., Niederée, C., & Velegrakis, Y. (2010). On-the-Fly Entity-Aware Query Processing in the Presence of Linkage. Proceedings of the VLDB Endowment, 3(1), 429-438. https://doi.org/10.14778/1920841.1920898
Ioannou E, Nejdl W, Niederée C, Velegrakis Y. On-the-Fly Entity-Aware Query Processing in the Presence of Linkage. Proceedings of the VLDB Endowment. 2010 Sep;3(1):429-438. doi: 10.14778/1920841.1920898
Ioannou, Ekaterini ; Nejdl, Wolfgang ; Niederée, Claudia et al. / On-the-Fly Entity-Aware Query Processing in the Presence of Linkage. in: Proceedings of the VLDB Endowment. 2010 ; Jahrgang 3, Nr. 1. S. 429-438.
Download
@article{8b7632b73fb24be19be180b21e4a78be,
title = "On-the-Fly Entity-Aware Query Processing in the Presence of Linkage",
abstract = "Entity linkage is central to almost every data integration and data cleaning scenario. Traditional techniques use some computed similarity among data structure to perform merges and then answer queries on the merged data. We describe a novel framework for entity linkage with uncertainty. Instead of using the linkage information to merge structures a-priori, possible linkages are stored alongside the data with their belief value. A new probabilistic query answering technique is used to take the probabilistic linkage into consideration. The framework introduces a series of novelties: (i) it performs merges at run time based not only on existing linkages but also on the given query; (ii) it allows results that may contain structures not explicitly represented in the data, but generated as a result of a reasoning on the linkages; and (iii) enables an evaluation of the query conditions that spans across linked structures, offering a functionality not currently supported by any traditional probabilistic databases. We formally define the semantics, describe an efficient implementation and report on the findings of our experimental evaluation.",
author = "Ekaterini Ioannou and Wolfgang Nejdl and Claudia Nieder{\'e}e and Yannis Velegrakis",
year = "2010",
month = sep,
doi = "10.14778/1920841.1920898",
language = "English",
volume = "3",
pages = "429--438",
number = "1",

}

Download

TY - JOUR

T1 - On-the-Fly Entity-Aware Query Processing in the Presence of Linkage

AU - Ioannou, Ekaterini

AU - Nejdl, Wolfgang

AU - Niederée, Claudia

AU - Velegrakis, Yannis

PY - 2010/9

Y1 - 2010/9

N2 - Entity linkage is central to almost every data integration and data cleaning scenario. Traditional techniques use some computed similarity among data structure to perform merges and then answer queries on the merged data. We describe a novel framework for entity linkage with uncertainty. Instead of using the linkage information to merge structures a-priori, possible linkages are stored alongside the data with their belief value. A new probabilistic query answering technique is used to take the probabilistic linkage into consideration. The framework introduces a series of novelties: (i) it performs merges at run time based not only on existing linkages but also on the given query; (ii) it allows results that may contain structures not explicitly represented in the data, but generated as a result of a reasoning on the linkages; and (iii) enables an evaluation of the query conditions that spans across linked structures, offering a functionality not currently supported by any traditional probabilistic databases. We formally define the semantics, describe an efficient implementation and report on the findings of our experimental evaluation.

AB - Entity linkage is central to almost every data integration and data cleaning scenario. Traditional techniques use some computed similarity among data structure to perform merges and then answer queries on the merged data. We describe a novel framework for entity linkage with uncertainty. Instead of using the linkage information to merge structures a-priori, possible linkages are stored alongside the data with their belief value. A new probabilistic query answering technique is used to take the probabilistic linkage into consideration. The framework introduces a series of novelties: (i) it performs merges at run time based not only on existing linkages but also on the given query; (ii) it allows results that may contain structures not explicitly represented in the data, but generated as a result of a reasoning on the linkages; and (iii) enables an evaluation of the query conditions that spans across linked structures, offering a functionality not currently supported by any traditional probabilistic databases. We formally define the semantics, describe an efficient implementation and report on the findings of our experimental evaluation.

UR - http://www.scopus.com/inward/record.url?scp=79959927816&partnerID=8YFLogxK

U2 - 10.14778/1920841.1920898

DO - 10.14778/1920841.1920898

M3 - Article

AN - SCOPUS:79959927816

VL - 3

SP - 429

EP - 438

JO - Proceedings of the VLDB Endowment

JF - Proceedings of the VLDB Endowment

IS - 1

ER -

Von denselben Autoren