Documentation ¶
Index ¶
- func LoadFormal(filename string) (*vschemapb.SrvVSchema, error)
- func LoadFormalKeyspace(filename string) (*vschemapb.Keyspace, error)
- func Register(vindexType string, newVindexFunc NewVindexFunc)
- func ValidateKeyspace(input *vschemapb.Keyspace) error
- type AutoIncrement
- type Binary
- func (vind *Binary) Cost() int
- func (vind *Binary) IsFunctional() bool
- func (vind *Binary) IsUnique() bool
- func (vind *Binary) Map(cursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
- func (*Binary) ReverseMap(_ VCursor, ksids [][]byte) ([]sqltypes.Value, error)
- func (vind *Binary) String() string
- func (vind *Binary) Verify(_ VCursor, ids []sqltypes.Value, ksids [][]byte) ([]bool, error)
- type BinaryMD5
- func (vind *BinaryMD5) Cost() int
- func (vind *BinaryMD5) IsFunctional() bool
- func (vind *BinaryMD5) IsUnique() bool
- func (vind *BinaryMD5) Map(cursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
- func (vind *BinaryMD5) String() string
- func (vind *BinaryMD5) Verify(_ VCursor, ids []sqltypes.Value, ksids [][]byte) ([]bool, error)
- type ByCost
- type Column
- type ColumnVindex
- type Hash
- func (vind *Hash) Cost() int
- func (vind *Hash) IsFunctional() bool
- func (vind *Hash) IsUnique() bool
- func (vind *Hash) Map(cursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
- func (vind *Hash) ReverseMap(_ VCursor, ksids [][]byte) ([]sqltypes.Value, error)
- func (vind *Hash) String() string
- func (vind *Hash) Verify(_ VCursor, ids []sqltypes.Value, ksids [][]byte) ([]bool, error)
- type Keyspace
- type KeyspaceSchema
- type Lookup
- type LookupHash
- func (lh *LookupHash) Cost() int
- func (lh *LookupHash) Create(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksids [][]byte, ...) error
- func (lh *LookupHash) Delete(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksid []byte) error
- func (lh *LookupHash) IsFunctional() bool
- func (lh *LookupHash) IsUnique() bool
- func (lh *LookupHash) Map(vcursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
- func (lh *LookupHash) MarshalJSON() ([]byte, error)
- func (lh *LookupHash) String() string
- func (lh *LookupHash) Update(vcursor VCursor, oldValues []sqltypes.Value, ksid []byte, ...) error
- func (lh *LookupHash) Verify(vcursor VCursor, ids []sqltypes.Value, ksids [][]byte) ([]bool, error)
- type LookupHashUnique
- func (lhu *LookupHashUnique) Cost() int
- func (lhu *LookupHashUnique) Create(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksids [][]byte, ...) error
- func (lhu *LookupHashUnique) Delete(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksid []byte) error
- func (lhu *LookupHashUnique) IsFunctional() bool
- func (lhu *LookupHashUnique) IsUnique() bool
- func (lhu *LookupHashUnique) Map(vcursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
- func (lhu *LookupHashUnique) MarshalJSON() ([]byte, error)
- func (lhu *LookupHashUnique) String() string
- func (lhu *LookupHashUnique) Update(vcursor VCursor, oldValues []sqltypes.Value, ksid []byte, ...) error
- func (lhu *LookupHashUnique) Verify(vcursor VCursor, ids []sqltypes.Value, ksids [][]byte) ([]bool, error)
- type LookupNonUnique
- func (ln *LookupNonUnique) Cost() int
- func (ln *LookupNonUnique) Create(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksids [][]byte, ...) error
- func (ln *LookupNonUnique) Delete(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksid []byte) error
- func (ln *LookupNonUnique) IsFunctional() bool
- func (ln *LookupNonUnique) IsUnique() bool
- func (ln *LookupNonUnique) Map(vcursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
- func (ln *LookupNonUnique) MarshalJSON() ([]byte, error)
- func (ln *LookupNonUnique) String() string
- func (ln *LookupNonUnique) Update(vcursor VCursor, oldValues []sqltypes.Value, ksid []byte, ...) error
- func (ln *LookupNonUnique) Verify(vcursor VCursor, ids []sqltypes.Value, ksids [][]byte) ([]bool, error)
- type LookupUnique
- func (lu *LookupUnique) Cost() int
- func (lu *LookupUnique) Create(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksids [][]byte, ...) error
- func (lu *LookupUnique) Delete(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksid []byte) error
- func (lu *LookupUnique) IsFunctional() bool
- func (lu *LookupUnique) IsUnique() bool
- func (lu *LookupUnique) Map(vcursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
- func (lu *LookupUnique) MarshalJSON() ([]byte, error)
- func (lu *LookupUnique) String() string
- func (lu *LookupUnique) Update(vcursor VCursor, oldValues []sqltypes.Value, ksid []byte, ...) error
- func (lu *LookupUnique) Verify(vcursor VCursor, ids []sqltypes.Value, ksids [][]byte) ([]bool, error)
- type NewVindexFunc
- type Null
- func (vind *Null) Cost() int
- func (vind *Null) IsFunctional() bool
- func (vind *Null) IsUnique() bool
- func (vind *Null) Map(cursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
- func (vind *Null) String() string
- func (vind *Null) Verify(cursor VCursor, ids []sqltypes.Value, ksids [][]byte) ([]bool, error)
- type Numeric
- func (*Numeric) Cost() int
- func (*Numeric) IsFunctional() bool
- func (*Numeric) IsUnique() bool
- func (*Numeric) Map(cursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
- func (*Numeric) ReverseMap(_ VCursor, ksids [][]byte) ([]sqltypes.Value, error)
- func (vind *Numeric) String() string
- func (*Numeric) Verify(_ VCursor, ids []sqltypes.Value, ksids [][]byte) ([]bool, error)
- type NumericLookupTable
- type NumericStaticMap
- func (*NumericStaticMap) Cost() int
- func (vind *NumericStaticMap) IsFunctional() bool
- func (vind *NumericStaticMap) IsUnique() bool
- func (vind *NumericStaticMap) Map(cursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
- func (vind *NumericStaticMap) String() string
- func (vind *NumericStaticMap) Verify(_ VCursor, ids []sqltypes.Value, ksids [][]byte) ([]bool, error)
- type Reversible
- type Table
- type UnicodeLooseMD5
- func (vind *UnicodeLooseMD5) Cost() int
- func (vind *UnicodeLooseMD5) IsFunctional() bool
- func (vind *UnicodeLooseMD5) IsUnique() bool
- func (vind *UnicodeLooseMD5) Map(cursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
- func (vind *UnicodeLooseMD5) String() string
- func (vind *UnicodeLooseMD5) Verify(_ VCursor, ids []sqltypes.Value, ksids [][]byte) ([]bool, error)
- type VCursor
- type VSchema
- type Vindex
- func CreateVindex(vindexType, name string, params map[string]string) (Vindex, error)
- func NewBinary(name string, _ map[string]string) (Vindex, error)
- func NewBinaryMD5(name string, _ map[string]string) (Vindex, error)
- func NewHash(name string, m map[string]string) (Vindex, error)
- func NewLookup(name string, m map[string]string) (Vindex, error)
- func NewLookupHash(name string, m map[string]string) (Vindex, error)
- func NewLookupHashUnique(name string, m map[string]string) (Vindex, error)
- func NewLookupUnique(name string, m map[string]string) (Vindex, error)
- func NewNull(name string, m map[string]string) (Vindex, error)
- func NewNumeric(name string, _ map[string]string) (Vindex, error)
- func NewNumericStaticMap(name string, params map[string]string) (Vindex, error)
- func NewUnicodeLooseMD5(name string, _ map[string]string) (Vindex, error)
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func LoadFormal ¶
func LoadFormal(filename string) (*vschemapb.SrvVSchema, error)
LoadFormal loads the JSON representation of VSchema from a file.
func LoadFormalKeyspace ¶
LoadFormalKeyspace loads the JSON representation of VSchema from a file, for a single keyspace.
func Register ¶
func Register(vindexType string, newVindexFunc NewVindexFunc)
Register registers a vindex under the specified vindexType. A duplicate vindexType will generate a panic. New vindexes will be created using these functions at the time of vschema loading.
func ValidateKeyspace ¶
ValidateKeyspace ensures that the keyspace vschema is valid. External references (like sequence) are not validated.
Types ¶
type AutoIncrement ¶
type AutoIncrement struct { Column sqlparser.ColIdent `json:"column"` Sequence *Table `json:"sequence"` }
AutoIncrement contains the auto-inc information for a table.
type Binary ¶
type Binary struct {
// contains filtered or unexported fields
}
Binary is a vindex that converts binary bits to a keyspace id.
func (*Binary) IsFunctional ¶
IsFunctional returns true since the Vindex is functional.
func (*Binary) ReverseMap ¶
ReverseMap returns the associated ids for the ksids.
type BinaryMD5 ¶
type BinaryMD5 struct {
// contains filtered or unexported fields
}
BinaryMD5 is a vindex that hashes binary bits to a keyspace id.
func (*BinaryMD5) IsFunctional ¶
IsFunctional returns true since the Vindex is functional.
type ByCost ¶
type ByCost []*ColumnVindex
ByCost provides the interface needed for ColumnVindexes to be sorted by cost order.
type Column ¶
Column describes a column.
func (*Column) MarshalJSON ¶
MarshalJSON returns a JSON representation of Column.
type ColumnVindex ¶
type ColumnVindex struct { Columns []sqlparser.ColIdent `json:"columns"` Type string `json:"type"` Name string `json:"name"` Owned bool `json:"owned,omitempty"` Vindex Vindex `json:"vindex"` }
ColumnVindex contains the index info for each index of a table.
type Hash ¶
type Hash struct {
// contains filtered or unexported fields
}
Hash defines vindex that hashes an int64 to a KeyspaceId by using null-key 3DES hash. It's Unique, Reversible and Functional.
func (*Hash) IsFunctional ¶
IsFunctional returns true since the Vindex is functional.
func (*Hash) ReverseMap ¶
ReverseMap returns the ids from ksids.
type KeyspaceSchema ¶
type KeyspaceSchema struct { Keyspace *Keyspace Tables map[string]*Table Vindexes map[string]Vindex }
KeyspaceSchema contains the schema(table) for a keyspace.
func BuildKeyspaceSchema ¶
func BuildKeyspaceSchema(input *vschemapb.Keyspace, keyspace string) (*KeyspaceSchema, error)
BuildKeyspaceSchema builds the vschema portion for one keyspace. The build ignores sequence references because those dependencies can go cross-keyspace.
func (*KeyspaceSchema) MarshalJSON ¶
func (ks *KeyspaceSchema) MarshalJSON() ([]byte, error)
MarshalJSON returns a JSON representation of KeyspaceSchema.
type Lookup ¶
type Lookup interface { // Create creates an association between ids and ksids. If ignoreMode // is true, then the Create should ignore dup key errors. Create(vc VCursor, rowsColValues [][]sqltypes.Value, ksids [][]byte, ignoreMode bool) error Delete(vc VCursor, rowsColValues [][]sqltypes.Value, ksid []byte) error // Update replaces the mapping of old values with new values for a keyspace id. Update(vc VCursor, oldValues []sqltypes.Value, ksid []byte, newValues []sqltypes.Value) error }
A Lookup vindex is one that needs to lookup a previously stored map to compute the keyspace id from an id. This means that the creation of a lookup vindex entry requires a keyspace id as input. A Lookup vindex need not be unique because the keyspace_id, which must be supplied, can be used to determine the target shard for an insert operation.
type LookupHash ¶
type LookupHash struct {
// contains filtered or unexported fields
}
LookupHash defines a vindex that uses a lookup table. The table is expected to define the id column as unique. It's NonUnique and a Lookup. Warning: This Vindex is being depcreated in favor of Lookup
func (*LookupHash) Cost ¶
func (lh *LookupHash) Cost() int
Cost returns the cost of this vindex as 20.
func (*LookupHash) Create ¶
func (lh *LookupHash) Create(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksids [][]byte, ignoreMode bool) error
Create reserves the id by inserting it into the vindex table.
func (*LookupHash) IsFunctional ¶
func (lh *LookupHash) IsFunctional() bool
IsFunctional returns false since the Vindex is not functional.
func (*LookupHash) IsUnique ¶
func (lh *LookupHash) IsUnique() bool
IsUnique returns false since the Vindex is not unique.
func (*LookupHash) Map ¶
func (lh *LookupHash) Map(vcursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
Map can map ids to key.Destination objects.
func (*LookupHash) MarshalJSON ¶
func (lh *LookupHash) MarshalJSON() ([]byte, error)
MarshalJSON returns a JSON representation of LookupHash.
func (*LookupHash) String ¶
func (lh *LookupHash) String() string
String returns the name of the vindex.
type LookupHashUnique ¶
type LookupHashUnique struct {
// contains filtered or unexported fields
}
LookupHashUnique defines a vindex that uses a lookup table. The table is expected to define the id column as unique. It's Unique and a Lookup. Warning: This Vindex is being depcreated in favor of LookupUnique
func (*LookupHashUnique) Cost ¶
func (lhu *LookupHashUnique) Cost() int
Cost returns the cost of this vindex as 10.
func (*LookupHashUnique) Create ¶
func (lhu *LookupHashUnique) Create(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksids [][]byte, ignoreMode bool) error
Create reserves the id by inserting it into the vindex table.
func (*LookupHashUnique) Delete ¶
func (lhu *LookupHashUnique) Delete(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksid []byte) error
Delete deletes the entry from the vindex table.
func (*LookupHashUnique) IsFunctional ¶
func (lhu *LookupHashUnique) IsFunctional() bool
IsFunctional returns false since the Vindex is not functional.
func (*LookupHashUnique) IsUnique ¶
func (lhu *LookupHashUnique) IsUnique() bool
IsUnique returns true since the Vindex is unique.
func (*LookupHashUnique) Map ¶
func (lhu *LookupHashUnique) Map(vcursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
Map can map ids to key.Destination objects.
func (*LookupHashUnique) MarshalJSON ¶
func (lhu *LookupHashUnique) MarshalJSON() ([]byte, error)
MarshalJSON returns a JSON representation of LookupHashUnique.
func (*LookupHashUnique) String ¶
func (lhu *LookupHashUnique) String() string
String returns the name of the vindex.
type LookupNonUnique ¶
type LookupNonUnique struct {
// contains filtered or unexported fields
}
LookupNonUnique defines a vindex that uses a lookup table and create a mapping between from ids and KeyspaceId. It's NonUnique and a Lookup.
func (*LookupNonUnique) Cost ¶
func (ln *LookupNonUnique) Cost() int
Cost returns the cost of this vindex as 20.
func (*LookupNonUnique) Create ¶
func (ln *LookupNonUnique) Create(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksids [][]byte, ignoreMode bool) error
Create reserves the id by inserting it into the vindex table.
func (*LookupNonUnique) Delete ¶
func (ln *LookupNonUnique) Delete(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksid []byte) error
Delete deletes the entry from the vindex table.
func (*LookupNonUnique) IsFunctional ¶
func (ln *LookupNonUnique) IsFunctional() bool
IsFunctional returns false since the Vindex is not functional.
func (*LookupNonUnique) IsUnique ¶
func (ln *LookupNonUnique) IsUnique() bool
IsUnique returns false since the Vindex is non unique.
func (*LookupNonUnique) Map ¶
func (ln *LookupNonUnique) Map(vcursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
Map can map ids to key.Destination objects.
func (*LookupNonUnique) MarshalJSON ¶
func (ln *LookupNonUnique) MarshalJSON() ([]byte, error)
MarshalJSON returns a JSON representation of LookupHash.
func (*LookupNonUnique) String ¶
func (ln *LookupNonUnique) String() string
String returns the name of the vindex.
type LookupUnique ¶
type LookupUnique struct {
// contains filtered or unexported fields
}
LookupUnique defines a vindex that uses a lookup table. The table is expected to define the id column as unique. It's Unique and a Lookup.
func (*LookupUnique) Cost ¶
func (lu *LookupUnique) Cost() int
Cost returns the cost of this vindex as 10.
func (*LookupUnique) Create ¶
func (lu *LookupUnique) Create(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksids [][]byte, ignoreMode bool) error
Create reserves the id by inserting it into the vindex table.
func (*LookupUnique) Delete ¶
func (lu *LookupUnique) Delete(vcursor VCursor, rowsColValues [][]sqltypes.Value, ksid []byte) error
Delete deletes the entry from the vindex table.
func (*LookupUnique) IsFunctional ¶
func (lu *LookupUnique) IsFunctional() bool
IsFunctional returns false since the Vindex is not functional.
func (*LookupUnique) IsUnique ¶
func (lu *LookupUnique) IsUnique() bool
IsUnique returns true since the Vindex is unique.
func (*LookupUnique) Map ¶
func (lu *LookupUnique) Map(vcursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
Map can map ids to key.Destination objects.
func (*LookupUnique) MarshalJSON ¶
func (lu *LookupUnique) MarshalJSON() ([]byte, error)
MarshalJSON returns a JSON representation of LookupUnique.
func (*LookupUnique) String ¶
func (lu *LookupUnique) String() string
String returns the name of the vindex.
type NewVindexFunc ¶
A NewVindexFunc is a function that creates a Vindex based on the properties specified in the input map. Every vindex must register a NewVindexFunc under a unique vindexType.
type Null ¶
type Null struct {
// contains filtered or unexported fields
}
Null defines a vindex that always return 0. It's Unique and Functional. This is useful for rows that always go into the first shard. This Vindex can be used for validating an unsharded->sharded transition. Unlike other vindexes, this one will work even for NULL input values. This will allow you to keep MySQL auto-inc columns unchanged.
func (*Null) IsFunctional ¶
IsFunctional returns true since the Vindex is functional.
type Numeric ¶
type Numeric struct {
// contains filtered or unexported fields
}
Numeric defines a bit-pattern mapping of a uint64 to the KeyspaceId. It's Unique and Reversible.
func (*Numeric) IsFunctional ¶
IsFunctional returns true since the Vindex is functional.
func (*Numeric) ReverseMap ¶
ReverseMap returns the associated ids for the ksids.
type NumericLookupTable ¶
NumericLookupTable stores the mapping of keys.
type NumericStaticMap ¶
type NumericStaticMap struct {
// contains filtered or unexported fields
}
NumericStaticMap is similar to vindex Numeric but first attempts a lookup via a JSON file.
func (*NumericStaticMap) Cost ¶
func (*NumericStaticMap) Cost() int
Cost returns the cost of this vindex as 1.
func (*NumericStaticMap) IsFunctional ¶
func (vind *NumericStaticMap) IsFunctional() bool
IsFunctional returns true since the Vindex is functional.
func (*NumericStaticMap) IsUnique ¶
func (vind *NumericStaticMap) IsUnique() bool
IsUnique returns true since the Vindex is unique.
func (*NumericStaticMap) Map ¶
func (vind *NumericStaticMap) Map(cursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
Map can map ids to key.Destination objects.
func (*NumericStaticMap) String ¶
func (vind *NumericStaticMap) String() string
String returns the name of the vindex.
type Reversible ¶
A Reversible vindex is one that can perform a reverse lookup from a keyspace id to an id. This is optional. If present, VTGate can use it to fill column values based on the target keyspace id.
type Table ¶
type Table struct { IsSequence bool `json:"is_sequence,omitempty"` Name sqlparser.TableIdent `json:"name"` Keyspace *Keyspace `json:"-"` ColumnVindexes []*ColumnVindex `json:"column_vindexes,omitempty"` Ordered []*ColumnVindex `json:"ordered,omitempty"` Owned []*ColumnVindex `json:"owned,omitempty"` AutoIncrement *AutoIncrement `json:"auto_increment,omitempty"` Columns []Column `json:"columns,omitempty"` Pinned []byte `json:"pinned,omitempty"` }
Table represents a table in VSchema.
type UnicodeLooseMD5 ¶
type UnicodeLooseMD5 struct {
// contains filtered or unexported fields
}
UnicodeLooseMD5 is a vindex that normalizes and hashes unicode strings to a keyspace id. It conservatively converts the string to its base characters before hashing. This is also known as UCA level 1. Ref: http://www.unicode.org/reports/tr10/#Multi_Level_Comparison. This is compatible with MySQL's utf8_unicode_ci collation.
func (*UnicodeLooseMD5) IsFunctional ¶
func (vind *UnicodeLooseMD5) IsFunctional() bool
IsFunctional returns true since the Vindex is functional.
func (*UnicodeLooseMD5) IsUnique ¶
func (vind *UnicodeLooseMD5) IsUnique() bool
IsUnique returns true since the Vindex is unique.
func (*UnicodeLooseMD5) Map ¶
func (vind *UnicodeLooseMD5) Map(cursor VCursor, ids []sqltypes.Value) ([]key.Destination, error)
Map can map ids to key.Destination objects.
func (*UnicodeLooseMD5) String ¶
func (vind *UnicodeLooseMD5) String() string
String returns the name of the vindex.
type VCursor ¶
type VCursor interface { Execute(method string, query string, bindvars map[string]*querypb.BindVariable, isDML bool) (*sqltypes.Result, error) ExecuteAutocommit(method string, query string, bindvars map[string]*querypb.BindVariable, isDML bool) (*sqltypes.Result, error) }
A VCursor is an interface that allows you to execute queries in the current context and session of a VTGate request. Vindexes can use this interface to execute lookup queries.
type VSchema ¶
type VSchema struct { Keyspaces map[string]*KeyspaceSchema `json:"keyspaces"` // contains filtered or unexported fields }
VSchema represents the denormalized version of SrvVSchema, used for building routing plans.
func BuildVSchema ¶
func BuildVSchema(source *vschemapb.SrvVSchema) (vschema *VSchema, err error)
BuildVSchema builds a VSchema from a SrvVSchema.
func (*VSchema) FindTable ¶
FindTable returns a pointer to the Table. If a keyspace is specified, only tables from that keyspace are searched. If the specified keyspace is unsharded and no tables matched, it's considered valid: FindTable will construct a table of that name and return it. If no kesypace is specified, then a table is returned only if its name is unique across all keyspaces. If there is only one keyspace in the vschema, and it's unsharded, then all table requests are considered valid and belonging to that keyspace.
func (*VSchema) FindTableOrVindex ¶
FindTableOrVindex finds a table or a Vindex by name using Find and FindVindex.
func (*VSchema) FindVindex ¶
FindVindex finds a vindex by name. If a keyspace is specified, only vindexes from that keyspace are searched. If no kesypace is specified, then a vindex is returned only if its name is unique across all keyspaces. The function returns an error only if the vindex name is ambiguous.
type Vindex ¶
type Vindex interface { // String returns the name of the Vindex instance. // It's used for testing and diagnostics. Use pointer // comparison to see if two objects refer to the same // Vindex. String() string // Cost is used by planbuilder to prioritize vindexes. // The cost can be 0 if the id is basically a keyspace id. // The cost can be 1 if the id can be hashed to a keyspace id. // The cost can be 2 or above if the id needs to be looked up // from an external data source. These guidelines are subject // to change in the future. Cost() int // IsUnique returns true if the Vindex is unique. // Which means Map() maps to either a KeyRange or a single KeyspaceID. IsUnique() bool // IsFunctional returns true if the Vindex can compute // the keyspace id from the id without a lookup. // A Functional vindex is also required to be Unique. // Which means Map() maps to either a KeyRange or a single KeyspaceID. IsFunctional() bool // Verify must be implented by all vindexes. It should return // true if the ids can be mapped to the keyspace ids. Verify(cursor VCursor, ids []sqltypes.Value, ksids [][]byte) ([]bool, error) // Map can map ids to key.Destination objects. // If the Vindex is unique, each id would map to either // a KeyRange, or a single KeyspaceID. // If the Vindex is non-unique, each id would map to either // a KeyRange, or a list of KeyspaceID. // If the error returned if nil, then the array len of the // key.Destination array must match len(ids). Map(cursor VCursor, ids []sqltypes.Value) ([]key.Destination, error) }
Vindex defines the interface required to register a vindex.
func CreateVindex ¶
CreateVindex creates a vindex of the specified type using the supplied params. The type must have been previously registered.
func NewBinaryMD5 ¶
NewBinaryMD5 creates a new BinaryMD5.
func NewLookup ¶
NewLookup creates a LookupNonUnique vindex. The supplied map has the following required fields:
table: name of the backing table. It can be qualified by the keyspace. from: list of columns in the table that have the 'from' values of the lookup vindex. to: The 'to' column name of the table.
The following fields are optional:
autocommit: setting this to "true" will cause inserts to upsert and deletes to be ignored. write_only: in this mode, Map functions return the full keyrange causing a full scatter.
func NewLookupHash ¶
NewLookupHash creates a LookupHash vindex. The supplied map has the following required fields:
table: name of the backing table. It can be qualified by the keyspace. from: list of columns in the table that have the 'from' values of the lookup vindex. to: The 'to' column name of the table.
The following fields are optional:
autocommit: setting this to "true" will cause inserts to upsert and deletes to be ignored. write_only: in this mode, Map functions return the full keyrange causing a full scatter.
func NewLookupHashUnique ¶
NewLookupHashUnique creates a LookupHashUnique vindex. The supplied map has the following required fields:
table: name of the backing table. It can be qualified by the keyspace. from: list of columns in the table that have the 'from' values of the lookup vindex. to: The 'to' column name of the table.
The following fields are optional:
autocommit: setting this to "true" will cause deletes to be ignored. write_only: in this mode, Map functions return the full keyrange causing a full scatter.
func NewLookupUnique ¶
NewLookupUnique creates a LookupUnique vindex. The supplied map has the following required fields:
table: name of the backing table. It can be qualified by the keyspace. from: list of columns in the table that have the 'from' values of the lookup vindex. to: The 'to' column name of the table.
The following fields are optional:
autocommit: setting this to "true" will cause deletes to be ignored. write_only: in this mode, Map functions return the full keyrange causing a full scatter.
func NewNumeric ¶
NewNumeric creates a Numeric vindex.
func NewNumericStaticMap ¶
NewNumericStaticMap creates a NumericStaticMap vindex.