This is an automated email from the ASF dual-hosted git repository.
omalley pushed a commit to branch asf-site
in repository https://gitbox.apache.org/repos/asf/orc.git
The following commit(s) were added to refs/heads/asf-site by this push:
new 4c34b2c Pushing orc-426 to site.
4c34b2c is described below
commit 4c34b2c0be77766468eedc622a14a4bf6c40b79d
Author: Owen O'Malley <[email protected]>
AuthorDate: Tue Oct 30 15:00:07 2018 -0700
Pushing orc-426 to site.
Signed-off-by: Owen O'Malley <[email protected]>
---
specification/ORCv0/index.html | 2 +-
specification/ORCv1/index.html | 6 ++----
specification/ORCv2/index.html | 6 ++----
3 files changed, 5 insertions(+), 9 deletions(-)
diff --git a/specification/ORCv0/index.html b/specification/ORCv0/index.html
index 942801d..79e3ad1 100644
--- a/specification/ORCv0/index.html
+++ b/specification/ORCv0/index.html
@@ -1099,7 +1099,7 @@ element values.</p>
<h2 id="map-columns">Map Columns</h2>
<p>Maps are encoded as the PRESENT stream and a length stream with number
-of items in each list. They have a child column for the key and
+of items in each map. They have a child column for the key and
another child column for the value.</p>
<table>
diff --git a/specification/ORCv1/index.html b/specification/ORCv1/index.html
index 0ff36ea..66922b8 100644
--- a/specification/ORCv1/index.html
+++ b/specification/ORCv1/index.html
@@ -804,8 +804,6 @@ with negative values marked by the most significant bit
set. If it that
bit is set, the entire value is negated.</li>
<li>Data values (W * L bits padded to the byte) - A sequence of W bit
positive
values that are added to the base value.</li>
- <li>Data values (W * L bits padded to the byte) - A sequence of W bit
positive
-values that are added to the base value.</li>
<li>Patch list (PLL * (PGW + PW) bytes) - A list of patches for values
that didn’t fit within W bits. Each entry in the list consists of a
gap, which is the number of elements skipped from the previous
@@ -1490,7 +1488,7 @@ element values.</p>
<h2 id="map-columns">Map Columns</h2>
<p>Maps are encoded as the PRESENT stream and a length stream with number
-of items in each list. They have a child column for the key and
+of items in each map. They have a child column for the key and
another child column for the value.</p>
<table>
@@ -1617,7 +1615,7 @@ group (default to 10,000 rows) in a column. Only the row
groups that
satisfy min/max row index evaluation will be evaluated against the
bloom filter index.</p>
-<p>Each BloomFilterEntry stores the number of hash functions (‘k’) used
+<p>Each bloom filter entry stores the number of hash functions (‘k’) used
and the bitset backing the bloom filter. The original encoding (pre
ORC-101) of bloom filters used the bitset field encoded as a repeating
sequence of longs in the bitset field with a little endian encoding
diff --git a/specification/ORCv2/index.html b/specification/ORCv2/index.html
index 42e31af..bd4d4a2 100644
--- a/specification/ORCv2/index.html
+++ b/specification/ORCv2/index.html
@@ -829,8 +829,6 @@ with negative values marked by the most significant bit
set. If it that
bit is set, the entire value is negated.</li>
<li>Data values (W * L bits padded to the byte) - A sequence of W bit
positive
values that are added to the base value.</li>
- <li>Data values (W * L bits padded to the byte) - A sequence of W bit
positive
-values that are added to the base value.</li>
<li>Patch list (PLL * (PGW + PW) bytes) - A list of patches for values
that didn’t fit within W bits. Each entry in the list consists of a
gap, which is the number of elements skipped from the previous
@@ -1506,7 +1504,7 @@ element values.</p>
<h2 id="map-columns">Map Columns</h2>
<p>Maps are encoded as the PRESENT stream and a length stream with number
-of items in each list. They have a child column for the key and
+of items in each map. They have a child column for the key and
another child column for the value.</p>
<table>
@@ -1633,7 +1631,7 @@ group (default to 10,000 rows) in a column. Only the row
groups that
satisfy min/max row index evaluation will be evaluated against the
bloom filter index.</p>
-<p>Each BloomFilterEntry stores the number of hash functions (‘k’) used
+<p>Each bloom filter entry stores the number of hash functions (‘k’) used
and the bitset backing the bloom filter. The original encoding (pre
ORC-101) of bloom filters used the bitset field encoded as a repeating
sequence of longs in the bitset field with a little endian encoding
