Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data 2005
DOI: 10.1145/1066157.1066168
|View full text |Cite
|
Sign up to set email alerts
|

Reference reconciliation in complex information spaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
338
0
9

Year Published

2006
2006
2013
2013

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 393 publications
(350 citation statements)
references
References 15 publications
3
338
0
9
Order By: Relevance
“…At first sight, the entity search task has a strong similarity with entity linkage techniques [14], also known as data matching [4,9], deduplication [27], resolution [3], merge-purge [13], entity identification [21], and reference reconciliation [10]. Entity Linkage is the process that decides whether two descriptions refer to the same real world entity (see [12] for an overview).…”
Section: Entity Searchmentioning
confidence: 99%
“…At first sight, the entity search task has a strong similarity with entity linkage techniques [14], also known as data matching [4,9], deduplication [27], resolution [3], merge-purge [13], entity identification [21], and reference reconciliation [10]. Entity Linkage is the process that decides whether two descriptions refer to the same real world entity (see [12] for an overview).…”
Section: Entity Searchmentioning
confidence: 99%
“…Web application and integration systems are progressively moving from tuple and value-based towards entity-based solutions, i.e., systems in which the basic data unit is an entity, independently of its logical modeling [10]. Furthermore, web integration systems, in order to achieve interoperability, may need to provide unique identification for the entities in the data they exchange [11].…”
Section: Introductionmentioning
confidence: 99%
“…Xing Dong et al [10] propose to reconcile the object references in three steps. The first step is constructing the dependency graph, which describes the relationships between object pairs.…”
Section: Related Workmentioning
confidence: 99%
“…After we get the selected class matching pairs, we adopt an object reconciliation algorithm developed by Dong, Halevy and Madhavan in [10] to reconcile the instances of classes from two ontologies. The original algorithm considers the relationship of matching pairs and determines whether two data objects in different databases represent the same real-world entity.…”
Section: Object Reconciliationmentioning
confidence: 99%
See 1 more Smart Citation