The Solution of Massive Tasks in GIS Exemplified by Determining Terrain Surface Types Above Gas Pipelines in the Czech Republic

Bartoněk, Dalibor; Bureš, Jiří; Opatřilová, Irena

doi:10.1007/978-3-319-08180-9_8

Cited by 1 publication

(3 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The reasons and more details are given in Ref. [2]. The processing time in these sub-territorial units depends partly on their size and the number of elements with which are performed the requested operation.…”

Section: Resultsmentioning

confidence: 99%

“…(2) and (3) implies that all processes p i ∈ P are contained in a combination (p i m j ∈ S exactly once. Further, from these equations follows that means m j ∈ M with the combination (p i m j ∈ S can be repeated or they do not have to be contained all there.…”

Section: Mathematical Model and Context Of Processesmentioning

confidence: 98%

“…This case occurs in GIS systems more frequently than in other fields-see Ref. [2]. We design a map of processes M based on the graph in Figure 1.…”

Section: Mathematical Model and Context Of Processesmentioning

confidence: 99%

See 2 more Smart Citations

Algorithmization and Optimization of Processing of Big Geographical Data

Bartoněk

Bureš

2016

j comput theor nanosci

Self Cite

View full text Add to dashboard Cite

This paper presents the optimization of evaluation of large volume of geographic data. The core of the method is hierarchical decomposition of the set of processes into elementary processes and the allocation of means to these processes. The means can be of three types: hardware, software or human factor, eventually combination of these types. Each elementary process can be processed at one of these means in certain time. Generally, the processes and the means can be interdependent or independent. The described problem can be represented using an oriented graph, where nodes correspond to the processes or the means and edges represent either the interdependence of processes and means, or the processing time of certain process on a given mean. The map of processes is formed on the basis of the graph. This map contains temporal continuity of solutions of sub-processes. Then, the duration of all processes is compiled from this map, which must be less than the time solving a task in the required quality of results. If not, the pairs of sub process-mean are replaced alternative pairs according to the map of processes with lower duration. The special algorithm was designed for this task. If the sum of the durations of all processes complies with solutions, the optimization ends and at this time the sub-processes and their allocated means are defined. The proposed method of data processing was realized in the project of data analysis of storage of gas facilities under certain types of terrain surface in the Czech Republic with the area of 64,350 km 2 .

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Mathematical Model and Context Of Processesmentioning

confidence: 98%