Efficient computation of order by, order by with limit, min, and max in column-oriented databases
US11914589B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Feb 28, 2020 |
| Grant date | Feb 27, 2024 |
| Priority date | — |
| Expiry date | Jun 15, 2040 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/24557
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
In some example embodiments, there may be provided a method including detecting a query operator of a predetermined type requiring a sorting or a scanning responsive to the query operator at a column-oriented database; determining a sorted dictionary at the column-oriented database is eligible for direct access by at least checking that the column-oriented database provides sorted dictionary access and that dictionary collation and a collation of the query operator are the same; when the sorted dictionary is eligible, reading directly from the sorted dictionary a batch of sorted values; and processing, based on the batch sorted values read from the sorted dictionary, the query operator.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.