CN106682042B - A kind of relation data caching and querying method and device - Google Patents
A kind of relation data caching and querying method and device Download PDFInfo
- Publication number
- CN106682042B CN106682042B CN201510766583.3A CN201510766583A CN106682042B CN 106682042 B CN106682042 B CN 106682042B CN 201510766583 A CN201510766583 A CN 201510766583A CN 106682042 B CN106682042 B CN 106682042B
- Authority
- CN
- China
- Prior art keywords
- column
- association
- subdata
- row
- bitmap
- 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.)
- Active
Links
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/2455—Query execution
- G06F16/24552—Database cache management
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Memory System Of A Hierarchy Structure (AREA)
Abstract
The embodiment of the invention discloses a kind of relation data caching and querying methods and device, the caching method includes: to receive after the relation data cached, according to the corresponding relationship of each column in each association subdata and column cluster, each association subdata is cached in corresponding column, and whether the relation data has been cached according to each column, update the bitmap mark that row is corresponded in bitmap index.Due to the mapping table in embodiments of the present invention based on bitmap index and each column, carry out relation data caching, and relation data is divided into multiple association subdatas, it is cached respectively, therefore the buffer efficiency of relation data is improved, and this method is applied to the memory of electronic equipment, improves the utilization rate of memory.
Description
Technical field
The present invention relates to technical field of data processing, in particular to a kind of relation data caching and querying method and device.
Background technique
The data exchange buffer area of computer hardware technology is generally the memory module between memory and CPU, prior to
Memory enables CPU quickly to access the data of needs.Caching in software technology is generally opened up in memory and solid state hard disk
One panel region stores some data being often accessed, the excessively slow problem of the difference and disk access for supplementing memory.
The caching system of mainstream has Memcache d system and Redis system at present.Memcached system is based on Key-
Value carries out data buffer storage, and Key-Value is a kind of key value Key and data Value storage and access mode, such as<1, a>,<
2, b > data a and b can be accessed by key assignments 1 and 2.Redis system may be used also in addition to supporting Key-Value to carry out data buffer storage
To support some data buffer storages based on other modes, such as based on character string, Hash table, list, set sum has
Sequence collection.But although above-mentioned each data buffer storage mode is simple, for some complex situations, such as relational database is slow
Scene is deposited and inquires, Memcached system and Redis system can not just meet the query demand of relational database.
HBase database is a PostgreSQL database distributed, towards column.But HBase database is one and is based on
The carrier of the database of external memory, the database caches data is still disk, although there is low volume data that can be cached to memory,
When the data of reading have been more than the data volume of memory cache, reading performance will be decreased obviously.In addition, for Hbase data
For library, when carrying out relation data caching, relation data needs to store into different column, in existing caching system,
Corresponding Key-Value is set for each column, therefore causes the redundancy of Key, causes the waste of memory space.In addition,
When carrying out data storage and searching, Value can only be looked for by Key, and cannot achieve the lookup of entire relation data.
Summary of the invention
The embodiment of the invention discloses a kind of relation data caching and querying methods and device, to improve relation data
Buffer efficiency, and improve the utilization rate of memory source.
In order to achieve the above objectives, the embodiment of the invention discloses a kind of relation data caching methods, are applied to electronic equipment,
This method comprises:
Relation data to be cached is received, wherein including at least an association subdata in the relation data；
According to the corresponding relationship of each column in each association subdata and column cluster, each association subdata is cached to corresponding
In column；And
The relation data whether has been cached according to each column, has updated the bitmap mark for corresponding to row in bitmap index.
Further, it is described each association subdata is cached in corresponding column after, the method also includes:
For each column, judge the association subdata whether is preserved in the corresponding filter of the column, if it does not exist, then will
The information of the association subdata is added in the filter.
Further, it is described each association subdata is cached in corresponding column after, the method also includes:
It is corresponding in the subregion to judge that this is listed according to the subregion where the row of association subdata caching for each column
Whether the association subdata is preserved in filter, if it does not exist, then the information of the association subdata is added to the mistake
In filter.
Further, different subregions is located at same electronic equipment or different electronic equipments.
Further, described each association subdata is cached in corresponding column includes:
For each column, identify whether the corresponding data cached length of the column fixes；
If so, directly caching the association subdata in the column；
If it is not, then it is long that the corresponding association subdata of the column is converted to the data according to the column corresponding data length
Degree, and the association subdata after the conversion is cached in the column.
Further, the method also includes:
At set time intervals, the relation data of caching is synchronized to other systems.
Further, the relation data is buffered in memory or the solid state hard disk of the electronic equipment.
The embodiment of the invention provides a kind of relation data querying method based on above-mentioned relation data cache method, applications
In electronic equipment, this method comprises:
Data to be checked are received, wherein the data are at least one association in relation data or relation data
Data；
The data are split as at least one association subdata；
It is associated with subdata for each, according to the column for caching this association subdata, judges the association subnumber of column caching
It whether there is the association subdata in；If so, searching should in bitmap index according to the position where the association subdata
Position corresponds to the bitmap mark of row, and is identified according to the bitmap of the row, extracts other associations in corresponding each column corresponding position
Subdata, and group is combined into relation data；
Using the intersection of the first quantity of the pass connection data combined for each association subdata as query result.
Further, the position according to where the association subdata, searches the position in bitmap index and corresponds to row
Bitmap mark include:
It is relevant according to caching in the bitmap index according to the line number for the row that the association subdata caches in the column
First bitmap of subdata identifies, the identification information of the row of bitmap index where searching the first bitmap mark of the first quantity, and
It searches in the row and is identified for the bitmap of each column, wherein first quantity is the line number；
Described to be identified according to the bitmap of the row, extracting other association subdatas in corresponding each column corresponding position includes:
The first bitmap of each of row mark according to the bitmap index, according to first bitmap mark place
Column are identified in the column from starting into the row occur what the first bitmap identified according to sequence from front to back for the column
Number, other association subdatas cached in the row for extracting the correspondence number in corresponding column.
Further, include: with the presence or absence of the association subdata in the association subdata for judging column caching
For each column, in the corresponding filter of the column, judge whether deposit in the information of the association subdata of column storage
In the association subdata.
Further, include: with the presence or absence of the association subdata in the association subdata for judging column caching
For each column in each subregion, in the corresponding each filter of the column, the association subnumber of column storage is judged
According to information in whether there is the association subdata.
The embodiment of the invention provides a kind of relation data buffer storages, are applied to electronic equipment, which includes:
Receiving module, for receiving relation data to be cached, wherein including at least an association in the relation data
Subdata；
Cache module, for the corresponding relationship according to each column in each association subdata and column cluster, by each association subnumber
According to being cached in corresponding column；
Update module updates the bitmap that row is corresponded in bitmap index for whether having cached the relation data according to each column
Mark.
Further, described device further include:
Filtering module judges the association subdata whether is preserved in the corresponding filter of the column, such as being directed to each column
Fruit is not present, then the information of the association subdata is added in the filter.
Further, described device further include:
Filtering module judges that this is listed in the subregion according to the subregion where the row of association subdata caching for each column
In whether preserve the association subdata in corresponding filter, if it does not exist, then the information of the association subdata is added
Into the filter.
Further, the cache module is specifically used for being directed to each column, identifies that the corresponding data cached length of the column is
No fixation；If so, directly caching the association subdata in the column；If it is not, then according to the corresponding data length of the column, it will
The corresponding association subdata of the column is converted to the data length, and the association subdata after the conversion is cached in the column.
Further, described device further include:
Synchronization module, at set time intervals, the relation data of caching being synchronized to other systems.
The embodiment of the invention provides a kind of relation data inquiry unit based on above-mentioned relation data buffer storage device, applications
In electronic equipment, which includes:
Receiving module, for receiving data to be checked, wherein the data be in relation data or relation data extremely
One item missing is associated with subdata；
Module is split, for the data to be split as at least one association subdata；
Searching module, for according to the column for caching this association subdata, judging that the column are slow for each association subdata
It whether there is the association subdata in the association subdata deposited；If so, being searched according to the position where the association subdata
The position corresponds to the bitmap mark of row in bitmap index, and is identified according to the bitmap of the row, in corresponding each column corresponding position
Other association subdatas are extracted, and group is combined into relation data；
Module is provided, for the intersection for the relation data that each association subdata combines will to be directed to as inquiry knot
Fruit.
Further, the searching module, specifically for the line number of the row cached in the column according to the association subdata,
It is identified in the bitmap index according to the first bitmap for caching relevant subdata, searches the first bitmap mark of first quantity
The identification information of the row of bitmap index where knowing, and search in the row and identified for the bitmap of each column, wherein first number
Amount is the line number；The first bitmap of each of row mark, identifies according to first bitmap according to the bitmap index
The column at place are identified in the column from starting into the row the first bitmap occur according to sequence from front to back for the column
The number of mark, other association subdatas cached in the row for extracting the correspondence number in corresponding column.
Further, the searching module is specifically used for judging the column in the corresponding filter of the column for each column
It whether there is the association subdata in the information of the association subdata of storage.
Further, the searching module, specifically for each column being directed in each subregion, in the corresponding each mistake of the column
In filter, judge in the information of the association subdata of column storage with the presence or absence of the association subdata.
It include: to connect the embodiment of the invention provides a kind of relation data caching and querying method and device, the caching method
It receives after the relation data cached, according to the corresponding relationship of each column in each association subdata and column cluster, by each association
Whether data buffer storage has cached the relation data into corresponding column, and according to each column, updates the position that row is corresponded in bitmap index
Map logo.Due to the mapping table in embodiments of the present invention based on bitmap index and each column, relation data caching is carried out, and
And relation data is divided into multiple association subdatas, is cached respectively, therefore improves the buffer efficiency of relation data, and
And this method is applied to the memory of electronic equipment, improves the utilization rate of memory.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is a kind of process of caching of relation data provided in an embodiment of the present invention；
Fig. 2 is the specific of column cluster table in a kind of relation data caching provided in an embodiment of the present invention, bitmap index and each column
Structural schematic diagram；
Fig. 3 is the process of caching of relation data provided by one embodiment of the present invention；
Fig. 4 is a kind of relation data query process provided in an embodiment of the present invention based on above-mentioned cache way；
Fig. 5 is the tool of column cluster table, bitmap index and each column in another relation data caching provided in an embodiment of the present invention
Body structural schematic diagram；
Fig. 6 is relation data buffer storage structural schematic diagram provided in an embodiment of the present invention；
Fig. 7 is the relation data inquiry unit provided in an embodiment of the present invention based on relation data buffer storage shown in Fig. 6
Structural schematic diagram.
Specific embodiment
In order to improve the buffer efficiency of relation data, memory source is made full use of, the embodiment of the invention provides a kind of passes
It is data buffer storage and querying method and device.
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
Fig. 1 be a kind of process of caching of relation data provided in an embodiment of the present invention, the process the following steps are included:
S101: receiving relation data to be cached, wherein including at least an association subdata in the relation data.
The process of caching of relation data provided in an embodiment of the present invention is applied to electronic equipment, which can be clothes
The equipment that business device, PC etc. carry out data buffer storage.
Relation data middle finger includes the data of at least one association subdata, at least one association subdata is interrelated
The data are described, such as association subdata can be respectively as follows: Zhang San, male, 28 years old or Li Si, female, 49 kilograms, or
Person horse five, health, or only name etc..
In embodiments of the present invention for caching be which kind of relation data be it is known, which includes which
Association subdata is also known.It may include whole association subnumbers of the relation data each in relation data to be cached
According to or only including partial association subdata, such as it includes name that the relation data, which is, gender and age are associated with subdata
Data, then one of association subdata, such as name or gender can be only included by being somebody's turn to do relation data to be cached；Or
Person includes two association subdatas, for example including name and gender or name and age etc.；Certain relation data can also be with
It simultaneously include this three association subdatas.When specifically used, it can be cached according to demand.
S102: according to the corresponding relationship of each association subdata and caching column, each association subdata is cached to correspondence
Column in.
In embodiments of the present invention when carrying out relation data caching, stored using column.Line storage is with row
For the process object of data buffer storage, column storage is using longitudinal column as the process object of data buffer storage.Generally according to relationship number
According to comprising association subdata quantity, determine the quantity of column cached.It is also illustrated by taking above-mentioned example as an example, relationship
Data be include name, the data for being associated with subdata of gender and age, the then quantity of the column cached is 3, this 3 column can
To constitute a column cluster.Column cluster is the concept in column storage, may include one or more column in column cluster.
When caching to relation data, it can know all include several association subnumbers in the relation data of caching in advance
According to and which association subdata, the storage of each association subdata, therefore can into which column and can be pre-set
Corresponding association subdata to be cached in respective column.
Whether S103: having cached the relation data according to each column, updates in bitmap index and identifies the corresponding bitmap of the row.
The association subdata that bitmap index can cache each column is identified, that is, identifies specifically depositing for each relation data
Storage space is set, and bitmap index is also to be made of columns and rows, the quantity of column number identical as the quantity of the column of caching relation data, capable
It measures identical as the quantity of row for including in the column of caching relation data.The same line identifier of the specific bitmap index is same
The storage bitmap of each association subdata of a relation data can be identified with bitmap and is indicated, for example 1 can indicate to store
The a certain association subdata of same relation data, 0 indicates the association subdata of the not stored relation data.The bitmap index with
There is corresponding incidence relation, every row of the column cached to relation data and position between the column cached to relation data
Every row of index of the picture is corresponding, i.e., there are how many row in the column cached to relation data, just has in bitmap index identical
Line number, and corresponded between the every row of the two.
In order to guarantee corresponding relationship between the two, bitmap index and the column cached to relation data can be stored
Together, the pointer of a direction other side can also be established in bitmap index and the column cached to relation data.
When caching to relation data, whether the relation data is cached according to each column, updating will in bitmap index
The corresponding bitmap mark of the row.Specifically, possible a certain relation data does not simultaneously include all association subnumbers when being cached
According to, when being cached at this time, just without data deposit in the corresponding column of association subdata of the missing, therefore will be in bitmap index
For the column, its corresponding bitmap mark is updated to 0, indicates that the relation data is not stored in the column, exists in relation data
Association subdata when being deposited into corresponding column, then for column in bitmap index, its corresponding bitmap mark is updated 1,
Indicate that the relation data has been cached in the column.
For the caching of implementation relation data, whether each row is occupied in mark bitmap index, in the embodiment of the present invention
In the column that are cached for relation data, this, which can be set, corresponding ID table, and record has corresponding position in ID table
The whether occupied information of every row in index of the picture.The quantity for the row that ID table includes is identical as the quantity for the row that bitmap index includes,
And record has the identification information of every row in ID table, which can be the line number of the row.In addition, in order to facilitate relationship number
According to caching, record has the corresponding whether occupied information of every row in bitmap index in ID table, such as 01 indicates bitmap
It is occupied that row is corresponded in index, 00 indicate to correspond to row in bitmap index it is unoccupied.
Because the bitmap index recorded in ID table in embodiments of the present invention corresponds to the occupied information of row, the line number and reality
Border caching relation data quantity be it is identical, in corresponding bitmap index the quantity of occupied row also with the relationship of caching
The quantity of data be it is identical, according in bitmap index be directed to each column record every row bitmap identify, can determine in each column
The quantity of the association subdata of caching.
Due to the mapping table in embodiments of the present invention based on bitmap index and each column, relation data caching is carried out,
And relation data is divided into multiple association subdatas, is cached respectively, therefore improves the buffer efficiency of relation data,
And this method is applied to the memory of electronic equipment, improves the utilization rate of memory.
Relation data cache way provided in an embodiment of the present invention, applied on the memory of electronic equipment or solid state hard disk
Carry out the caching of relation data.Corresponding following embodiment is also all that memory or solid-state in electronic equipment can be applied hard
On disk.
Fig. 2 is the specific knot of ID table, bitmap index and each column in a kind of relation data caching provided in an embodiment of the present invention
Structure schematic diagram.Be illustrated by taking Fig. 2 as an example, be ID table shown in the ID in Fig. 2, in ID table there are 1,2 ... k row, due to ID
Table is corresponding with bitmap index, and there is also k rows in bitmap index.The column cached in column cluster to the relation data include
2 column, respectively A column and B column.In order to which the occupancy situation to each column is identified, two column, a column are also equipped in bitmap index
It is arranged with b, wherein each storage condition for being associated with subdata in a column record A column, each association subdata deposits in b column record B column
Store up situation.One of relation data corresponds to a line in the bitmap index.
As shown in Fig. 2, having recorded bitmap mark 1 and 1 in the first row of bitmap index, illustrate that first relation data is same
When include two association subdatas, the association subdata be respectively stored into A column the first row and B arrange the first row, the second row
In have recorded bitmap mark 1 and 0, illustrate that second relation data includes an association subdata, which is stored in
Second row of A column, the third line have recorded bitmap mark 0 and 0, illustrates that third relation data is not stored in any one and arranges,
Fourth line has recorded bitmap mark 1 and 1, illustrates the 4th relation data while including two association subdatas, the association subnumber
According to be respectively stored into A column the third line and B column the second row, and so on, the row k of the bitmap index has recorded bitmap mark
Know 1 and 1, illustrates k-th of relation data while including two association subdatas, which has been respectively stored into A column
The jth row of i-th row and B column, wherein i is the quantity of storage association subdata in A column, and j is the number of B column storage association subdata
Amount.
According to foregoing description it is found that for the row k in ID table, the bitmap mark of row is corresponded in the corresponding bitmap index of the row
Combination Bitmapk=(ak, bk), ak and the bk of knowledge are the bitmap mark of a column and b column in row k.For ak, it is the in a column
I nonzero value, therefore when determining the corresponding nonzero value quantity in a column of ak, it can be expressed as P (ak)=i, for bk,
It is b column in j-th of nonzero value, therefore determine bk it is corresponding for b column in nonzero value quantity when, P (bk) can be expressed as
=j.A is arranged accordingly, the corresponding value mark of row k, arranges B, j-th of data in i-th of data Ai bitmap index
The corresponding value mark of row k, above-mentioned each direct corresponding relationship of table can be expressed as (IDK, Ai, Bj) and be in Bj bitmap index
Same data line, and P (ak)=i, P (bk)=j.
Pass through above-mentioned relation, it is known that, all may be by upper for the numerical value of any column of a line any in above-mentioned each table
State relationship lookup.
In another embodiment of the present invention, for the caching of implementation relation data, facilitate subsequent lookup, it is described to incite somebody to action
After each association subdata is cached in corresponding column, the method also includes:
For each column, judge the association subdata whether is preserved in the corresponding filter of the column, if it does not exist, then will
The information of the association subdata is added in the filter.
It is both provided with filter for each column, Filter as shown in Figure 2 is stored in the column in the filter and caches
Association subdata information, the information of the specific association subdata can be each association subdata cached in the column,
It can be the corresponding conditions that the association subdata of column caching meets.Therefore work as and cached corresponding association subdata in each column
Afterwards, judge whether filter preserves the association subdata, if the association subdata is stored in filter, not to the mistake
Filter is updated, and when not saving the association subdata in the filter, is then added to the information of the association subdata
In filter.
For example, for each column of caching name, gender and age correlations data, for caching the column of name, the column pair
What is cached in the filter answered can be each name for including in the column, if not saving the name in the filter,
The name is added in filter；For caching the column at age, the corresponding filter caching of the column can be in the column
Existing institute's has age, the range being also possible to where institute's has age, such as the age cached in the column includes 13,14,15,17,
It can then set the information of the association subdata in filter between 13 and 17, if a certain age is not in the range,
Then the range is adjusted, such as the age is 18, then is added to 18 in filter, by the corresponding association subnumber of filter
According to information be set as between 13 and 18.
In order to meet the needs of distributed memory system, deblocking, different data can be stored in different set
It is standby upper, therefore all rows in corresponding each column may be in different subregions, in order to facilitate the lookup of follow-up data.In this hair
In bright one embodiment, corresponding filter can be set for each column in each subregion, it is described by each association subnumber
After being cached in corresponding column, the method also includes:
It is corresponding in the subregion to judge that this is listed according to the subregion where the row of association subdata caching for each column
Whether the association subdata is preserved in filter, if it does not exist, then the information of the association subdata is added to the mistake
In filter.
Different subregions is located at same electronic equipment or different electronic equipments.
Although not going together for same row may on different devices, inquiry and caching for the ease of data, column
Cluster table and bitmap index still use same, and according to continuous between equipment, are arranged between distinct device between row
Relationship.
In the process and above-described embodiment being updated to the information of the association subdata saved in the filter of each column
It is identical, in embodiments of the present invention to the process without repeating.
Fig. 3 be relation data provided by one embodiment of the present invention process of caching, the process the following steps are included:
S301: receiving relation data to be cached, wherein including at least an association subdata in the relation data.
S302: according to the corresponding relationship of each column in each association subdata and column cluster, each association subdata is cached to
In corresponding column.
S303: according to the identification information of the occupied row of the bitmap index recorded in ID table, the pass in bitmap index is determined
Coefficient is according to the identification information for corresponding to row.
Whether S304: having cached the relation data according to each column, updates in bitmap index and identifies the corresponding bitmap of the row.
S305: being directed to each column, and according to the subregion where the row of association subdata caching, it is right in the subregion to judge that this is listed in
Whether the association subdata is preserved in the filter answered, if it is not, then S306 is carried out, if so, the data buffer storage process knot
Beam.
S306: then the information of the association subdata is added in the filter.
As long as step S306 is located at after step S302 in the above process, the embodiment of the present invention is to step S306 and step
Sequence between rapid S303~S305 is with no restrictions.
In order to facilitate the caching of relation data, the efficiency of relation data caching is improved, in one embodiment of the invention,
Described each association subdata is cached in corresponding column include:
For each column, identify whether the corresponding data cached length of the column fixes；
If so, directly caching the association subdata in the column；
If it is not, then it is long that the corresponding association subdata of the column is converted to the data according to the column corresponding data length
Degree, and the association subdata after the conversion is cached in the column.
The storage of subdata can be associated by the way of elongated domain in embodiments of the present invention, it can also be using change
Mode of the long domain in conjunction with fixed-length field carries out relation data caching.No matter which kind of mode is used, the corresponding caching word length of each column is most
It is good fixed, it can unify to cache using the mode in elongated domain, can also unify to cache using the mode of fixed-length field.
It include two parts when being cached for the cache way in elongated domain, the data length F_ in respectively elongated domain
Length, and specifically meet the data F_Value of the length.For the cache way of fixed-length field, it is somebody's turn to do as long as caching meets
The data F_Value of regular length.
In order to realize the interaction between data cached, in another embodiment of the present invention the method also includes:
At set time intervals, the relation data of caching is synchronized to other systems.
Specifically, (Data Connection Driver) mould can be driven by data connection in embodiments of the present invention
Block realizes that interaction data cached between not homologous ray, common data connection driving have java database to connect (Java
Data Base Connectivity, JDBC), Open Database Connection (Open Database Connectivity, ODBC).
Fig. 4 is a kind of relation data query process provided in an embodiment of the present invention based on above-mentioned cache way, the process
The following steps are included:
S401: receiving data to be checked, wherein the data are at least one pass in relation data or relation data
Join subdata.
The data may be relation data, it is also possible at least one association subdata in the relation data.Relationship number
It include the data of at least one association subdata according to middle finger, subdata is interrelated retouches to the data for this at least one association
State, for example, association subdata can be respectively as follows: Zhang San, male, 28 years old perhaps Li Si, female, 49 kilograms or horse five, health, or
Person only has name etc..
S402: the data are split as at least one association subdata.
When searching relation data, it can know all include several association subnumbers in the relation data of lookup in advance
According to and which association subdata, therefore the fractionation of the data may be implemented.And the association can be searched in corresponding column
Subdata.
S403: the association of column caching is judged according to the column for caching this association subdata for each association subdata
It whether there is the association subdata in subdata, if so, carrying out step S404, otherwise, which terminates.
Since each association subdata is buffered in corresponding column, when searching association subdata, in correspondence
Column in search, it is whether identical according to two association subdatas, judge be in every row caches in the column association subdata
It is no to judge that the whether identical process of two association subdatas belongs to the prior art there are the association subdata, implement in the present invention
To the process without repeating in example.
S404: according to the position where the association subdata, the bitmap mark that the position in bitmap index corresponds to row is searched
Know, and identified according to the bitmap of the row, extracts other association subdatas in corresponding each column corresponding position, and group is combined into relationship
Data.
The association subdata that bitmap index can cache each column in embodiments of the present invention is identified, i.e., mark is each
The specific storage location of relation data, specific same line identifier be the same relation data storage bitmap, bitmap can be used
Mark is indicated, for example 1 can indicate a certain association subdata that same relation data are stored in respective column, and 0 indicates
The association subdata of the not stored relation data in respective column.
Specifically, when there are ID table there is corresponding incidence relation between the bitmap index and ID table, it is every in ID table
Row is corresponding with every row of bitmap index, i.e., there are how many row in ID table, just has identical line number in bitmap index, and the two is every
It is corresponded between row.According to the identification information of row every in ID table, the specific occupied information of the row in bitmap index can be searched,
And bitmap index counter can also look into the identification information that row is corresponded in ID table.
According to Fig.2, each column cluster has corresponding ID table, is the ID table shown in the ID in Fig. 2, exists in ID table
1,2 ... k row, since ID table is corresponding with bitmap index item, there is also k rows in bitmap index.To the relationship number in column cluster
It include 2 column, respectively A column and B column according to the column cached.In order to which the occupancy situation to each column is identified, bitmap index
In be also equipped with two column, a column and b column, wherein in a column record A column each association subdata storage condition, in b column record B column
The storage condition of each association subdata.One of relation data corresponds to a line in the bitmap index.
As shown in Fig. 2, having recorded bitmap mark 1 and 1 in the first row of bitmap index, illustrate that first relation data is same
When include two association subdatas, the association subdata be respectively stored into A column the first row and B arrange the first row, the second row
In have recorded bitmap mark 1 and 0, illustrate that second relation data includes an association subdata, which is stored in
Second row of A column, the third line have recorded bitmap mark 0 and 0, illustrates that third relation data is not stored in any one and arranges,
Fourth line has recorded bitmap mark 1 and 1, illustrates the 4th relation data while including two association subdatas, the association subnumber
According to be respectively stored into A column the third line and B column the second row, and so on, the row k of the bitmap index has recorded bitmap mark
Know 1 and 1, illustrates k-th of relation data while including two association subdatas, which has been respectively stored into A column
The jth row of i-th row and B column, wherein i is the quantity of storage association subdata in A column, and j is the number of B column storage association subdata
Amount.
The bitmap mark that the position in bitmap index corresponds to row is searched in the position according to where the association subdata
Include:
It is relevant according to caching in the bitmap index according to the line number for the row that the association subdata caches in the column
First bitmap of subdata identifies, the identification information of the row of bitmap index where searching the first bitmap mark of the first quantity, and
It searches in the row and is identified for the bitmap of each column, wherein first quantity is the line number；
Described to be identified according to the bitmap of the row, extracting other association subdatas in corresponding each column corresponding position includes:
The first bitmap of each of row mark according to the bitmap index, according to first bitmap mark place
Column are identified in the column from starting into the row occur what the first bitmap identified according to sequence from front to back for the column
Number extracts other association subdatas cached in several rows of the correspondence time in corresponding column.
Wherein cache the first bitmap mark of relevant subdata, i.e., bitmap mark 1 described above, second map logo
It is uncached association subdata for bitmap mark 0.According to Fig.2, for the row k in ID table, the corresponding bitmap rope of the row
Combination Bitmapk=(ak, bk), ak and the bk for drawing the bitmap mark of middle corresponding row are the bitmap mark of a column and b column in row k.
For ak, it is i-th of nonzero value in a column, therefore when determining the corresponding nonzero value quantity in a column of ak, can be indicated
For P (ak)=i, for bk, it is j-th of nonzero value in b column, therefore is determining the corresponding nonzero value quantity in b column of bk
When, P (bk)=j can be expressed as.A is arranged accordingly, the corresponding value mark of row k in i-th of data Ai bitmap index,
B is arranged, the corresponding value mark of row k in j-th of data Bj bitmap index, above-mentioned each direct corresponding relationship of table can be with table
(IDK, Ai, Bj) is shown as same data line, and P (ak)=i, P (bk)=j.
Pass through above-mentioned relation, it is known that, all may be by upper for the numerical value of any column of a line any in above-mentioned each table
State relationship lookup.
S405: using the intersection of the relation data combined for each association subdata as query result.
Corresponding relation data can be found for each association subdata, is wrapped when in the relation data to be checked
When containing more than two association subdatas, it is final that the relation data found for each association subdata, which is taken intersection,
Query result.
Such as the data to be checked are male, 14 years old, and also according to the description of above-described embodiment, which is split as two passes
Join subdata male and 14 years old, meets gender in gender column and the lookup of age column respectively and be male's relation data and expire
The relation data that the sufficient age is 14, the relation data found according to gender are the first relation data, the second relation data and the
Three relation datas, the relation data found according to the age are the first relation data, the second relation data and the 4th relation data,
The intersection for the relation data that two association subdatas combine is the first relation data and the second relation data.
Due to being directed to each relation data in embodiments of the present invention, each of the relation data is recorded by bitmap index
It is associated with the cache location of subdata, therefore corresponding relation data can be searched according to bitmap index, facilitates looking into for relation data
It askes, and improves the utilization rate of the memory spaces such as memory.
In one embodiment of the invention, with the presence or absence of association in the association subdata of the judgement each column storage
Data include:
For each column, in the corresponding filter of the column, judge whether deposit in the information of the association subdata of column storage
In the association subdata.
In the above-described embodiments, filter, Filter as shown in Figure 2, in the filter are both provided with for each column
It is stored with the information of the association subdata cached in the column, the information of the specific association subdata can be to be cached in the column
Each association subdata can be the corresponding conditions that the association subdata of column caching meets.Because when having cached phase in each column
After the association subdata answered, judge whether filter preserves the association subdata, if storing association in filter
Data are not updated the filter then, when not saving the association subdata in the filter, then by the association subdata
Information be added in filter.It therefore, can be with according to the information of the association subdata saved in the corresponding filter of each column
Accelerate the speed of inquiry.If there are the association subdatas in the filter, continuation is searched one by one in the column, if the mistake
The association subdata is not present in filter, then can save subsequent finding step, directly output does not inquire mentioning for accordingly result
Show information.
In one embodiment of the invention, with the presence or absence of association in the association subdata of the judgement each column storage
Data include:
For each column in each subregion, in the corresponding each filter of the column, the association subnumber of column storage is judged
According to information in whether there is the association subdata.
In order to meet the needs of distributed memory system, deblocking, different data can be stored in different set
It is standby upper, therefore all rows in corresponding each column may be in different subregions, in order to facilitate the lookup of follow-up data.In difference
Subregion each column is provided with corresponding filter.
Different subregions is located at same electronic equipment or different electronic equipments.
Although not going together for same row may on different devices, inquiry and caching for the ease of data, column
Cluster table and bitmap index still use same, and according to continuous between equipment, are arranged between distinct device between row
Relationship.It is same with the above-mentioned embodiment to the process for searching association subdata in the filter of each column, in the embodiment of the present invention
In to the process without repeating.
Below with reference to a specific embodiment, the relation data caching and query process of the embodiment of the present invention are said
It is bright, shown in the relation schematic diagram between each table as shown in connection with fig. 5.
Relation data includes: that name, gender are associated with subdata with the age, the relation data of first caching be Zhang San, male,
21 years old, second caching relation data be Li Si, female, 23 years old, third caching relation data be 20 years old, the 4th cache
Relation data is horse five, female, 20 years old.
When being cached, name is buffered in A column, and gender is buffered in B column, and the age is buffered in C column, in the pass cached
Coefficient splits out each relationship subdata in, by each relator data buffer storage in respective column.It is specifically slow by first
The relation data deposited is split as Zhang San, male, 21 years old, and Zhang San is buffered in the first row of A column, and male is buffered in the first row of B column,
21 years old is buffered in the first row of C column.The current ID table is used not yet, and corresponding bitmap index is also not used by, therefore
The information of the relation data is added in the first row of bitmap index, is specifically arranged in the first row of the bitmap index for A
Position addition bitmap mark 1, for B column position addition bitmap mark 1, for C class position add 1.And in the ID table
The occupied information of middle record the first row.
In addition, when that will be associated with subdata and be cached to A column, it is elongated length of field which, which arranges corresponding data length, therefore root
According to the corresponding data length of the column, name is converted into the data length, and the association subnumber after the conversion is cached in the column
According to.It is fixed data length that B column and C, which are arranged corresponding, then the Cache associativity subdata directly in respective column.
The information of each association subdata is added according to each association subdata of caching for the filter of each column.And
And it can at set time intervals, by the relationship of caching by data connection driving (Data Connection Driver)
Data are synchronized to alternative document system (FileSystem).
It is same to adopt and cached in a like fashion for second, third, the 4th relation data cached,
And to the corresponding position addition bitmap mark of the second row, the third line and fourth line in the bitmap index, as Fig. 5 Bitmap indexes
Preceding four row.Other relation datas can be also cached, later in order to simply only be said for caching four relation datas herein
It is bright.
When the data to be checked received are Li Si, female, 23 years old, which is split as three association subdatas point
Not Wei Li Si, female, 23 years old, then respectively A column, B column and C column in inquired.
When being inquired in A is arranged, A arranges corresponding filter, judges whether the information for being cached with Li Si, then arranges in A
Every row in searched, find the information that the second row is stored with Li Si.Because Li Si is stored in the second row of A column,
Therefore it is searched in bitmap index and the row that second bitmap is identified as 1 occurs, it is specific for the second row in bitmap index.According to
The bitmap of second row of bitmap index identifies, it is known that the association subdata of the relation data is all cached in A, B, C column.In B column
Map logo 1 is second of appearance, then other corresponding association subdatas of Li Si, map logo in C column are extracted in the second row of B column
1 to be also second of appearance, then extracts other corresponding association subdatas of Li Si in the second row of C column.
When the data to be checked received are 20, which is the association subdata of relation data, and is stored in C
It in column, is then arranged in corresponding filter according to C, judges whether to be cached with 20 information, if it is present being looked into C column
It looks for, the third line and fourth line for finding C column are all stored with 20 information.Therefore according to C arrange in 20 line number that stores, can
Know, respectively the third line and fourth line, is then searched in bitmap index and occur third bitmap mark 1 in column corresponding with C column
Line number and there is the line number of the 4th bitmap mark 1, the third line and fourth line respectively in bitmap index.According to bitmap rope
Draw each bitmap mark in the third line it is found that corresponding relation data only includes association subdata 20, according to bitmap index the
Each bitmap mark in four rows is it is found that corresponding relation data also has storage in A column and B column.A is arranged, according to bitmap
In index in fourth line in column corresponding with A column, from the beginning number that the bitmap mark 1 of fourth line arrives fourth line appearance is 3, therefore
Know that other association subdatas of the relation data are buffered in the 3rd row of A column；According in bitmap index in fourth line with B column pair
In the column answered, from the beginning number that the bitmap mark 1 of fourth line arrives fourth line appearance is 3.It may thus be appreciated that other of the relation data
Association subdata is buffered in the 3rd row of B column, other for extracting that the 3rd row in A column and B column stores are associated with subdata, arranges the with from C
Four rows find association subdata and are combined to obtain the first relation data, and the association subnumber that will be found from C column the third line
According to as the second relation data, using the first relation data and the second relation data as query result.
The process searched according to other association subdatas is similar with the above process, herein just without repeating.
Fig. 6 is relation data buffer storage structural schematic diagram provided in an embodiment of the present invention, is applied to electronic equipment, the dress
It sets and includes:
Receiving module 61, for receiving relation data to be cached, wherein including at least a pass in the relation data
Join subdata；
Cache module 62, for the corresponding relationship according to each column in each association subdata and column cluster, by each association
Data buffer storage is into corresponding column；
Update module 63 updates the position that row is corresponded in bitmap index for whether having cached the relation data according to each column
Map logo.
Described device further include:
Filtering module 64, for judging whether preserve the association subdata in the corresponding filter of the column for each column,
If it does not exist, then the information of the association subdata is added in the filter.
Described device further include:
Filtering module 64 judges that this is listed in this point according to the subregion where the row of association subdata caching for each column
Whether the association subdata is preserved in area in corresponding filter, if it does not exist, then the information of the association subdata is added
It is added in the filter.
The cache module 62 is specifically used for being directed to each column, identifies whether the corresponding data cached length of the column fixes；
If so, directly caching the association subdata in the column；If it is not, then according to the corresponding data length of the column, by the column pair
The association subdata answered is converted to the data length, and the association subdata after the conversion is cached in the column.
Described device further include:
Synchronization module 65, at set time intervals, the relation data of caching being synchronized to other systems.
Specifically, the relation data is buffered in memory or the solid state hard disk of the electronic equipment.
Fig. 7 is the relation data inquiry unit provided in an embodiment of the present invention based on relation data buffer storage shown in Fig. 6
Structural schematic diagram, is applied to electronic equipment, which includes:
Receiving module 71, for receiving data to be checked, wherein the data are in relation data or relation data
At least one association subdata；
Module 72 is split, for the data to be split as at least one association subdata；
Searching module 73, for judging the column according to the column for caching this association subdata for each association subdata
It whether there is the association subdata in the association subdata of caching；If so, being looked into according to the position where the association subdata
It looks for the position in bitmap index to correspond to the bitmap mark of row, and is identified according to the bitmap of the row, in corresponding each column corresponding positions
Other association subdatas of extraction are set, and group is combined into relation data；
Module 74 is provided, for the intersection for the relation data that each association subdata combines will to be directed to as inquiry knot
Fruit.
The searching module 73, specifically for the line number of the row cached in the column according to the association subdata, described
It is identified in bitmap index according to the first bitmap for caching relevant subdata, searches the first bitmap mark place of first quantity
The identification information of the row of bitmap index, and search in the row and identified for the bitmap of each column, wherein first quantity is institute
State line number；The first bitmap of each of row mark according to the bitmap index, according to first bitmap mark place
Column are identified in the column from starting into the row occur what the first bitmap identified according to sequence from front to back for the column
Number, other association subdatas cached in the row for extracting the correspondence number in corresponding column.
The searching module 73 is specifically used for being directed to each column, in the corresponding filter of the column, judges the pass of column storage
Join and whether there is the association subdata in the information of subdata.
The searching module 73, specifically in the corresponding filter of the column, judging for each column in each subregion
It whether there is the association subdata in the information of the association subdata of column storage.
It include: to connect the embodiment of the invention provides a kind of relation data caching and querying method and device, the caching method
It receives after the relation data cached, according to the corresponding relationship of each column in each association subdata and column cluster, by each association
Whether data buffer storage has cached the relation data into corresponding column, and according to each column, updates the position that row is corresponded in bitmap index
Map logo.Due to the mapping table in embodiments of the present invention based on bitmap index and each column, relation data caching is carried out, and
And relation data is divided into multiple association subdatas, is cached respectively, therefore improves the buffer efficiency of relation data, and
And this method is applied to the memory of electronic equipment, improves the utilization rate of memory.
For systems/devices embodiment, since it is substantially similar to the method embodiment, so the comparison of description is simple
Single, the relevent part can refer to the partial explaination of embodiments of method.
It should be noted that, in this document, relational terms such as first and second and the like are used merely to a reality
Body or operation are distinguished with another entity or operation, are deposited without necessarily requiring or implying between these entities or operation
In any actual relationship or order or sequence.Moreover, the terms "include", "comprise" or its any other variant are intended to
Non-exclusive inclusion, so that the process, method, article or equipment including a series of elements is not only wanted including those
Element, but also including other elements that are not explicitly listed, or further include for this process, method, article or equipment
Intrinsic element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that
There is also other identical elements in process, method, article or equipment including the element.
Those of ordinary skill in the art will appreciate that all or part of the steps in realization above method embodiment is can
It is completed with instructing relevant hardware by program, the program can store in computer-readable storage medium,
The storage medium designated herein obtained, such as: ROM/RAM, magnetic disk, CD.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the scope of the present invention.It is all
Any modification, equivalent replacement, improvement and so within the spirit and principles in the present invention, are all contained in protection scope of the present invention
It is interior.
Claims (20)
1. a kind of relation data caching method, which is characterized in that it is applied to electronic equipment, this method comprises:
Relation data to be cached is received, wherein including at least an association subdata in the relation data；
According to the corresponding relationship of each column in each association subdata and column cluster, each association subdata is cached to corresponding column
In；
According to the identification information of the occupied row of the bitmap index recorded in ID table, determine that the relation data is corresponding in bitmap index
Capable identification information, record has the whether occupied information of every row, the ID in corresponding bitmap index in the ID table
The quantity for the row that table includes is identical as the quantity for the row that bitmap index includes；
The relation data whether has been cached according to each column, has updated the bitmap mark for corresponding to row in bitmap index.
2. the method according to claim 1, wherein described be cached to each association subdata in corresponding column
Afterwards, the method also includes:
For each column, judge the association subdata whether is preserved in the corresponding filter of the column, if it does not exist, then by the pass
The information of connection subdata is added in the filter.
3. the method according to claim 1, wherein described be cached to each association subdata in corresponding column
Afterwards, the method also includes:
Judge that this is listed in corresponding filtering in the subregion according to the subregion where the row of association subdata caching for each column
Whether the association subdata is preserved in device, if it does not exist, then the information of the association subdata is added to the filter
In.
4. according to the method described in claim 3, it is characterized in that, different subregions is located at same electronic equipment or different
Electronic equipment.
5. method according to claim 1-4, which is characterized in that described to be cached to each association subdata pair
Include: in the column answered
For each column, identify whether the corresponding data cached length of the column fixes；
If so, directly caching the association subdata in the column；
If it is not, then the corresponding association subdata of the column is converted to by the data length according to the corresponding data length of the column, and
Association subdata after caching the conversion in the column.
6. the method according to claim 1, wherein the method also includes:
At set time intervals, the relation data of caching is synchronized to other systems.
7. the method according to claim 1, wherein the relation data is buffered in the memory of the electronic equipment
Or in solid state hard disk.
8. a kind of relation data querying method based on relation data caching method as claimed in claim 1 to 7, feature
It is, is applied to electronic equipment, this method comprises:
Data to be checked are received, wherein the data are at least one association subdata in relation data or relation data；
The data are split as at least one association subdata；
It is associated with subdata for each, according to the column for caching this association subdata, in the association subdata for judging column caching
With the presence or absence of the association subdata；If so, searching the position in bitmap index according to the position where the association subdata
The bitmap mark of corresponding row, and identified according to the bitmap of the row, other association subnumbers are extracted in corresponding each column corresponding position
According to, and group is combined into relation data；
Using the intersection of the first quantity associated data combined for each association subdata as query result.
9. according to the method described in claim 8, it is characterized in that, the position according to where the association subdata, is looked into
The bitmap mark for looking for the position in bitmap index to correspond to row includes:
According to the line number for the row that the association subdata caches in the column, according to the relevant subnumber of caching in the bitmap index
According to the first bitmap mark, the identification information of the row of bitmap index, and is searched where searching the first bitmap mark of the first quantity
It is identified in the row for the bitmap of each column, wherein first quantity is the line number；
Described to be identified according to the bitmap of the row, extracting other association subdatas in corresponding each column corresponding position includes:
The first bitmap of each of row mark according to the bitmap index, the column where being identified according to first bitmap,
For the column, identify in the column according to sequence from front to back from time for starting into the row the first bitmap mark occur
It counts, other association subdatas cached in the row for extracting the correspondence number in corresponding column.
10. according to the method described in claim 8, it is characterized in that, it is described judge the column caching association subdata in whether
There are the association subdatas to include:
For each column, in the corresponding filter of the column, judging, which whether there is in the information of the association subdata of column storage, is somebody's turn to do
It is associated with subdata.
11. according to the method described in claim 8, it is characterized in that, it is described judge the column caching association subdata in whether
There are the association subdatas to include:
For each column in each subregion, in the corresponding each filter of the column, the association subdata of column storage is judged
It whether there is the association subdata in information.
12. a kind of relation data buffer storage, which is characterized in that be applied to electronic equipment, which includes:
Receiving module, for receiving relation data to be cached, wherein including at least an association subnumber in the relation data
According to；
Cache module delays each association subdata for the corresponding relationship according to each column in each association subdata and column cluster
It is stored in corresponding column；
Update module determines in bitmap index for the identification information according to the occupied row of the bitmap index recorded in ID table
The relation data corresponds to the identification information of row, and whether record has every row in corresponding bitmap index occupied in the ID table
Information, the quantity for the row that the ID table includes is identical as the quantity for the row that bitmap index includes；Whether cached according to each column
The relation data updates the bitmap mark that row is corresponded in bitmap index.
13. device according to claim 12, which is characterized in that described device further include:
Filtering module judges the association subdata whether is preserved in the corresponding filter of the column, if not for being directed to each column
In the presence of then the information of the association subdata is added in the filter.
14. device according to claim 12, which is characterized in that described device further include:
It is right in the subregion to judge that this is listed according to the subregion where the row of association subdata caching for each column for filtering module
Whether the association subdata is preserved in the filter answered, if it does not exist, then the information of the association subdata is added to institute
It states in filter.
15. the described in any item devices of 2-14 according to claim 1, which is characterized in that the cache module, specifically for being directed to
Each column, identifies whether the corresponding data cached length of the column fixes；If so, directly caching the association subnumber in the column
According to；If it is not, then the corresponding association subdata of the column is converted to by the data length according to the corresponding data length of the column, and
Association subdata after caching the conversion in the column.
16. device according to claim 12, which is characterized in that described device further include:
Synchronization module, at set time intervals, the relation data of caching being synchronized to other systems.
17. a kind of relation data inquiry unit based on any relation data buffer storage of claim 12-16, special
Sign is, is applied to electronic equipment, which includes:
Receiving module, for receiving data to be checked, wherein the data are at least one in relation data or relation data
Item association subdata；
Module is split, for the data to be split as at least one association subdata；
Searching module, for judging column caching according to the column for caching this association subdata for each association subdata
It is associated in subdata and whether there is the association subdata；If so, searching bitmap according to the position where the association subdata
The position corresponds to the bitmap mark of row in index, and is identified according to the bitmap of the row, extracts in corresponding each column corresponding position
Other association subdatas, and group is combined into relation data；
Module is provided, for the intersection for the relation data that each association subdata combines will to be directed to as query result.
18. device according to claim 17, which is characterized in that the searching module is specifically used for according to association
The line number for the row that data cache in the column, according to the first bitmap mark for caching relevant subdata in the bitmap index
Know, the identification information of the row of bitmap index where searching the first bitmap mark of the first quantity, and searches in the row for every
The bitmap of column identifies, wherein first quantity is the line number；Each of row first according to the bitmap index
Map logo, according to the column where first bitmap mark, for the column, according to sequence from front to back identify in the column from
The number for starting into the row to occur the first bitmap mark, cache in the row for extracting the correspondence number in corresponding column its
He is associated with subdata.
19. device according to claim 17, which is characterized in that the searching module is specifically used for being directed to each column, at this
It arranges in corresponding filter, judges in the information of the association subdata of column storage with the presence or absence of the association subdata.
20. device according to claim 17, which is characterized in that the searching module is specifically used for being directed to each subregion
In each column, in the corresponding each filter of the column, judge the column storage association subdata information in the presence or absence of this
It is associated with subdata.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510766583.3A CN106682042B (en) | 2015-11-11 | 2015-11-11 | A kind of relation data caching and querying method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510766583.3A CN106682042B (en) | 2015-11-11 | 2015-11-11 | A kind of relation data caching and querying method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106682042A CN106682042A (en) | 2017-05-17 |
| CN106682042B true CN106682042B (en) | 2019-11-22 |
Family
ID=58865271
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510766583.3A Active CN106682042B (en) | 2015-11-11 | 2015-11-11 | A kind of relation data caching and querying method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106682042B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110168529B (en) * | 2017-08-03 | 2022-05-13 | 华为云计算技术有限公司 | Data storage method, device and storage medium |
| CN109101516B (en) | 2017-11-30 | 2019-09-17 | 新华三大数据技术有限公司 | A kind of data query method and server |
| CN110874358B (en) * | 2018-08-30 | 2023-05-05 | 阿里巴巴集团控股有限公司 | Multi-attribute column storage and retrieval method and device and electronic equipment |
| CN109947793B (en) * | 2019-03-20 | 2022-05-31 | 深圳市北斗智能科技有限公司 | Method and device for analyzing accompanying relationship and storage medium |
| WO2020232569A1 (en) * | 2019-05-17 | 2020-11-26 | 环球雅途集团有限公司 | Database access layer representation method and device |
| CN112214521A (en) * | 2020-11-20 | 2021-01-12 | 深圳前海微众银行股份有限公司 | Rule query method, device, equipment and computer storage medium |
| CN112632077A (en) * | 2020-12-28 | 2021-04-09 | 深圳壹账通智能科技有限公司 | Data storage method, device, equipment and storage medium based on redis |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101968806A (en) * | 2010-10-22 | 2011-02-09 | 天津南大通用数据技术有限公司 | Data storage method, querying method and device |
| CN102663116A (en) * | 2012-04-11 | 2012-09-12 | 中国人民大学 | Multi-dimensional OLAP (On Line Analytical Processing) inquiry processing method facing column storage data warehouse |
| CN103678556A (en) * | 2013-12-06 | 2014-03-26 | 华为技术有限公司 | Method for processing column-oriented database and processing equipment |
| CN103970870A (en) * | 2014-05-12 | 2014-08-06 | 华为技术有限公司 | Database query method and server |
| US9176999B2 (en) * | 2012-09-13 | 2015-11-03 | International Business Machines Corporation | Multiplication-based method for stitching results of predicate evaluation in column stores |
-
2015
- 2015-11-11 CN CN201510766583.3A patent/CN106682042B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101968806A (en) * | 2010-10-22 | 2011-02-09 | 天津南大通用数据技术有限公司 | Data storage method, querying method and device |
| CN102663116A (en) * | 2012-04-11 | 2012-09-12 | 中国人民大学 | Multi-dimensional OLAP (On Line Analytical Processing) inquiry processing method facing column storage data warehouse |
| US9176999B2 (en) * | 2012-09-13 | 2015-11-03 | International Business Machines Corporation | Multiplication-based method for stitching results of predicate evaluation in column stores |
| CN103678556A (en) * | 2013-12-06 | 2014-03-26 | 华为技术有限公司 | Method for processing column-oriented database and processing equipment |
| CN103970870A (en) * | 2014-05-12 | 2014-08-06 | 华为技术有限公司 | Database query method and server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106682042A (en) | 2017-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106682042B (en) | A kind of relation data caching and querying method and device | |
| CN103020204B (en) | A kind of method and its system carrying out multi-dimensional interval query to distributed sequence list | |
| US8140495B2 (en) | Asynchronous database index maintenance | |
| US6408312B1 (en) | Method and system for supporting multiple, historical, and future designs in a relational database | |
| US7418544B2 (en) | Method and system for log structured relational database objects | |
| US20070233720A1 (en) | Lazy bulk insertion method for moving object indexing | |
| CN107423422B (en) | Spatial data distributed storage and search method and system based on grid | |
| US7890541B2 (en) | Partition by growth table space | |
| EP1393206B1 (en) | Data structure for information systems | |
| US8862588B1 (en) | Generating an empirically-determined schema for a schemaless database | |
| CN110291518A (en) | Merge tree garbage index | |
| CN108256088A (en) | A kind of storage method and system of the time series data based on key value database | |
| CN110268399A (en) | Merging tree for attended operation is modified | |
| CN109902130A (en) | A kind of date storage method, data query method and apparatus, storage medium | |
| CN110287391A (en) | Multi-level trajectory data storage method, storage medium and terminal based on Hadoop | |
| CN110321325A (en) | File inode lookup method, terminal, server, system and storage medium | |
| CN110309233A (en) | Method, apparatus, server and the storage medium of data storage | |
| CN104239377A (en) | Platform-crossing data retrieval method and device | |
| CN103544261A (en) | Method and device for managing global indexes of mass structured log data | |
| US20150234898A1 (en) | Apparatus and method for processing query in database with hybrid storage | |
| CN107391600A (en) | Method and apparatus for accessing time series data in internal memory | |
| CN106599040A (en) | Layered indexing method and search method for cloud storage | |
| CN105095240A (en) | Database data sample acquisition | |
| CN109408589A (en) | Method of data synchronization and device | |
| CN108694188A (en) | A kind of newer method of index data and relevant apparatus |
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 |