Matching cartographic objects in spatial databases

Research output: Contribution to journalConference articleResearchpeer review

Authors

  • Daniela Mantel
  • Udo Lipeck
View graph of relations

Details

Original languageEnglish
Number of pages5
JournalInternational Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences - ISPRS Archives
Volume35
Publication statusPublished - 2004
Event20th ISPRS Congress on Technical Commission VII - Istanbul, Turkey
Duration: 12 Jul 200423 Jul 2004

Abstract

Nowadays cartographic objects of different resolutions are hold in different coexisting databases. This implies an extensive amount of work for updating an object in all resolutions. One way to reduce this is to build a multi-resolution database which holds and links different representations of the real-world objects and allows to automatically pass updates to all linked representations (requiring algorithms for propagation of updates). In order to ensure the autonomy of applications on the local databases, we propose the architecture of a federated database for such a multi-resolution database. A main requirement for setting up a multi-resolution database is to "identify" the different representations of real-world objects. Therefore we propose a multistage procedure as follows: - Semantic classification: Identify the sets of objects to compare with one another - Compute geometrically possible matchings within these classes - Postprocessing: Automatically select correct matchings from the set of possible matchings by applying prepared rules - Manual select correct matchings for the remaining possible matchings, which were not automatically detected as correct or incorrect We present a framework for the needed semantic classification, a concept for rule-based selection as well as an algorithm to compute possible matchings. We have enhanced the formerly known buffer growing algorithm for computation of possible matchings and implemented it in PL/SQL for use in spatial databases based on Oracle9i (with the spatial data cartridge). The enclosing object matching process is supported by a graphical user interface utilizing stored database procedures for the mentioned steps and rules.

Keywords

    Federated databases, Integration, Matching algorithms, Resolution

ASJC Scopus subject areas

Cite this

Matching cartographic objects in spatial databases. / Mantel, Daniela; Lipeck, Udo.
In: International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences - ISPRS Archives, Vol. 35, 2004.

Research output: Contribution to journalConference articleResearchpeer review

Mantel, D & Lipeck, U 2004, 'Matching cartographic objects in spatial databases', International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences - ISPRS Archives, vol. 35. https://doi.org/10.15488/3357
Mantel, D., & Lipeck, U. (2004). Matching cartographic objects in spatial databases. International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences - ISPRS Archives, 35. https://doi.org/10.15488/3357
Mantel D, Lipeck U. Matching cartographic objects in spatial databases. International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences - ISPRS Archives. 2004;35. doi: 10.15488/3357
Mantel, Daniela ; Lipeck, Udo. / Matching cartographic objects in spatial databases. In: International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences - ISPRS Archives. 2004 ; Vol. 35.
Download
@article{fa3d5b90ec274b2f8afa7bac900ac870,
title = "Matching cartographic objects in spatial databases",
abstract = "Nowadays cartographic objects of different resolutions are hold in different coexisting databases. This implies an extensive amount of work for updating an object in all resolutions. One way to reduce this is to build a multi-resolution database which holds and links different representations of the real-world objects and allows to automatically pass updates to all linked representations (requiring algorithms for propagation of updates). In order to ensure the autonomy of applications on the local databases, we propose the architecture of a federated database for such a multi-resolution database. A main requirement for setting up a multi-resolution database is to {"}identify{"} the different representations of real-world objects. Therefore we propose a multistage procedure as follows: - Semantic classification: Identify the sets of objects to compare with one another - Compute geometrically possible matchings within these classes - Postprocessing: Automatically select correct matchings from the set of possible matchings by applying prepared rules - Manual select correct matchings for the remaining possible matchings, which were not automatically detected as correct or incorrect We present a framework for the needed semantic classification, a concept for rule-based selection as well as an algorithm to compute possible matchings. We have enhanced the formerly known buffer growing algorithm for computation of possible matchings and implemented it in PL/SQL for use in spatial databases based on Oracle9i (with the spatial data cartridge). The enclosing object matching process is supported by a graphical user interface utilizing stored database procedures for the mentioned steps and rules.",
keywords = "Federated databases, Integration, Matching algorithms, Resolution",
author = "Daniela Mantel and Udo Lipeck",
note = "Publisher Copyright: {\textcopyright} 2004 International Society for Photogrammetry and Remote Sensing. All rights reserved.; 20th ISPRS Congress on Technical Commission VII ; Conference date: 12-07-2004 Through 23-07-2004",
year = "2004",
doi = "10.15488/3357",
language = "English",
volume = "35",

}

Download

TY - JOUR

T1 - Matching cartographic objects in spatial databases

AU - Mantel, Daniela

AU - Lipeck, Udo

N1 - Publisher Copyright: © 2004 International Society for Photogrammetry and Remote Sensing. All rights reserved.

PY - 2004

Y1 - 2004

N2 - Nowadays cartographic objects of different resolutions are hold in different coexisting databases. This implies an extensive amount of work for updating an object in all resolutions. One way to reduce this is to build a multi-resolution database which holds and links different representations of the real-world objects and allows to automatically pass updates to all linked representations (requiring algorithms for propagation of updates). In order to ensure the autonomy of applications on the local databases, we propose the architecture of a federated database for such a multi-resolution database. A main requirement for setting up a multi-resolution database is to "identify" the different representations of real-world objects. Therefore we propose a multistage procedure as follows: - Semantic classification: Identify the sets of objects to compare with one another - Compute geometrically possible matchings within these classes - Postprocessing: Automatically select correct matchings from the set of possible matchings by applying prepared rules - Manual select correct matchings for the remaining possible matchings, which were not automatically detected as correct or incorrect We present a framework for the needed semantic classification, a concept for rule-based selection as well as an algorithm to compute possible matchings. We have enhanced the formerly known buffer growing algorithm for computation of possible matchings and implemented it in PL/SQL for use in spatial databases based on Oracle9i (with the spatial data cartridge). The enclosing object matching process is supported by a graphical user interface utilizing stored database procedures for the mentioned steps and rules.

AB - Nowadays cartographic objects of different resolutions are hold in different coexisting databases. This implies an extensive amount of work for updating an object in all resolutions. One way to reduce this is to build a multi-resolution database which holds and links different representations of the real-world objects and allows to automatically pass updates to all linked representations (requiring algorithms for propagation of updates). In order to ensure the autonomy of applications on the local databases, we propose the architecture of a federated database for such a multi-resolution database. A main requirement for setting up a multi-resolution database is to "identify" the different representations of real-world objects. Therefore we propose a multistage procedure as follows: - Semantic classification: Identify the sets of objects to compare with one another - Compute geometrically possible matchings within these classes - Postprocessing: Automatically select correct matchings from the set of possible matchings by applying prepared rules - Manual select correct matchings for the remaining possible matchings, which were not automatically detected as correct or incorrect We present a framework for the needed semantic classification, a concept for rule-based selection as well as an algorithm to compute possible matchings. We have enhanced the formerly known buffer growing algorithm for computation of possible matchings and implemented it in PL/SQL for use in spatial databases based on Oracle9i (with the spatial data cartridge). The enclosing object matching process is supported by a graphical user interface utilizing stored database procedures for the mentioned steps and rules.

KW - Federated databases

KW - Integration

KW - Matching algorithms

KW - Resolution

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

U2 - 10.15488/3357

DO - 10.15488/3357

M3 - Conference article

AN - SCOPUS:85044538756

VL - 35

JO - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences - ISPRS Archives

JF - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences - ISPRS Archives

SN - 1682-1750

T2 - 20th ISPRS Congress on Technical Commission VII

Y2 - 12 July 2004 through 23 July 2004

ER -