Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › Early exit from table scans of loosely ordered and/or grouped relations using nearly ordered maps

Early exit from table scans of loosely ordered and/or grouped relations using nearly ordered maps

US Patent 10108651 · Granted Oct 23, 2018

Estimated economic value: $2,704,000 ⓘ

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

Editor for generating computational graphs2024
Transforming operations of a computer program for execution at a database2024
Systems and methods for dataflow graph optimization2024
Editor for generating computational graphs2023
Early exit from table scans of loosely ordered and/or grouped relations using ne2021
Early exit from table scans of loosely ordered and/or grouped relations using ne2021
Balanced partition placement in distributed databases2021
Query predicate evaluation and computation for hierarchically compressed data2021
Query predicate evaluation and computation for hierarchically compressed data2021
Hardware acceleration for a compressed computation database2020
Multi stage aggregation using digest order after a first stage of aggregation2020
Systems and methods for performing data processing operations using variable lev2020