CN106383860A - Data query method and apparatus - Google Patents
Data query method and apparatus Download PDFInfo
- Publication number
- CN106383860A CN106383860A CN201610799393.6A CN201610799393A CN106383860A CN 106383860 A CN106383860 A CN 106383860A CN 201610799393 A CN201610799393 A CN 201610799393A CN 106383860 A CN106383860 A CN 106383860A
- Authority
- CN
- China
- Prior art keywords
- index
- data
- optimum
- inquiry
- request
- 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
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
-
- 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/21—Design, administration or maintenance of databases
- G06F16/219—Managing data history or versioning
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/80—Information retrieval; Database structures therefor; File system structures therefor of semi-structured data, e.g. markup language structured data such as SGML, XML or HTML
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/80—Information retrieval; Database structures therefor; File system structures therefor of semi-structured data, e.g. markup language structured data such as SGML, XML or HTML
- G06F16/83—Querying
- G06F16/835—Query processing
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a data query method and apparatus. The method comprises the steps of obtaining an optimal index and an index interval of a current query according to a received query request; querying data corresponding to the optimal index in the index interval when the optimal index is obtained successfully; and querying the data requested by the request through full-table scanning query when the optimal index is obtained unsuccessfully. Therefore, the problem of high HBase version dependence during data query or insertion in related technologies is solved and the Hbase version dependence during the data query or insertion is reduced.
Description
Technical field
The present invention relates to the communications field, in particular to a kind of data query method and device.
Background technology
At present HBase is mainly used in structuring and the storage of semi-structured big data, its in insertion and reading all
There is high performance, this has close relationship with its Method of Data Organization, logically, the table data of HBase
Carry out dictionary sequence by RowKey, RowKey is actually one-level index (Primary Index) of tables of data, due to HBase
Itself there is no secondary index (Secondary Index) mechanism, RowKey merely can only be relied on based on indexed search data, be
Multi-condition inquiry can be supported, developer need by be all spliced in RowKey possible as the field of querying condition,
This is extremely common way in HBase exploitation.But, no matter how to be designed, the intrinsic limitation of single RowKey
Determine it and can not possibly effectively support multi-condition inquiry.As a rule, RowKey can only be directed in condition and contain its lead-in section
Inquiry give gratifying performance and support, when inquiring about other fields, performance is not just very well, in extreme situations
The query performance of some fields may deteriorate to the level of full table scan, and this is because that status in RowKey for the field is
Non-equivalence, their rankings in RowKey determine performance when they are retrieved, and sort more forward field,
More there is in inquiry advantage, particularly the first field has special advantage, if comprising the first field, during retrieval just in inquiry
The prefix part of RowKey can be determined by the value of the first field, thus significantly narrowing retrieval interval, if do not comprised,
Can search one by one on the RowKey of all data.
Based on background above reason it is considered that it is not to be especially suitable for such many condition and High Performance Data Query.Reason
By on can realize the inquiry of arbitrarily complicated condition based on the Filter mechanism of HBase, but do like that and just thoroughly abandon
RowKey can become very poor as the value of index, most query performance.
But it is based on general need, developer wishes that HBase, can be to many condition while keeping high-performance benefits
Inquiry gives certain support.The existing related solution of industry at present, for example：ITHbase, IHbase and the two of Huawei
Level index HIndex solution, each of which has respective advantage, but also all has certain limitation simultaneously.
Above-mentioned mention existing technical scheme and all there is respective advantage, but also all exist not enough accordingly, maximum asks
Topic is：The invasion of the dependency for HBase version and code is larger.
, also do not have at present for the high problem of the dependency of HBase version for when data query in correlation technique or insertion
Efficiently solve scheme.
Content of the invention
Embodiments provide a kind of data query method and device, at least to solve data query in correlation technique
Or for the high problem of the dependency of HBase version during insertion.
According to one embodiment of present invention, there is provided a kind of data query method, including：Please according to the inquiry receiving
Ask the optimum index obtaining this inquiry and index interval；In the case of the described optimum index of acquisition is successful, in described index
The corresponding data of described optimum index is inquired about in interval；In the case that the described optimum of acquisition indexes unsuccessfully, by full table scan
Inquire about the data that described inquiry request is asked.
Alternatively, the optimum index of this inquiry is obtained according to the inquiry request receiving and index interval includes：Receive
Described inquiry request；Parse the querying condition that described inquiry request carries and to contrast concordance list according to described querying condition corresponding
Metadata, obtains described optimum index, and wherein, described concordance list is used for storage for inquiring about the index of data；According to described
It is interval that excellent index obtains described index.
Alternatively, inquire about described optimum index corresponding data or inquire about the data that described inquiry request asked it
Afterwards, methods described also includes：The data that inquiry is obtained merges and collects, and obtains Query Result set.
Alternatively, the described optimum index of this inquiry and described index are being obtained according to the described inquiry request receiving
After interval, methods described also includes：Judge whether to obtain described optimum index；Judging to obtain the feelings of described optimum index
Under condition, determine that obtaining described optimum indexes successfully；In the case of judging not obtaining described optimum index, determine described in obtaining
Optimum indexes unsuccessfully.
Alternatively, also include：Receiving data write request, wherein, described data write request is used for request in data base
Middle write data；Point to described data write request according to the index configurations information creating that index configurations file carries to be asked to write
The index of the data entering, wherein, described index configurations information is used for configuration index；The index of establishment is inserted in tables of data.
According to another embodiment of the invention, there is provided a kind of data query arrangement, including：Acquisition module, for root
Obtain optimum index and the index interval of this inquiry according to the inquiry request receiving；First enquiry module, for obtaining institute
In the case of stating optimum index successfully, in described index interval, inquire about the corresponding data of described optimum index；Second inquiry mould
Block, in the case of indexing unsuccessfully in the described optimum of acquisition, inquires about, by full table scan, the number that described inquiry request is asked
According to.
Alternatively, described acquisition module is used for：Receive described inquiry request；Parse the inquiry bar that described inquiry request carries
Part simultaneously contrasts the corresponding metadata of concordance list according to described querying condition, obtains described optimum index, wherein, described concordance list is used
In storage for inquiring about the index of data；Described index is obtained according to described optimum index interval.
Alternatively, described device also includes：Merge module, the data for obtaining to inquiry merges and collects, and obtains
Query Result set.
Alternatively, described device also includes：Judge module, is used for judging whether to obtain described optimum index；First determination
Module, for, in the case of judging to obtain described optimum index, determining that obtaining described optimum indexes successfully；Second determination mould
Block, for, in the case of judging not obtaining described optimum index, determining that obtaining described optimum indexes unsuccessfully.
Alternatively, also include：Receiver module, for receiving data write request, wherein, described data write request is used for
Request writes data in data base；Creation module, the index configurations information creating for being carried according to index configurations file refers to
Asked the index of the data of write to described data write request, wherein, described index configurations information is used for configuration index；Insert
Enter module, for being inserted into the index of establishment in tables of data.
By the present invention, the inquiry request according to receiving obtains optimum index and the index interval of this inquiry；Obtaining
In the case of taking optimum index successful, the corresponding data of the optimum index of inquiry in index interval；Index unsuccessfully obtaining optimum
In the case of, the data asked of inquiry request is inquired about by full table scan it can be seen that, this is obtained using such scheme and looks into
The optimum index ask and index are interval, if successfully obtaining optimum index, in index interval, the optimum index of inquiry is corresponding
Data, if obtain optimum to index the data unsuccessfully inquiring about needs in full table, so that the inquiry of data does not rely on
HBase table, therefore, reduces the dependency for HBase version when data query or insertion, thus solving in correlation technique
For the high problem of the dependency of HBase version when data query or insertion.
Brief description
Accompanying drawing described herein is used for providing a further understanding of the present invention, constitutes the part of the application, this
Bright schematic description and description is used for explaining the present invention, does not constitute inappropriate limitation of the present invention.In the accompanying drawings：
Fig. 1 is a kind of flow chart of data query method according to embodiments of the present invention；
Fig. 2 is a kind of structured flowchart one of data query arrangement according to embodiments of the present invention；
Fig. 3 is a kind of structured flowchart two of data query arrangement according to embodiments of the present invention；
Fig. 4 is a kind of structured flowchart three of data query arrangement according to embodiments of the present invention；
Fig. 5 is a kind of structured flowchart four of data query arrangement according to embodiments of the present invention.
Specific embodiment
To describe the present invention in detail below with reference to accompanying drawing and in conjunction with the embodiments.It should be noted that not conflicting
In the case of, the embodiment in the application and the feature in embodiment can be mutually combined.
It should be noted that term " first " in description and claims of this specification and above-mentioned accompanying drawing, "
Two " it is etc. for distinguishing similar object, without for describing specific order or precedence.
Embodiment 1
Provide a kind of data query method in the present embodiment, a kind of data that Fig. 1 is according to embodiments of the present invention is looked into
The flow chart of inquiry method, as shown in figure 1, this flow process comprises the steps：
Step S102, the inquiry request according to receiving obtains optimum index and the index interval of this inquiry；
Step S104, in the case of obtaining optimum index successfully, in index interval, inquiry optimum indexes corresponding number
According to；
Step S106, in the case of obtaining optimum index unsuccessfully, inquires about what inquiry request was asked by full table scan
Data.
Alternatively, above-mentioned data query method can be, but not limited in the scene be applied to data query.For example：HBase
Scene of the data query of data base etc..
Alternatively, above-mentioned data query method can be, but not limited to be applied to HBase data base.
By above-mentioned steps, the inquiry request according to receiving obtains optimum index and the index interval of this inquiry；?
In the case of obtaining optimum index successfully, in index interval, inquiry optimum indexes corresponding data；Lose obtaining optimum index
In the case of losing, the data asked of inquiry request is inquired about by full table scan it can be seen that, this is obtained using such scheme
The optimum index of inquiry and index are interval, if successfully obtaining optimum index, in index interval, the optimum index of inquiry corresponds to
Data, if obtain optimum index the data unsuccessfully inquiring about needs in full table, so that the inquiry of data is independent of
In HBase table, therefore, reduce the dependency for HBase version when data query or insertion, thus solving correlation technique
For the high problem of the dependency of HBase version when middle data query or insertion.
Alternatively, in above-mentioned steps S102, can be, but not limited to obtain optimum index and index area in the following manner
Between：Receive inquiry request, the querying condition that parsing inquiry request carries simultaneously contrasts concordance list corresponding unit number according to querying condition
According to obtaining optimum index, wherein, concordance list is used for storage for inquiring about the index of data, obtains index area according to optimum index
Between.
Alternatively, after above-mentioned steps S104 or step S106, the data that can be, but not limited to inquiry is obtained is entered
Row merging collects, and obtains Query Result set.
Alternatively, after above-mentioned steps S102, can be, but not limited to by judging whether that obtaining optimum index to determine
Whether successful, for example obtain optimum index：Judge whether to obtain optimum index, in the case of judging to obtain optimum index,
Determine that obtaining optimum indexes successfully, in the case of judging not obtaining optimum index, determines that obtaining optimum indexes unsuccessfully.
Alternatively, in the present embodiment, can also but be not limited to carry out the insertion of data.For example：Receiving data write please
Ask, wherein, data write request is used for request and writes data, the index configurations carrying according to index configurations file in data base
Information creating points to the index of the data that data write request is asked to write, and wherein, index configurations information is used for configuration index,
The index of establishment is inserted in tables of data.
Embodiment 2
Additionally provide a kind of data query arrangement in the present embodiment, this device is used for realizing above-described embodiment and preferably real
Apply mode, carry out repeating no more of explanation.As used below, the soft of predetermined function can be realized in term " module "
Part and/or the combination of hardware.Although the device described by following examples preferably to be realized with software, hardware, or
The realization of the combination of software and hardware is also may and to be contemplated.
Fig. 2 is a kind of structured flowchart one of data query arrangement according to embodiments of the present invention, as shown in Fig. 2 this device
Including：
Acquisition module 22, optimum index and index for obtaining this inquiry according to the inquiry request receiving are interval；
First enquiry module 24, coupled to acquisition module 22, in the case of obtaining optimum index successfully, in index
In interval, inquiry is optimum indexes corresponding data；
Second enquiry module 26, coupled to acquisition module 22, in the case of obtaining optimum index unsuccessfully, by complete
Table scan inquires about the data that inquiry request is asked.
Alternatively, above-mentioned data query arrangement can be, but not limited in the scene be applied to data query.For example：HBase
Scene of the data query of data base etc..
Alternatively, above-mentioned data query arrangement can be, but not limited to be applied to HBase data base.
By said apparatus, acquisition module obtains the optimum index of this inquiry according to the inquiry request receiving and indexes
Interval；In the case of obtaining optimum index successfully, in index interval, inquiry optimum indexes corresponding number to first enquiry module
According to；Second enquiry module, in the case of obtaining optimum index unsuccessfully, inquires about, by full table scan, the number that inquiry request is asked
According to it can be seen that, the optimum index of this inquiry is obtained using such scheme and index is interval, if successfully obtaining optimum rope
Draw the then corresponding data of the optimum index of inquiry in index interval, if obtain optimum indexing unsuccessfully, inquiry in full table needs
The data wanted so that the inquiry of data does not rely on HBase table, therefore, reduce data query or insertion when for
The dependency of HBase version, thus it is high to solve the dependency for HBase version when data query in correlation technique or insertion
Problem.
Alternatively, acquisition module 22 is used for：Receive inquiry request；The parsing querying condition that carries of inquiry request according to looking into
Ask the corresponding metadata of conditions correlation concordance list, obtain optimum index, wherein, concordance list is used for storage for inquiring about the rope of data
Draw；Index is obtained according to optimum index interval.
Fig. 3 is a kind of structured flowchart two of data query arrangement according to embodiments of the present invention, as shown in figure 3, alternatively,
Said apparatus also include：
Merge module 32, coupled to the first enquiry module 24 and the second enquiry module 26, for the data that inquiry is obtained
Merge and collect, obtain Query Result set.
Fig. 4 is a kind of structured flowchart three of data query arrangement according to embodiments of the present invention, as shown in figure 4, alternatively,
Said apparatus also include：
Judge module 42, coupled to acquisition module 22, is used for judging whether to obtain optimum index；
First determining module 44, coupled between judge module 42 and the first enquiry module 24, for judging to obtain
In the case of optimum index, determine that obtaining optimum indexes successfully；
Second determining module 46, coupled between judge module 42 and the second enquiry module 26, for judging not obtain
To in the case of optimum index, determine that obtaining optimum indexes unsuccessfully.
Fig. 5 is a kind of structured flowchart four of data query arrangement according to embodiments of the present invention, as shown in figure 5, alternatively,
Said apparatus also include：
Receiver module 52, for receiving data write request, wherein, data write request is used for request and writes in data base
Enter data；
Creation module 54, coupled to receiver module 52, for the index configurations information wound being carried according to index configurations file
Build the index pointing to the data that data write request is asked to write, wherein, index configurations information is used for configuration index；
Insertion module 56, coupled to creation module 54, for being inserted into the index of establishment in tables of data.
It should be noted that above-mentioned modules can be by software or hardware to realize, for the latter, Ke Yitong
Cross in the following manner to realize, but not limited to this：Above-mentioned module is respectively positioned in same processor；Or, above-mentioned module is located at many respectively
In individual processor.
It is described in detail with reference to alternative embodiment of the present invention.
Alternative embodiment of the present invention provides a kind of various dimensions requestor.This various dimensions requestor builds HBase's
In Coprocessor mechanism (this mechanism is that HBase carries in itself), it is made up of Client end and Server end two parts, number
Pass through according to the foundation of table index " index configurations file " configured.
For inquiry data, inquiry request pushes away via the coprocessorExec method of HTable from Client end
Deliver on all of RegionServer, RegionServer receive after inquiry request using " inquiry decision-making device " analysis inquiry
Condition, contrasts the metadata of index simultaneously, and after finding the optimum index of this inquiry suitable, parsing index is interval, then transfers to "
Search index device " carries out data retrieval based on given index and analysis interval, without finding suitable index, then entrusts
Give " full table requestor " carry out full table scan.After the local queries result of each RegionServer returns, engine
Client end is also responsible for the data inquiring is merged collects, thus obtaining final result set.
For insertion data, can be intercepted by Coprocessor when data division attempts to write into, transfer to " index structure
Make device " basis " index configurations file " create all indexes pointing to current master data, then together it is inserted in tables of data.
The query engine of above-mentioned various dimensions requestor builds on HBase, both HBase is not made any change,
Do any compromise also without upper layer application.
The front end query interface of the engine of above-mentioned various dimensions requestor and rear end index process are all based on general target and set
Meter, do not rely on any specific (HBase) table.
HBase need not be carried out in itself any when data being inquired about by the various dimensions requestor of this alternative embodiment
Change, also not dependent on any specific HBase table.
Alternatively, the integrated scheme of ElasticSearch+Hbase, user can also in this alternative embodiment, be adopted
When multi-condition inquiry, first inquire about ElasticSearch, according to inquiry return ID, then to HBase Rigen according to
RowKey is inquired about.
Above example only in order to technical scheme to be described rather than be limited, the ordinary skill of this area
Personnel can modify to technical scheme or equivalent, without departing from the spirit and scope of the present invention, this
The protection domain of invention should be to be defined described in claim.
Embodiment 3
Through the above description of the embodiments, those skilled in the art can be understood that according to above-mentioned enforcement
The method of example can be realized by the mode of software plus necessary general hardware platform naturally it is also possible to pass through hardware, but a lot
In the case of the former is more preferably embodiment.Based on such understanding, technical scheme is substantially in other words to existing
What technology contributed partly can be embodied in the form of software product, and this computer software product is stored in a storage
In medium (as ROM/RAM, magnetic disc, CD), including some instructions with so that a station terminal equipment (can be mobile phone, calculate
Machine, server, or network equipment etc.) execution each embodiment of the present invention described in method.
Embodiments of the invention additionally provide a kind of storage medium.Alternatively, in the present embodiment, above-mentioned storage medium can
To be arranged to store the program code for executing following steps：
S1, the inquiry request according to receiving obtains optimum index and the index interval of this inquiry；
S2, in the case of obtaining optimum index successfully, in index interval, inquiry optimum indexes corresponding data；
S3, in the case of obtaining optimum index unsuccessfully, inquires about, by full table scan, the data that inquiry request is asked.
Alternatively, storage medium is also configured to store the program generation of the method and step for executing above-described embodiment record
Code：
Alternatively, in the present embodiment, above-mentioned storage medium can include but is not limited to：USB flash disk, read only memory (ROM,
Read-Only Memory), random access memory (RAM, Random Access Memory), portable hard drive, magnetic disc or
CD etc. is various can be with the medium of store program codes.
Alternatively, in the present embodiment, processor executes above-mentioned enforcement according to the program code of storage in storage medium
The method and step that example is recorded.
Alternatively, the specific example in the present embodiment may be referred to described in above-described embodiment and optional embodiment
Example, the present embodiment will not be described here.
Obviously, those skilled in the art should be understood that each module of the above-mentioned present invention or each step can be with general
Computing device realizing, they can concentrate on single computing device, or be distributed in multiple computing devices and formed
Network on, alternatively, they can be realized with the executable program code of computing device, it is thus possible to they are stored
To be executed by computing device in the storage device, and in some cases, can be with different from shown in order execution herein
The step going out or describing, or they are fabricated to respectively each integrated circuit modules, or by the multiple modules in them or
Step is fabricated to single integrated circuit module to realize.So, the present invention is not restricted to any specific hardware and software combination.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for the skill of this area
For art personnel, the present invention can have various modifications and variations.All within the spirit and principles in the present invention, made any repair
Change, equivalent, improvement etc., should be included within the scope of the present invention.
Claims (10)
1. a kind of data query method is it is characterised in that include：
Inquiry request according to receiving obtains optimum index and the index interval of this inquiry；
In the case of acquisition described optimum index is successful, inquires about described optimum in described index is interval and index corresponding number
According to；
In the case that the described optimum of acquisition indexes unsuccessfully, the data that described inquiry request is asked is inquired about by full table scan.
2. method according to claim 1 is it is characterised in that obtain this inquiry according to the inquiry request receiving
Excellent index and the interval inclusion of index：
Receive described inquiry request；
Parse the querying condition that described inquiry request carries and the corresponding metadata of concordance list is contrasted according to described querying condition, obtain
To described optimum index, wherein, described concordance list is used for storage for inquiring about the index of data；
Described index is obtained according to described optimum index interval.
3. method according to claim 1 is it is characterised in that inquiring about the corresponding data of described optimum index or inquiry
After the data that described inquiry request is asked, methods described also includes：
The data that inquiry is obtained merges and collects, and obtains Query Result set.
4. method according to claim 1 is it is characterised in that look into obtaining this according to the described inquiry request receiving
After the described optimum index ask and described index interval, methods described also includes：
Judge whether to obtain described optimum index；
In the case of judging to obtain described optimum index, determine that obtaining described optimum indexes successfully；
In the case of judging not obtaining described optimum index, determine that obtaining described optimum indexes unsuccessfully.
5. method according to any one of claim 1 to 4 is it is characterised in that also include：
Receiving data write request, wherein, described data write request is used for request and writes data in data base；
The number that described data write request is asked to write is pointed to according to the index configurations information creating that index configurations file carries
According to index, wherein, described index configurations information be used for configuration index；
The index of establishment is inserted in tables of data.
6. a kind of data query arrangement is it is characterised in that include：
Acquisition module, optimum index and index for obtaining this inquiry according to the inquiry request receiving are interval；
First enquiry module, for, in the case of the described optimum index of acquisition is successful, in described index is interval, inquiry is described
The corresponding data of optimum index；
Second enquiry module, in the case of indexing unsuccessfully in the described optimum of acquisition, inquires about described inquiry by full table scan
Ask asked data.
7. device according to claim 6 is it is characterised in that described acquisition module is used for：Receive described inquiry request；Solution
Analyse the querying condition that described inquiry request carries and the corresponding metadata of concordance list is contrasted according to described querying condition, obtain described
Optimum index, wherein, described concordance list is used for storage for inquiring about the index of data；Described rope is obtained according to described optimum index
Draw interval.
8. device according to claim 6 is it is characterised in that described device also includes：
Merge module, the data for obtaining to inquiry merges and collects, and obtains Query Result set.
9. device according to claim 6 is it is characterised in that described device also includes：
Judge module, is used for judging whether to obtain described optimum index；
First determining module, for, in the case of judging to obtain described optimum index, determining that obtaining described optimum indexes into
Work(；
Second determining module, for, in the case of judging not obtaining described optimum index, determining and obtaining described optimum index
Failure.
10. the device according to any one of claim 6 to 9 is it is characterised in that also include：
Receiver module, for receiving data write request, wherein, described data write request is used for request and writes in data base
Data；
Creation module, the index configurations information creating for being carried according to index configurations file points to described data write request institute
The index of the data of request write, wherein, described index configurations information is used for configuration index；
Insertion module, for being inserted into the index of establishment in tables of data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610799393.6A CN106383860A (en) | 2016-08-31 | 2016-08-31 | Data query method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610799393.6A CN106383860A (en) | 2016-08-31 | 2016-08-31 | Data query method and apparatus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106383860A true CN106383860A (en) | 2017-02-08 |
Family
ID=57938863
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610799393.6A Pending CN106383860A (en) | 2016-08-31 | 2016-08-31 | Data query method and apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106383860A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108491262A (en) * | 2018-02-28 | 2018-09-04 | 华为技术有限公司 | A kind of method and apparatus of sampling inquiry |
| CN109800222A (en) * | 2018-12-11 | 2019-05-24 | 中国科学院信息工程研究所 | A kind of HBase secondary index adaptive optimization method and system |
| CN110109948A (en) * | 2019-04-25 | 2019-08-09 | 数译(成都)信息技术有限公司 | Data query method, computer equipment and computer readable storage medium |
| CN110704486A (en) * | 2019-09-27 | 2020-01-17 | 支付宝(杭州)信息技术有限公司 | Data processing method, device, system, storage medium and server |
| CN110895531A (en) * | 2018-09-11 | 2020-03-20 | 北京奇虎科技有限公司 | Data writing method of data storage table, partition server and electronic equipment |
| CN111581236A (en) * | 2020-04-02 | 2020-08-25 | 中国邮政储蓄银行股份有限公司 | Data query method and device |
| CN112148725A (en) * | 2019-06-26 | 2020-12-29 | 中兴通讯股份有限公司 | Method and device for realizing global unique index |
| CN112784136A (en) * | 2019-11-05 | 2021-05-11 | 阿里巴巴集团控股有限公司 | Data query method and device and electronic equipment |
| CN116303628A (en) * | 2023-05-25 | 2023-06-23 | 南京中孚信息技术有限公司 | Alarm data query method, system and equipment based on elastic search |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070276807A1 (en) * | 2006-03-30 | 2007-11-29 | Wei Zhu Chen | Search Ranking Method for File System and Related Search Engine |
| CN104112013A (en) * | 2014-07-17 | 2014-10-22 | 浪潮(北京)电子信息产业有限公司 | HBase secondary indexing method and device |
| CN104111955A (en) * | 2013-04-22 | 2014-10-22 | 中国银联股份有限公司 | Combined inquiring method oriented to Hbase database |
| CN104217011A (en) * | 2014-09-19 | 2014-12-17 | 浪潮(北京)电子信息产业有限公司 | Method and device for inquiring HBase secondary index table |
| CN104834688A (en) * | 2015-04-20 | 2015-08-12 | 北京奇艺世纪科技有限公司 | Secondary index establishment method and device |
-
2016
- 2016-08-31 CN CN201610799393.6A patent/CN106383860A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070276807A1 (en) * | 2006-03-30 | 2007-11-29 | Wei Zhu Chen | Search Ranking Method for File System and Related Search Engine |
| CN104111955A (en) * | 2013-04-22 | 2014-10-22 | 中国银联股份有限公司 | Combined inquiring method oriented to Hbase database |
| CN104112013A (en) * | 2014-07-17 | 2014-10-22 | 浪潮(北京)电子信息产业有限公司 | HBase secondary indexing method and device |
| CN104217011A (en) * | 2014-09-19 | 2014-12-17 | 浪潮(北京)电子信息产业有限公司 | Method and device for inquiring HBase secondary index table |
| CN104834688A (en) * | 2015-04-20 | 2015-08-12 | 北京奇艺世纪科技有限公司 | Secondary index establishment method and device |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019165762A1 (en) * | 2018-02-28 | 2019-09-06 | 华为技术有限公司 | Sampling query method and device |
| CN108491262A (en) * | 2018-02-28 | 2018-09-04 | 华为技术有限公司 | A kind of method and apparatus of sampling inquiry |
| CN110895531A (en) * | 2018-09-11 | 2020-03-20 | 北京奇虎科技有限公司 | Data writing method of data storage table, partition server and electronic equipment |
| CN109800222B (en) * | 2018-12-11 | 2021-06-01 | 中国科学院信息工程研究所 | HBase secondary index self-adaptive optimization method and system |
| CN109800222A (en) * | 2018-12-11 | 2019-05-24 | 中国科学院信息工程研究所 | A kind of HBase secondary index adaptive optimization method and system |
| CN110109948A (en) * | 2019-04-25 | 2019-08-09 | 数译(成都)信息技术有限公司 | Data query method, computer equipment and computer readable storage medium |
| CN112148725A (en) * | 2019-06-26 | 2020-12-29 | 中兴通讯股份有限公司 | Method and device for realizing global unique index |
| CN110704486A (en) * | 2019-09-27 | 2020-01-17 | 支付宝(杭州)信息技术有限公司 | Data processing method, device, system, storage medium and server |
| CN112784136A (en) * | 2019-11-05 | 2021-05-11 | 阿里巴巴集团控股有限公司 | Data query method and device and electronic equipment |
| CN112784136B (en) * | 2019-11-05 | 2024-06-04 | 阿里巴巴集团控股有限公司 | Data query method and device and electronic equipment |
| CN111581236A (en) * | 2020-04-02 | 2020-08-25 | 中国邮政储蓄银行股份有限公司 | Data query method and device |
| CN116303628A (en) * | 2023-05-25 | 2023-06-23 | 南京中孚信息技术有限公司 | Alarm data query method, system and equipment based on elastic search |
| CN116303628B (en) * | 2023-05-25 | 2023-09-22 | 南京中孚信息技术有限公司 | Alarm data query method, system and equipment based on elastic search |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106383860A (en) | Data query method and apparatus | |
| US7213198B1 (en) | Link based clustering of hyperlinked documents | |
| CN101292242B (en) | Managing relationships between resources stored within a repository | |
| CN111177148B (en) | Method for automatically building and dividing tables of hydropower database | |
| CN103729471A (en) | Method and device for database query | |
| US9430525B2 (en) | Access plan for a database query | |
| US10733163B2 (en) | Record insertion by generating unique index bases | |
| US20060161594A1 (en) | Method and apparatus for improving data processing speed through storage of record information of identity module | |
| CN104298687A (en) | Hash partitioning management method and device | |
| CA2461871A1 (en) | An efficient index structure to access hierarchical data in a relational database system | |
| CN109815238A (en) | The dynamic adding method and device of database are realized with strict balanced binary tree | |
| CN110109874A (en) | A kind of non-stop layer distributed document retrieval method based on block chain | |
| CN111026709A (en) | Data processing method and device based on cluster access | |
| CN104636368A (en) | Data retrieval method and device and server | |
| CN113268502A (en) | Method and equipment for providing information | |
| CN109299101A (en) | Data retrieval method, device, server and storage medium | |
| CN102654879B (en) | Search method and device | |
| CN103714144A (en) | Device and method for information retrieval | |
| CN109901991A (en) | A kind of method, apparatus and electronic equipment for analyzing exception call | |
| CN111190861B (en) | Hot spot file management method, server and computer readable storage medium | |
| CN113256301B (en) | Data shielding method, device, server and medium | |
| CN111209284B (en) | Meta-data-based sub-table method and device | |
| CN114048171A (en) | Image data storage method, device, medium and equipment | |
| CN114647665A (en) | Data processing method of distributed system and data processing system thereof | |
| CN113760907A (en) | Data uniqueness identification method in database |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: Wuxi District of Jiangsu city in Wuxi Province, Zhenze Road No. 18, Wuxi (National) Software Park Dolphin C seat 2, 3 floor Applicant after: Wuxi private online Polytron Technologies Inc Address before: Wuxi District of Jiangsu city in Wuxi Province, Zhenze Road No. 18, Wuxi (National) Software Park Dolphin C seat 2, 3 floor Applicant before: Wuxi Yazuo Online Technology Development Co., Ltd. |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170208 |