# HG changeset patch # User jbe # Date 1471803185 -7200 # Node ID 4f07a22f4d45c5cf239693ba5ecb2f391dce4fc8 # Parent 2393084ef3564bfe6d55ca1f6ab1c90263af1d5b Minor change in introduction of README file diff -r 2393084ef356 -r 4f07a22f4d45 README.html --- a/README.html Sun Aug 21 17:43:52 2016 +0200 +++ b/README.html Sun Aug 21 20:13:05 2016 +0200 @@ -8,9 +8,9 @@

While many other spatial databases still use imprecise bounding boxes for many operations, pgLatLon supports more precise geometric calculations for all implemented operators. Efficient indexing of geometric objects is provided -using fractal indices. Optimizations on bit level (including logarithmic -compression) allow for a highly memory-efficient non-overlapping index suitable -for huge datasets.

+using space-filling fractal curves. Optimizations on bit level (including +logarithmic compression) allow for a highly memory-efficient non-overlapping +index suitable for huge datasets.

Unlike competing spatial extensions for PostgreSQL, pgLatLon is available under the permissive MIT/X11 license to avoid problems with viral licenses like the diff -r 2393084ef356 -r 4f07a22f4d45 README.mkd --- a/README.mkd Sun Aug 21 17:43:52 2016 +0200 +++ b/README.mkd Sun Aug 21 20:13:05 2016 +0200 @@ -8,9 +8,9 @@ While many other spatial databases still use imprecise bounding boxes for many operations, pgLatLon supports more precise geometric calculations for all implemented operators. Efficient indexing of geometric objects is provided -using fractal indices. Optimizations on bit level (including logarithmic -compression) allow for a highly memory-efficient non-overlapping index suitable -for huge datasets. +using space-filling fractal curves. Optimizations on bit level (including +logarithmic compression) allow for a highly memory-efficient non-overlapping +index suitable for huge datasets. Unlike competing spatial extensions for PostgreSQL, pgLatLon is available under the permissive MIT/X11 license to avoid problems with viral licenses like the