This is an automated email from the ASF dual-hosted git repository.

mck pushed a commit to branch trunk
in repository https://gitbox.apache.org/repos/asf/cassandra-website.git


The following commit(s) were added to refs/heads/trunk by this push:
     new 207dbf1f8 add glossary terms
207dbf1f8 is described below

commit 207dbf1f831d50daa3b0b35caa348d3e9423959a
Author: Lorina Poland <lor...@datastax.com>
AuthorDate: Tue Oct 17 15:37:58 2023 -0700

    add glossary terms
    
     patch by Lorina Poland; reviewed by Mick Semb Wever for CASSANDRA-18604
---
 .../source/modules/ROOT/pages/glossary.adoc        | 430 +++++++++++++++++++--
 .../modules/ROOT/partials/a-nearest-neighbor.adoc  |   3 +
 .../source/modules/ROOT/partials/alphabet-nav.adoc |   1 +
 .../source/modules/ROOT/partials/anti-entropy.adoc |   3 +
 .../modules/ROOT/partials/authentication.adoc      |   3 +
 .../modules/ROOT/partials/authorization.adoc       |   3 +
 .../modules/ROOT/partials/back-pressure.adoc       |   3 +
 .../source/modules/ROOT/partials/bloom-filter.adoc |   3 +
 .../source/modules/ROOT/partials/bootstrap.adoc    |   3 +
 .../source/modules/ROOT/partials/cardinality.adoc  |   8 +
 .../source/modules/ROOT/partials/cell.adoc         |   4 +
 .../source/modules/ROOT/partials/cluster.adoc      |   3 +
 .../modules/ROOT/partials/clustering-column.adoc   |   6 +
 .../source/modules/ROOT/partials/clustering.adoc   |   3 +
 .../modules/ROOT/partials/coalescing-strategy.adoc |   4 +
 .../modules/ROOT/partials/column-family.adoc       |   4 +
 .../source/modules/ROOT/partials/column.adoc       |   4 +
 .../source/modules/ROOT/partials/commit-log.adoc   |   3 +
 .../source/modules/ROOT/partials/compaction.adoc   |   9 +
 .../ROOT/partials/composite-partition-key.adoc     |   3 +
 .../ROOT/partials/compound-primary-key.adoc        |   3 +
 .../modules/ROOT/partials/consistency-level.adoc   |   3 +
 .../source/modules/ROOT/partials/consistency.adoc  |   4 +
 .../modules/ROOT/partials/coordinator-node.adoc    |   3 +
 .../modules/ROOT/partials/cosine-similarity.adoc   |   3 +
 .../source/modules/ROOT/partials/cqlsh.adoc        |   3 +
 .../partials/cross-data-center-forwarding.adoc     |   4 +
 .../source/modules/ROOT/partials/data-type.adoc    |   3 +
 .../source/modules/ROOT/partials/datacenter.adoc   |   5 +
 .../modules/ROOT/partials/denormalization.adoc     |   4 +
 .../source/modules/ROOT/partials/ebnf.adoc         |   5 +
 .../source/modules/ROOT/partials/embeddings.adoc   |   3 +
 .../modules/ROOT/partials/euclidean-distance.adoc  |   3 +
 .../ROOT/partials/eventual-consistency.adoc        |   5 +
 .../modules/ROOT/partials/garbage-collector.adoc   |   4 +
 .../source/modules/ROOT/partials/gossip.adoc       |   3 +
 site-content/source/modules/ROOT/partials/hdd.adoc |   4 +
 .../source/modules/ROOT/partials/hdfs.adoc         |   4 +
 .../source/modules/ROOT/partials/headroom.adoc     |   3 +
 .../source/modules/ROOT/partials/hint.adoc         |   3 +
 .../source/modules/ROOT/partials/idempotent.adoc   |   3 +
 .../source/modules/ROOT/partials/immutable.adoc    |   3 +
 .../source/modules/ROOT/partials/index.adoc        |   3 +
 .../modules/ROOT/partials/jaccard-similarity.adoc  |   3 +
 .../source/modules/ROOT/partials/keyspace.adoc     |   3 +
 site-content/source/modules/ROOT/partials/lcs.adoc |   8 +
 .../ROOT/partials/linearizable-consistency.adoc    |   8 +
 .../modules/ROOT/partials/listen-address.adoc      |   3 +
 .../modules/ROOT/partials/machine-learning.adoc    |   3 +
 .../source/modules/ROOT/partials/mapreduce.adoc    |   4 +
 .../modules/ROOT/partials/materialized-view.adoc   |   4 +
 .../source/modules/ROOT/partials/memtable.adoc     |   3 +
 .../source/modules/ROOT/partials/mutation.adoc     |   3 +
 .../ROOT/partials/natural-language-processing.adoc |   3 +
 .../source/modules/ROOT/partials/node-repair.adoc  |   3 +
 .../source/modules/ROOT/partials/node.adoc         |   3 +
 .../modules/ROOT/partials/normalization.adoc       |   4 +
 .../source/modules/ROOT/partials/oltp.adoc         |   3 +
 .../modules/ROOT/partials/partition-index.adoc     |   3 +
 .../modules/ROOT/partials/partition-key.adoc       |   6 +
 .../modules/ROOT/partials/partition-range.adoc     |   4 +
 .../modules/ROOT/partials/partition-summary.adoc   |   4 +
 .../source/modules/ROOT/partials/partition.adoc    |   5 +
 .../source/modules/ROOT/partials/partitioner.adoc  |   4 +
 .../source/modules/ROOT/partials/primary-key.adoc  |   3 +
 .../modules/ROOT/partials/range-movement.adoc      |   3 +
 .../source/modules/ROOT/partials/read-repair.adoc  |   3 +
 .../ROOT/partials/replica-placement-strategy.adoc  |   3 +
 .../source/modules/ROOT/partials/replica.adoc      |   3 +
 .../modules/ROOT/partials/replication-factor.adoc  |   8 +
 .../modules/ROOT/partials/replication-group.adoc   |   3 +
 .../source/modules/ROOT/partials/role.adoc         |   4 +
 .../modules/ROOT/partials/rolling-restart.adoc     |   4 +
 .../source/modules/ROOT/partials/row-cache.adoc    |  11 +
 site-content/source/modules/ROOT/partials/row.adoc |   4 +
 .../source/modules/ROOT/partials/seed.adoc         |   4 +
 .../ROOT/partials/serializable-consistency.adoc    |   3 +
 .../source/modules/ROOT/partials/slice.adoc        |   3 +
 .../source/modules/ROOT/partials/snitch.adoc       |   4 +
 site-content/source/modules/ROOT/partials/ssd.adoc |   4 +
 .../source/modules/ROOT/partials/sstable.adoc      |   4 +
 .../modules/ROOT/partials/static-column.adoc       |   3 +
 .../source/modules/ROOT/partials/stcs.adoc         |   6 +
 .../source/modules/ROOT/partials/streaming.adoc    |  10 +
 .../modules/ROOT/partials/strong-consistency.adoc  |   3 +
 .../source/modules/ROOT/partials/superuser.adoc    |   7 +
 .../source/modules/ROOT/partials/table.adoc        |   5 +
 .../source/modules/ROOT/partials/token.adoc        |   6 +
 .../source/modules/ROOT/partials/tombstone.adoc    |   4 +
 site-content/source/modules/ROOT/partials/ttl.adoc |   3 +
 .../modules/ROOT/partials/tunable-consistency.adoc |   5 +
 .../source/modules/ROOT/partials/twcs.adoc         |   7 +
 site-content/source/modules/ROOT/partials/ucs.adoc |  11 +
 .../source/modules/ROOT/partials/upsert.adoc       |   3 +
 .../modules/ROOT/partials/vector-search.adoc       |   3 +
 .../source/modules/ROOT/partials/vector.adoc       |   3 +
 .../source/modules/ROOT/partials/vnode.adoc        |   6 +
 .../modules/ROOT/partials/weak-consistency.adoc    |   3 +
 .../source/modules/ROOT/partials/wide-row.adoc     |   3 +
 .../source/modules/ROOT/partials/zombie.adoc       |  11 +
 100 files changed, 800 insertions(+), 41 deletions(-)

diff --git a/site-content/source/modules/ROOT/pages/glossary.adoc 
b/site-content/source/modules/ROOT/pages/glossary.adoc
index 93f9e4372..edf46a55f 100644
--- a/site-content/source/modules/ROOT/pages/glossary.adoc
+++ b/site-content/source/modules/ROOT/pages/glossary.adoc
@@ -1,41 +1,389 @@
-= Glossary
-:page-layout: basic
-
-Cassandra::
-  Apache Cassandra is a distributed, high-available, eventually
-  consistent NoSQL open-source database.
-cluster::
-  Two or more database instances that exchange messages using the gossip
-  protocol.
-commitlog::
-  A file to which the database appends changed data for recovery in the
-  event of a hardware failure.
-datacenter::
-  A group of related nodes that are configured together within a cluster
-  for replication and workload segregation purposes. Not necessarily a
-  separate location or physical data center. Datacenter names are
-  case-sensitive and cannot be changed.
-gossip::
-  A peer-to-peer communication protocol for exchanging location and
-  state information between nodes.
-hint::
-  One of the three ways, in addition to read-repair and full/incremental
-  anti-entropy repair, that Cassandra implements the eventual
-  consistency guarantee that all updates are eventually received by all
-  replicas.
-listen address::
-  Address or interface to bind to and tell other Cassandra nodes to
-  connect to
-seed node::
-  A seed node is used to bootstrap the gossip process for new nodes
-  joining a cluster. To learn the topology of the ring, a joining node
-  contacts one of the nodes in the -seeds list in cassandra. yaml. The
-  first time you bring up a node in a new cluster, only one node is the
-  seed node.
-snitch::
-  The mapping from the IP addresses of nodes to physical and virtual
-  locations, such as racks and data centers. There are several types of
-  snitches. The type of snitch affects the request routing mechanism.
-SSTable::
-  An SSTable provides a persistent,ordered immutable map from keys to
-  values, where both keys and values are arbitrary byte strings.
+= DataStax glossary
+// shortdesc: Glossary topics.
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+== A
+
+:leveloffset: +2
+
+include::ROOT:partial$anti-entropy.adoc[]
+
+include::ROOT:partial$a-nearest-neighbor.adoc[]
+
+include::ROOT:partial$authentication.adoc[]
+
+include::ROOT:partial$authorization.adoc[]
+
+:leveloffset: -2
+
+== B
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$back-pressure.adoc[]
+
+include::ROOT:partial$bloom-filter.adoc[]
+
+include::ROOT:partial$bootstrap.adoc[]
+
+:leveloffset: -2
+
+== C
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$cardinality.adoc[]
+
+include::ROOT:partial$cell.adoc[]
+
+include::ROOT:partial$cluster.adoc[]
+
+include::ROOT:partial$clustering.adoc[]
+
+include::ROOT:partial$clustering-column.adoc[]
+
+include::ROOT:partial$coalescing-strategy.adoc[]
+
+include::ROOT:partial$column.adoc[]
+
+include::ROOT:partial$column-family.adoc[]
+
+include::ROOT:partial$commit-log.adoc[]
+
+include::ROOT:partial$compaction.adoc[]
+
+include::ROOT:partial$composite-partition-key.adoc[]
+
+include::ROOT:partial$compound-primary-key.adoc[]
+
+include::ROOT:partial$consistency.adoc[]
+
+include::ROOT:partial$consistency-level.adoc[]
+
+include::ROOT:partial$coordinator-node.adoc[]
+
+include::ROOT:partial$cosine-similarity.adoc[]
+
+include::ROOT:partial$cqlsh.adoc[]
+
+include::ROOT:partial$cross-data-center-forwarding.adoc[]
+
+:leveloffset: -2
+
+== D
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$datacenter.adoc[]
+
+include::ROOT:partial$data-type.adoc[]
+
+include::ROOT:partial$denormalization.adoc[]
+
+:leveloffset: -2
+
+== E
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$ebnf.adoc[]
+
+include::ROOT:partial$embeddings.adoc[]
+
+include::ROOT:partial$euclidean-distance.adoc[]
+
+include::ROOT:partial$eventual-consistency.adoc[]
+
+:leveloffset: -2
+
+== F
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+:leveloffset: -2
+
+== G
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$garbage-collector.adoc[]
+
+include::ROOT:partial$gossip.adoc[]
+
+:leveloffset: -2
+
+== H
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$hdd.adoc[]
+
+include::ROOT:partial$hdfs.adoc[]
+
+include::ROOT:partial$headroom.adoc[]
+
+include::ROOT:partial$hint.adoc[]
+
+:leveloffset: -2
+
+== I
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$idempotent.adoc[]
+
+include::ROOT:partial$immutable.adoc[]
+
+include::ROOT:partial$index.adoc[]
+
+:leveloffset: -2
+
+== J
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$jaccard-similarity.adoc[]
+
+:leveloffset: -2
+
+== K
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$keyspace.adoc[]
+
+:leveloffset: -2
+
+== L
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$lcs.adoc[]
+
+include::ROOT:partial$linearizable-consistency.adoc[]
+
+include::ROOT:partial$listen-address.adoc[]
+
+:leveloffset: -2
+
+== M
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$machine-learning.adoc[]
+
+include::ROOT:partial$mapreduce.adoc[]
+
+include::ROOT:partial$materialized-view.adoc[]
+
+include::ROOT:partial$memtable.adoc[]
+
+include::ROOT:partial$mutation.adoc[]
+
+:leveloffset: -2
+
+== N
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$natural-language-processing.adoc[]
+
+include::ROOT:partial$node.adoc[]
+
+include::ROOT:partial$node-repair.adoc[]
+
+include::ROOT:partial$normalization.adoc[]
+
+:leveloffset: -2
+
+== O
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$oltp.adoc[]
+
+:leveloffset: -2
+
+== P
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$partition.adoc[]
+
+include::ROOT:partial$partition-index.adoc[]
+
+include::ROOT:partial$partition-key.adoc[]
+
+include::ROOT:partial$partition-range.adoc[]
+
+include::ROOT:partial$partition-summary.adoc[]
+
+include::ROOT:partial$partitioner.adoc[]
+
+include::ROOT:partial$persistent-volume.adoc[]
+
+include::ROOT:partial$persistent-volume-claim.adoc[]
+
+include::ROOT:partial$primary-key.adoc[]
+
+:leveloffset: -2
+
+== R
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$range-movement.adoc[]
+
+include::ROOT:partial$read-repair.adoc[]
+
+include::ROOT:partial$replica.adoc[]
+
+include::ROOT:partial$replica-placement-strategy.adoc[]
+
+include::ROOT:partial$replication-factor.adoc[]
+
+include::ROOT:partial$replication-group.adoc[]
+
+include::ROOT:partial$role.adoc[]
+
+include::ROOT:partial$rolling-restart.adoc[]
+
+include::ROOT:partial$row.adoc[]
+
+include::ROOT:partial$row-cache.adoc[]
+
+:leveloffset: -2
+
+== S
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$seed.adoc[]
+
+include::ROOT:partial$segment.adoc[]
+
+include::ROOT:partial$serializable-consistency.adoc[]
+
+include::ROOT:partial$stcs.adoc[]
+
+include::ROOT:partial$slice.adoc[]
+
+include::ROOT:partial$snitch.adoc[]
+
+include::ROOT:partial$ssd.adoc[]
+
+include::ROOT:partial$sstable.adoc[]
+
+include::ROOT:partial$static-column.adoc[]
+
+include::ROOT:partial$streaming.adoc[]
+
+include::ROOT:partial$strong-consistency.adoc[]
+
+include::ROOT:partial$superuser.adoc[]
+
+:leveloffset: -2
+
+== T
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$table.adoc[]
+
+include::ROOT:partial$twcs.adoc[]
+
+include::ROOT:partial$token.adoc[]
+
+include::ROOT:partial$tombstone.adoc[]
+
+include::ROOT:partial$ttl.adoc[]
+
+include::ROOT:partial$tunable-consistency.adoc[]
+
+:leveloffset: -2
+
+== U
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$ucs.adoc[]
+
+include::ROOT:partial$upsert.adoc[]
+
+:leveloffset: -2
+
+== V
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$vector.adoc[]
+
+include::ROOT:partial$vector-search.adoc[]
+
+include::ROOT:partial$vnode.adoc[]
+
+:leveloffset: -2
+
+== W
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$weak-consistency.adoc[]
+
+include::ROOT:partial$wide-row.adoc[]
+
+:leveloffset: -2
+
+[#x-y-z]
+== X, Y, Z
+
+include::ROOT:partial$alphabet-nav.adoc[]
+
+:leveloffset: +2
+
+include::ROOT:partial$zombie.adoc[]
+
+:leveloffset: -2
\ No newline at end of file
diff --git a/site-content/source/modules/ROOT/partials/a-nearest-neighbor.adoc 
b/site-content/source/modules/ROOT/partials/a-nearest-neighbor.adoc
new file mode 100644
index 000000000..9fd52881f
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/a-nearest-neighbor.adoc
@@ -0,0 +1,3 @@
+= Approximate Nearest Neighbor (ANN)
+
+A machine learning algorithm that locates the most similar vectors to a given 
item in a dataset.
diff --git a/site-content/source/modules/ROOT/partials/alphabet-nav.adoc 
b/site-content/source/modules/ROOT/partials/alphabet-nav.adoc
new file mode 100644
index 000000000..01b38da7f
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/alphabet-nav.adoc
@@ -0,0 +1 @@
+<<A>> | <<B>> | <<C>> | <<D>> | <<E>> | <<F>> | <<G>> | <<H>> | <<I>> | <<J>> 
| <<K>> | <<L>> | <<M>> | <<N>> | <<O>> | <<P>> | <<R>> | <<S>> | <<T>> | <<U>> 
| <<V>> | <<W>> | <<x-y-z>>
\ No newline at end of file
diff --git a/site-content/source/modules/ROOT/partials/anti-entropy.adoc 
b/site-content/source/modules/ROOT/partials/anti-entropy.adoc
new file mode 100644
index 000000000..f7e58b358
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/anti-entropy.adoc
@@ -0,0 +1,3 @@
+= anti-entropy
+
+The synchronization of replica data on nodes to ensure that the data is fresh.
diff --git a/site-content/source/modules/ROOT/partials/authentication.adoc 
b/site-content/source/modules/ROOT/partials/authentication.adoc
new file mode 100644
index 000000000..886480a3f
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/authentication.adoc
@@ -0,0 +1,3 @@
+= authentication
+
+Process of establishing the identity of a user or application.
diff --git a/site-content/source/modules/ROOT/partials/authorization.adoc 
b/site-content/source/modules/ROOT/partials/authorization.adoc
new file mode 100644
index 000000000..a8c425c86
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/authorization.adoc
@@ -0,0 +1,3 @@
+= authorization
+
+Process of establishing permissions to database resources through roles.
diff --git a/site-content/source/modules/ROOT/partials/back-pressure.adoc 
b/site-content/source/modules/ROOT/partials/back-pressure.adoc
new file mode 100644
index 000000000..9fc1d2aa0
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/back-pressure.adoc
@@ -0,0 +1,3 @@
+= back pressure
+
+Pausing or blocking the buffering of incoming requests after reaching the 
threshold until the internal processing of buffered requests catches up.
\ No newline at end of file
diff --git a/site-content/source/modules/ROOT/partials/bloom-filter.adoc 
b/site-content/source/modules/ROOT/partials/bloom-filter.adoc
new file mode 100644
index 000000000..03f3c3ea3
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/bloom-filter.adoc
@@ -0,0 +1,3 @@
+= bloom filter
+
+An off-heap structure associated with each SSTable that checks if any data for 
the requested row exists in the SSTable before doing any disk I/O.
diff --git a/site-content/source/modules/ROOT/partials/bootstrap.adoc 
b/site-content/source/modules/ROOT/partials/bootstrap.adoc
new file mode 100644
index 000000000..1a652d003
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/bootstrap.adoc
@@ -0,0 +1,3 @@
+= bootstrap
+
+The process by which new nodes join the cluster transparently gathering the 
data needed from existing nodes.
diff --git a/site-content/source/modules/ROOT/partials/cardinality.adoc 
b/site-content/source/modules/ROOT/partials/cardinality.adoc
new file mode 100644
index 000000000..441327115
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/cardinality.adoc
@@ -0,0 +1,8 @@
+= cardinality
+
+The number of unique values in a column.
+For example, a column of ID numbers unique for each employee would have high 
cardinality while a column of employee ZIP codes would have low cardinality 
because multiple employees can have the same ZIP code.
+
+An index on a column with low cardinality can boost read performance because 
the index is significantly smaller than the column.
+An index for a high-cardinality column may reduce performance.
+If your application requires a search on a high-cardinality column, a 
materialized view is ideal.
diff --git a/site-content/source/modules/ROOT/partials/cell.adoc 
b/site-content/source/modules/ROOT/partials/cell.adoc
new file mode 100644
index 000000000..e0ca132b8
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/cell.adoc
@@ -0,0 +1,4 @@
+= cell
+
+The smallest increment of stored data.
+Contains a value in a row-column intersection.
diff --git a/site-content/source/modules/ROOT/partials/cluster.adoc 
b/site-content/source/modules/ROOT/partials/cluster.adoc
new file mode 100644
index 000000000..fadbd24a4
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/cluster.adoc
@@ -0,0 +1,3 @@
+= cluster
+
+Two or more database instances that exchange messages using the gossip 
protocol.
diff --git a/site-content/source/modules/ROOT/partials/clustering-column.adoc 
b/site-content/source/modules/ROOT/partials/clustering-column.adoc
new file mode 100644
index 000000000..6e01b96b7
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/clustering-column.adoc
@@ -0,0 +1,6 @@
+= clustering column
+
+In the table definition, a clustering column is a column that is part of the 
compound primary key definition.
+Note that the clustering column *cannot* be the first column because that 
position is reserved for the <<partition key>>.
+Columns are clustered in multiple rows within a single partition.
+The clustering order is determined by the position of columns in the compound 
primary key definition.
diff --git a/site-content/source/modules/ROOT/partials/clustering.adoc 
b/site-content/source/modules/ROOT/partials/clustering.adoc
new file mode 100644
index 000000000..c14358fd1
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/clustering.adoc
@@ -0,0 +1,3 @@
+= clustering
+
+The storage engine process that creates an index and keeps data in order based 
on the index.
diff --git a/site-content/source/modules/ROOT/partials/coalescing-strategy.adoc 
b/site-content/source/modules/ROOT/partials/coalescing-strategy.adoc
new file mode 100644
index 000000000..531031814
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/coalescing-strategy.adoc
@@ -0,0 +1,4 @@
+= coalescing strategy
+
+Strategy to combine multiple network messages into a single packet for 
outbound TCP connections to nodes in the same data center (intra-DC) or to 
nodes in a different data center (inter-DC).
+A coalescing strategy is provided with a blocking queue of pending messages 
and an output collection for messages to send.
diff --git a/site-content/source/modules/ROOT/partials/column-family.adoc 
b/site-content/source/modules/ROOT/partials/column-family.adoc
new file mode 100644
index 000000000..e3ed70d76
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/column-family.adoc
@@ -0,0 +1,4 @@
+= column family
+
+A container for rows, similar to the table in a relational system.
+Called a <<table>> in CQL 3.
diff --git a/site-content/source/modules/ROOT/partials/column.adoc 
b/site-content/source/modules/ROOT/partials/column.adoc
new file mode 100644
index 000000000..4754f2526
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/column.adoc
@@ -0,0 +1,4 @@
+= column
+
+The smallest increment of data.
+Contains a name, a value, and a timestamp.
diff --git a/site-content/source/modules/ROOT/partials/commit-log.adoc 
b/site-content/source/modules/ROOT/partials/commit-log.adoc
new file mode 100644
index 000000000..099057d0b
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/commit-log.adoc
@@ -0,0 +1,3 @@
+= commit log
+
+A file to which the database appends changed data for recovery in the event of 
a hardware failure.
diff --git a/site-content/source/modules/ROOT/partials/compaction.adoc 
b/site-content/source/modules/ROOT/partials/compaction.adoc
new file mode 100644
index 000000000..49d7dcd44
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/compaction.adoc
@@ -0,0 +1,9 @@
+= compaction
+
+The process of consolidating <<SSTable,SSTables>>, discarding tombstones, and 
regenerating the SSTable index.
+The available compaction strategies are:
+
+* <<UnifiedCompactionStrategy (UCS)>>
+* <<LeveledCompactionStrategy (LCS)>>
+* <<SizeTieredCompactionStrategy (STCS)>>
+* <<TimeWindowCompactionStrategy (TWCS)>>
diff --git 
a/site-content/source/modules/ROOT/partials/composite-partition-key.adoc 
b/site-content/source/modules/ROOT/partials/composite-partition-key.adoc
new file mode 100644
index 000000000..5f2190dfd
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/composite-partition-key.adoc
@@ -0,0 +1,3 @@
+= composite partition key
+
+A partition key consisting of multiple columns.
diff --git 
a/site-content/source/modules/ROOT/partials/compound-primary-key.adoc 
b/site-content/source/modules/ROOT/partials/compound-primary-key.adoc
new file mode 100644
index 000000000..651462e7e
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/compound-primary-key.adoc
@@ -0,0 +1,3 @@
+= compound primary key
+
+A primary key consisting of the partition key, which determines the node on 
which data is stored, and one or more additional <<columns,columns>> that 
determine clustering.
diff --git a/site-content/source/modules/ROOT/partials/consistency-level.adoc 
b/site-content/source/modules/ROOT/partials/consistency-level.adoc
new file mode 100644
index 000000000..7a838dfc7
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/consistency-level.adoc
@@ -0,0 +1,3 @@
+= consistency level
+
+A setting that defines a successful write or read by the number of cluster 
replicas that acknowledge the write or respond to the read request, 
respectively.
diff --git a/site-content/source/modules/ROOT/partials/consistency.adoc 
b/site-content/source/modules/ROOT/partials/consistency.adoc
new file mode 100644
index 000000000..e0d2eacc1
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/consistency.adoc
@@ -0,0 +1,4 @@
+= consistency
+
+The synchronization of data on replicas in a cluster.
+Consistency is categorized as <<weak consistency,weak>> or <<strong 
consistency,strong>>.
diff --git a/site-content/source/modules/ROOT/partials/coordinator-node.adoc 
b/site-content/source/modules/ROOT/partials/coordinator-node.adoc
new file mode 100644
index 000000000..0ea057b79
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/coordinator-node.adoc
@@ -0,0 +1,3 @@
+= coordinator node
+
+The node that determines which nodes in the ring should get the request based 
on the cluster configured snitch.
diff --git a/site-content/source/modules/ROOT/partials/cosine-similarity.adoc 
b/site-content/source/modules/ROOT/partials/cosine-similarity.adoc
new file mode 100644
index 000000000..bc8a70ad2
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/cosine-similarity.adoc
@@ -0,0 +1,3 @@
+= cosine similarity
+
+A metric measuring the similarity between two non-zero vectors in a 
multi-dimensional space. It quantifies the cosine of the angle between the 
vectors; the angle representing each vector's orientation and direction 
relative to each other. Zero (0) indicates complete dissimilarity. Negative one 
(-1) indicates exact opposite orientation of the vectors. One (1) indicates 
complete similarity.
diff --git a/site-content/source/modules/ROOT/partials/cqlsh.adoc 
b/site-content/source/modules/ROOT/partials/cqlsh.adoc
new file mode 100644
index 000000000..fbb7a6328
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/cqlsh.adoc
@@ -0,0 +1,3 @@
+= CQL shell
+
+The Cassandra Query Language shell (`cqlsh`) utility.
diff --git 
a/site-content/source/modules/ROOT/partials/cross-data-center-forwarding.adoc 
b/site-content/source/modules/ROOT/partials/cross-data-center-forwarding.adoc
new file mode 100644
index 000000000..5d85ac094
--- /dev/null
+++ 
b/site-content/source/modules/ROOT/partials/cross-data-center-forwarding.adoc
@@ -0,0 +1,4 @@
+= cross-data center forwarding
+
+A technique for optimizing replication across datacenters by sending data from 
one datacenter to a node in another datacenter. 
+The receiving node then forwards the data to other nodes in its data center. 
diff --git a/site-content/source/modules/ROOT/partials/data-type.adoc 
b/site-content/source/modules/ROOT/partials/data-type.adoc
new file mode 100644
index 000000000..cd9431b58
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/data-type.adoc
@@ -0,0 +1,3 @@
+= data type
+
+A particular kind of data item, defined by the values it can take or the 
operations that can be performed on it.
diff --git a/site-content/source/modules/ROOT/partials/datacenter.adoc 
b/site-content/source/modules/ROOT/partials/datacenter.adoc
new file mode 100644
index 000000000..769399486
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/datacenter.adoc
@@ -0,0 +1,5 @@
+= datacenter
+
+A group of related nodes that are configured together within a cluster for 
replication and workload segregation purposes.
+Not necessarily a separate location or physical data center.
+Datacenter names are case sensitive and cannot be changed.
diff --git a/site-content/source/modules/ROOT/partials/denormalization.adoc 
b/site-content/source/modules/ROOT/partials/denormalization.adoc
new file mode 100644
index 000000000..4fe146d17
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/denormalization.adoc
@@ -0,0 +1,4 @@
+= denormalization
+
+Denormalization refers to the process of optimizing the read performance of a 
database by adding redundant data or by grouping data.
+This process is accomplished by duplicating data in multiple tables or by 
grouping data for queries.
diff --git a/site-content/source/modules/ROOT/partials/ebnf.adoc 
b/site-content/source/modules/ROOT/partials/ebnf.adoc
new file mode 100644
index 000000000..5fe887837
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/ebnf.adoc
@@ -0,0 +1,5 @@
+= EBNF
+
+https://en.wikipedia.org/wiki/Extended_Backus%E2%80%93Naur_form[EBNF^] 
(Extended Backus-Naur Form) syntax expresses a context-free grammar that 
formally describes a language.
+EBNF extends its precursor BNF (Backus-Naur Form) with additional operators 
allowed in expansions.
+Syntax (railroad) diagrams graphically depict EBNF grammars.
diff --git a/site-content/source/modules/ROOT/partials/embeddings.adoc 
b/site-content/source/modules/ROOT/partials/embeddings.adoc
new file mode 100644
index 000000000..901dcb906
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/embeddings.adoc
@@ -0,0 +1,3 @@
+= embeddings
+
+A mathematical technique in machine learning where complex, high-dimensional 
data is represented as points in a lower-dimensional space. The process of 
creating an embedding preserves the relevant properties of the original data, 
such as distance and similarity, enabling easier computational processing. For 
instance, words with similar meanings in Natural Language Processing (NLP) can 
be set close to each other in the reduced space, facilitating their use in 
machine learning models.
\ No newline at end of file
diff --git a/site-content/source/modules/ROOT/partials/euclidean-distance.adoc 
b/site-content/source/modules/ROOT/partials/euclidean-distance.adoc
new file mode 100644
index 000000000..459a08000
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/euclidean-distance.adoc
@@ -0,0 +1,3 @@
+= Euclidean distance
+
+A coordinate geometry non-negative distance metric between two points, 
quantifying the similarity or dissimilarity between those data points 
represented as vectors. Use it to compare generated samples to real data points.
diff --git 
a/site-content/source/modules/ROOT/partials/eventual-consistency.adoc 
b/site-content/source/modules/ROOT/partials/eventual-consistency.adoc
new file mode 100644
index 000000000..b93edbaa6
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/eventual-consistency.adoc
@@ -0,0 +1,5 @@
+= eventual consistency
+
+The database maximizes availability and partition tolerance.
+The database ensures eventual data <<consistency>> by updating all replicas 
during read operations and periodically checking and updating any replicas not 
directly accessed.
+The updating and checking ensures that any query always returns the most 
recent version of the result set and that all replicas of any given row 
eventually become completely consistent with each other.
diff --git a/site-content/source/modules/ROOT/partials/garbage-collector.adoc 
b/site-content/source/modules/ROOT/partials/garbage-collector.adoc
new file mode 100644
index 000000000..8fb9250ea
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/garbage-collector.adoc
@@ -0,0 +1,4 @@
+= garbage collector
+
+A Java background process that frees heap memory when it is no longer in use 
by the program.
+The main Java algorithms to allocate and clean up memory are Continuous Mark 
Sweep (CMS) and Garbage-First (G1).
diff --git a/site-content/source/modules/ROOT/partials/gossip.adoc 
b/site-content/source/modules/ROOT/partials/gossip.adoc
new file mode 100644
index 000000000..d0112cab9
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/gossip.adoc
@@ -0,0 +1,3 @@
+= gossip
+
+A peer-to-peer communication protocol for exchanging location and state 
information between nodes.
diff --git a/site-content/source/modules/ROOT/partials/hdd.adoc 
b/site-content/source/modules/ROOT/partials/hdd.adoc
new file mode 100644
index 000000000..37bfaf210
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/hdd.adoc
@@ -0,0 +1,4 @@
+= HDD
+
+A hard disk drive (HDD) or spinning disk is a data storage device used for 
storing and retrieving digital information using one or more rigid rapidly 
rotating disks.
+Compare to <<SSD>>.
diff --git a/site-content/source/modules/ROOT/partials/hdfs.adoc 
b/site-content/source/modules/ROOT/partials/hdfs.adoc
new file mode 100644
index 000000000..c8ef060b0
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/hdfs.adoc
@@ -0,0 +1,4 @@
+= HDFS
+
+Hadoop Distributed File System (HDFS) stores data on nodes to improve 
performance.
+HDFS is a necessary component in addition to MapReduce in a Hadoop 
distribution.
diff --git a/site-content/source/modules/ROOT/partials/headroom.adoc 
b/site-content/source/modules/ROOT/partials/headroom.adoc
new file mode 100644
index 000000000..1671cf2ff
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/headroom.adoc
@@ -0,0 +1,3 @@
+= headroom
+
+The amount of disk space required by a process (such as compaction) in 
addition to the space occupied by the data being processed.
diff --git a/site-content/source/modules/ROOT/partials/hint.adoc 
b/site-content/source/modules/ROOT/partials/hint.adoc
new file mode 100644
index 000000000..d4ba0aa46
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/hint.adoc
@@ -0,0 +1,3 @@
+= hint
+
+One of the three ways, in addition to read-repair and full/incremental 
anti-entropy repair, that Cassandra implements the eventual consistency 
guarantee that all updates are eventually received by all replicas.
diff --git a/site-content/source/modules/ROOT/partials/idempotent.adoc 
b/site-content/source/modules/ROOT/partials/idempotent.adoc
new file mode 100644
index 000000000..a489d3e84
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/idempotent.adoc
@@ -0,0 +1,3 @@
+= idempotent
+
+An operation that can occur multiple times without changing the result, such 
as performing the same update multiple times without affecting the outcome.
diff --git a/site-content/source/modules/ROOT/partials/immutable.adoc 
b/site-content/source/modules/ROOT/partials/immutable.adoc
new file mode 100644
index 000000000..335707a22
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/immutable.adoc
@@ -0,0 +1,3 @@
+= immutable
+
+Data on a disk that cannot be overwritten.
diff --git a/site-content/source/modules/ROOT/partials/index.adoc 
b/site-content/source/modules/ROOT/partials/index.adoc
new file mode 100644
index 000000000..31fe00aea
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/index.adoc
@@ -0,0 +1,3 @@
+= index
+
+A native capability for finding a column in the database that does not involve 
using the primary key.
diff --git a/site-content/source/modules/ROOT/partials/jaccard-similarity.adoc 
b/site-content/source/modules/ROOT/partials/jaccard-similarity.adoc
new file mode 100644
index 000000000..5f1a2f44e
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/jaccard-similarity.adoc
@@ -0,0 +1,3 @@
+= Jaccard similarity
+
+A measure of similarity between two sets of features or elements in generated 
data and real data. The mathematical calculation is the size of the 
intersection of two sets divided by the size of their union, and ranges from 
zero (0) to one (1). One (1) indicates identical sets.
\ No newline at end of file
diff --git a/site-content/source/modules/ROOT/partials/keyspace.adoc 
b/site-content/source/modules/ROOT/partials/keyspace.adoc
new file mode 100644
index 000000000..4b03838ac
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/keyspace.adoc
@@ -0,0 +1,3 @@
+= keyspace
+
+A namespace container that defines how data is replicated on nodes in each 
datacenter.
diff --git a/site-content/source/modules/ROOT/partials/lcs.adoc 
b/site-content/source/modules/ROOT/partials/lcs.adoc
new file mode 100644
index 000000000..3731bbd2d
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/lcs.adoc
@@ -0,0 +1,8 @@
+= LeveledCompactionStrategy (LCS)
+
+This compaction strategy creates SSTables of a fixed, relatively small size 
that are grouped into levels.
+Within each level, SSTables are guaranteed to be non-overlapping.
+Each level (L0, L1, L2, and so on) is ten times as large as the previous level.
+Disk I/O is more uniform and predictable on higher levels than on lower levels 
as SSTables are continuously being compacted into progressively larger levels.
+At each level, row keys are merged into non-overlapping SSTables in the next 
level.
+This process improves performance for reads because the database can determine 
which SSTables in each level to check for the existence of row key data.
diff --git 
a/site-content/source/modules/ROOT/partials/linearizable-consistency.adoc 
b/site-content/source/modules/ROOT/partials/linearizable-consistency.adoc
new file mode 100644
index 000000000..031eae03f
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/linearizable-consistency.adoc
@@ -0,0 +1,8 @@
+= linearizable consistency
+
+Also called _serializable consistency_, linearizable consistency is the 
restriction that one operation cannot be executed unless and until another 
operation has completed.
+
+The database supports Lightweight transactions to ensure linearizable 
consistency in writes.
+The first phase of a Lightweight transaction works at SERIAL consistency and 
follows the Paxos protocol to ensure that the required operation succeeds.
+If this phase succeeds, the write is performed at the consistency level 
specified for the operation.
+Reads performed at the SERIAL consistency level execute without database 
built-in read repair operations.
diff --git a/site-content/source/modules/ROOT/partials/listen-address.adoc 
b/site-content/source/modules/ROOT/partials/listen-address.adoc
new file mode 100644
index 000000000..d1aba9731
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/listen-address.adoc
@@ -0,0 +1,3 @@
+= listen address
+
+Address or interface to bind to and tell other Cassandra nodes to connect to a 
node.
diff --git a/site-content/source/modules/ROOT/partials/machine-learning.adoc 
b/site-content/source/modules/ROOT/partials/machine-learning.adoc
new file mode 100644
index 000000000..04c04e351
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/machine-learning.adoc
@@ -0,0 +1,3 @@
+= Machine Learning (ML)
+
+A branch of artificial intelligence (AI) and computer science that uses and 
develops computer systems capable of learning and adapting without explicit 
instruction. ML uses algorithms and statistical models to analyze data and 
identify patterns, make decisions, and improve its system.
\ No newline at end of file
diff --git a/site-content/source/modules/ROOT/partials/mapreduce.adoc 
b/site-content/source/modules/ROOT/partials/mapreduce.adoc
new file mode 100644
index 000000000..5ff81f5bd
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/mapreduce.adoc
@@ -0,0 +1,4 @@
+= MapReduce
+
+Hadoop's parallel processing engine that quickly processes large data sets.
+A necessary component in addition to MapReduce in a Hadoop distribution.
diff --git a/site-content/source/modules/ROOT/partials/materialized-view.adoc 
b/site-content/source/modules/ROOT/partials/materialized-view.adoc
new file mode 100644
index 000000000..ea2779eb6
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/materialized-view.adoc
@@ -0,0 +1,4 @@
+= materialized view
+
+A materialized view is a table with data that is automatically inserted and 
updated from another base table.
+Has a primary key that differs from the base table, allowing the 
implementation of different queries.
diff --git a/site-content/source/modules/ROOT/partials/memtable.adoc 
b/site-content/source/modules/ROOT/partials/memtable.adoc
new file mode 100644
index 000000000..7dd63378d
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/memtable.adoc
@@ -0,0 +1,3 @@
+= memtable
+
+A database table-specific, in-memory data structure that resembles a 
write-back cache.
diff --git a/site-content/source/modules/ROOT/partials/mutation.adoc 
b/site-content/source/modules/ROOT/partials/mutation.adoc
new file mode 100644
index 000000000..0570bf7d5
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/mutation.adoc
@@ -0,0 +1,3 @@
+= mutation
+
+A mutation is either an insertion or a deletion.
diff --git 
a/site-content/source/modules/ROOT/partials/natural-language-processing.adoc 
b/site-content/source/modules/ROOT/partials/natural-language-processing.adoc
new file mode 100644
index 000000000..973ae1f99
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/natural-language-processing.adoc
@@ -0,0 +1,3 @@
+= Natural Language Processing (NLP)
+
+Helps computers interpret and share the human language to offer the best use 
for the user.
\ No newline at end of file
diff --git a/site-content/source/modules/ROOT/partials/node-repair.adoc 
b/site-content/source/modules/ROOT/partials/node-repair.adoc
new file mode 100644
index 000000000..455c5766b
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/node-repair.adoc
@@ -0,0 +1,3 @@
+= node repair
+
+A process that makes all data on a replica consistent.
diff --git a/site-content/source/modules/ROOT/partials/node.adoc 
b/site-content/source/modules/ROOT/partials/node.adoc
new file mode 100644
index 000000000..8c06ffacc
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/node.adoc
@@ -0,0 +1,3 @@
+= node
+
+A Java virtual machine (a platform-independent execution environment that 
converts Java bytecode into machine language and executes it) that runs an 
instance of the Licensed Software.
diff --git a/site-content/source/modules/ROOT/partials/normalization.adoc 
b/site-content/source/modules/ROOT/partials/normalization.adoc
new file mode 100644
index 000000000..fa1f9a8c0
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/normalization.adoc
@@ -0,0 +1,4 @@
+= normalization
+
+Normalization refers to a series of steps used to eliminate redundancy and 
reduce the chances of data inconsistency in a database's schema.
+In DataStax Enterprise, this process is inefficient because joining data in 
multiple tables for queries requires accessing more nodes.
diff --git a/site-content/source/modules/ROOT/partials/oltp.adoc 
b/site-content/source/modules/ROOT/partials/oltp.adoc
new file mode 100644
index 000000000..85766d998
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/oltp.adoc
@@ -0,0 +1,3 @@
+= OLTP
+
+Online transaction processing (OLTP) is characterized by a large number of 
short on-line transactions for data entry and retrieval.
diff --git a/site-content/source/modules/ROOT/partials/partition-index.adoc 
b/site-content/source/modules/ROOT/partials/partition-index.adoc
new file mode 100644
index 000000000..1b32a1a75
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/partition-index.adoc
@@ -0,0 +1,3 @@
+= partition index
+
+A list of primary keys and the start position of data.
diff --git a/site-content/source/modules/ROOT/partials/partition-key.adoc 
b/site-content/source/modules/ROOT/partials/partition-key.adoc
new file mode 100644
index 000000000..9a671292b
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/partition-key.adoc
@@ -0,0 +1,6 @@
+= partition key
+
+A partition keys represents a logical entity which helps a Cassandra cluster 
know on which node some requested data resides.
+
+The partition key is the first column declared in the primary key definition. 
+In a compound key, multiple columns can declare the columns that form the 
primary key.
diff --git a/site-content/source/modules/ROOT/partials/partition-range.adoc 
b/site-content/source/modules/ROOT/partials/partition-range.adoc
new file mode 100644
index 000000000..a0ccbf5bc
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/partition-range.adoc
@@ -0,0 +1,4 @@
+= partition range
+
+The limits of the partition that differ depending on the configured 
partitioner.
+Murmur3Partitioner (default) range is -2^63^ to +2^63^ and RandomPartitioner 
range is 0 to 2^127^-1.
diff --git a/site-content/source/modules/ROOT/partials/partition-summary.adoc 
b/site-content/source/modules/ROOT/partials/partition-summary.adoc
new file mode 100644
index 000000000..73fd1108e
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/partition-summary.adoc
@@ -0,0 +1,4 @@
+= partition summary
+
+A subset of the <<partition index>>.
+By default, 1 partition key out of every 128 is sampled.
diff --git a/site-content/source/modules/ROOT/partials/partition.adoc 
b/site-content/source/modules/ROOT/partials/partition.adoc
new file mode 100644
index 000000000..bb2df367d
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/partition.adoc
@@ -0,0 +1,5 @@
+= partition
+
+A partition is a collection of data addressable by a <<partition-key,key>>.
+This data resides on one node in a Cassandra cluster.
+A partition is replicated on as many nodes as the 
<<replication-factor-rf,replication factor>> specifies.
diff --git a/site-content/source/modules/ROOT/partials/partitioner.adoc 
b/site-content/source/modules/ROOT/partials/partitioner.adoc
new file mode 100644
index 000000000..5e83a48d2
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/partitioner.adoc
@@ -0,0 +1,4 @@
+= Partitioner
+
+Distributes data across a cluster.
+The types of partitioners are Murmur3Partitioner (default), RandomPartitioner, 
and OrderPreservingPartitioner.
diff --git a/site-content/source/modules/ROOT/partials/primary-key.adoc 
b/site-content/source/modules/ROOT/partials/primary-key.adoc
new file mode 100644
index 000000000..5645d4304
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/primary-key.adoc
@@ -0,0 +1,3 @@
+= primary key
+
+The partition key. One or more columns that uniquely identify a row in a 
<<table>>.
diff --git a/site-content/source/modules/ROOT/partials/range-movement.adoc 
b/site-content/source/modules/ROOT/partials/range-movement.adoc
new file mode 100644
index 000000000..60d414134
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/range-movement.adoc
@@ -0,0 +1,3 @@
+= range movement
+
+A change in the expanse of tokens assigned to a node.
diff --git a/site-content/source/modules/ROOT/partials/read-repair.adoc 
b/site-content/source/modules/ROOT/partials/read-repair.adoc
new file mode 100644
index 000000000..590fb4ee0
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/read-repair.adoc
@@ -0,0 +1,3 @@
+= read repair
+
+A process that updates database replicas with the most recent version of 
frequently-read data.
diff --git 
a/site-content/source/modules/ROOT/partials/replica-placement-strategy.adoc 
b/site-content/source/modules/ROOT/partials/replica-placement-strategy.adoc
new file mode 100644
index 000000000..848a2309a
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/replica-placement-strategy.adoc
@@ -0,0 +1,3 @@
+= replica placement strategy
+
+A specification that determines the replicas for each row of data.
diff --git a/site-content/source/modules/ROOT/partials/replica.adoc 
b/site-content/source/modules/ROOT/partials/replica.adoc
new file mode 100644
index 000000000..95d664784
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/replica.adoc
@@ -0,0 +1,3 @@
+= replica
+
+A copy of a portion of the whole database. Each node holds some replicas.
diff --git a/site-content/source/modules/ROOT/partials/replication-factor.adoc 
b/site-content/source/modules/ROOT/partials/replication-factor.adoc
new file mode 100644
index 000000000..af404b5f4
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/replication-factor.adoc
@@ -0,0 +1,8 @@
+= replication factor (RF)
+
+The total number of replicas across the cluster, abbreviated as RF.
+A replication factor of 1 means that there is only one copy of each row in the 
cluster.
+If the node containing the row goes down, the row cannot be retrieved.
+A replication factor of 2 indicates two copies of each row and that each copy 
is on a different node.
+All replicas are equally important;
+there is no primary or master replica.
diff --git a/site-content/source/modules/ROOT/partials/replication-group.adoc 
b/site-content/source/modules/ROOT/partials/replication-group.adoc
new file mode 100644
index 000000000..e0209d714
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/replication-group.adoc
@@ -0,0 +1,3 @@
+= replication group
+
+See <<datacenter>>.
diff --git a/site-content/source/modules/ROOT/partials/role.adoc 
b/site-content/source/modules/ROOT/partials/role.adoc
new file mode 100644
index 000000000..3bac4c11c
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/role.adoc
@@ -0,0 +1,4 @@
+= role
+
+A set of permissions assigned to users that limits their access to database 
resources.
+When using internal authentication, roles can also have passwords and 
represent a single user, DSE client tool, or application.
diff --git a/site-content/source/modules/ROOT/partials/rolling-restart.adoc 
b/site-content/source/modules/ROOT/partials/rolling-restart.adoc
new file mode 100644
index 000000000..37b19a6e7
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/rolling-restart.adoc
@@ -0,0 +1,4 @@
+= rolling restart
+
+A procedure that is performed during upgrading nodes in a cluster for zero 
downtime.
+Nodes are upgraded and restarted one at a time while other nodes continue to 
operate online.
diff --git a/site-content/source/modules/ROOT/partials/row-cache.adoc 
b/site-content/source/modules/ROOT/partials/row-cache.adoc
new file mode 100644
index 000000000..d2f19955b
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/row-cache.adoc
@@ -0,0 +1,11 @@
+= row cache
+
+A database component for improving the performance of read-intensive 
operations.
+In off-heap memory, the row cache holds the most recently read rows from the 
local <<SSTable,SSTables>>.
+Each local read operation stores its result set in the row cache and sends it 
to the coordinator node.
+The next read first checks the row cache.
+If the required data is there, the database returns it immediately.
+This initial read can save further seeks in the Bloom filter, partition key 
cache, partition summary, partition index, and SSTables.
+
+The database uses LRU (least-recently-used) eviction to ensure that the row 
cache is refreshed with the most frequently accessed rows.
+The size of the row cache can be configured in the cassandra.yaml file.
diff --git a/site-content/source/modules/ROOT/partials/row.adoc 
b/site-content/source/modules/ROOT/partials/row.adoc
new file mode 100644
index 000000000..d31a4ad3a
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/row.adoc
@@ -0,0 +1,4 @@
+= row
+
+1) Columns that have the same primary key. +
+2) A collection of cells per combination of columns in the storage engine.
diff --git a/site-content/source/modules/ROOT/partials/seed.adoc 
b/site-content/source/modules/ROOT/partials/seed.adoc
new file mode 100644
index 000000000..09753ffca
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/seed.adoc
@@ -0,0 +1,4 @@
+= seed
+
+A seed, or seed node, is used to bootstrap the gossip process for new nodes 
joining a cluster.
+A seed node provides no other function and is not a single point of failure 
for a cluster.
diff --git 
a/site-content/source/modules/ROOT/partials/serializable-consistency.adoc 
b/site-content/source/modules/ROOT/partials/serializable-consistency.adoc
new file mode 100644
index 000000000..494ac6767
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/serializable-consistency.adoc
@@ -0,0 +1,3 @@
+= serializable consistency
+
+See <<linearizable consistency>>.
diff --git a/site-content/source/modules/ROOT/partials/slice.adoc 
b/site-content/source/modules/ROOT/partials/slice.adoc
new file mode 100644
index 000000000..95ae2b9ea
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/slice.adoc
@@ -0,0 +1,3 @@
+= slice
+
+A set of clustered columns in a partition that you query as a set using, for 
example, a conditional WHERE clause.
diff --git a/site-content/source/modules/ROOT/partials/snitch.adoc 
b/site-content/source/modules/ROOT/partials/snitch.adoc
new file mode 100644
index 000000000..b1cfe9828
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/snitch.adoc
@@ -0,0 +1,4 @@
+= Snitch
+
+The mapping from the IP addresses of nodes to physical and virtual locations, 
such as racks and datacenters.
+The request routing mechanism is affected by which of the several types of 
snitches is used.
diff --git a/site-content/source/modules/ROOT/partials/ssd.adoc 
b/site-content/source/modules/ROOT/partials/ssd.adoc
new file mode 100644
index 000000000..cab61924d
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/ssd.adoc
@@ -0,0 +1,4 @@
+= SSD
+
+A solid-state drive (SSD) is a solid-state storage device that uses integrated 
circuits to persistently store data.
+Compare to <<HDD>>.
diff --git a/site-content/source/modules/ROOT/partials/sstable.adoc 
b/site-content/source/modules/ROOT/partials/sstable.adoc
new file mode 100644
index 000000000..3b856a1a7
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/sstable.adoc
@@ -0,0 +1,4 @@
+= SSTable
+
+A sorted string table (SSTable) is an immutable data file to which the 
database writes memtables periodically.
+SSTables are stored on disk sequentially and maintained for each database 
table.
diff --git a/site-content/source/modules/ROOT/partials/static-column.adoc 
b/site-content/source/modules/ROOT/partials/static-column.adoc
new file mode 100644
index 000000000..037cc1f4f
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/static-column.adoc
@@ -0,0 +1,3 @@
+= static column
+
+A special column that is shared by all rows of a partition.
diff --git a/site-content/source/modules/ROOT/partials/stcs.adoc 
b/site-content/source/modules/ROOT/partials/stcs.adoc
new file mode 100644
index 000000000..0cc4a6a50
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/stcs.adoc
@@ -0,0 +1,6 @@
+= SizeTieredCompactionStrategy (STCS)
+
+The default compaction strategy.
+This strategy triggers a minor compaction when there are a number of similar 
sized SSTables on disk as configured by the table subproperty, min_threshold.
+A minor compaction does not involve all the tables in a keyspace.
+Also see _STCS compaction subproperties_ in the relevant CQL documentation.
diff --git a/site-content/source/modules/ROOT/partials/streaming.adoc 
b/site-content/source/modules/ROOT/partials/streaming.adoc
new file mode 100644
index 000000000..d5722c484
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/streaming.adoc
@@ -0,0 +1,10 @@
+= streaming
+
+A component that handles data exchange among nodes in a cluster.
+It is part of the SSTable file.  +
+
+Examples include:
+
+* When bootstrapping a new node, the new node gets data from existing nodes 
using streaming.
+* When running nodetool repair, nodes exchange out-of-sync data using 
streaming.
+* When bulkloading data from backup, sstableloader uses streaming to complete 
a task.
diff --git a/site-content/source/modules/ROOT/partials/strong-consistency.adoc 
b/site-content/source/modules/ROOT/partials/strong-consistency.adoc
new file mode 100644
index 000000000..749636559
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/strong-consistency.adoc
@@ -0,0 +1,3 @@
+= strong consistency
+
+As a database reads data it performs a <<read repair>> before returning 
results.
diff --git a/site-content/source/modules/ROOT/partials/superuser.adoc 
b/site-content/source/modules/ROOT/partials/superuser.adoc
new file mode 100644
index 000000000..d47aa5a62
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/superuser.adoc
@@ -0,0 +1,7 @@
+= superuser
+
+Superuser is a role attribute that provides root database access.
+Superusers have all permissions on all objects.
+Apache Cassandra databases include the superuser role `cassandra` with 
password `cassandra` by default.
+This account runs queries, including logins, with a consistency level of 
`QUORUM`.
+It is recommended that users create a superuser for deployments and remove the 
`cassandra` role.
diff --git a/site-content/source/modules/ROOT/partials/table.adoc 
b/site-content/source/modules/ROOT/partials/table.adoc
new file mode 100644
index 000000000..30cb5d0c4
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/table.adoc
@@ -0,0 +1,5 @@
+= table
+
+A collection of columns ordered by name and fetched by row.
+A row consists of columns and has a primary key; the first part of the key is 
a column name.
+Subsequent parts of a compound key are other column names that define the 
order of columns in the table.
diff --git a/site-content/source/modules/ROOT/partials/token.adoc 
b/site-content/source/modules/ROOT/partials/token.adoc
new file mode 100644
index 000000000..0c1254c38
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/token.adoc
@@ -0,0 +1,6 @@
+= token
+
+An element on the ring that depends on the partitioner.
+Determines the node's position on the ring and the portion of data for which 
it is responsible.
+The range for the Murmur3Partitioner (default) is -2^63^ to +2^63^.
+The range for the RandomPartitioner is 0 to 2^127^-1.
diff --git a/site-content/source/modules/ROOT/partials/tombstone.adoc 
b/site-content/source/modules/ROOT/partials/tombstone.adoc
new file mode 100644
index 000000000..9cd7284da
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/tombstone.adoc
@@ -0,0 +1,4 @@
+= tombstone
+
+A marker in a row that indicates a column was deleted.
+During compaction, marked columns are deleted.
diff --git a/site-content/source/modules/ROOT/partials/ttl.adoc 
b/site-content/source/modules/ROOT/partials/ttl.adoc
new file mode 100644
index 000000000..c117b49ef
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/ttl.adoc
@@ -0,0 +1,3 @@
+= TTL
+
+Time-to-live (TTL) is an optional expiration date for values that are inserted 
into a column.
diff --git a/site-content/source/modules/ROOT/partials/tunable-consistency.adoc 
b/site-content/source/modules/ROOT/partials/tunable-consistency.adoc
new file mode 100644
index 000000000..7667233da
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/tunable-consistency.adoc
@@ -0,0 +1,5 @@
+= tunable consistency
+
+The database ensures that all replicas of any given row <<eventual 
consistency,eventually become completely consistent>>.
+For situations requiring immediate and complete consistency, the database can 
be tuned to provide 100% consistency for specified operations, datacenters, or 
clusters.
+The database cannot be tuned to complete consistency for all data and 
operations.
diff --git a/site-content/source/modules/ROOT/partials/twcs.adoc 
b/site-content/source/modules/ROOT/partials/twcs.adoc
new file mode 100644
index 000000000..d32734277
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/twcs.adoc
@@ -0,0 +1,7 @@
+= TimeWindowCompactionStrategy (TWCS)
+
+This compaction strategy compacts SSTables based on a series of time windows.
+During the current time window, the SSTables are compacted into one or more 
SSTables.
+At the end of the current time window, all SSTables are compacted into a 
single larger SSTable.
+The compaction process repeats at the start of the next time window.
+Each TWCS time window contains data within a specified range and contains 
varying amounts of data.
diff --git a/site-content/source/modules/ROOT/partials/ucs.adoc 
b/site-content/source/modules/ROOT/partials/ucs.adoc
new file mode 100644
index 000000000..abccae051
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/ucs.adoc
@@ -0,0 +1,11 @@
+= UnifiedCompactionStrategy (UCS)
+
+This compaction strategy compacts SSTables based on a series of time windows.
+During the current time window, the SSTables are compacted into one or more 
SSTables.
+At the end of the current time window, all SSTables are compacted into a 
single larger SSTable.
+The compaction process repeats at the start of the next time window.
+Each TWCS time window contains data within a specified range and contains 
varying amounts of data.
+
+Covers the applications of levelled, tiered and time-windowed compaction 
strategies, including combinations of levelled and tiered in different levels 
of the compaction hierarchy.
+This compaction can work in modes similar to <<STCS>> (with w = T4 matching 
STCS's default threshold of 4), LCS (with w = L10 to match LCS's default fan 
factor of 10), and can also work well enough for time-series workloads when 
used with a large tiered fan factor (e.g. w = T20). 
+Read-heavy workloads, especially ones that cannot benefit from bloom filters 
or time order (i.e. wide partition non-time-series) are best served by levelled 
configurations. Write-heavy, time series or key-value workloads are best served 
by tiered ones.
\ No newline at end of file
diff --git a/site-content/source/modules/ROOT/partials/upsert.adoc 
b/site-content/source/modules/ROOT/partials/upsert.adoc
new file mode 100644
index 000000000..9d1151402
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/upsert.adoc
@@ -0,0 +1,3 @@
+= upsert
+
+A change in the database that updates a specified column in a row if the 
column exists. If the column does not exist, then that column is inserted.
diff --git a/site-content/source/modules/ROOT/partials/vector-search.adoc 
b/site-content/source/modules/ROOT/partials/vector-search.adoc
new file mode 100644
index 000000000..eafab292b
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/vector-search.adoc
@@ -0,0 +1,3 @@
+= Vector Search
+
+Reviews data on a database to determine the distance between the vectors. The 
closer they are, the more similar the data. The more the distance, the less 
similar the data.
\ No newline at end of file
diff --git a/site-content/source/modules/ROOT/partials/vector.adoc 
b/site-content/source/modules/ROOT/partials/vector.adoc
new file mode 100644
index 000000000..c98d2822b
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/vector.adoc
@@ -0,0 +1,3 @@
+= Vector
+
+An array of floating point type that represents a specific object or entity.
\ No newline at end of file
diff --git a/site-content/source/modules/ROOT/partials/vnode.adoc 
b/site-content/source/modules/ROOT/partials/vnode.adoc
new file mode 100644
index 000000000..72629ec49
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/vnode.adoc
@@ -0,0 +1,6 @@
+= Vnode
+
+Vnode is a virtual node.
+Normally, nodes are responsible for a single partitioning range in the full 
token range of a cluster.
+With vnodes enabled, each node is responsible for several virtual nodes, 
effectively spreading a partitioning range across more nodes in the cluster.
+Enabling vnodes can reduce the risk of hotspotting or straining one node in 
the cluster.
diff --git a/site-content/source/modules/ROOT/partials/weak-consistency.adoc 
b/site-content/source/modules/ROOT/partials/weak-consistency.adoc
new file mode 100644
index 000000000..b391ad222
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/weak-consistency.adoc
@@ -0,0 +1,3 @@
+= weak consistency
+
+When reading data, the database performs <<read repair>> after returning 
results.
diff --git a/site-content/source/modules/ROOT/partials/wide-row.adoc 
b/site-content/source/modules/ROOT/partials/wide-row.adoc
new file mode 100644
index 000000000..00694906d
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/wide-row.adoc
@@ -0,0 +1,3 @@
+= wide row
+
+A data partition that CQL 3 transposes into familiar row-based resultsets.
diff --git a/site-content/source/modules/ROOT/partials/zombie.adoc 
b/site-content/source/modules/ROOT/partials/zombie.adoc
new file mode 100644
index 000000000..81a36f988
--- /dev/null
+++ b/site-content/source/modules/ROOT/partials/zombie.adoc
@@ -0,0 +1,11 @@
+= zombie
+
+A row or cell that reappears in a database table after deletion.
+This can happen if a node goes down for a long period of time and is then 
restored without being repaired.
+
+Deleted data is not erased from database tables; it is marked with 
<<tombstone,tombstones>> until compaction.
+The tombstones created on one node must be propagated to the nodes containing 
the deleted data.
+If one of these nodes goes down before this happens, the node may not receive 
the most up-to-date tombstones.
+If the node is not repaired before it comes back online, the database finds 
the non-tombstoned items and propagates them to other nodes as new data.
+
+To avoid this problem, run nodetool repair on any restored node before 
rejoining it to its cluster.


---------------------------------------------------------------------
To unsubscribe, e-mail: commits-unsubscr...@cassandra.apache.org
For additional commands, e-mail: commits-h...@cassandra.apache.org

Reply via email to