Techniques for evaluating query predicates during in-memory table scans
Techniques are described herein for filtering data from a table during an in-memory scan.
Predicates are pushed to in-memory scan to avoid scanning unnecessary columnar units …
Predicates are pushed to in-memory scan to avoid scanning unnecessary columnar units …
Speeding up queries in column stores: a case for compression
C Lemke, KU Sattler, F Faerber, A Zeier - Data Warehousing and …, 2010 - Springer
BI accelerator solutions like the SAP NetWeaver database engine TREX achieve high
performance when processing complex analytic queries in large data warehouses. They do …
performance when processing complex analytic queries in large data warehouses. They do …
Toward quantity-of-interest preserving lossy compression for scientific data
Today's scientific simulations and instruments are producing a large amount of data, leading
to difficulties in storing, transmitting, and analyzing these data. While error-controlled lossy …
to difficulties in storing, transmitting, and analyzing these data. While error-controlled lossy …
Methods and systems for fast set-membership tests using one or more processors that support single instruction multiple data instructions
SK Chavan, P Watanaprakornkul - US Patent 9,886,459, 2018 - Google Patents
Methods and apparatuses for determining set-membership using Single Instruction Multiple
Data (“SIMD”) architecture are presented herein. Specifically, methods and apparatuses are …
Data (“SIMD”) architecture are presented herein. Specifically, methods and apparatuses are …
Dictionary-based order-preserving string compression for main memory column stores
C Binnig, F Faerber, S Hildenbrand - US Patent 7,868,789, 2011 - Google Patents
Methods and systems are described that involve usage of dictionaries for compressing a
large set of variable-length string values with fixed-length integer keys in column stores. The …
large set of variable-length string values with fixed-length integer keys in column stores. The …
Optimizer statistics and cost model for in-memory tables
Techniques are provided for determining costs for alternative execution plans for a query,
where at least a portion of the data items required by the query are in in-memory …
where at least a portion of the data items required by the query are in in-memory …
Techniques for more efficient usage of memory-to-CPU bandwidth
LJ Ellison, A Ganesh, V Marwah, J Kamp… - US Patent …, 2013 - Google Patents
Techniques are provided for more efficiently using the bandwidth of the I/O path between a
CPU and volatile memory during the performance of database operation. Relational data …
CPU and volatile memory during the performance of database operation. Relational data …
Techniques for maintaining column vectors of relational data within volatile memory
LJ Ellison, A Ganesh, V Marwah, J Kamp… - US Patent …, 2013 - Google Patents
Techniques are provided for more efficiently using the band width of the I/O path between a
CPU and volatile memory during the performance of database operation. Relational data …
CPU and volatile memory during the performance of database operation. Relational data …
Hardware message queues for intra-cluster communication
K Aingaran, WH Bridge Jr, GF Swart, S Jairath… - US Patent …, 2015 - Google Patents
(57) ABSTRACT A method and apparatus for sending and receiving messages between
nodes on a compute cluster is provided. Communi cation between nodes on a compute …
nodes on a compute cluster is provided. Communi cation between nodes on a compute …
Database tuple-encoding-aware data partitioning in a direct memory access engine
DA Brown, S Idicula, E Schlanger, R Jain… - US Patent …, 2018 - Google Patents
Techniques provide for hardware accelerated data movement between main memory and
an on-chip data movement system that comprises multiple core processors that operate on …
an on-chip data movement system that comprises multiple core processors that operate on …