have to fall back to individual inserts in order to implement the above algorithm 42 for rows that yield dup keys. For simplicity, we may not do bulk insert in the initial implementation. ### What won’t • A table can have multiple Vindexes. • Vindexes can be NonUnique, which allows a column value to yield multiple keyspace IDs. • Vindexes can be a simple function or be based on a lookup table. • Vindexes non-unique index. It is a secondary index for searching by an alternate WHERE clause. An input value could yield multiple keyspace IDs, and rows could be matched from multiple shards. For example, if a table has

will have to fall back to individual inserts in order to implement the above algorithm for rows that yield dup keys. For simplicity, we may not do bulk insert in the initial implementation. What won’t work • A table can have multiple Vindexes. • Vindexes can be NonUnique, which allows a column value to yield multiple keyspace IDs. 141 • Vindexes can be a simple function or be based on a lookup table. • non-unique index. It is a secondary index for searching by an alternate WHERE clause. An input value could yield multiple keyspace IDs, and rows could be matched from multiple shards. For example, if a table has

have to fall back to individual inserts in order to implement the above algorithm 43 for rows that yield dup keys. For simplicity, we may not do bulk insert in the initial implementation. ### What won’t • A table can have multiple Vindexes. • Vindexes can be NonUnique, which allows a column value to yield multiple keyspace IDs. • Vindexes can be a simple function or be based on a lookup table. • Vindexes non-unique index. It is a secondary index for searching by an alternate WHERE clause. An input value could yield multiple keyspace IDs, and rows could be matched from multiple shards. For example, if a table has

will have to fall back to individual inserts in order to implement the above algorithm for rows that yield dup keys. For simplicity, we may not do bulk insert in the initial implementation. What won’t work • A table can have multiple Vindexes. • Vindexes can be NonUnique, which allows a column value to yield multiple keyspace IDs. • Vindexes can be a simple function or be based on a lookup table. • Vindexes non-unique index. It is a secondary index for searching by an alternate WHERE clause. An input value could yield multiple keyspace IDs, and rows could be matched from multiple shards. For example, if a table has

penetration testing against the Vitess system in scope. Given that the manual source code audit did not yield an overly large number of findings, the second approach was added as means to maximize the test coverage

A table can have multiple Vindexes. • Vindexes could be NonUnique, which allows a column value to yield multiple keyspace IDs. • They could be a simple function or be based on a lookup table. • They could non-unique index. It is a secondary index for searching by an alternate WHERE clause. An input value could yield multiple keyspace IDs, and rows could be matched from multiple shards. For example, if a table has

A table can have multiple Vindexes. • Vindexes could be NonUnique, which allows a column value to yield multiple keyspace IDs. • They could be a simple function or be based on a lookup table. • They could non-unique index. It is a secondary index for searching by an alternate WHERE clause. An input value could yield multiple keyspace IDs, and rows could be matched from multiple shards. For example, if a table has

A table can have multiple Vindexes. • Vindexes could be NonUnique, which allows a column value to yield multiple keyspace IDs. • They could be a simple function or be based on a lookup table. • They could non-unique index. It is a secondary index for searching by an alternate WHERE clause. An input value could yield multiple keyspace IDs, and rows could be matched from multiple shards. For example, if a table has

• A table can have multiple Vindexes. • Vindexes can be NonUnique, which allows a column value to yield multiple keyspace IDs. • Vindexes can be a simple function or be based on a lookup table. • Vindexes non-unique index. It is a secondary index for searching by an alternate WHERE clause. An input value could yield multiple keyspace IDs, and rows could be matched from multiple shards. For example, if a table has