Abstract
Given two geographic databases, a fusion algorithm should produce all pairs of corresponding objects. This chapter describes the four fusion algorithms that only use locations of objects, and measures their performance in terms of recall and precision. These algorithms are designed to work even when locations are imprecise and each database represents only some of the real-world entities. Results of investigations are presented and discussed. The analysis exhibits that the performance depends on the density of the data sources and the degree of overlap among them. All the four algorithms are much better than the current state of the art. One of these four algorithms is best in all cases, at a cost of a small increase in the running time compared to the other algorithms.
Original language | English |
---|---|
Title of host publication | Proceedings 2004 VLDB Conference |
Subtitle of host publication | The 30th International Conference on Very Large Databases (VLDB) |
Publisher | Elsevier |
Pages | 816-827 |
Number of pages | 12 |
ISBN (Electronic) | 9780120884698 |
DOIs | |
State | Published - 1 Jan 2004 |
Bibliographical note
Publisher Copyright:© 2004 Elsevier Inc. All rights reserved.