CN116166660A - Method and device for compressing Cartesian product data combination - Google Patents
Method and device for compressing Cartesian product data combination Download PDFInfo
- Publication number
- CN116166660A CN116166660A CN202211577006.6A CN202211577006A CN116166660A CN 116166660 A CN116166660 A CN 116166660A CN 202211577006 A CN202211577006 A CN 202211577006A CN 116166660 A CN116166660 A CN 116166660A
- Authority
- CN
- China
- Prior art keywords
- data
- combination
- cartesian product
- index
- compressing
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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/2228—Indexing structures
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0608—Saving storage space on storage systems
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0644—Management of space entities, e.g. partitions, extents, pools
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The embodiment of the invention relates to the technical field of data processing, and discloses a method for compressing Cartesian product data combination, which comprises the following steps: sequentially acquiring one data combination in the Cartesian product data combination sets, and creating a corresponding index scheme to an index set in a corresponding data structure based on the data combination; acquiring a data item from the data combination, and judging whether the data item exists in a data source or not; returning subscript information of the data item in the data source; writing the subscript information into a corresponding index scheme; returning the subscript information of all data items of the data combination; the data source and index set are stored. According to the invention, the data items in the data combination are stored in the data source, and the index scheme which is the same as the data combination structure is constructed, so that repeated data storage and transmission are avoided, the data storage space is reduced, and the data transmission efficiency is improved.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a method and a device for compressing Cartesian product data combination.
Background
Cartesian products, also known as direct products, have the mathematical expression: a×b; which means that the first object is a member of a and the second object is one member of all possible ordered pairs of B.
From the cartesian product characteristics, it is known that there will be more repeated data in the cartesian product data combination set, for example, the data source set a has 2 data (a, B) and the set B has 3 data (c, d, e), the cartesian product (a×b) scheme set has 6 schemes for 12 data, respectively, (a, c), (a, d), (a, e), (B, c), (B, d), (B, e), and it can be seen that the data of a and B appear in the a×b multiple times (such as the data a and B appear repeatedly multiple times), and when we need to store and remotely transmit such combined data, we need to store and transmit more repeated data, resulting in unnecessary resource waste.
Disclosure of Invention
In view of the defects, the embodiment of the invention discloses a method for compressing Cartesian product data combination, which is characterized in that data items in the data combination are stored in a data source, and an index scheme which is the same as a data combination structure is constructed, so that repeated data are prevented from being stored and transmitted, the storage space of the data is reduced, and the transmission efficiency of the data is improved.
The first aspect of the embodiment of the invention discloses a method for compressing Cartesian product data combination, which comprises the following steps:
s1: sequentially obtaining one data combination in a Cartesian product data combination set, wherein the Cartesian product data combination set comprises at least one data combination;
s2: creating a corresponding indexing scheme to an index set in a corresponding data structure based on the data combination, the data structure comprising a data source and an index set;
s3: acquiring a data item from the data combination, and judging whether the data item exists in a data source or not; if yes, the subscript information of the data item in the data source is returned; if not, adding the data item to the tail end of the data source queue, and returning the subscript information of the data item;
s4: writing the index information into a corresponding index scheme;
s5: repeating the step S3 until the subscript information of all the data items of the data combination is returned;
s6: and storing the data source and the index set.
As an optional implementation manner, in the first aspect of the embodiment of the present invention, the storing the data source and the index set includes:
distributing a data source memory space for the data source in a memory;
dividing the memory space of the data source into a plurality of storage units M which are sequentially arranged according to the number of data items in the Cartesian product data combination set, and marking subscript information for each storage unit M according to the sequence;
and sequentially storing the data items in the storage unit M according to the processing sequence.
As an optional implementation manner, in the first aspect of the embodiment of the present invention, the storing the data source and the index set includes:
allocating an index set memory space for the index set in a memory;
dividing the memory space of the index set into a plurality of storage units N according to the number of data combinations in the Cartesian product data combination set, wherein the data structure of the storage units N is the same as that of the data combinations;
the indexing schemes are sequentially stored in the storage unit N, respectively.
In an optional implementation manner, in the first aspect of the embodiment of the present invention, the subscript information is sequentially arranged arabic numerals or has sequential symbol marks.
As an alternative implementation manner, in the first aspect of the embodiment of the present invention, the data combination includes at least 2 data items.
As an optional implementation manner, in the first aspect of the embodiment of the present invention, the method for compressing the combination of cartesian product data further includes: decompressing the compressed combination of cartesian product data;
the decompression comprises the steps of:
s7: acquiring an index scheme from a storage unit N;
s8: returning data items in the storage unit M corresponding to the index information according to the index information in the index scheme;
s9: steps S7 to S8 are performed for the indexing scheme in each storage unit N.
As an optional implementation manner, in the first aspect of the embodiment of the present invention, the data item includes one or more of video, image, text, web data, and location data.
A second aspect of an embodiment of the present invention discloses an apparatus for compressing a combination of cartesian product data, comprising:
and a data storage module: a data item and indexing scheme for storing a Cartesian product data set;
and a judging module: for determining whether a data combination obtained from the set of cartesian product data combinations is already present in the data source;
the execution module: and the data source queue is used for returning the subscript information of the data item in the data source according to the judging result of the judging module or adding the data item to the end of the data source queue and returning the subscript information of the data item.
A third aspect of an embodiment of the present invention discloses an electronic device, including: a memory storing executable program code; a processor coupled to the memory; the processor invokes the executable program code stored in the memory for performing the method of compressing the combination of cartesian product data as disclosed in the first aspect of the embodiment of the invention.
A fourth aspect of the embodiments of the present invention discloses a computer-readable storage medium storing a computer program, wherein the computer program causes a computer to perform the method of compressing cartesian product data combinations disclosed in the first aspect of the embodiments of the present invention.
Compared with the prior art, the embodiment of the invention has the following beneficial effects:
according to the embodiment of the invention, the data items in the data combination are stored in the data source, and the index scheme which is the same as the data combination structure is constructed, so that repeated data storage and transmission are avoided, the storage space of the data is reduced, and the data transmission efficiency is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow diagram of a method of compressing Cartesian product data combinations in accordance with the present disclosure;
FIG. 2 is a schematic diagram of data items of a data source set A and a data source set B according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a data structure of a compressed Cartesian combination of data sets formed by a data source set A and a data source set B according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of the steps of storing a data source according to the present invention;
FIG. 5 is a schematic diagram illustrating steps for storing an index set according to the present invention;
FIG. 6 is a schematic diagram of the decompression step of the present invention for a compressed Cartesian combination of data;
FIG. 7 is a schematic diagram of an apparatus for compressing Cartesian product data combinations according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
It should be noted that the terms "first," "second," "third," "fourth," and the like in the description and in the claims of the present invention are used for distinguishing between different objects and not necessarily for describing a particular sequential or chronological order. The terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed or inherent to such process, method, article, or apparatus.
Example 1
Referring to fig. 1, fig. 1 is a flow chart illustrating a method for compressing cartesian product data combination according to an embodiment of the invention. The execution main body of the method described in the embodiment of the invention is an execution main body composed of software or/and hardware, and the execution main body can receive related information in a wired or/and wireless mode and can send a certain instruction. Of course, it may also have certain processing and storage functions. The execution body may control a plurality of devices, such as a remote physical server or cloud server and related software, or may be a local host or server and related software that performs related operations on a device that is located somewhere, etc. In some scenarios, multiple storage devices may also be controlled, which may be located in the same location or in different locations than the devices.
In this embodiment, as shown in fig. 2, the data source set a has 2 data items, a and b respectively; the data source set B has 3 data items, namely c, d and e respectively; the cartesian operation is performed on the data sets a and B to obtain a cartesian product data set (AxB), which is shown in fig. 3, and there are 6 schemes and 12 data items. As can be seen from fig. 3, data items a and b each appear 3 times, respectively, and c, d and e each appear 2 times, respectively. The data items in this embodiment may be one or more of video, image, text, web data, location data, etc., and when a, b, c, d and e are data with relatively large occupied space, such as video data, the user needs to transmit the data items multiple times during the storage or transmission process, which results in an increase in storage space and a decrease in transmission efficiency, which is very inconvenient.
As shown in fig. 1, the method based on compressed cartesian product data combination comprises the following steps:
s1: one data combination in a set of cartesian product data combinations is sequentially acquired, the set of cartesian product data combinations comprising at least one data combination.
The function of this step is to sequentially select one data combination to be stored or transmitted in the order of data transmission or the order of storage. In this embodiment, the data combinations (a, c) may be selected sequentially, and typically, a cartesian product data combination generally has two or more data source sets, each data source set has 1 data item, and at least one data combination is included after a cartesian product operation is performed.
S2: creating a respective indexing scheme to an index set in a respective data structure based on the data combination, the data structure comprising a data source and an index set.
The effect of this step is to create an indexing scheme in the index set that is identical to the data structure of the data combination (a, c). The data structure includes a data source and an index set. The data source is used for storing specific data items in the data combination, such as a, b, c, d and e in the embodiment; the index set is used to store an index scheme.
S3: acquiring a data item from the data combination, and judging whether the data item exists in a data source or not; if yes, the subscript information of the data item in the data source is returned; if not, the data item is added to the tail end of the data source queue, and the subscript information of the data item is returned.
This step is a key step of the present invention, as shown in fig. 3, in this embodiment, one of the data items (a, c) selected in step S1 is selected, for example, a, since (a, c) is the first data combination in the cartesian product data combination, the data items a and c are both first occurring, the data items a and c are both stored in the data source, the storage unit M is allocated to each data item in the middle of the data source memory, after the data items are stored in the storage unit M, a subscript information is given to the storage unit in which each data item is located, for example, the subscript information of the data item a is 0 in this embodiment, and the subscript information of the data item a in the data source is returned. Preferably, the subscript information is sequentially arranged arabic numerals or sequentially arranged sign marks. In this embodiment, the subscript information is arabic numerals 0, 1, 2, and 3, which are sequentially arranged, so that the data source can be accessed fastest and most directly.
It should be noted that, in the present invention, it is preferable to label the subscript information, if a superscript or label in other modes is labeled, because the present invention can continuously add new data items to the end of the queue of the data source in the data source, if the superscript is used, the superscript information of the previous data items can be continuously changed, which is not beneficial to fast matching the corresponding data items in the data source according to the superscript information.
S4: and writing the index information into a corresponding index scheme.
Specifically, the step writes the index information 0 of the data item a returned by the step into the corresponding index scheme to obtain the index scheme (0').
S5: and repeating the step S3 until the subscript information of all the data items of the data combination is returned.
The function of this step is to perform the same processing on the data item c, and return the subscript information 1 of the data item c in the data source to obtain the index schemes (0, 1) corresponding to the data combinations (a, c).
S6: and storing the data source and the index set. The invention allocates an index set memory space for the index set, the index set memory space allocates a storage unit N for each index scheme, and each index scheme is stored in the storage unit N; and a storage unit M is allocated to each data item in the middle of the data source memory, and after the data item is stored in the storage unit M, subscript information is given to the storage unit in which each data item is located.
Preferably, the storing the data source and the index set includes:
s611: and allocating data source memory space for the data source in the memory.
S612: dividing the memory space of the data source into a plurality of storage units M which are sequentially arranged according to the number of data items in the Cartesian product data combination set, and marking the subscript information for each storage unit M according to the sequence.
S613: and sequentially storing the data items in the storage unit M according to the processing sequence.
Preferably, the storing the data source and the index set includes:
s621: and allocating an index set memory space for the index set in a memory.
S622: dividing the memory space of the index set into a plurality of storage units N according to the number of data combinations in the Cartesian product data combination set, wherein the data structure of the storage units N is the same as that of the data combinations.
S623: the indexing schemes are sequentially stored in the storage unit N, respectively.
Specifically, the invention comprises a memory, which is mainly divided into two parts, namely a data source memory space and an index set memory space. The data source memory space can be divided into a plurality of storage units M, the index set memory space can be divided into a plurality of storage units N, the number of the storage units M is equal to the number of data items in the data source set a and the data source set B, and the number of the storage units N is equal to the number of data combinations in the cartesian product data combination set (AxB).
Preferably, the method of compressing cartesian product data combinations further comprises: decompressing the compressed combination of cartesian product data; the decompression step is opposite to the compression step, and specifically comprises the following steps:
s7: an indexing scheme is obtained from the storage unit N.
S8: and returning the data items in the storage unit M corresponding to the index information according to the index information in the index scheme.
S9: steps S7 to S8 are performed for the indexing scheme in each storage unit N.
Specifically, one of the index schemes is obtained from the storage unit N, for example, the index schemes (0, 1) are taken in the embodiment, the data items a and c in the corresponding data sources in the corresponding subscript information 0 and the corresponding subscript information 1 are found according to the index schemes (0, 1), the corresponding data items a and c are returned, and the data combinations (a, c) are obtained, so that the data combinations (a, c) can be stored or transmitted; and (3) executing steps S7-S8 on all index schemes needing decompression in the storage unit N to realize decompression of the Cartesian product data combination.
According to the embodiment of the invention, the data items in the data combination are stored in the data source, and the index scheme which is the same as the data combination structure is constructed, so that repeated data storage and transmission are avoided, the storage space of the data is reduced, and the data transmission efficiency is improved.
Example two
Referring to fig. 7, fig. 7 is a schematic structural diagram of an apparatus for compressing cartesian integrated data combination according to an embodiment of the invention. As shown in fig. 7, the apparatus for compressing the combination of cartesian product data may include:
the data storage module 310: a data item and indexing scheme for storing a Cartesian product data set;
the judgment module 320: for determining whether a data combination obtained from the set of cartesian product data combinations is already present in the data source;
execution module 330: and the data source queue is used for returning the subscript information of the data item in the data source according to the judging result of the judging module or adding the data item to the end of the data source queue and returning the subscript information of the data item.
Example III
Referring to fig. 8, fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the invention. The electronic device may be a computer, a server, or the like, and of course, may also be an intelligent device such as a mobile phone, a tablet computer, a monitor terminal, or the like, and an image acquisition device having a processing function.
As shown in fig. 8, the electronic device may include:
a memory 510 storing executable program code;
a processor 520 coupled to the memory 510;
wherein the processor 520 invokes the executable program code stored in the memory 510 to perform some or all of the steps in the method of compressing the combination of cartesian product data in embodiment one.
An embodiment of the present invention discloses a computer-readable storage medium storing a computer program, wherein the computer program causes a computer to execute some or all of the steps in the method for compressing cartesian product data combinations in embodiment one.
The embodiment of the invention also discloses a computer program product, wherein the computer program product when run on a computer causes the computer to execute part or all of the steps in the method for compressing Cartesian product data combination in the embodiment I.
The embodiment of the invention also discloses an application publishing platform, wherein the application publishing platform is used for publishing the computer program product, and the computer program product, when running on the computer, causes the computer to execute part or all of the steps in the method for compressing the Cartesian product data combination in the first embodiment.
In various embodiments of the present invention, it should be understood that the size of the sequence numbers of the processes does not mean that the execution sequence of the processes is necessarily sequential, and the execution sequence of the processes should be determined by the functions and internal logic thereof, and should not constitute any limitation on the implementation process of the embodiments of the present invention.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer-accessible memory. Based on this understanding, the technical solution of the present invention, or a part contributing to the prior art or all or part of the technical solution, may be embodied in the form of a software product stored in a memory, comprising several requests for a computer device (which may be a personal computer, a server or a network device, etc., in particular may be a processor in a computer device) to execute some or all of the steps of the method according to the embodiments of the present invention.
In the embodiments provided herein, it should be understood that "B corresponding to a" means that B is associated with a, from which B can be determined. It should also be understood that determining B from a does not mean determining B from a alone, but may also determine B from a and/or other information.
Those of ordinary skill in the art will appreciate that some or all of the steps of the various methods of the described embodiments may be implemented by hardware associated with a program that may be stored in a computer-readable storage medium, including Read-Only Memory (ROM), random-access Memory (Random Access Memory, RAM), programmable Read-Only Memory (Programmable Read-Only Memory, PROM), erasable programmable Read-Only Memory (Erasable Programmable Read-Only Memory, EPROM), one-time programmable Read-Only Memory (OTPROM), electrically erasable programmable Read-Only Memory (EEPROM), compact disc Read-Only Memory (Compact Disc Read-Only Memory, CD-ROM), or other optical disk Memory, magnetic disk Memory, tape Memory, or any other medium capable of being used to carry or store data that is readable by a computer.
The method, the device, the electronic equipment and the storage medium for compressing the Cartesian product data combination disclosed by the embodiment of the invention are described in detail, and specific examples are applied to the principle and the implementation of the invention, so that the description of the above embodiment is only used for helping to understand the method and the core idea of the invention; meanwhile, as those skilled in the art will have variations in the specific embodiments and application scope in accordance with the ideas of the present invention, the present description should not be construed as limiting the present invention in view of the above.
Claims (10)
1. A method of compressing a combination of cartesian product data, the method comprising the steps of:
s1: sequentially obtaining one data combination in a Cartesian product data combination set, wherein the Cartesian product data combination set comprises at least one data combination;
s2: creating a corresponding indexing scheme to an index set in a corresponding data structure based on the data combination, the data structure comprising a data source and an index set;
s3: acquiring a data item from the data combination, and judging whether the data item exists in a data source or not; if yes, the subscript information of the data item in the data source is returned; if not, adding the data item to the tail end of the data source queue, and returning the subscript information of the data item;
s4: writing the index information into a corresponding index scheme;
s5: repeating the step S3 until the subscript information of all the data items of the data combination is returned;
s6: and storing the data source and the index set.
2. The method of compressing a combination of cartesian product data according to claim 1, wherein storing the data source and index set comprises:
distributing a data source memory space for the data source in a memory;
dividing the memory space of the data source into a plurality of storage units M which are sequentially arranged according to the number of data items in the Cartesian product data combination set, and marking subscript information for each storage unit M according to the sequence;
and sequentially storing the data items in the storage unit M according to the processing sequence.
3. The method of compressing a combination of cartesian product data according to claim 2, wherein storing the data source and index set comprises:
allocating an index set memory space for the index set in a memory;
dividing the memory space of the index set into a plurality of storage units N according to the number of data combinations in the Cartesian product data combination set, wherein the data structure of the storage units N is the same as that of the data combinations;
the indexing schemes are sequentially stored in the storage unit N, respectively.
4. The method of compressing a combination of cartesian product data according to claim 1, wherein the subscript information is sequential arabic numerals or has sequential sign marks.
5. The method of compressing a cartesian product data combination according to claim 1, wherein the data combination comprises at least 2 data items.
6. A method of compressing a combination of cartesian product data according to claim 3, further comprising: decompressing the compressed combination of cartesian product data;
the decompression comprises the steps of:
s7: acquiring an index scheme from a storage unit N;
s8: returning data items in the storage unit M corresponding to the index information according to the index information in the index scheme;
s9: steps S7 to S8 are performed for the indexing scheme in each storage unit N.
7. The method of compressing a combination of cartesian product data according to claim 1, wherein the data items comprise one or more of video, images, text, web data, location data.
8. An apparatus for compressing a combination of cartesian product data, comprising:
and a data storage module: a data item and indexing scheme for storing a Cartesian product data set;
and a judging module: for determining whether a data combination obtained from the set of cartesian product data combinations is already present in the data source;
the execution module: and the data source queue is used for returning the subscript information of the data item in the data source according to the judging result of the judging module or adding the data item to the end of the data source queue and returning the subscript information of the data item.
9. An electronic device, comprising: a memory storing executable program code; a processor coupled to the memory; the processor invokes the executable program code stored in the memory for performing the method of compressing the cartesian product data combination of any one of claims 1 to 7.
10. A computer readable storage medium, characterized in that the computer readable storage medium stores a computer program, wherein the computer program causes a computer to perform the method of compressing the combination of cartesian product data of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211577006.6A CN116166660B (en) | 2022-12-08 | 2022-12-08 | Method and device for compressing Cartesian product data combination |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211577006.6A CN116166660B (en) | 2022-12-08 | 2022-12-08 | Method and device for compressing Cartesian product data combination |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116166660A true CN116166660A (en) | 2023-05-26 |
| CN116166660B CN116166660B (en) | 2023-11-07 |
Family
ID=86415362
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211577006.6A Active CN116166660B (en) | 2022-12-08 | 2022-12-08 | Method and device for compressing Cartesian product data combination |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116166660B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060074935A1 (en) * | 2004-09-30 | 2006-04-06 | Zimmerer Peter K | Multi-dimensional set object |
| US7873629B1 (en) * | 2004-06-07 | 2011-01-18 | Teradata Us, Inc. | Dynamic partition enhanced inequality joining using a value-count index |
| US20150088809A1 (en) * | 2013-09-20 | 2015-03-26 | Oracle International Corporation | Densely grouping dimensional data |
| US20150088885A1 (en) * | 2013-09-20 | 2015-03-26 | Oracle International Corporation | Aggregating dimensional data using dense containers |
| CN113742343A (en) * | 2021-09-01 | 2021-12-03 | 上海浦东发展银行股份有限公司 | Data splitting method, device and storage medium based on large amount of service data scenes |
| CN114547380A (en) * | 2022-01-25 | 2022-05-27 | 北京元年科技股份有限公司 | Data traversal query method, device, electronic device and readable storage medium |
-
2022
- 2022-12-08 CN CN202211577006.6A patent/CN116166660B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7873629B1 (en) * | 2004-06-07 | 2011-01-18 | Teradata Us, Inc. | Dynamic partition enhanced inequality joining using a value-count index |
| US20060074935A1 (en) * | 2004-09-30 | 2006-04-06 | Zimmerer Peter K | Multi-dimensional set object |
| US20150088809A1 (en) * | 2013-09-20 | 2015-03-26 | Oracle International Corporation | Densely grouping dimensional data |
| US20150088885A1 (en) * | 2013-09-20 | 2015-03-26 | Oracle International Corporation | Aggregating dimensional data using dense containers |
| CN105683956A (en) * | 2013-09-20 | 2016-06-15 | 甲骨文国际公司 | Densely grouping dimensional data |
| CN113742343A (en) * | 2021-09-01 | 2021-12-03 | 上海浦东发展银行股份有限公司 | Data splitting method, device and storage medium based on large amount of service data scenes |
| CN114547380A (en) * | 2022-01-25 | 2022-05-27 | 北京元年科技股份有限公司 | Data traversal query method, device, electronic device and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116166660B (en) | 2023-11-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114328632A (en) | User data analysis method and device based on bitmap and computer equipment | |
| CA3154763A1 (en) | Data operation method, device and system | |
| CN110837586B (en) | Question-answer matching method, system, server and storage medium | |
| JP2022037900A (en) | Parallel decompression of compressed data streams | |
| CN113626612B (en) | Prediction method and system based on knowledge graph reasoning | |
| CN112347101A (en) | Tag data storage method, computer device, and storage medium | |
| CN111552715A (en) | User query method and device | |
| CN110609966B (en) | Page display method, device and equipment thereof | |
| CN111126604B (en) | Model training method, device, server and storage medium | |
| CN116431878A (en) | Vector retrieval service method, device, equipment and storage medium thereof | |
| CN114218175A (en) | A resource cross-platform sharing method, device, terminal device and storage medium | |
| US7616137B2 (en) | Method and apparatus for compression and decompression of an executable code with a RISC processor | |
| CN112306452A (en) | Method, device and system for processing service data by merging and sorting algorithm | |
| CN110909155B (en) | Book order generation method, calculation device and computer storage medium | |
| CN116166660B (en) | Method and device for compressing Cartesian product data combination | |
| CN112749127A (en) | Data providing method and system for model training | |
| CN112612427B (en) | Vehicle stop data processing method and device, storage medium and terminal | |
| CN116974898A (en) | A data processing method, device, equipment and computer-readable storage medium | |
| CN113282814A (en) | Characteristic data processing method, device, server and storage medium | |
| CN112052330B (en) | Application keyword distribution method and device | |
| CN112487876A (en) | Intelligent pen character recognition method and device and electronic equipment | |
| CN116719614A (en) | Virtual machine monitor selection method, device, computer equipment and storage medium | |
| CN115061785B (en) | Information sending method, device, storage medium and server | |
| CN112684985B (en) | Data writing method and device | |
| CN117851071A (en) | Application resource allocation method and device, computer equipment and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |