Inventor

RAMAN VIJAYSHANKAR

US125 patents

⚠️ This page may combine multiple inventors who share the name “RAMAN VIJAYSHANKAR”. Patents are grouped by organization below to help distinguish them — per-person disambiguation is on the roadmap.

RAMAN VIJAYSHANKAR

IBM

Progressive refinement of a federated query plan during query execution

Method for compressed data with reduced dictionary sizes by coding value prefixes

Reducing the cost of update, delete, and append-only insert operations in a database

Hashing scheme using compact array tables

Reducing collisions within a hash table

Dynamic and selective data source binding through a metawrapper

System and method for asynchronous data replication without persistence for distributed computing

Frequency partitioning: entropy compression with fixed size fields

System, method, and computer program product for progressive query processing

System, method, and computer program product for progressive query processing

Determining validity ranges of query plans based on suboptimality

Embracing and exploiting data skew during a join or groupby

On-the-fly encoding method for efficient grouping and aggregation

Join operation partitioning

Reducing collisions within a hash table

Efficient join with one or more large dimension tables

Dynamic and selective data source binding through a metawrapper

Transactional operations in multi-master distributed data management systems

Off-loading star join operations to a storage server

Predictable query execution through early materialization

Method, system and program for prioritizing maintenance of database tables

Microeconomic mechanism for distributed indexing

Efficient performance of insert and point query operations in a column store

On-the-fly encoding method for efficient grouping and aggregation

Efficient partitioned joins in a database with column-major layout

Switching between a non-partitioned hash join and a partitioned hash join based on an amount of available memory

Concurrent reads and inserts into a data structure without latching or waiting by readers

Parallel build of non-partitioned join hash tables and non-enforced N:1 join hash tables

Reducing the cost of update, delete, and append-only insert operations in a database

Performing batches of selective assignments in a vector friendly manner

Systems, methods and computer program products for probing a hash table for improved latency and scalability in a processing system

Pooling work across multiple transactions for reducing contention in operational analytics systems

Multilevel filters for cache-efficient access

Multilevel filters for cache-efficient access

Join operation partitioning

Hashing scheme using compact array tables

Multi-level aggregation techniques for memory hierarchies

Resolving versions in an append-only large-scale data store in distributed data management systems

System, method, and apparatus for scan-sharing for business intelligence queries in an in-memory database

Indexing for evolving large-scale datasets in multi-master hybrid transactional and analytical processing systems

Data compression using dictionary encoding

BARBER RONALD J

Predicate pushdown with late materialization in database query processing

Intra-block partitioning for database management

Intra-block partitioning for database management

ARNDT STEFAN

Efficient partitioned joins in a database with column-major layout

Efficient partitioned joins in a database with column-major layout

DRAESE OLIVER

Adaptive cell-specific dictionaries for frequency-partitioned multi-dimensional data

JOHNSON F RYAN

Method for laying out fields in a database in a hybrid of row-wise and column-wise ordering

KIM MIN-SOO

Systems, methods and computer program products for reducing hash table working-set size for improved latency and scalability in a processing system

HAN WEI

Adaptive lazy merging