CN102521303A - Single-table multi-column sequence storage method for column database - Google Patents
Single-table multi-column sequence storage method for column database Download PDFInfo
- Publication number
- CN102521303A CN102521303A CN2011103920331A CN201110392033A CN102521303A CN 102521303 A CN102521303 A CN 102521303A CN 2011103920331 A CN2011103920331 A CN 2011103920331A CN 201110392033 A CN201110392033 A CN 201110392033A CN 102521303 A CN102521303 A CN 102521303A
- Authority
- CN
- China
- Prior art keywords
- row
- index
- column
- data
- tables
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a single-table multi-column sequence storage method for a column database. The column database comprises a plurality of data tables formed by rows and columns, wherein the data tables are divided into a plurality of column sets, and the column set comprises one or more columns; and a union set of the column sets forms the data table, and a connection index is established between every two column sets and records the one-to-one corresponding relationship of storage positions of the columns of the same tuple belonging to the data table in the two column sets between which the connection index is established. The single-table multi-column sequence storage method provided by the invention can improve the query efficiency of the column database, and reduces the storage space.
Description
Technical field
The present invention relates to a kind of database storing method, relate in particular to a kind of single table multiple row preface storage means that is used for the column data storehouse, belong to the database storage techniques field.
Background technology
Relevant database is the software systems in order to storage and Processing Structure data, and its data are divided into two levels: the one, and logical data, it is made up of tables of data, record etc.; Another is a physical data, and its representation database is the stored logic data how.The method of fulfillment database physical data has two kinds: a kind of row that is based on is stored, and another kind is based on the row storage.
For implementation method based on row storage, it be the whole piece recording storage of logical data in data block, in order to improve inquiry velocity, set up the index of types such as B+ tree for some row; For implementation method based on the row storage; Record in the logical data directly is not mapped in the physical data by bar; But by row separately record; There is the value of the same column of all records together, the connection data are provided simultaneously, be used for reconfiguring the formation record to the corresponding train value of different recording.
Along with deepening continuously of enterprise and e-government, the complicacy of database application strengthens day by day.These demands are promoting database technology and are developing to the direction of magnanimity with intelligence.Simultaneously, application such as data warehouse and on-line analysis presses for the data processing technique of real-time high-efficiency.Technical bottleneck has appearred in traditional database technology based on the row storage.How when carrying out complex query fast, can also dwindle storage space is the hot issue of present database technology research with practicing thrift cost.
The column data storehouse is based on the relevant database in row memory technology, main To enterprises decision analysis field.The characteristics of row memory technology are that efficiency data query is high, and it is few to read disk, and storage space is few, are the desirable frameworks that makes up data warehouse.The using value in column data storehouse comes from its storage advantage that quick response and data compression brought to complex query, makes it have bright development prospect in applications such as business decision analysis, data warehouse, business intelligence.According to the analysis report about data warehouse of U.S. Gartner company in January, 2010 issue: the column data storehouse is compared with the traditional relational database, aspect data analysis, shows remarkable performance.Therefore, the technical research in column data storehouse and product development receive extensive concern in academia and industry member.
At present, there is C-Store in the column data storehouse of increasing income, rasdaman, and MonetDB etc., there are Sybase IQ, Vertica Analytic Database, ParAccel Analytic Database, EXASOL EXA Solution etc. in commercial column data storehouse.Over nearly 5 years, the best paper in world first-class database meeting such as VLDB, SIGMOD, the last relevant field, column data storehouse of ICDE also occurs again and again.
In application number is 200810187227.6 Chinese invention patent application, discloses a kind of the realization and comprised: set up data file, and the data block of forming data file is compiled sequence number in order based on the method and the device of the relevant database of row storage; The definition list section; Record is inserted in the table section; For unique record identify number in the record generation table section that is inserted in the table section, and will write down separately by row; For each row in the record, carry out operation as follows: train value is stored in the data block and by the train value size as Value Data with record identify number sort; The sequence number of the record identify number and the data block of storing value data is stored in the new data block as being connected data, and press the ordering of record identify number size; Data block to the storing value data is set up index with the data block that storage is connected data, generates the index data piece.This method is that the data block of storing value data is set up index with the data block that storage is connected data, rather than sets up index between the different lines that belongs to same tuple or row are gathered.
Summary of the invention
Technical matters to be solved by this invention is to provide a kind of single table multiple row preface storage means that is used for the column data storehouse.Utilize this storage means can improve the search efficiency in column data storehouse, and reduce storage space.
For realizing above-mentioned goal of the invention, the present invention adopts following technical scheme:
A kind of single table multiple row preface storage means that is used for the column data storehouse; Said column data storehouse comprises a plurality of tables of data that are made up of row and column; Said tables of data is divided into a plurality of row set; The set of said row comprises one or more row, and said row union of sets collection constitutes said tables of data, it is characterized in that:
The said row set index that connects between any two, said connection index record has been set up in two row set that connect index, belongs to the one-to-one relationship of memory location of row of the same tuple of said tables of data.
Wherein more excellently, to each row set, according to the memory location values of the row same tuple that belongs to said tables of data, in two row set, index connects;
Said connection index corresponding stored is in said each row set, and corresponding with said row in said each row set.
Wherein more excellently,, two row set repeat row, then according to the said row that repeat, to the advance line ordering and the storage of said two row set if comprising;
If two row set do not repeat row, then will said two row that row are gathered, sort according to querying condition respectively and store.
Wherein more excellently, for said two the row set that do not repeat to be listed as, the index that do not connect if logical order is identical, index connects if logical order is inequality.
Wherein more excellently, for said two the row set that repeat to be listed as are arranged, index does not connect.
Wherein more excellently, estimate the cost that each executive plan is required, select to connect index according to optimum cost.
Wherein more excellently, when whole row of judging said tables of data all appear at said a plurality of row union of sets and concentrate, be that Materialized View is created in each row set, accomplish the establishment of row set.
Wherein more excellently, in the process of index that connects, also comprise following row set load step:
Step 1: at said tables of data loading data;
Step 2: materialization all is listed as the set Materialized View, comprises the memory location of each row set of materialization;
Step 3: index connects;
Step 4: the data of deleting said tables of data;
Step 5: delete unwanted memory location value.
The present invention has broken the row storage needs maintenance to belong to the identical restriction in the position of train value in every row of same logic tuple, makes this list table multiple row preface storage means increase the dirigibility of using.The projection that the present invention can divide optimal sequence according to the inquiry that the form class is used can not lost performance according to connecting index process Ad-Hoc (point-to-point) type inquiry to strengthen the property yet.
Description of drawings
Below in conjunction with accompanying drawing and embodiment the present invention is done further detailed description.
Fig. 1 has shown a database items purpose example of using this list table multiple row preface storage means;
Fig. 2 is in the database project shown in Figure 1, the synoptic diagram of display storage location value;
Fig. 3 in the database project shown in Figure 1, shows the synoptic diagram that connects index;
Fig. 4 is in this list table multiple row preface storage means, creates the operation steps synoptic diagram of row set;
Fig. 5 is in the embodiment shown in fig. 1, the synoptic diagram of the connection index of being set up;
Fig. 6 is in the embodiment shown in fig. 1, uses the synoptic diagram that connects index reduction logic tuple.
Embodiment
The present invention uses the logic data model of relational database: each relation (relation) is a bivariate table (table), is made up of row (tuple also claims tuple) and row (attribute also claims field).On this basis, the present invention uses the physical organization based on the row set to realize logic data model.At first introduce the concrete implication of " row set " below.
The row set: each row set all belongs to a relation, and the above-listed set of logic is a vertical subclass of relation under it; Physically comprise one or more row of this relation and identical line number is arranged with affiliated relation.If the relation under the row set is many-to-one relation with another relation, also can comprise the row in another relation in the row set.
Can repeat to comprise same row between the row set, also can not repeat row each other.In other words, the row between the row set can be overlapping, can comprise the same column of a plurality of tables of data.Belonging to unions in homonymous all row set, row is exactly the set of this pass series, and these row have just been formed this relation.Use the row storage in the row set, and can sort according to row or several row in the row set.Such organizational form can be saved the storage overhead of index and the optimization space to inquiry is provided.In storing process, can use multiple row store compressed mode, for example RLE (run length encoding) etc.In addition, can use the mode of fragmented storage to improve compression efficiency.
The present invention provides the row storage physical organization mode of a kind of OLAP of being used for (on-line analytical processing) scene, can use less storage space and more optimization dirigibility is provided.For this reason, in single table multiple row preface storage means provided by the present invention, the tables of data that at first will store is divided into the set of a plurality of row as base table.Use the connection of memory location value (storage key) index (join index) that connects simultaneously.This connecting strand is incorporated in the one-to-one relationship of train value between the set of record different lines.Be listed as set through connecting other train values that other connection index that are listed as set can obtain train value correspondence in base table in this row set, so that rebuild a tuple in logic.The memory location value can be set according to actual needs, for example can be the cryptographic hash etc. of Hash row in the base table.
This row set is a vertical division of base table, comprises one or more row, with base table identical line number is arranged.In addition, row set also can comprise the row that other and base table have the tables of data of many-one relationship.
Need maintenance to belong to the position needs identical restriction of train value in every row of same logic tuple because the present invention has broken the row storage, make this list table multiple row preface storage means can increase the dirigibility in the use.The projection that the present invention can divide optimal sequence according to the inquiry that the form class is used for example in Fig. 6, is at first carried out the projection of name to strengthen the property, and finds corresponding place system according to connecting index again.The prerequisite that realizes this process is: what write down in the connection index is to be listed as to gather to belong to tie up to be listed as the memory location of gathering in the name.Therefore; In each row set, all to store the connection index; In the position of row in the minute book row set in another row set, i.e. row in these the row set and another row set which is corresponding, also can not lose performance according to the inquiry of connection index process Ad-Hoc (point-to-point) class.
Single table multiple row preface storage means of the present invention at the row set index that connects between any two, has connected index record, has set up in two row set that connect index, belongs to the one-to-one relationship of memory location of row of the same tuple of tables of data.To each row set, according to the memory location values of the row same tuple that belongs to tables of data, in two row set, the index that connects will connect the index corresponding stored in each row set, and to be listed as the value of the respective column in gathering corresponding with each.Like this, even each row set is resequenced, the value that connects index sorts thereupon, also just can not influence the corresponding relation between the row that belong to same tuple that are listed as set.
Below, be example with a database project of using single table multiple row preface storage means, specifically set forth implementation step of the present invention and effect thereof.This database example is the database that is used for institution of higher learning's teaching management work.As shown in Figure 1, press row 1 (student number, name, sex, the age) of set of student number ordering and formed student's relation by the row set 2 (student number, place system) of place system ordering, comprised the row in the course in the row set 3.As shown in Figure 2, each value of the every row in the row set all has a memory location value, and the row with same memory location value constitute a logic tuple.This memory location value can not adopt the physical store mode.As shown in Figure 3, because the set of the row of component relationship can be according to different row orderings, the train value that in base table, has same memory location value possibly be in different positions in different row set.Like student number among Fig. 3 is 20070026 record, in row set 2, is positioned at the 1st row; In row set 1, be positioned at the 2nd row.Use to connect this position of index marker relation, can when being not sure of physical storage locations, find out the train value identical, and then, can obtain the logic tuple according to the order of certain row through the index that in different row set, connects with the memory location value.For example, connection index (being " correspondence position " in upper right side among Fig. 3) mark, the 1st row is corresponding with the 2nd row that is listed as in gathering in the row set 2.
Can know that through above explanation two row that logical order is identical can not need connect index between gathering.Repeat row if two row set comprise, then repeat row, to the advance line ordering and the storage of two row set according to this; If two row set do not repeat row,, sort according to querying condition respectively and store then with the row of two row set.Two row set that do not repeat to be listed as, the index that do not connect if logical order is identical, index connects if logical order is inequality.Two row set that repeat to be listed as are arranged,, then need not connect index because its ordering is identical.
Fig. 4 has shown in this list table multiple row preface storage means, creates the operation steps of row set.At first, judge according to the row sets definition whether tabulation is empty.If tabulation is sky then return, if the row that the base table part, is further judged in tabulation for sky then get the row set whether in base table row set A, if result then in the set B that will be listed as and fall in lines for being, the feedback error information if the result is.Next; Check that further the row in each row of not quoting other tables set belong to base table? Whether each row of quoting in the row set of other tables belongs to reference list; Do reference list and base table have main external key relation? Comprise row and belong to tabulation X? Is there other row set to comprise the row (promptly whether whole row of base table all appear in the row set) of base table? Result in above inspection is under the situation that is, in the involved row and the set B of falling in lines.If the result of inspection is not situation, feedback error information according to circumstances then.Under the row set B situation identical with the row set of base table, create a Materialized View for each row set, get next row set and repeat above-mentioned operation steps.
Shown below and created more employed SQL statement examples of base table of using row set storage mode:
The statement explanation:
It is the base table of table_name that CREATE TABLE table_name has specified table name.
WITH (ORIENTATION=COLUMN) has specified the storage mode of base table to be the row storage.
PROJECTIONS clause is used for creating the row set, has specified to comprise the row name set row that comprise in the set, the row that are used to sort.
Under the row set situation of the row that only use base table, use following query statement:
SELECT?column_name...FROM?table_name?ORDER?BY?column_name；
Under the row set situation of the row that use other tables, use following query statement:
SELECT column_name...FROM table_name JOIN other_table USING (main foreign key column) ORDER BY column_name.
Fig. 5 has shown in the embodiment shown in fig. 1, the synoptic diagram of the connection index of being set up.The employed SQL statement of the index that connects is following:
CREATE?JOIN?INDEX?index_name?FROM?projection_a?TO?projection_b；
This SQL statement has been created the connection index index_name of row set projection_a to row set projection_b.
In the process of index that connects, the data load process of row set is such:
1) at base table other table loading data that set refers to row;
2) the whole row set Materialized View of materialization comprises the memory location that each row of materialization are gathered;
3) index that connects;
4) data of deletion base table other tables that set refers to row;
5) delete unwanted memory location.
The process of selecting to connect index can be used the optimal way based on cost, promptly estimates the cost that each executive plan is required, and this cost resource that each executive plan is spent quantizes, and selects optimum connection index according to this cost.Owing to use the connection index can cause random library to handle up (IO), therefore should the least possible use connect index.
Fig. 6 has shown in the embodiment shown in fig. 1, uses the operating process that connects index reduction logic tuple.This operating process comprises following step:
Step 10: searching comprises the row set of inquiring about needed all target column, if having, then utilizes this row set to restore tuple; If no, then get into next step;
In Fig. 6, be specially: seek and to comprise all targets of inquiry, i.e. " name ", " place system ", the row set.
Step 11: seek the identical a plurality of row set that comprise needed all target column of inquiry of row preface;
Step 12: in a plurality of row set that in step 11, obtain, select the row set group (for example set of the row among Fig. 61 and row set 2) of using the connection index minimum;
Step 13: accomplish after the projection of target column, utilize to connect index reduction tuple.
Through postponing the use that connects index as far as possible, after the projection of accomplishing target column, can strengthen query performance.
More than the single table multiple row preface storage means that is used for the column data storehouse provided by the present invention has been carried out detailed explanation.To those skilled in the art, any conspicuous change of under the prerequisite that does not deviate from connotation of the present invention, it being done all will constitute to infringement of patent right of the present invention, with corresponding legal responsibilities.
Claims (10)
1. a list that is used for the column data storehouse is shown multiple row preface storage means; Said column data storehouse comprises a plurality of tables of data that are made up of row and column; Said tables of data is divided into a plurality of row set; The set of said row comprises one or more row, and said row union of sets collection constitutes said tables of data, it is characterized in that:
The said row set index that connects between any two, said connection index record has been set up in two row set that connect index, belongs to the one-to-one relationship of memory location of row of the same tuple of said tables of data.
2. the single table multiple row preface storage means that is used for the column data storehouse as claimed in claim 1 is characterized in that comprising the steps:
To each row set, according to the memory location values of the row same tuple that belongs to said tables of data, in two row set, index connects;
Said connection index corresponding stored is in said each row set, and corresponding with said row in said each row set.
3. the single table multiple row preface storage means that is used for the column data storehouse as claimed in claim 1 is characterized in that comprising the steps:
If comprising, two row set repeat row, then according to the said row that repeat, to the advance line ordering and the storage of said two row set;
If two row set do not repeat row, then will said two row that row are gathered, sort according to querying condition respectively and store.
4. the single table multiple row preface storage means that is used for the column data storehouse as claimed in claim 3 is characterized in that:
For said two the row set that do not repeat to be listed as, the index that do not connect if logical order is identical, index connects if logical order is inequality.
5. the single table multiple row preface storage means that is used for the column data storehouse as claimed in claim 3 is characterized in that:
For said two the row set that repeat to be listed as are arranged, index does not connect.
6. the single table multiple row preface storage means that is used for the column data storehouse as claimed in claim 2 is characterized in that:
Estimate the cost that each executive plan is required, select to connect index according to optimum cost.
7. the single table multiple row preface storage means that is used for the column data storehouse as claimed in claim 1 is characterized in that the step that comprises that following establishment row are gathered:
When whole row of judging said tables of data all appear at said a plurality of row union of sets and concentrate, be that Materialized View is created in each row set, accomplish the establishment of row set.
8. the single table multiple row preface storage means that is used for the column data storehouse as claimed in claim 1 is characterized in that: in the process of index that connects, also comprise following row set load step:
Step 1: at said tables of data loading data;
Step 2: materialization all is listed as the set Materialized View, comprises the memory location of each row set of materialization;
Step 3: index connects;
Step 4: the data of deleting said tables of data;
Step 5: delete unwanted memory location value.
9. the single table multiple row preface storage means that is used for the column data storehouse as claimed in claim 1 is characterized in that also comprising that following utilization connects the step of index reduction logic tuple:
Step 1: searching comprises the row set of inquiring about needed all target column, if having, then utilizes this row set to restore tuple; If no, then get into next step;
Step 2: seek the identical a plurality of row set that comprise needed all target column of inquiry of row preface;
Step 3: in a plurality of row set that in step 2, obtain, select to use the minimum row set group of connection index;
Step 4: accomplish after the projection of target column, utilize to connect index reduction tuple.
10. the single table multiple row preface storage means that is used for the column data storehouse as claimed in claim 1 is characterized in that:
The row that belong to the same tuple of said tables of data are meant a plurality of row in the row set.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110392033.1A CN102521303B (en) | 2011-11-30 | 2011-11-30 | A kind of single-table multi-column sequence storage method for a column database |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110392033.1A CN102521303B (en) | 2011-11-30 | 2011-11-30 | A kind of single-table multi-column sequence storage method for a column database |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102521303A true CN102521303A (en) | 2012-06-27 |
| CN102521303B CN102521303B (en) | 2016-08-10 |
Family
ID=46292224
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110392033.1A Active CN102521303B (en) | 2011-11-30 | 2011-11-30 | A kind of single-table multi-column sequence storage method for a column database |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102521303B (en) |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103218691A (en) * | 2013-04-26 | 2013-07-24 | 吉林市赢科信息技术有限责任公司 | Embedded type business intelligent information management system and management method |
| CN103425781A (en) * | 2013-08-20 | 2013-12-04 | 北京国双科技有限公司 | Data processing method and device for column position in table on software interface |
| CN104021145A (en) * | 2014-05-16 | 2014-09-03 | 华为技术有限公司 | Mixed service concurrent access method and device |
| CN104090954A (en) * | 2014-07-04 | 2014-10-08 | 用友软件股份有限公司 | Connecting method and system of read-only tables |
| CN105045791A (en) * | 2014-03-26 | 2015-11-11 | 日本电气株式会社 | Database device |
| CN105224649A (en) * | 2015-09-29 | 2016-01-06 | 北京奇艺世纪科技有限公司 | A kind of data processing method and device |
| WO2016000156A1 (en) * | 2014-06-30 | 2016-01-07 | Microsoft Technology Licensing, Llc | Managing data with flexible schema |
| CN105446991A (en) * | 2014-07-07 | 2016-03-30 | 阿里巴巴集团控股有限公司 | Data storage method, query method and device |
| CN105589965A (en) * | 2015-12-23 | 2016-05-18 | 中国地质大学（武汉） | Spatial data storage method based on column database |
| CN106326305A (en) * | 2015-06-30 | 2017-01-11 | 星环信息科技（上海）有限公司 | Storage method and equipment for data file and inquiry method and equipment for data file |
| CN106354829A (en) * | 2016-08-31 | 2017-01-25 | 天津南大通用数据技术股份有限公司 | Physic-chemical method and device of column storage database |
| CN106933919A (en) * | 2015-12-31 | 2017-07-07 | 北京国双科技有限公司 | The connection method of tables of data and device |
| WO2017161540A1 (en) * | 2016-03-24 | 2017-09-28 | 华为技术有限公司 | Data query method, data object storage method and data system |
| CN108268586A (en) * | 2017-09-22 | 2018-07-10 | 广东神马搜索科技有限公司 | Across the data processing method of more tables of data, device, medium and computing device |
| CN110019218A (en) * | 2017-12-08 | 2019-07-16 | 阿里巴巴集团控股有限公司 | Data storage and querying method and equipment |
| CN110413624A (en) * | 2019-08-07 | 2019-11-05 | 南京录信软件技术有限公司 | A method of the multiple row stored in association deposited based on column |
| CN111737290A (en) * | 2020-06-03 | 2020-10-02 | 北京人大金仓信息技术股份有限公司 | Query method and device for distributed database |
| CN112182028A (en) * | 2020-09-29 | 2021-01-05 | 北京人大金仓信息技术股份有限公司 | Data line number query method and device based on table of distributed database |
| CN113641681A (en) * | 2021-10-13 | 2021-11-12 | 南京大数据集团有限公司 | Space self-adaptive mass data query method |
| US11222067B2 (en) | 2017-12-05 | 2022-01-11 | Beijing Baidu Netcom Science And Technology Co., Ltd. | Multi-index method and apparatus, cloud system and computer-readable storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101751406A (en) * | 2008-12-18 | 2010-06-23 | 赵伟 | Method and device for realizing column storage based relational database |
-
2011
- 2011-11-30 CN CN201110392033.1A patent/CN102521303B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101751406A (en) * | 2008-12-18 | 2010-06-23 | 赵伟 | Method and device for realizing column storage based relational database |
Non-Patent Citations (2)
| Title |
|---|
| BFS198: "hbase介绍", 《百度文库-专业资料-IT/计算机》 * |
| 尼米克: "《Oracle Database 10g性能调整与优化》", 31 January 2009 * |
Cited By (33)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103218691A (en) * | 2013-04-26 | 2013-07-24 | 吉林市赢科信息技术有限责任公司 | Embedded type business intelligent information management system and management method |
| CN103218691B (en) * | 2013-04-26 | 2016-09-07 | 吉林市赢科信息技术有限责任公司 | A kind of embedded business intelligence information management system and management method |
| CN103425781A (en) * | 2013-08-20 | 2013-12-04 | 北京国双科技有限公司 | Data processing method and device for column position in table on software interface |
| CN103425781B (en) * | 2013-08-20 | 2018-04-06 | 北京国双科技有限公司 | The data processing method and device of column position in software interface form |
| CN105045791A (en) * | 2014-03-26 | 2015-11-11 | 日本电气株式会社 | Database device |
| CN104021145A (en) * | 2014-05-16 | 2014-09-03 | 华为技术有限公司 | Mixed service concurrent access method and device |
| CN104021145B (en) * | 2014-05-16 | 2018-03-06 | 华为技术有限公司 | The method and apparatus that a kind of mixed service concurrently accesses |
| US9904701B2 (en) | 2014-05-16 | 2018-02-27 | Huawei Technologies Co.,. Ltd. | Method and apparatus for concurrent access of mixed services |
| US9898492B2 (en) | 2014-06-30 | 2018-02-20 | Microsoft Technology Licensing, Llc | Managing data with flexible schema |
| WO2016000156A1 (en) * | 2014-06-30 | 2016-01-07 | Microsoft Technology Licensing, Llc | Managing data with flexible schema |
| US11169981B2 (en) | 2014-06-30 | 2021-11-09 | Microsoft Technology Licensing, Llc | Managing data with flexible schema |
| CN106471489A (en) * | 2014-06-30 | 2017-03-01 | 微软技术许可有限责任公司 | Management has the data of flexible modes |
| CN106471489B (en) * | 2014-06-30 | 2019-10-11 | 微软技术许可有限责任公司 | Manage the data with flexible modes |
| CN104090954A (en) * | 2014-07-04 | 2014-10-08 | 用友软件股份有限公司 | Connecting method and system of read-only tables |
| CN105446991B (en) * | 2014-07-07 | 2018-10-30 | 阿里巴巴集团控股有限公司 | Date storage method, querying method and equipment |
| CN105446991A (en) * | 2014-07-07 | 2016-03-30 | 阿里巴巴集团控股有限公司 | Data storage method, query method and device |
| CN106326305A (en) * | 2015-06-30 | 2017-01-11 | 星环信息科技（上海）有限公司 | Storage method and equipment for data file and inquiry method and equipment for data file |
| CN105224649B (en) * | 2015-09-29 | 2019-03-26 | 北京奇艺世纪科技有限公司 | A kind of data processing method and device |
| CN105224649A (en) * | 2015-09-29 | 2016-01-06 | 北京奇艺世纪科技有限公司 | A kind of data processing method and device |
| CN105589965A (en) * | 2015-12-23 | 2016-05-18 | 中国地质大学（武汉） | Spatial data storage method based on column database |
| CN106933919A (en) * | 2015-12-31 | 2017-07-07 | 北京国双科技有限公司 | The connection method of tables of data and device |
| CN106933919B (en) * | 2015-12-31 | 2020-03-03 | 北京国双科技有限公司 | Data table connection method and device |
| WO2017161540A1 (en) * | 2016-03-24 | 2017-09-28 | 华为技术有限公司 | Data query method, data object storage method and data system |
| CN106354829A (en) * | 2016-08-31 | 2017-01-25 | 天津南大通用数据技术股份有限公司 | Physic-chemical method and device of column storage database |
| CN108268586A (en) * | 2017-09-22 | 2018-07-10 | 广东神马搜索科技有限公司 | Across the data processing method of more tables of data, device, medium and computing device |
| US11222067B2 (en) | 2017-12-05 | 2022-01-11 | Beijing Baidu Netcom Science And Technology Co., Ltd. | Multi-index method and apparatus, cloud system and computer-readable storage medium |
| CN110019218A (en) * | 2017-12-08 | 2019-07-16 | 阿里巴巴集团控股有限公司 | Data storage and querying method and equipment |
| CN110019218B (en) * | 2017-12-08 | 2023-08-25 | 阿里巴巴集团控股有限公司 | Data storage and query method and equipment |
| CN110413624A (en) * | 2019-08-07 | 2019-11-05 | 南京录信软件技术有限公司 | A method of the multiple row stored in association deposited based on column |
| CN111737290A (en) * | 2020-06-03 | 2020-10-02 | 北京人大金仓信息技术股份有限公司 | Query method and device for distributed database |
| CN112182028A (en) * | 2020-09-29 | 2021-01-05 | 北京人大金仓信息技术股份有限公司 | Data line number query method and device based on table of distributed database |
| CN113641681A (en) * | 2021-10-13 | 2021-11-12 | 南京大数据集团有限公司 | Space self-adaptive mass data query method |
| CN113641681B (en) * | 2021-10-13 | 2022-02-22 | 南京大数据集团有限公司 | Space self-adaptive mass data query method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102521303B (en) | 2016-08-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102521303A (en) | Single-table multi-column sequence storage method for column database | |
| CN101751406B (en) | Method and device for realizing column storage based relational database | |
| CN100562874C (en) | A kind of increment data capturing method and system | |
| Markl | Mistral: Processing relational queries using a multidimensional access technique | |
| CN103020301B (en) | A kind of multidimensional data query and storage means and system | |
| CN107391306A (en) | A kind of isomeric data library backup file access pattern method | |
| CN103366015A (en) | OLAP (on-line analytical processing) data storage and query method based on Hadoop | |
| CN102521307A (en) | Parallel query processing method for share-nothing database cluster in cloud computing environment | |
| CN104391948A (en) | Data standardization construction method and system of data warehouse | |
| CN105631003A (en) | Intelligent index establishing, inquiring and maintaining method supporting mass data classification and counting | |
| CN102682108B (en) | Row and line mixed database storage method | |
| CN109636092B (en) | Warehouse goods space allocation method based on double-factor optimization | |
| US20210149923A1 (en) | Systems and methods for intelligently grouping financial product users into cohesive cohorts | |
| CN101299213A (en) | N-dimension clustering order recording tree space index method | |
| CN102779138A (en) | Hard disk access method of real time data | |
| CN104021156A (en) | Method for rapidly collecting multi-layer fact data based on SQL statements | |
| CN102411600A (en) | Data quality automatic detection method based on implication rule | |
| CN105938479A (en) | Structural transfer method of relational tables and non-relational tables | |
| CN101408882B (en) | Method and system for searching authorization document | |
| CN101833511A (en) | Data management method, device and system | |
| Doulkeridis et al. | On saying" enough already!" in mapreduce | |
| Rao et al. | Efficient iceberg query evaluation using set representation | |
| CN110688386A (en) | Distributed column data indexing method for novel power supply rail transit big data | |
| Rahman | SQL optimization in a parallel processing database system | |
| CN113448966B (en) | Order data multidimensional spreadsheet system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |