CN117312374A - Sub-table data query method, sub-table data query component and storage medium based on logic computation - Google Patents
Sub-table data query method, sub-table data query component and storage medium based on logic computation Download PDFInfo
- Publication number
- CN117312374A CN117312374A CN202311300552.XA CN202311300552A CN117312374A CN 117312374 A CN117312374 A CN 117312374A CN 202311300552 A CN202311300552 A CN 202311300552A CN 117312374 A CN117312374 A CN 117312374A
- Authority
- CN
- China
- Prior art keywords
- sub
- boundary
- data
- tables
- query
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 23
- 238000013507 mapping Methods 0.000 claims abstract description 7
- 238000004364 calculation method Methods 0.000 claims abstract description 6
- 238000012545 processing Methods 0.000 claims description 7
- 238000004590 computer program Methods 0.000 claims description 3
- 230000015556 catabolic process Effects 0.000 abstract 1
- 238000006731 degradation reaction Methods 0.000 abstract 1
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 238000012423 maintenance Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24552—Database cache management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/248—Presentation of query results
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/02—Banking, e.g. interest calculation or account maintenance
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Computational Linguistics (AREA)
- Business, Economics & Management (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Software Systems (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a sub-table data query method based on logic calculation, which is implemented by receiving query conditions; searching sub-tables in the database according to the query conditions; and sorting the retrieved sub-tables according to the date sequence, mapping the sorted sub-table marking sequence numbers and the grouped coordinates into a created virtual logic table, paging the virtual logic table according to the number of the set information pages to obtain the boundary value of the virtual logic table, calculating the boundary coordinates of each sub-table according to the boundary value of the virtual logic table, and deriving a result set to be queried according to the boundary coordinates of the sub-table. Through the method, the multiple sub-tables are integrated, sequenced and paged for marking, so that the paging inquiry function of the sub-tables is realized, and the problem of performance degradation caused by overlarge data volume is solved. Based on the traditional paging inquiry, an accurate result set can be returned according to the conditional inquiry, and meanwhile, the boundary of each page can be determined, so that the data in each table can be correctly paged.
Description
Technical Field
The invention relates to the technical field of software development, in particular to a sub-table data query method, a sub-table data query component and a storage medium based on logic computation.
Background
As banking billing data continues to grow, the amount of data in a single database may reach the hundred million levels, which may lead to problems such as reduced query performance, and in order to solve this problem, it is common practice to split and store data from a single table into multiple tables, i.e., sub-tables. However, this form of splitting may present some query difficulties, such as, for example, inability to accurately query the result set by condition, inability to determine the boundary of each page, and the like.
Existing solutions include processing individual tables and processing large data platforms, but these methods suffer from several drawbacks. For example, because of data discontinuities, an exact result set cannot be returned by conditional queries, only a partial result set of a single table can be returned. At the same time, the boundaries of each page cannot be determined, and page boundary processing across multiple tables needs to be considered to ensure that the data in each table is correctly fetched and paged. In addition, the number of data pieces returned cannot be fixed, and there is a problem of jumping pages.
Disclosure of Invention
The method, the component and the storage medium for inquiring the calculated sub-table data are used for solving the problems that in the prior art, the inquiry performance is reduced, a result set cannot be accurately inquired according to conditions, the boundary of each page cannot be determined, the number of returned data is not fixed, the page jump exists and the like.
In order to achieve the above objective, the present invention provides a method for querying sub-table data based on logic computation, which includes the steps of S1, receiving query conditions of clients;
step S2, searching sub-tables in the database according to the range of the query condition;
step S3, determining the number of sub-tables retrieved in the step S2, integrating a plurality of sub-tables, setting a virtual logic table, mapping the integrated data of the plurality of sub-tables into the virtual logic table, paging the virtual logic table according to a set rule to obtain a boundary value of the virtual logic table, calculating boundary coordinates of each sub-table according to the boundary value of the virtual logic table, and deriving a result set to be queried according to the boundary coordinates of the sub-tables;
step S4, caching the calculated value in the step S3;
and S5, combining and outputting the result set of the query.
Further, the method for integrating the sub-tables comprises the steps of listing the sub-tables according to the sequence from the date to the large, and sequentially marking serial numbers according to the sequence from the small to the large;
and sequentially listing the data numbers of the sub-tables which are listed according to the date sequence from a first sub-table, taking the data number of each sub-table as the initial number of the current sub-table according to the last data number of the last sub-table plus 1, taking the last data number of the last sub-table plus the data number of the current sub-table as the knot mantissa of the current sub-table, wherein the initial number and the ending number form an array coordinate, and the array coordinate corresponds to the sequence number one by one.
Further, the calculating the boundary coordinates of each sub-table includes the boundary coordinates of the sub-table falling on the virtual logical table paging boundary and the boundary coordinates of the sub-table not falling on the virtual logical table paging boundary;
the boundary coordinates of the sub-table falling at the virtual logical table page boundary, specifically, the two sub-pages forming the page boundary are a first page and a second page, the sub-table part falls at the first page, the boundary coordinates of the sub-table part is (0, the number of data strips from the sub-table to the page boundary), the sub-table part falls at the second page, and the boundary coordinates of the sub-table part is (the number of data strips from the sub-table to the page boundary plus 1, the number of data strips from the sub-table minus the number of data strips from the sub-table to the page boundary);
the boundary coordinates of the sub-table which do not fall at the page boundary of the virtual logical table, specifically, the boundary coordinates are (0, sub-table data bar length).
Optionally, the storing the calculated values in step S3 includes storing the array coordinates, the sequence number, the boundary values of the virtual logic table, and the boundary coordinates of each sub-table.
Optionally, the result set to be queried is derived according to the boundary coordinates of the sub-table, specifically, the stored boundary coordinates of the sub-table are called, then the data in the database are corresponding, and the corresponding data are combined and output as the result set.
Optionally, the receiving client query conditions include any one or combination of a date range query, an amount limit query, and a client code query.
A component for querying sub-table data based on logic calculation comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving query conditions of clients;
the searching unit is used for receiving the query conditions from the receiving unit and searching the sub-tables in the database according to the range of the query conditions;
the logic operation unit is used for determining the number of the sub-tables retrieved by the retrieval unit, integrating a plurality of sub-tables, setting a virtual logic table in the logic operation unit, mapping the integrated data of the plurality of sub-tables into the virtual logic table, paging the virtual logic table according to a set rule to obtain a boundary value of the virtual logic table, calculating boundary coordinates of each sub-table according to the boundary value of the virtual logic table, and deriving a result set to be queried according to the boundary coordinates of the sub-tables;
the caching unit is used for caching the calculated value of the logic operation unit;
and the output unit is used for outputting the result set of the query in a combined way.
Optionally, the search unit is provided with an identification function, and when the condition of the query is identified to be consistent with or within the range of the query condition corresponding to the cached data of the cache unit, the search unit directly calls the boundary value of the virtual logic table and the boundary coordinates of each sub table from the cache unit.
Optionally, the caching unit generates a unique caching key according to the query condition of the client.
A storage medium having stored thereon a computer program which when executed performs the steps of a method of sub-table data querying based on logical calculations as defined in any of the above.
Compared with the prior art, the method has the beneficial effects that the position of the query page in the sub-table is obtained through the established virtual logic table, and only the data in the range is required to be queried, so that the query range is reduced, and the query performance is effectively improved; the result set can be accurately inquired according to the conditions by marking the serial numbers and the array coordinates in the virtual logic table for the sub-tables; by setting the boundary value of the virtual logic table and the boundary coordinates of each sub-table, the boundary range of the corresponding sub-table of one page to be inquired can be known, and the number of returned data is also fixed; by listing a plurality of sub-tables in the virtual logic table, continuous inquiry can be carried out during inquiry, and page jump is avoided; the cache unit is arranged to cache the calculated value of the logic operation unit, so that the data fetching speed is improved, and the problem of insufficient cache caused by overlarge data volume is effectively avoided.
Drawings
FIG. 1 is a flow chart of a sub-table data query method based on logic computation according to the present invention;
FIG. 2 is a block diagram of the components of a sub-table data query based on logical computation according to the present invention.
Detailed Description
In order that the objects and advantages of the invention will become more apparent, the invention will be further described with reference to the following examples; it should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention. Preferred embodiments of the present invention are described below with reference to the accompanying drawings. It should be understood by those skilled in the art that these embodiments are merely for explaining the technical principles of the present invention, and are not intended to limit the scope of the present invention. The specific meaning of the above terms in the present invention can be understood by those skilled in the art according to the specific circumstances.
The core of the invention is to provide a sub-table data query method based on logic computation, the flow diagram of the specific implementation mode is shown in figure 1, comprising the following steps,
step S1, receiving inquiry conditions of a client, wherein the inquiry conditions comprise date range inquiry, amount limit inquiry and client code inquiry.
And step S2, searching the sub-tables in the database according to the range of the query condition.
And S3, integrating the retrieved sub-tables in a specific integration mode, namely, listing the sub-tables according to the sequence from the date to the large, marking serial numbers according to the sequence from the small to the large in sequence, and setting array coordinates for each sub-table according to the number of the data bars. Setting a virtual logic table, mapping data in a plurality of integrated sub-tables into the virtual logic table, wherein the virtual logic table performs paging according to a set rule to obtain a boundary value of the virtual logic table, and calculating boundary coordinates of each sub-table, specifically, when the boundary value of the virtual logic table falls into an array coordinate of one sub-table, the boundary coordinates of the sub-table are calculated in such a way that two pages forming a paging boundary are a first page and a second page, the sub-table part falls on the first page, the boundary coordinates thereof are (0, the number of data strips from the sub-table to the paging boundary), the sub-table part falls on the second page, and the boundary coordinates thereof are (the number of data strips from the sub-table to the paging boundary is increased by 1, and the number of data strips from the sub-table to the paging boundary is reduced by the number of data strips from the sub-table to the paging boundary); when the array coordinates of one sub-table do not contain the boundary value of any virtual logic table, the boundary coordinates of the sub-table are (0, the length of the sub-table data bar), and the result set to be queried is derived according to the boundary coordinates of the sub-table.
And S4, caching the array coordinates, the sequence numbers, the boundary values of the virtual logic tables and the boundary coordinates of each sub-table which are calculated in the step S3, so that the cached information can be conveniently used for subsequent inquiry.
And S5, calling the boundary coordinates of the stored sub-table, corresponding to the data in the database, and combining and outputting the corresponding data as a result set.
Specifically, in step S3, the number of data in several sub-tables listed according to the date sequence is listed sequentially from the first sub-table, and the number of data in each sub-table is added with 1 according to the last data in the last sub-table as the initial number of the current sub-table, the last data in the last sub-table added with the current data in the current sub-table is taken as the final number of the current sub-table, and the initial number and the final number form a set of coordinates, where the set of coordinates and the sequence numbers are in one-to-one correspondence.
The process according to the invention is illustrated in detail below,
obtaining a corresponding sub-table:
the sub-table range actually used is determined to be [ tab_20220101, tab_20220102,..tab_ 20220130] according to the date range (e.g., 20220101-20220130) in the input condition.
Obtaining the number of rows of each sub-table under the query condition:
the count () command is used to acquire the number of rows of each sub-table and the result is cached and recorded. Thus, for queries of the same condition, the number of lines can be directly obtained from the cache, avoiding repeated execution of the count () command.
Each sub-table is listed to form a virtual logic table:
the sub-tables are arranged in sequence, and the sub-table with the row number of 0 is removed. They are considered as a virtual logical table having its own length, which is the sum of the lengths of the sub-tables.
And obtaining the boundary value of the virtual logic table by paging the virtual logic table:
and paging the virtual logic table according to a table dividing mode. Assume that the length of the logical table is loc_length=
[ count1+count2+ ] +countn ] =589. Dividing loc_length by the size of each page (e.g., 100) gives a total of 6 pages, the first 5 pages being 100 records in length and the sixth 89 records. Thus, the total number of pieces and the total number of pages returned by the query condition can be determined.
Obtaining boundary coordinates of sub-tables through boundary values of the virtual logic tables:
the start and end positions of each sub-table in the entire virtual logical table are calculated. For example, TAB_20220101 has a length of 50, then its position in the virtual logic table is [0,50]. The position of the second sheet is the end of the first sheet plus 1 as the beginning of the second sheet, the end of the second sheet being equal to the end of the first sheet plus its own length 40. Similarly, the boundary coordinates of all sub-tables in the virtual logical table are calculated and recorded in the cache.
And inquiring according to the boundary coordinates of the sub-table, and combining and returning the results. For example, if the third page is queried (pageno=3), it can be derived that the record range of the third page in the virtual logical table is [201,300]. From 201 of the start position it can be determined to which sub-table the start belongs, e.g. to the range of the fifth sub-table TAB 20220107[193,226 ]. The actual execution boundary of this sub-table of TAB 20220107 is calculated to be 201-193=8. Since the logical end boundary 300 is not within TAB_20220107[193,226], the actual end execution boundary of the sub-table is the length 33 of the table and the actual execution range is [8,33]. The same way can find the sub-table where the logical end position is located and calculate the actual end position. Because the single sub-table is continuous in the virtual logical table, the sub-table between the actual start sub-table and the actual end sub-table also needs to be queried, the actual start position of the middle sub-table is 0, and the actual end position is the actual length [0, length ]. With this range, each single table can be queried and the results returned.
The position of the query page in the sub-table is acquired through the established virtual logic table, and only the data in the range is required to be queried, so that the query range is reduced, and the query performance is effectively improved; the result set can be accurately inquired according to the conditions by marking the serial numbers and the array coordinates in the virtual logic table for the sub-tables; by setting the boundary value of the virtual logic table and the boundary coordinates of each sub-table, the boundary range of the corresponding sub-table of one page to be inquired can be known, and the number of returned data is also fixed; by listing a plurality of sub-tables in the virtual logic table, continuous inquiry can be carried out during inquiry, and page jump is avoided; the cache unit is arranged to cache the calculated value of the logic operation unit, so that the data fetching speed is improved, and the problem of insufficient cache caused by overlarge data volume is effectively avoided.
The following describes a component for querying sub-table data based on logic computation according to an embodiment of the present invention, where the component for querying sub-table data based on logic computation described below and the method for querying sub-table data based on logic computation described above may be referred to correspondingly.
Fig. 2 is a block diagram of an assembly structure of a sub-table data query based on logic computation according to an embodiment of the present invention, referring to an assembly of the sub-table data query based on logic computation of fig. 2, including:
the receiving unit is used for receiving the query condition of the client;
the searching unit is used for receiving the query conditions from the receiving unit and searching the sub-tables in the database according to the range of the query conditions;
the logic operation unit is used for determining the number of the sub-tables retrieved by the retrieval unit, integrating a plurality of sub-tables, setting a virtual logic table in the logic operation unit, mapping the integrated data of the plurality of sub-tables into the virtual logic table, paging the virtual logic table according to a set rule to obtain a boundary value of the virtual logic table, calculating boundary coordinates of each sub-table according to the boundary value of the virtual logic table, and deriving a result set to be queried according to the boundary coordinates of the sub-tables.
And the caching unit is used for caching the array coordinates, the serial numbers, the boundary values of the virtual logic tables and the boundary coordinates of each sub table which are calculated in the logic operation unit.
And the output unit is used for calling the boundary coordinates of the storage sub-table, corresponding to the data in the database and combining and outputting the corresponding data as a result set.
Further, the search unit is provided with an identification function, and when the condition of the search is identified to be consistent with or within the range of the search condition corresponding to the data cached by the cache unit, the search unit directly calls the boundary value of the virtual logic table and the boundary coordinates of each sub-table from the cache unit.
A storage medium having stored thereon a computer program which when executed performs the steps of a method of sub-table data querying based on logical calculations as defined in any of the above.
When the virtual logic table is queried for the first time, the length of the virtual logic table and the result of the boundary coordinates of each sub-table can be stored in a cache according to the input condition. Results can be obtained directly from the cache for queries of the same condition without having to execute the query again.
Setting and reading of the cache by using Redis as a cache tool, a unique cache key (cache key) can be calculated by the following formula:
input_conditions= [ start date, end date, user-defined conditions ]
cache_key＝"query:"+hash(input_conditions)
The input_conditions are input conditions of the query, and are a character string or a serialized object. The input conditions are hashed to ensure that the generated cache key is unique.
By using the above formula, a unique cache key can be generated according to the input condition of the query, for storing and retrieving the query result in the Redis. Thus, when the same query is executed next time, the result can be directly obtained from the Redis cache by using the cache key without executing the query again, thereby improving the query performance.
The assembly has the advantages of light weight, convenient use, low maintenance cost and the like. It can be flexibly integrated into existing systems and does not require extensive modification of the database architecture. This reduces implementation and maintenance costs and provides good scalability.
Thus far, the technical solution of the present invention has been described in connection with the preferred embodiments shown in the drawings, but it is easily understood by those skilled in the art that the scope of protection of the present invention is not limited to these specific embodiments. Equivalent modifications and substitutions for related technical features may be made by those skilled in the art without departing from the principles of the present invention, and such modifications and substitutions will be within the scope of the present invention.
The foregoing description is only of the preferred embodiments of the invention and is not intended to limit the invention; various modifications and variations of the present invention will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A sub-table data query method based on logic calculation is characterized by comprising the following steps of,
step S1, receiving inquiry conditions of a client;
step S2, searching sub-tables in the database according to the range of the query condition;
step S3, determining the number of sub-tables retrieved in the step S2, integrating a plurality of sub-tables, setting a virtual logic table, mapping the integrated data of the plurality of sub-tables into the virtual logic table, paging the virtual logic table according to a set rule to obtain a boundary value of the virtual logic table, calculating boundary coordinates of each sub-table according to the boundary value of the virtual logic table, and deriving a result set to be queried according to the boundary coordinates of the sub-tables;
step S4, caching the calculated value in the step S3;
and S5, combining and outputting the result set of the query.
2. The method for querying sub-table data based on logic computation according to claim 1, wherein the way of integrating the sub-tables comprises the steps of listing the sub-tables in a sequence from small to large according to date, and sequentially marking sequence numbers in the sequence from small to large;
and sequentially listing the data numbers of the sub-tables which are listed according to the date sequence from a first sub-table, taking the data number of each sub-table as the initial number of the current sub-table according to the last data number of the last sub-table plus 1, taking the last data number of the last sub-table plus the data number of the current sub-table as the knot mantissa of the current sub-table, wherein the initial number and the ending number form an array coordinate, and the array coordinate corresponds to the sequence number one by one.
3. The method according to claim 2, wherein calculating boundary coordinates of each of the sub-tables includes, boundary coordinates of the sub-table falling on the virtual logical table page boundary and boundary coordinates of the sub-table not falling on the virtual logical table page boundary;
the boundary coordinates of the sub-table falling at the virtual logical table page boundary, specifically, the two sub-pages forming the page boundary are a first page and a second page, the sub-table part falls at the first page, the boundary coordinates of the sub-table part is (0, the number of data strips from the sub-table to the page boundary), the sub-table part falls at the second page, and the boundary coordinates of the sub-table part is (the number of data strips from the sub-table to the page boundary plus 1, the number of data strips from the sub-table minus the number of data strips from the sub-table to the page boundary);
the boundary coordinates of the sub-table which do not fall at the page boundary of the virtual logical table, specifically, the boundary coordinates are (0, sub-table data bar length).
4. The method according to claim 3, wherein said calculating the values in step S3 includes storing the array coordinates, the sequence numbers, the boundary values of the virtual logical table, and the boundary coordinates of each sub-table.
5. The method for querying sub-table data based on logical computation according to claim 4, wherein the result set to be queried is derived according to the boundary coordinates of the sub-table, specifically, the stored boundary coordinates of the sub-table are called, and then the data are corresponding to the data in the database, and the corresponding data are combined and output as the result set.
6. The method of claim 1, wherein the receiving client query conditions include any one or a combination of date range query, amount limit query, and client code query.
7. A component for querying sub-table data based on logic calculation, which is characterized by comprising a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving query conditions of clients;
the searching unit is used for receiving the query conditions from the receiving unit and searching the sub-tables in the database according to the range of the query conditions;
the logic operation unit is used for determining the number of the sub-tables retrieved by the retrieval unit, integrating a plurality of sub-tables, setting a virtual logic table in the logic operation unit, mapping the integrated data of the plurality of sub-tables into the virtual logic table, paging the virtual logic table according to a set rule to obtain a boundary value of the virtual logic table, calculating boundary coordinates of each sub-table according to the boundary value of the virtual logic table, and deriving a result set to be queried according to the boundary coordinates of the sub-tables;
the caching unit is used for caching the calculated values in the logic operation unit;
and the output unit is used for outputting the result set of the query in a combined way.
8. The component for querying sub-table data based on logical computation according to claim 7, wherein the retrieving unit is provided with an identifying function, and when the condition of the query is identified to be consistent with or within the range of the query condition corresponding to the cached data of the caching unit, the retrieving unit directly invokes the boundary value of the virtual logical table and the boundary coordinates of each sub-table from the caching unit.
9. The component for logically computing based sub-table data querying as recited in claim 7, wherein said caching unit generates a unique cache key based on a client query condition.
10. A storage medium having stored thereon a computer program which when executed performs the steps of the logical computation based sub-table data querying method according to any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311300552.XA CN117312374A (en) | 2023-10-09 | 2023-10-09 | Sub-table data query method, sub-table data query component and storage medium based on logic computation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311300552.XA CN117312374A (en) | 2023-10-09 | 2023-10-09 | Sub-table data query method, sub-table data query component and storage medium based on logic computation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117312374A true CN117312374A (en) | 2023-12-29 |
Family
ID=89261791
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311300552.XA Pending CN117312374A (en) | 2023-10-09 | 2023-10-09 | Sub-table data query method, sub-table data query component and storage medium based on logic computation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117312374A (en) |
-
2023
- 2023-10-09 CN CN202311300552.XA patent/CN117312374A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110321344B (en) | Information query method and device for associated data, computer equipment and storage medium | |
| US7406485B2 (en) | Shared scans utilizing query monitor during query execution to improve buffer cache utilization across multi-stream query environments | |
| US6546394B1 (en) | Database system having logical row identifiers | |
| US8176088B2 (en) | Incremental cardinality estimation for a set of data values | |
| US4774657A (en) | Index key range estimator | |
| CN107391554A (en) | Efficient distributed local sensitivity hash method | |
| EP0772836A2 (en) | A method for storing and retrieving data and a memory arrangement | |
| US7406462B2 (en) | Prediction of query difficulty for a generic search engine | |
| CN111680063B (en) | Method and device for paging query data by elastic search | |
| CN110647542A (en) | Data acquisition method and device | |
| US7191174B2 (en) | Method, query optimizer, and computer program product for implementing live switchover to temporary sparse index for faster query performance | |
| CN114281819A (en) | Data query method, device, equipment and storage medium | |
| US8255388B1 (en) | Providing a progress indicator in a database system | |
| CN117312374A (en) | Sub-table data query method, sub-table data query component and storage medium based on logic computation | |
| CN111666302A (en) | User ranking query method, device, equipment and storage medium | |
| CN113360551B (en) | Method and system for storing and rapidly counting time sequence data in shooting range | |
| CN113792171B (en) | Image retrieval method, system, equipment and storage medium based on memory management | |
| US7792825B2 (en) | Fast select for fetch first N rows with order by | |
| CN109241098B (en) | Query optimization method for distributed database | |
| CN111581440B (en) | Hardware acceleration B + tree operation device and method thereof | |
| CN111259003A (en) | Database establishing method and device | |
| CN112860712B (en) | Block chain-based transaction database construction method, system and electronic equipment | |
| CN112363986B (en) | Time optimization method for file caching | |
| CN111290803B (en) | Data preloading method, device, equipment and storage medium | |
| JPS59146339A (en) | Information retrieving system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |