DYNAMIC MODIFICATION OF A DATABASE DATA STRUCTURE
A self-optimizing database machine is provided in which data structures are evolved (e.g., added, dropped and changed) in response to database commands received from a client at a database. Algorithms may be pushed to one or more processors located at a drive and performed in parallel (e.g., via vec...
Saved in:
| Format | Patent |
|---|---|
| Language | English |
| Published |
03.02.2015
|
| Online Access | Get full text |
Cover
| Summary: | A self-optimizing database machine is provided in which data structures are evolved (e.g., added, dropped and changed) in response to database commands received from a client at a database. Algorithms may be pushed to one or more processors located at a drive and performed in parallel (e.g., via vector or other processing) to increase operational speed of a database. New or modified database structures and/or algorithms may be compiled into object code (e.g., native low-level assembler code that can be run directly on the processor) to be executed on a processor co-located or embedded in a storage device. New or modified database structures and/or algorithms may be dynamically loaded into the chip pathways as custom gate arrays (e.g., in an FPGA) at a component of a database system (e.g., a processor co-located or embedded in a storage device storing a shard or a collection of micro-shards of a database). |
|---|