Organization of topological data, based on relational data model

Adam Duszeńko, Aleksandra Werner


The relational model can be considered as a generalization of the set data model. So, the basic organization of a data in traditional – relational – database system is a set of data with no defined any positional orderings of them. At first glance, this approach is accurate, because it brings unlimited possibilities of data indexing. However such forced order of data organization is the secondary one and doesn’t reflect inner topology of data in a set. In the case of topological data, it can cause significant difficulties in finding the neighboring points, according to defined neighborhood criteria. This chapter presents the organization of a topological data modeled in the relational database system that allows direct designating the subsets of neighboring points. This article describes recursive SQL queries and presents its syntax with explanation of used clauses. Besides, the design of performance cluster by the use of DB2 Distributed Partitioning Feature is discussed.


database; relational model; topological data; recursive queries

Full Text:

PDF (Polski)


Frej B.: Topologia - wykład 4. Instytut Matematyki i Informatyki Politechniki Wrocławskiej,

Izdebski W.: Wykłady z przedmiotu SIT (Systemy Informacji o Terenie),

Dokumentacja techniczna Oracle 11g: Oracle Database SQL Language Reference,

Jellema L.: Oracle RDBMS 11gR2 - goodbye Connect By or: the end of hierarchical querying as we know it,

IT Tips. Reclusive subquery factoring using the SQL WITH clause. Burleson Enterprises,

Centrum Informacyjne IBM DB2,

Subieta K.: Tranzytywne domknięcia i równania stałopunktowe. Konstrukcja systemów obiektowych i rozproszonych, www.ipipan.en/staff/k.subieta/SBA_SBQL/lectures-/SBA16.