Massive point cloud data management: Design, implementation and execution of a point cloud benchmark

被引:65
作者
van Oosterom, Peter [1 ]
Martinez-Rubi, Oscar [2 ]
Ivanova, Milena [2 ]
Horhammer, Mike [3 ]
Geringer, Daniel [3 ]
Ravada, Siva [3 ]
Tijssen, Theo [1 ]
Kodde, Martin [4 ]
Goncalves, Romulo [2 ]
机构
[1] Delft Univ Technol, Fac Architecture & Built Environm, Dept OTB, Sect GIS Technol, Delft, Netherlands
[2] Netherlands ESci Ctr, Amsterdam, Netherlands
[3] Server Technol, Oracle Spatial & Graph & MapViewer, Nashua, NH USA
[4] GeoServices BV, Fugro, Leidschendam, Netherlands
来源
COMPUTERS & GRAPHICS-UK | 2015年 / 49卷
关键词
Benchmark; DBMS; Point cloud data; Parallel processing; Space filling curve; Vario-scale; OCTREE;
D O I
10.1016/j.cag.2015.01.007
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Point cloud data are important sources for 3D geo-information. An inventory of the point cloud data management user requirements has been compiled using structured interviews with users from different background: government, industry and academia. Based on these requirements a benchmark has been developed to compare various point cloud data management solutions with regard to functionality and performance. The main test dataset is the second national height map of the Netherlands, AHN2, with 6-10 samples for every square meter of the country, resulting in 640 billion points. At the database level, a data storage model based on grouping the points in blocks is available in Oracle and PostgreSQL. This model is compared with the 'flat table' model, where each point is stored in a table row, in Oracle, PostgreSQL and the column-store MonetDB. In addition, the commonly used file-based solution Rapidlasso LAStools is used for comparison with the database solutions. The results of executing the benchmark on different platforms are presented as obtained during the increasingly challenging stages with more functionality and more data: mini (20 million points), medium (20 billion points), and full benchmark (the complete AHN2). During the design, the implementation and the execution of the benchmarks, a number of point cloud data management improvements were proposed and partly tested: Morton/Hilbert code for ordering data (especially in flat model), two algorithms for parallel query execution, and a unique vario-scale LoD data organization avoiding the density jumps of the well-known discrete LoD data organizations. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:92 / 125
页数:34
相关论文
共 29 条
[1]  
[Anonymous], 2014, ORACLE DATABASE ONLI
[2]  
[Anonymous], 2014, DAT PHYS STOR 58 2 T
[3]  
[Anonymous], 2014, GIST IND
[4]  
[Anonymous], COLUMN STORE MEETS P
[5]  
Boehm J., P WORKSH PROC LARG G
[6]   One billion points in the cloud - an octree for efficient processing of 3D laser scans [J].
Elseberg, Jan ;
Borrmann, Dorit ;
Nuechter, Andreas .
ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, 2013, 76 :76-88
[7]  
Finkel R. A., 1974, Acta Informatica, V4, P1, DOI 10.1007/BF00288933
[8]   Development of a hashing-based data structure for the fast retrieval of 3D terrestrial laser scanned data [J].
Han, Soohee ;
Kim, Sangmin ;
Jung, Jae Hoon ;
Kim, Changjae ;
Yu, Kiyun ;
Heo, Joon .
COMPUTERS & GEOSCIENCES, 2012, 39 :1-10
[9]  
Herring John, 2010, 06104R4 OGC
[10]  
I. Environmental Systems Research Institute, 1998, TECHNICAL REPORT