Shptree notes - Revision history

Wiki-Leo at 11:19, 25 February 2015

2015-02-25T11:19:26Z

Jmckenna: /* buildings.shp */

2010-07-24T19:59:42Z

buildings.shp

Jmckenna: /* buildings.shp */

2010-07-24T18:55:11Z

buildings.shp

Jmckenna at 18:54, 24 July 2010

2010-07-24T18:54:44Z

Jmckenna at 18:52, 24 July 2010

2010-07-24T18:52:15Z

Jmckenna at 18:50, 24 July 2010

2010-07-24T18:50:19Z

Jmckenna at 18:49, 24 July 2010

2010-07-24T18:49:23Z

Jmckenna: add page

2010-07-24T18:46:16Z

add page

New page

== shptree Depth ==

No depth parameter was used for the shptree command, which means the shptree code would determine the optimal depth. The determined depths were:

{| border="1"
| '''file''' || '''depth'''
|-
| building|| 21
|-
| contour-0 || 16
|-
| contour-1 || 17
|-
| contour-2 || 17
|-
| contour-3 || 17
|-
| contour-4 || 17
|-
| contour-5 || 15
|-
| contour-6 || 17
|-
| contour-7 || 17
|-
| industry || 17
|-
| motorway || 10
|-
| point-labels-for-geometry || 15
|-
| point-labels-no-geometry || 18
|-
| ramp || 14
|-
| road || 14
|-
| settlement || 16
|-
| track || 16
|}

== Verifying the qix file ==

* shptreetst utility was used to verify the integrity of qix file
* you should see a message like:

::
$ shptreetst contour-0.qix

This new LSB index supports a shapefile with 221671 shapes, 16 depth
shapes 0, node 4, -8.187613,36.166759,3.274251,43.666687
shapes 0, node 4, -8.187613,36.166759,-1.883588,40.291719
shapes 0, node 4, -8.187613,36.166759,-4.720399,38.435487
shapes 0, node 1, -8.187613,36.166759,-6.280646,37.414560
shapes 0, node 2, -7.329478,36.728269,-6.280646,37.414560
...

read entire file now at quad box rec 20 file pos 1000
using last read box as a search
result of rectangle search was
86554, 86580, 86586, 86598, 86638, 86641, 86642, 86643, 86660, 86667, 195862, 195895, 195901, 195903, 195926, 196873, 197711,

@@ Line 1: / Line 1: @@
 = shptree Processing Notes =
-''(for the [[Benchmarking_2010]] exercise)''
+''(for the [[Benchmarking 2010]] exercise)''
 == shptree Depth ==
@@ Line 73: / Line 73: @@
 ----
-[[Category:FOSS4G2010]] [[Category:FOSS4G]]
+[[Category:FOSS4G2010]]

@@ Line 68: / Line 68: @@
 == buildings.shp ==
-* <code>shptreetst building.qix</code> caused a Segmentation fault initially on our Linux server (with 8GB RAM)
+* <code>shptreetst building.qix</code> caused a Segmentation fault initially on our BenchmarkB Linux server (with 8GB RAM)
 * to solve this we...

@@ Line 68: / Line 68: @@
 == buildings.shp ==
-* shptreetst building.qix caused a Segmentation fault initially on our Linux server (with 8GB RAM)
+* <code>shptreetst building.qix</code> caused a Segmentation fault initially on our Linux server (with 8GB RAM)
 * to solve this we...

← Older revision		Revision as of 18:54, 24 July 2010
Line 1:		Line 1:
−	''(~~shptree processing notes~~ for the [[Benchmarking_2010]] exercise)''	+	= shptree Processing Notes =
		+
		+	''(for the [[Benchmarking_2010]] exercise)''

	== shptree Depth ==		== shptree Depth ==

← Older revision		Revision as of 18:52, 24 July 2010
Line 1:		Line 1:
		+	''(shptree processing notes for the [[Benchmarking_2010]] exercise)''
		+
	== shptree Depth ==		== shptree Depth ==

← Older revision		Revision as of 18:50, 24 July 2010
Line 66:		Line 66:
	* shptreetst building.qix caused a Segmentation fault initially on our Linux server (with 8GB RAM)		* shptreetst building.qix caused a Segmentation fault initially on our Linux server (with 8GB RAM)
	* to solve this we...		* to solve this we...
		+
		+	----
		+
		+	[[Category:FOSS4G2010]] [[Category:FOSS4G]]

← Older revision		Revision as of 18:49, 24 July 2010
Line 61:		Line 61:
	result of rectangle search was		result of rectangle search was
	86554, 86580, 86586, 86598, 86638, 86641, 86642, 86643, 86660, 86667, 195862, 195895, 195901, 195903, 195926, 196873, 197711,		86554, 86580, 86586, 86598, 86638, 86641, 86642, 86643, 86660, 86667, 195862, 195895, 195901, 195903, 195926, 196873, 197711,
		+
		+	== buildings.shp ==
		+
		+	* shptreetst building.qix caused a Segmentation fault initially on our Linux server (with 8GB RAM)
		+	* to solve this we...