perf: optimize Tablet memory layout and per-query lookup speed

cassandra/cluster.py

@@ -5114,11 +5114,14 @@ def _query(self, host, message=None, cb=None):
             # TODO get connectTimeout from cluster settings
             if self.query:
                 # Pass the ring token computed once for this request so the pool
-                # can select the shard without re-hashing the routing key.
+                # can select the shard without re-hashing the routing key, and
+                # the tablet found during query planning so the pool can skip a
+                # redundant lookup in the tablet map.
                 connection, request_id = pool.borrow_connection(
                     timeout=2.0, routing_key=self.query.routing_key,
                     keyspace=self.query.keyspace, table=self.query.table,
-                    routing_token=self._routing_token)
+                    routing_token=self._routing_token,
+                    tablet=getattr(self.query, '_tablet', None))
             else:
                 connection, request_id = pool.borrow_connection(timeout=2.0)
             self._connection = connection

cassandra/policies.py

@@ -537,6 +537,11 @@ def make_query_plan(self, working_keyspace=None, query=None):
 
         child = self._child_policy
         if query is None or query.routing_key is None or keyspace is None:
+            if query is not None:
+                # A Statement (e.g. BoundStatement) can be rebound and
+                # re-executed by the caller; make sure a tablet stashed by
+                # an earlier, unrelated execution isn't picked up below.
+                query._tablet = None
             for host in child.make_query_plan(keyspace, query):
                 yield host
             return
@@ -553,10 +558,13 @@ def make_query_plan(self, working_keyspace=None, query=None):
         tablet = self._cluster_metadata._tablets.get_tablet_for_key(keyspace, query.table, token)
 
         if tablet is not None:
-            replicas_mapped = set(map(lambda r: r[0], tablet.replicas))
+            replica_dict = tablet._replica_dict
             child_plan = child.make_query_plan(keyspace, query)
 
-            replicas = [host for host in child_plan if host.host_id in replicas_mapped]
+            replicas = [host for host in child_plan if host.host_id in replica_dict]
+            # Stash the tablet so that downstream shard-aware connection
+            # selection can reuse it instead of repeating the bisect lookup.
+            query._tablet = tablet
 
             # The leader concept only exists for strongly-consistent keyspaces,
             # which today means exactly the keyspaces whose consistency mode is
@@ -596,6 +604,12 @@ def make_query_plan(self, working_keyspace=None, query=None):
                                 break
         else:
             replicas = self._cluster_metadata.get_replicas(keyspace, query.routing_key)
+            # Clear any tablet stashed by a previous execution of this same
+            # query object (statements may be rebound and reused, e.g. via
+            # BoundStatement.bind()) so a stale tablet -- for a different
+            # routing key -- isn't reused for shard-aware connection
+            # selection below.
+            query._tablet = None
 
         if self.shuffle_replicas and not query.is_lwt() and not ConsistencyLevel.is_serial(query.consistency_level):
             shuffle(replicas)

cassandra/pool.py

@@ -442,7 +442,7 @@ def __init__(self, host, host_distance, session):
 
         log.debug("Finished initializing connection for host %s", self.host)
 
-    def _get_connection_for_routing_key(self, routing_key=None, keyspace=None, table=None, routing_token=None):
+    def _get_connection_for_routing_key(self, routing_key=None, keyspace=None, table=None, routing_token=None, tablet=None):
         if self.is_shutdown:
             raise ConnectionException(
                 "Pool for %s is shutdown" % (self.host,), self.host)
@@ -463,19 +463,19 @@ def _get_connection_for_routing_key(self, routing_key=None, keyspace=None, table
             if t is None and metadata.token_map is not None and metadata.can_support_partitioner():
                 t = metadata.token_map.token_class.from_key(routing_key)
             if t is not None and self.supports_tablet_routing and table is not None:
-                if keyspace is None:
-                    keyspace = self._keyspace
+                # Reuse the tablet found during query planning when available,
+                # avoiding a redundant bisect lookup in the tablet map.
+                if tablet is None:
+                    if keyspace is None:
+                        keyspace = self._keyspace
 
-                tablet = self._session.cluster.metadata._tablets.get_tablet_for_key(keyspace, table, t)
+                    tablet = self._session.cluster.metadata._tablets.get_tablet_for_key(keyspace, table, t)
 
                 # In both V1 and V2 the request is sent to this host, so we pick
                 # the shard that this host owns for the tablet. Leader-aware host
                 # selection (V2) happens earlier, in the load balancing policy.
                 if tablet is not None:
-                    for replica in tablet.replicas:
-                        if replica[0] == self.host.host_id:
-                            shard_id = replica[1]
-                            break
+                    shard_id = tablet._replica_dict.get(self.host.host_id)
 
             if shard_id is None and t is not None:
                 shard_id = self.host.sharding_info.shard_id_from_token(t.value)
@@ -518,15 +518,15 @@ def _get_connection_for_routing_key(self, routing_key=None, keyspace=None, table
             return random.choice(active_connections)
         return random.choice(list(self._connections.values()))
 
-    def borrow_connection(self, timeout, routing_key=None, keyspace=None, table=None, routing_token=None):
-        conn = self._get_connection_for_routing_key(routing_key, keyspace, table, routing_token)
+    def borrow_connection(self, timeout, routing_key=None, keyspace=None, table=None, routing_token=None, tablet=None):
+        conn = self._get_connection_for_routing_key(routing_key, keyspace, table, routing_token, tablet)
         start = time.time()
         remaining = timeout
         last_retry = False
         while True:
             if conn.is_closed:
                 # The connection might have been closed in the meantime - if so, try again
-                conn = self._get_connection_for_routing_key(routing_key, keyspace, table, routing_token)
+                conn = self._get_connection_for_routing_key(routing_key, keyspace, table, routing_token, tablet)
             with conn.lock:
                 if (not conn.is_closed or last_retry) and conn.in_flight < conn.max_request_id:
                     # On last retry we ignore connection status, since it is better to return closed connection than

cassandra/tablets.py

@@ -1,14 +1,9 @@
 from bisect import bisect_left
-from operator import attrgetter
 from random import getrandbits
 from threading import Lock
 from typing import Optional
 from uuid import UUID
 
-# C-accelerated attrgetter avoids per-call lambda allocation overhead
-_get_first_token = attrgetter("first_token")
-_get_last_token = attrgetter("last_token")
-
 
 def choose_tablet_version_block(tablet_version: int) -> int:
     """
@@ -42,39 +37,39 @@ class Tablet(object):
     It stores information about each replica, its host and shard,
     and the token interval in the format (first_token, last_token].
     """
-    first_token = 0
-    last_token = 0
-    replicas = None
-    # uint64 hash; None means unknown -- a cold start, or a tablet learned over
+# uint64 hash; None means unknown -- a cold start, or a tablet learned over
     # TABLETS_ROUTING_V1, which does not report a version.
-    tablet_version = None
+    __slots__ = ('first_token', 'last_token', 'replicas', 'tablet_version', '_replica_dict')
 
     def __init__(self, first_token=0, last_token=0, replicas=None, tablet_version=None):
         self.first_token = first_token
         self.last_token = last_token
-        self.replicas = replicas
+        # Materialize once: `replicas` may be a one-shot iterator, and both
+        # the tuple and the lookup dict must come from the same iteration.
+        self.replicas = tuple(replicas) if replicas is not None else None
+        self._replica_dict = {r[0]: r[1] for r in self.replicas} if self.replicas else {}
         self.tablet_version = tablet_version
 
     def __str__(self):
         return "<Tablet: first_token=%s last_token=%s replicas=%s tablet_version=%s>" \
                % (self.first_token, self.last_token, self.replicas, self.tablet_version)
     __repr__ = __str__
 
-    @staticmethod
-    def _is_valid_tablet(replicas):
-        return replicas is not None and len(replicas) != 0
-
     @staticmethod
     def from_row(first_token, last_token, replicas, tablet_version=None):
-        if Tablet._is_valid_tablet(replicas):
-            if tablet_version is not None:
-                # tablet_version is an unsigned 64-bit value, but it is
-                # deserialized from the wire as a signed LongType; normalize it
-                # back to unsigned so it matches the server's representation.
-                tablet_version &= 0xFFFFFFFFFFFFFFFF
-            tablet = Tablet(first_token, last_token, replicas, tablet_version)
-            return tablet
-        return None
+        # Materialize once: `replicas` may be a one-shot iterator (e.g. a
+        # generator), and a plain `if not replicas` truthiness check would
+        # always be False for such an object even when it yields nothing,
+        # since iterators have no __len__/__bool__ and are always truthy.
+        replicas_tuple = tuple(replicas) if replicas is not None else ()
+        if not replicas_tuple:
+            return None
+        if tablet_version is not None:
+            # tablet_version is an unsigned 64-bit value, but it is
+            # deserialized from the wire as a signed LongType; normalize it
+            # back to unsigned so it matches the server's representation.
+            tablet_version &= 0xFFFFFFFFFFFFFFFF
+        return Tablet(first_token, last_token, replicas_tuple, tablet_version)
 
     @property
     def leader(self) -> Optional[UUID]:
@@ -104,37 +99,53 @@ def leader(self) -> Optional[UUID]:
         return self.replicas[0][0]
 
     def replica_contains_host_id(self, uuid: UUID) -> bool:
-        for replica in self.replicas:
-            if replica[0] == uuid:
-                return True
-        return False
+        return uuid in self._replica_dict
 
+    def get_replica_shard_id(self, uuid: UUID) -> Optional[int]:
+        return self._replica_dict.get(uuid)
 
-class Tablets(object):
-    _lock = None
-    _tablets = {}
 
+class Tablets(object):
     def __init__(self, tablets):
-        self._tablets = tablets
+        # NOTE: these are intentionally instance attributes only (not class
+        # attributes) to avoid mutable class-level dicts being shared across
+        # instances, e.g. if a future alternative constructor were to bypass
+        # __init__.
         self._lock = Lock()
+        self._tablets = tablets
+        # Build parallel token index lists from any pre-populated data
+        # (keyspace, table) -> list[int] for both _first_tokens/_last_tokens
+        self._first_tokens = {
+            key: [t.first_token for t in tlist]
+            for key, tlist in tablets.items()
+        }
+        self._last_tokens = {
+            key: [t.last_token for t in tlist]
+            for key, tlist in tablets.items()
+        }
 
     def table_has_tablets(self, keyspace, table) -> bool:
         return bool(self._tablets.get((keyspace, table), []))
 
     def get_tablet_for_key(self, keyspace, table, t):
-        tablet = self._tablets.get((keyspace, table), [])
-        if not tablet:
+        key = (keyspace, table)
+        last_tokens = self._last_tokens.get(key)
+        if not last_tokens:
             return None
 
-        id = bisect_left(tablet, t.value, key=_get_last_token)
-        if id < len(tablet) and t.value > tablet[id].first_token:
-            return tablet[id]
+        token_value = t.value
+        id = bisect_left(last_tokens, token_value)
+        if id < len(last_tokens) and token_value > self._first_tokens[key][id]:
+            return self._tablets[key][id]
         return None
 
     def drop_tablets(self, keyspace: str, table: Optional[str] = None):
         with self._lock:
             if table is not None:
-                self._tablets.pop((keyspace, table), None)
+                key = (keyspace, table)
+                self._tablets.pop(key, None)
+                self._first_tokens.pop(key, None)
+                self._last_tokens.pop(key, None)
                 return
 
             to_be_deleted = []
@@ -144,36 +155,48 @@ def drop_tablets(self, keyspace: str, table: Optional[str] = None):
 
             for key in to_be_deleted:
                 del self._tablets[key]
+                self._first_tokens.pop(key, None)
+                self._last_tokens.pop(key, None)
 
     def drop_tablets_by_host_id(self, host_id: Optional[UUID]):
         if host_id is None:
             return
         with self._lock:
             for key, tablets in self._tablets.items():
-                to_be_deleted = []
-                for tablet_id, tablet in enumerate(tablets):
-                    if tablet.replica_contains_host_id(host_id):
-                        to_be_deleted.append(tablet_id)
-
-                for tablet_id in reversed(to_be_deleted):
-                    tablets.pop(tablet_id)
+                # Filter in one pass instead of popping one-by-one (O(n) vs O(k*n))
+                keep = [i for i, t in enumerate(tablets)
+                        if not t.replica_contains_host_id(host_id)]
+                if len(keep) == len(tablets):
+                    continue  # nothing to drop
+                self._tablets[key] = [tablets[i] for i in keep]
+                first = self._first_tokens[key]
+                last = self._last_tokens[key]
+                self._first_tokens[key] = [first[i] for i in keep]
+                self._last_tokens[key] = [last[i] for i in keep]
 
     def add_tablet(self, keyspace, table, tablet):
         with self._lock:
-            tablets_for_table = self._tablets.setdefault((keyspace, table), [])
+            key = (keyspace, table)
+            tablets_for_table = self._tablets.setdefault(key, [])
+            first_tokens = self._first_tokens.setdefault(key, [])
+            last_tokens = self._last_tokens.setdefault(key, [])
 
             # find first overlapping range
-            start = bisect_left(tablets_for_table, tablet.first_token, key=_get_first_token)
-            if start > 0 and tablets_for_table[start - 1].last_token > tablet.first_token:
+            start = bisect_left(first_tokens, tablet.first_token)
+            if start > 0 and last_tokens[start - 1] > tablet.first_token:
                 start = start - 1
 
             # find last overlapping range
-            end = bisect_left(tablets_for_table, tablet.last_token, key=_get_last_token)
-            if end < len(tablets_for_table) and tablets_for_table[end].first_token >= tablet.last_token:
+            end = bisect_left(last_tokens, tablet.last_token)
+            if end < len(last_tokens) and first_tokens[end] >= tablet.last_token:
                 end = end - 1
 
             if start <= end:
                 del tablets_for_table[start:end + 1]
+                del first_tokens[start:end + 1]
+                del last_tokens[start:end + 1]
 
             tablets_for_table.insert(start, tablet)
+            first_tokens.insert(start, tablet.first_token)
+            last_tokens.insert(start, tablet.last_token)
 

tests/unit/test_policies.py

@@ -1393,6 +1393,64 @@ def test_no_shuffle_for_serial_consistency(self, patched_shuffle):
                 assert patched_shuffle.call_count == 0, \
                     "shuffle should not be called for consistency level %s" % cl
 
+    def test_stale_tablet_not_reused_across_query_plans(self):
+        """
+        A Statement (e.g. a BoundStatement) may be rebound and re-executed by
+        the caller, so the same query object can be passed to
+        make_query_plan() multiple times with a different routing key each
+        time. Verify that a tablet stashed on the query object for shard-aware
+        connection selection (query._tablet) from one call doesn't leak into
+        a later call for which no tablet is found -- otherwise downstream
+        shard selection could pick a shard belonging to an unrelated,
+        previously-looked-up tablet.
+        """
+        cluster = self._prepare_cluster_with_tablets()
+        hosts = cluster.metadata.all_hosts()
+        tablet = cluster.metadata._tablets.get_tablet_for_key.return_value
+
+        child_policy = Mock()
+        child_policy.make_query_plan.return_value = hosts
+        child_policy.distance.return_value = HostDistance.LOCAL
+
+        policy = TokenAwarePolicy(child_policy, shuffle_replicas=False)
+        policy.populate(cluster, hosts)
+
+        query = Statement(routing_key='routing_key', keyspace='keyspace')
+        list(policy.make_query_plan('keyspace', query))
+        self.assertIs(query._tablet, tablet)
+
+        # Same (reused) query object, but this time no tablet is found for
+        # the (new) routing key -- e.g. it hasn't been discovered yet, or
+        # the table isn't tablets-based.
+        cluster.metadata._tablets.get_tablet_for_key.return_value = None
+        list(policy.make_query_plan('keyspace', query))
+        self.assertIsNone(query._tablet)
+
+    def test_stale_tablet_not_reused_when_no_routing_key(self):
+        """
+        Same as above, but covers the early-return path (no routing key /
+        no keyspace), which must also clear any previously stashed tablet.
+        """
+        cluster = self._prepare_cluster_with_tablets()
+        hosts = cluster.metadata.all_hosts()
+        tablet = cluster.metadata._tablets.get_tablet_for_key.return_value
+
+        child_policy = Mock()
+        child_policy.make_query_plan.return_value = hosts
+        child_policy.distance.return_value = HostDistance.LOCAL
+
+        policy = TokenAwarePolicy(child_policy, shuffle_replicas=False)
+        policy.populate(cluster, hosts)
+
+        query = Statement(routing_key='routing_key', keyspace='keyspace')
+        list(policy.make_query_plan('keyspace', query))
+        self.assertIs(query._tablet, tablet)
+
+        # Reuse the same statement without a routing key this time.
+        query.routing_key = None
+        list(policy.make_query_plan('keyspace', query))
+        self.assertIsNone(query._tablet)
+
 
 class ConvictionPolicyTest(unittest.TestCase):
     def test_not_implemented(self):