CN102253990A - Interactive application multimedia data query method and device - Google Patents
Interactive application multimedia data query method and device Download PDFInfo
- Publication number
- CN102253990A CN102253990A CN 201110186843 CN201110186843A CN102253990A CN 102253990 A CN102253990 A CN 102253990A CN 201110186843 CN201110186843 CN 201110186843 CN 201110186843 A CN201110186843 A CN 201110186843A CN 102253990 A CN102253990 A CN 102253990A
- Authority
- CN
- China
- Prior art keywords
- index
- interactive application
- expression formula
- inquiry
- unit
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses an interactive application multimedia data query method and an interactive application multimedia data query device. The method comprises the following steps of: establishing a list for a database in which interactive application multimedia data is stored; establishing an index for the list, wherein the index comprises a B+ tree index or a Hash index; and querying the needed data in the database according to the index. By the method provided by the embodiment of the invention, the aim of rapidly querying massive data in a digital television is fulfilled by dynamic query and query optimization, the interactive multimedia data is rapidly queried, the waiting time of a user is reduced, and data query accuracy rates can be improved simultaneously; therefore, the experience and the satisfaction of the user are improved.
Description
Technical field
The present invention relates to the digital television techniques field, relate in particular to a kind of querying method and device thereof of interactive application multi-medium data.
Background technology
In current digital development of television,, improve user experience quality in order to strengthen the interactivity with the user, more and more data needs transmission, and with the contrast of traditional tv in because user's interactivity strengthens, have certain real-time when needing to guarantee the user search Various types of data.In the processing means of existing mass data processing, mainly contain methods such as Bloom Filter, Hash (Hash), bitmap.
Bloom Filter is the very high random data structure of a kind of space efficiency, and it utilizes bit array to represent a set compactly, and can judge whether an element belongs to this set.During original state, Bloom Filter is a bit array that comprises the m position, and each is changed to 0.In order to express a set, Bloom Filter uses k separate hash function, be used for respectively each element map in the set to (1, .., m) in the scope, to any one element x, i hash function mapping position can be changed to 1, if a position repeatedly is changed to 1, has only and to work for the first time.
Hash is that a position visits record in the table by key value is mapped to, and to accelerate searching speed, may obtain same hash address to different key words, i.e. key1 ≠ key2, and f (key1)=f (key2), and this phenomenon is called conflict.Key word with same functions value is called synonym concerning this hash function.In sum, according to hash function H (key) and the method for handling conflict with on a set of keyword map to the limited continuous address set (interval), and with key word " elephant " in address set as the memory location that is recorded in the table, this table just is called hash table, this map process is called that hash is made a list or hash, and the memory location of gained is called the hash address.If for any key word in the set of keywords, equate through hash function map probability of any one address in the address set, claim that then this type of hash function is uniform hashing function (Uniform Hash function), Here it is makes key word obtain one " address at random " through hash function, thereby reduces conflict.
Though Bloom Filter has characteristics of high efficiency, but when judging whether an element belongs to certain set, might not think the element that belongs to this set by mistake and belong to this set, therefore Bloom Filter is not suitable for the application scenario of " zero error ", in Digital Television, not own selected particular content if the user sees, can reduce user's experience property.And Hash is owing to once read in total amount of data, and data volume is too huge in the digital home, therefore can not once read in well, and hash index query time when range query is very long, can increase the time that the user waits for, this also can influence user's experience.
Summary of the invention
The objective of the invention is to overcome the deficiencies in the prior art, the invention provides a kind of querying method and device thereof of interactive application multi-medium data, can realize the fast query of interaction multimedia data.
In order to address the above problem, the present invention proposes a kind of querying method of interactive application multi-medium data, described method comprises:
For storing the database foundation table of described interactive application multi-medium data;
For described table is set up index, described index comprises B+ tree index or Hash Hash index;
In database, inquire about needed data according to described index.
Preferably, describedly set up index for described table, described index comprises that the step of B+ tree index or Hash Hash index comprises:
Judge whether described table exists frequent operation, described operation comprises insertion, deletion, upgrades;
If then do not set up index for described table;
If not, judge then whether described table exists frequent inquiry on a large scale;
If then set up B+ tree index for described table;
If not, then set up the Hash index for described table.
Preferably, described step of inquiring about needed data according to described index in database comprises:
Obtain the relational algebra expression formula according to received query statement;
Relational algebra expression formula after described relational algebra expression formula is optimized and obtains to optimize;
In database, inquire about needed data according to the relational algebra expression formula after the described optimization, and obtain Query Result.
Preferably, described step according to received query statement acquisition relational algebra expression formula comprises:
The query statement that receives is carried out grammatical analysis and translation, and obtain the relational algebra expression formula.
Correspondingly, the embodiment of the invention also discloses a kind of inquiry unit of interactive application multi-medium data, it is characterized in that, described device comprises:
Table is set up module, is used to the database foundation table that stores described interactive application multi-medium data;
Module set up in index, is used to described table to set up index, and described index comprises B+ tree index or Hash Hash index;
Enquiry module is used for according to described index in the needed data of database inquiry.
Preferably, described index is set up module and is comprised:
Judging unit judges whether described table exists frequent operation, and described operation comprises insertion, deletion, upgrades; Described judging unit also is used for and ought have frequent operation, judges whether described table exists frequent inquiry on a large scale;
The unit set up in index, is used for when having frequent inquiry on a large scale, for described table is set up B+ tree index; Perhaps, be used for when not having frequent inquiry on a large scale, for described table is set up the Hash index.
Preferably, described enquiry module comprises:
Obtain the unit, be used for obtaining the relational algebra expression formula according to received query statement;
Optimize the unit, the relational algebra expression formula after being used for the relational algebra expression formula that described acquisition unit is obtained is optimized and obtains to optimize;
Query unit, the relational algebra expression formula after being used for optimizing according to described optimization unit be in the needed data of database inquiry, and obtain Query Result.
Preferably, described acquisition unit also is used for the query statement that receives is carried out grammatical analysis and translation, and obtains the relational algebra expression formula.
Implement the embodiment of the invention, by dynamic queries and query optimization to carry out the purpose of fast query in the mass data that is implemented in Digital Television, realize the fast query of interaction multimedia data, reduce the time that the user waits for, the accuracy rate of data query be can improve simultaneously, thereby user's Experience Degree and satisfaction improved.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art, to do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the schematic flow sheet of querying method of the interactive application multi-medium data of the embodiment of the invention;
Fig. 2 is the database structure design diagram of the embodiment of the invention;
Fig. 3 is the synoptic diagram of the table that database root was distinguished according to the date in the embodiment of the invention;
Fig. 4 is existing middle employing process mode written program synoptic diagram;
Fig. 5 is the synoptic diagram that the employing parallelization processing mode of the embodiment of the invention is handled database;
Fig. 6 is the synoptic diagram of the decision criteria that is listed as in the combined index of the embodiment of the invention;
Fig. 7 be the embodiment of the invention set up the process synoptic diagram of index for table;
Fig. 8 is the organigram of the hash index of the embodiment of the invention;
Fig. 9 is that the structure of inquiry unit of the interactive application multi-medium data of the embodiment of the invention is formed synoptic diagram.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that is obtained under the creative work prerequisite.
Fig. 1 is the schematic flow sheet of querying method of the interactive application multi-medium data of the embodiment of the invention, and as shown in Figure 1, this method comprises:
S101 is for the database that stores the interactive application multi-medium data is set up table;
S102, for table is set up index, this index comprises B+ tree index or Hash Hash index;
S103 inquires about needed data according to index in database.
Implement the embodiment of the invention, by dynamic queries and query optimization to carry out the purpose of fast query in the mass data that is implemented in Digital Television, realize the fast query of interaction multimedia data, reduce the time that the user waits for, the accuracy rate of data query be can improve simultaneously, thereby user's Experience Degree and satisfaction improved.
During concrete enforcement, because in the digital television interactive application service, multimedia data volumes such as image, audio frequency, video are huge, at interactive application multi-medium data access efficiency problem, the database that relates in the solution of the present invention adopts the form of high-volume database to realize, concrete database structure can be referring to Fig. 2, and Fig. 2 is the database structure design diagram of the embodiment of the invention.
Fig. 3 is the synoptic diagram of the table that database root was distinguished according to the date in the embodiment of the invention, in concrete enforcement, can be by the filing mechanism of determining, regularly, by rule that historical data is read-only, separate and filing, improve the experience property of user in the interactive application of Digital Television.In addition, the architecture design of the high-volume database of the embodiment of the invention is based on and requires submeter, subregion or branch storehouse.
In concrete the enforcement, the present invention adopts that (Structured Query Language is main program design high-volume database SQL), but not according to procedural method coding with Structured Query Language (SQL).Fig. 4 is existing middle employing process mode written program synoptic diagram, as shown in Figure 4, in process mode written program, even the optimization that has realized each SQL also and do not mean that the optimization that can realize whole SQL, the optimized operation unit of optimizer is SQL, and is impossible exist to the optimizer that procedural data processing is optimized.According to procedural mode coding the time, owing to can directly determine execution in step, thereby change the logical order that execution in step need be adjusted whole procedure.And in the program that the embodiment of the invention adopted, can realize the optimization of whole SQL implementation based on SQL.In program, only need just can change execution in step at an easy rate by adjusting SQL, adjustment index structure, prompting use etc. based on SQL.Fig. 5 is the synoptic diagram that the employing parallelization processing mode of the embodiment of the invention is handled database, as shown in Figure 5, in the process written program, according to the proportion of the handled part of parallelization processing mode in full content well below being in the main program at SQL, owing to can there be very big difference in performance along with the difference of the using method of SQL, and it is most important to adjust the parallel processing degree according to the operating position of resource, therefore the program based on SQL compares with the process written program in simplification, maintainability, and improved efficiency significantly.
In the design of high-volume database, need setting up widely, index comes mass data is handled, it is essential that big table is set up index, the foundation of index must be considered concrete condition, for example at the grouping of big table, fields such as ordering all need to set up index, generally can also set up composite index, the design of index will be satisfied all reading requirement.Sometimes needing to determine whether to carry out index in setting up the index process merges or combined index, index merges that to have a cost with respect to combined index low, fireballing characteristics, and combined index has the dirigibility height, the characteristics that cost is high, in concrete enforcement, whether carry out index and close and can adopt following criterion: 1, try not the bigger index of dispersion degree difference is merged; 2, the reasonable index of dispersion degree is merged; 3, forbid setting up index based on the bad row of dispersion degree.And in combined index, the associated relation of dispersion merges not as index, and operational symbol is more important than dispersion.As shown in Figure 6, Fig. 6 is the synoptic diagram of the decision criteria that is listed as in the combined index of the embodiment of the invention.
The size of the foundation of index and table and to show frequent necessary operations relevant, if setting up in the process of table, can predict need frequent to insert, delete, operation such as renewal, and the size of table does not surpass certain scope yet, at this moment, setting up index for this table is inappropriate behavior, and frequent operations such as deletion can cause the frequent updating of index, thereby causes inefficiency.When needing frequent large-scale inquiry in the table that index is set up, it is in the ordinary course of things littler than the cost of setting up the hash index structure to set up B+ tree index structure, but needed when being frequent single selection inquiry in table, the cost of hash index is littler than B+ tree index structure in the ordinary course of things.Fig. 7 be the embodiment of the invention set up the process synoptic diagram of index for table, as shown in Figure 7, S102 further comprises:
S1021 judges whether table exists frequent operation, and this operation comprises insertion, deletion, upgrades;
If not, then carry out S1022; If then do not set up index for table;
S1022 judges whether table exists frequent inquiry on a large scale;
If, then carry out S1023, if not, then carry out S1024;
S1023 is for table is set up B+ tree index;
S1024 is for table is set up the Hash index.
In the search procedure of B+ tree, select the minimum code value greater than set-point earlier, successively begin to search again, up to finding set-point to finish, the code of searching false code of B+ tree is achieved as follows:
In addition, a shortcoming of sequential file organization is the access index structure to come locator data, can avoid the access index structure based on the file organization of hashing technique, and hash also can provide a kind of method of constructing index.Hash index is made into the hash file tissue with the extremely corresponding pointer set of searching code, and the building method of hash index is as follows: hash function is acted on searching code and corresponding bucket thereof, then this searching code and corresponding pointer are deposited in this bucket.Fig. 8 is the organigram of the hash index of the embodiment of the invention.
In concrete the enforcement, handle given inquiry, especially a complex query, before query processing begins, query statement must be translated into spendable form.For the inquiry that provides, half all can have the method for multiple result of calculation.In addition, the relational algebra expression formula form of inquiry only part appointment how to carry out inquiry; Usually there are many modes to come the calculated relationship algebraic expression.The query processing process mainly comprises grammatical analysis and translation, optimizes.
Further, S103 comprises:
Obtain the relational algebra expression formula according to received query statement;
Relational algebra expression formula after the relational algebra expression formula is optimized and obtains to optimize;
In database, inquire about needed data according to the relational algebra expression formula after optimizing, and obtain Query Result.
Alternatively, can carry out grammatical analysis and translation, and obtain the relational algebra expression formula the query statement that receives.
Here can carry out grammatical analysis and carry out the grammer translation query statement by syntax analyzer by translater.
The cost of query processing can be measured the operating position of various resources by this inquiry, and these resources comprise disk access, carry out CPU time, a communication overhead in the parallel Database Systems that inquiry is used.The response time of inquiry plan comprises above all types of cost, measures preferably for one that can be used as the query execution plan cost.Optimization based on cost is to produce a series of query execution plan by rule of equal value from given query statement is total, and selects one of the cost minimum.For a complicated query, the different inquiry plans that are equivalent to given inquiry plan may be a lot, and the inquiry plan algorithm in the embodiment of the invention can be realized by following code:
A cost that shortcoming is optimization itself based on the optimization of cost.Though the query optimization cost can reduce dexterously by algorithm, the different executive plan numbers of an inquiry still may be very big.The query optimization that the embodiment of the invention adopted is based on heuristic and based on the mixing of cost.
In embodiments of the present invention, can also design by the NoSQL system architecture and realize to the high concurrency demand of database with to the storage and the visit of mass data, realize the design of high-volume database with another kind of Database Systems framework, finish the fast query and the renewal of data.
Correspondingly, the embodiment of the invention also provides a kind of inquiry unit of interactive application multi-medium data, and as shown in Figure 9, this device comprises:
Table is set up module 90, is used to the database foundation table that stores the interactive application multi-medium data;
The inquiry unit of the interactive application multi-medium data of the embodiment of the invention and the realization principle of module thereof and process can repeat no more here referring to the associated description among the inventive method embodiment.
Further, index is set up module 91 and is comprised:
Judging unit judges whether table exists frequent operation, and this operation comprises insertion, deletion, upgrades; This judging unit also is used for and ought have frequent operation, judges whether table exists frequent inquiry on a large scale;
The unit set up in index, is used for when having frequent inquiry on a large scale, for table is set up B+ tree index; Perhaps, be used for when not having frequent inquiry on a large scale, for table is set up the Hash index.
Further, enquiry module 92 comprises:
Obtain the unit, be used for obtaining the relational algebra expression formula according to received query statement;
Optimize the unit, be used for the relational algebra expression formula after obtaining relational algebra expression formula that the unit obtained and being optimized and obtaining to optimize;
Query unit is used for inquiring about needed data according to the relational algebra expression formula of optimizing after the unit is optimized at database, and obtains Query Result.
In concrete the enforcement, obtain the unit and also be used for the query statement that receives is carried out grammatical analysis and translation, and obtain the relational algebra expression formula.
Implement the inquiry unit of the interactive application multi-medium data of the embodiment of the invention, by dynamic queries and query optimization to carry out the purpose of fast query in the mass data that is implemented in Digital Television, realize the fast query of interaction multimedia data, reduce the time that the user waits for, the accuracy rate of data query be can improve simultaneously, thereby user's Experience Degree and satisfaction improved.
One of ordinary skill in the art will appreciate that all or part of step in the whole bag of tricks of the foregoing description is to instruct relevant hardware to finish by program, this program can be stored in the computer-readable recording medium, storage medium can comprise: ROM (read-only memory) (ROM, Read Only Memory), random access memory (RAM, Random Access Memory), disk or CD etc.
In addition, more than the querying method and the device thereof of the interactive application multi-medium data that the embodiment of the invention provided is described in detail, used specific case herein principle of the present invention and embodiment are set forth, the explanation of above embodiment just is used for helping to understand method of the present invention and core concept thereof; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, the part that all can change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (8)
1. the querying method of an interactive application multi-medium data is characterized in that, described method comprises:
For storing the database foundation table of described interactive application multi-medium data;
For described table is set up index, described index comprises B+ tree index or Hash Hash index;
In database, inquire about needed data according to described index.
2. the querying method of interactive application multi-medium data as claimed in claim 1 is characterized in that, describedly sets up index for described table, and described index comprises that the step of B+ tree index or Hash Hash index comprises:
Judge whether described table exists frequent operation, described operation comprises insertion, deletion, upgrades;
If then do not set up index for described table;
If not, judge then whether described table exists frequent inquiry on a large scale;
If then set up B+ tree index for described table;
If not, then set up the Hash index for described table.
3. the querying method of interactive application multi-medium data as claimed in claim 1 or 2 is characterized in that, described step of inquiring about needed data according to described index in database comprises:
Obtain the relational algebra expression formula according to received query statement;
Relational algebra expression formula after described relational algebra expression formula is optimized and obtains to optimize;
In database, inquire about needed data according to the relational algebra expression formula after the described optimization, and obtain Query Result.
4. the querying method of interactive application multi-medium data as claimed in claim 3 is characterized in that, described step according to received query statement acquisition relational algebra expression formula comprises:
The query statement that receives is carried out grammatical analysis and translation, and obtain the relational algebra expression formula.
5. the inquiry unit of an interactive application multi-medium data is characterized in that, described device comprises:
Table is set up module, is used to the database foundation table that stores described interactive application multi-medium data;
Module set up in index, is used to described table to set up index, and described index comprises B+ tree index or Hash Hash index;
Enquiry module is used for according to described index in the needed data of database inquiry.
6. the inquiry unit of interactive application multi-medium data as claimed in claim 5 is characterized in that, described index is set up module and comprised:
Judging unit judges whether described table exists frequent operation, and described operation comprises insertion, deletion, upgrades; Described judging unit also is used for and ought have frequent operation, judges whether described table exists frequent inquiry on a large scale;
The unit set up in index, is used for when having frequent inquiry on a large scale, for described table is set up B+ tree index; Perhaps, be used for when not having frequent inquiry on a large scale, for described table is set up the Hash index.
7. as the inquiry unit of claim 5 or 6 described interactive application multi-medium datas, it is characterized in that described enquiry module comprises:
Obtain the unit, be used for obtaining the relational algebra expression formula according to received query statement;
Optimize the unit, the relational algebra expression formula after being used for the relational algebra expression formula that described acquisition unit is obtained is optimized and obtains to optimize;
Query unit, the relational algebra expression formula after being used for optimizing according to described optimization unit be in the needed data of database inquiry, and obtain Query Result.
8. as the inquiry unit of claim 6 or 7 described interactive application multi-medium datas, it is characterized in that described acquisition unit also is used for the query statement that receives is carried out grammatical analysis and translation, and obtain the relational algebra expression formula.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110186843 CN102253990A (en) | 2011-07-05 | 2011-07-05 | Interactive application multimedia data query method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110186843 CN102253990A (en) | 2011-07-05 | 2011-07-05 | Interactive application multimedia data query method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102253990A true CN102253990A (en) | 2011-11-23 |
Family
ID=44981254
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110186843 Pending CN102253990A (en) | 2011-07-05 | 2011-07-05 | Interactive application multimedia data query method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102253990A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104317966A (en) * | 2014-11-18 | 2015-01-28 | 国家电网公司 | Dynamic indexing method applied to quick combined querying of big electric power data |
| TWI496016B (en) * | 2013-01-02 | 2015-08-11 | 104 Corp | Method and system for managing hibrid database |
| CN105378726A (en) * | 2013-05-21 | 2016-03-02 | 脸谱公司 | Database sharding with update layer |
| CN106302462A (en) * | 2016-08-16 | 2017-01-04 | 合肥东上多媒体科技有限公司 | Digital home multimedia playing system |
| CN107634875A (en) * | 2017-09-11 | 2018-01-26 | 中体彩科技发展有限公司 | The method and device of the discrete communication of game data |
| CN110096555A (en) * | 2019-04-17 | 2019-08-06 | 北京奇安信科技有限公司 | A kind of the table matched processing method and device of distributed system |
| CN111581328A (en) * | 2020-04-21 | 2020-08-25 | 浙江华途信息安全技术股份有限公司 | Data comparison detection method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1336604A (en) * | 2000-08-01 | 2002-02-20 | 复旦大学 | Method and system of digitizing ancient Chinese books and automatizing the content search |
| CN1652112A (en) * | 2005-03-02 | 2005-08-10 | 北京北方烽火科技有限公司 | Implementing method of data dictionary under embedded environment |
| CN101256579A (en) * | 2008-04-08 | 2008-09-03 | 中兴通讯股份有限公司 | Method for inquesting data organization in database |
-
2011
- 2011-07-05 CN CN 201110186843 patent/CN102253990A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1336604A (en) * | 2000-08-01 | 2002-02-20 | 复旦大学 | Method and system of digitizing ancient Chinese books and automatizing the content search |
| CN1652112A (en) * | 2005-03-02 | 2005-08-10 | 北京北方烽火科技有限公司 | Implementing method of data dictionary under embedded environment |
| CN101256579A (en) * | 2008-04-08 | 2008-09-03 | 中兴通讯股份有限公司 | Method for inquesting data organization in database |
Non-Patent Citations (2)
| Title |
|---|
| 《测绘科学》 20110531 娄书荣,孟令奎,黄长青 《P2P空间数据索引方法研究综述》 52-53 1-8 第36卷, 第3期 * |
| 《科技传播》 20110131 张占杰 《浅谈海量数据处理技巧》 160,170 1-8 , * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI496016B (en) * | 2013-01-02 | 2015-08-11 | 104 Corp | Method and system for managing hibrid database |
| CN105378726A (en) * | 2013-05-21 | 2016-03-02 | 脸谱公司 | Database sharding with update layer |
| CN105378726B (en) * | 2013-05-21 | 2019-03-08 | 脸谱公司 | Utilize the partitions of database of update step |
| US10977229B2 (en) | 2013-05-21 | 2021-04-13 | Facebook, Inc. | Database sharding with update layer |
| CN104317966A (en) * | 2014-11-18 | 2015-01-28 | 国家电网公司 | Dynamic indexing method applied to quick combined querying of big electric power data |
| CN104317966B (en) * | 2014-11-18 | 2017-08-08 | 国家电网公司 | A kind of dynamic index method inquired about for electric power big data Rapid Combination |
| CN106302462A (en) * | 2016-08-16 | 2017-01-04 | 合肥东上多媒体科技有限公司 | Digital home multimedia playing system |
| CN107634875A (en) * | 2017-09-11 | 2018-01-26 | 中体彩科技发展有限公司 | The method and device of the discrete communication of game data |
| CN107634875B (en) * | 2017-09-11 | 2020-08-28 | 中体彩科技发展有限公司 | Method and device for discrete communication of game data |
| CN110096555A (en) * | 2019-04-17 | 2019-08-06 | 北京奇安信科技有限公司 | A kind of the table matched processing method and device of distributed system |
| CN111581328A (en) * | 2020-04-21 | 2020-08-25 | 浙江华途信息安全技术股份有限公司 | Data comparison detection method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102253990A (en) | Interactive application multimedia data query method and device | |
| US9262458B2 (en) | Method and system for dynamically partitioning very large database indices on write-once tables | |
| CN108874971B (en) | Tool and method applied to mass tagged entity data storage | |
| CN105183735B (en) | The querying method and inquiry unit of data | |
| US10860561B2 (en) | Method and apparatus for providing efficient indexing and computer program included in computer readable medium therefor | |
| US7756889B2 (en) | Partitioning of nested tables | |
| US9141666B2 (en) | Incremental maintenance of range-partitioned statistics for query optimization | |
| US10545917B2 (en) | Multi-range and runtime pruning | |
| CN101916261B (en) | Data partitioning method for distributed parallel database system | |
| CN107291807B (en) | SPARQL query optimization method based on graph traversal | |
| CN103020204B (en) | A kind of method and its system carrying out multi-dimensional interval query to distributed sequence list | |
| CN102323947B (en) | Generation method of pre-join table on ring-shaped schema database | |
| CN102214236B (en) | Method and system for processing mass data | |
| US20110035369A1 (en) | Query Optimization with Memory I/O Awareness | |
| CN103678491A (en) | Method based on Hadoop small file optimization and reverse index establishment | |
| WO2015048925A1 (en) | A method of optimizing queries execution on a data store | |
| CN102739622A (en) | Expandable data storage system | |
| CN103617276A (en) | Method for storing distributed hierarchical RDF data | |
| WO2019005403A1 (en) | Query optimization using propagated data distinctness | |
| CN103353901A (en) | Orderly table data management method and system based on Hadoop distributed file system (HDFS) | |
| CN102567419B (en) | Mass data storage device and method based on tree structure | |
| CN112131228A (en) | FABRIC-based alliance chain system convenient for data retrieval | |
| CN111782663A (en) | Aggregation index structure and aggregation index method for improving aggregation query efficiency | |
| CN105354310B (en) | Map tile storage layout optimization method based on MapReduce | |
| CN115391424A (en) | Database query processing method, storage medium and computer equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20111123 |