Data query method, electronic device, and computer-readable storage medium
By using bitmap index parallel comparison technology and SIMD instruction set for parallel AND and equality operations, the problem of slow query speed for large data tables is solved, and fast data query is achieved.
CN116860798BActive Publication Date: 2026-01-13XFUSION DIGITAL TECH CO LTD
2 Cites 0 Cited by
Patent Information
- Application Number
- CN202310736686.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-06-20
- Publication Date
- 2026-01-13
- Estimated Expiration
- 2043-06-20
AI Technical Summary
Technical Problem
When a data table has many attributes and many tuples, the data query speed is slow, resulting in a long waiting time for users.
Method used
We employ bitmap index parallel comparison technology and utilize the SIMD instruction set to perform parallel AND and equality operations, thereby improving data query efficiency.
Benefits of technology
By comparing the bits of the bitmap index and the tuple in parallel, it is possible to quickly determine whether the tuple satisfies the query terms, which significantly improves the efficiency of data query.
✦ Generated by Eureka AI based on patent content.
Abstract
Embodiments of the present application disclose a data query method, an electronic device and a computer readable storage medium. The electronic device stores a first data table including a first tuple and a first bitmap index corresponding to the first tuple. The first tuple includes one or more queryable attribute values. The first bitmap index includes a plurality of bits arranged in sequence. The method includes receiving a query request for the first data table. The query request includes a query item including an attribute value to be queried. A second bitmap index corresponding to the query item is generated based on the attribute value to be queried. The second bitmap index corresponding to the query item and values of the plurality of bits at the same positions in the first bitmap index corresponding to the first tuple are compared simultaneously to determine whether the first tuple satisfies the query item. Embodiments of the present application can improve the efficiency of data query.
Need to check novelty before this filing date? Find Prior Art