Building a Robust Relational Implementation of Topology

Topologically structured data models often form the core of many users’ spatial databases. Topological structuring is primarily used to ensure data integrity; it describes how spatial objects share geometry. Supporting topology within the context of a relational database imposes additional requirements – the complex topological model must retain integrity across transactional boundaries. This can be a problematic requirement given the complexities associated with implementing safe referential integrity structures in relational databases (e.g., bulk data loading into a topologically structured model) [19, 5]. Common implementation techniques such as allowing dangling pointers (i.e., null foreign keys) complicates the issues for client applications that consume these models. In this paper, we revisit the problem of building a robust and scalable relational implementation of a topologically structured data model. We propose a different approach to representing such models that avoids many of the traditional relational database problems associated with maintaining complex semantic models.