Slide 24
Slide 24 text
some preliminary results
24
Storing and analysing massive TINs in a DBMS with a star-based data structure 17
degree
points duplicates triangles convexhull avg max
AHN2 281 884 687 214 050 563 768 199 1 173 6.00 63
serpent 3 265 110 17 584 6 494 998 52 6.00 39
msh 283 213 392 0 566 426 669 113 6.00 141
Table 2 Details concerning the datasets used for the experiments; convexhull is the number
of points that are on the boundary of the convex hull of the dataset.
Storing and analysing massive TINs in a DBMS with a star-based data structure 19
star structure triangles SF
table index total table index total
AHN2 28 GB 4.8 GB 32.8 GB 64 GB 29 GB 93 GB
serpent 325 MB 56 MB 381 MB 746 MB 329 MB 1075 MB
msh 28 GB 4.8 GB 32.8 GB 64 GB 29 GB 93 GB
Table 4 Size of the tables and the indexes in PostgreSQL for the datasets.
of triangles is around twice as large as that of points), the main cause is the
building of the GiST spatial index of PostGIS, which took 20 times more time.