Query method based on regional bitmap indexes in cloud environment
A technology of bitmap index and query method, applied in the field of information, can solve the problems of reducing system throughput, consuming large computing resources, etc., and achieving the effect of avoiding computing resource overhead and good scalability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0051] Example 1: Given a company's employee information table, set the table attribute to A 1 Indicates the gender of the employee, including male male and female female; attribute A 2 Record employee salary, the value is an integer in the range [0, 3000]. First, attribute A 1 The value domain of is divided into two sub-domains, including only male and female respectively; attribute A 2 The value range of is divided into three subfields: [0, 1000], (1000, 2000] and (2000, 3000]. Consider employee 1, whose gender is male and salary is 1300, then the bit string corresponding to employee 1 It is: '10010'. The first two digits of '10' represent attribute A 1 The upper value is male, and the last three digits of '010' indicate that his salary is within the range (1000,2000]. Then consider employee 2, assuming that his gender is female and his salary is 2600, then the bit string corresponding to this employee is: '01001 '. The first two '01' represent attribute A 1 The upper v...
example 2
[0053] Example 2: The assumptions about the employee information table are the same as Example 1. Such as Figure 5 As shown, assume that the table has a total of 7 records on a certain data node. Since B=6, the length of the indicated bitmap on this data node is 6. And since this data node only contains tuples with sort values 1, 3, 4, and 5, its indication bitmap should be: 101110.
[0054] Indicates that the bitmap records the presence of a local property value. When a query request arrives at a distributed data node, it first determines whether the data node contains the target tuple by comparing the indicator bitmap, and if not, returns a null value directly without executing the retrieval task. The comparison of the indicated bitmaps is accomplished through the bitwise logical AND operation of the bit strings.
example 3
[0055] Example 3: The assumptions about the employee information table are the same as Example 1. Such as Figure 5 As shown, assume that the table has a total of 7 records on a certain data node. It can be seen from example 3 that the indicated bitmap is 101110. Assuming that the user sends a query for employees whose gender is female and whose salary range is within (1000,2000], the corresponding bit string of the target record can be generated accordingly, and its sorting value is 2. Therefore, the constructed bit string 01000 and the existence of 101110 Perform logical bitwise AND: 01000&101110=0, the result is all zeros, so there is no target tuple on this node, and an empty set can be directly returned as the query result of this node.
[0056] Finally, a bitmap index is established for the locally managed data on each data node.
[0057] Similar to the above-mentioned distributed solution, this method also adopts the way that the data nodes independently manage the i...
PUM

Abstract
Description
Claims
Application Information

- Generate Ideas
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com