Does the new DataStax Python Driver 1.0.0 intelligently choose a coordinator that is also likely to be a replica partner for that row-key when using vnodes in C* 2.0? If so, how does it do it... just hash the row-key and see which partition range it falls in and which node owns that range?
Here is all the DataStax blog post says on this topic: "When a query is executed, a list of nodes to attempt the query against is generated. If the query fails against the first node in the list, the second node may be used, and so on. When sending a query to a node, the driver selects the least-utilized connection from that node's connection pool and issues the query." How is that list of nodes generated? Also, does the current version of the DS Java driver also intelligently choose a coordinator that is likely to already hold a replica of the row key? - SF
