CN105045932A - Data paging inquiry method based on descending order storage - Google Patents
Data paging inquiry method based on descending order storage Download PDFInfo
- Publication number
- CN105045932A CN105045932A CN201510557950.9A CN201510557950A CN105045932A CN 105045932 A CN105045932 A CN 105045932A CN 201510557950 A CN201510557950 A CN 201510557950A CN 105045932 A CN105045932 A CN 105045932A
- Authority
- CN
- China
- Prior art keywords
- data
- page
- descending
- paging
- user
- 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
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/10—File systems; File servers
- G06F16/18—File system types
- G06F16/182—Distributed file systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Probability & Statistics with Applications (AREA)
- Fuzzy Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a data paging inquiry method based on descending order storage. The method aims at solving the problem that existing paging of a relational database is not supported by a large Web information system application scene established by an HBase and solving the problems that an existing HBase table paging inquiry algorithm is high in resource consumption and low in inquiry efficiency. In the method, according to the storage characteristics of data in the HBase, a paging inquiry algorithm based on a time descending-order array is put forward, the latest data are stored at the top end of a table through the timestamp descending-order array, and therefore the requirement of a user for having access to the latest data is met. By designating the size of inquired data and the starting time, the return line number of each page is supported by a PageFilter function, the functions of arraying the data in a time descending order and displaying the data to the user in different pages are achieved, and the aim of reducing data network transmission price is achieved.
Description
Technical field
The present invention relates to a kind of data page querying method stored based on descending, belong to data query technique field.
Background technology
Along with the develop rapidly of the infotecies such as mobile radio communication, internet, Internet of Things, infotech has been dissolved into the life of people, and the various communication terminals, sensing equipment etc. of throughout world various places create the mass data exceeding any epoch in the past.Meanwhile, the rise of ecommerce, social networks is all the time all in the various data of generation.The epoch of large data arrive, and have in the society of more information because we live in one, and people are close any time before with the mutual ratio of data or the network information.
Contain bulk information in the data of magnanimity, a large amount of useful value can be extracted from information.In large-scale enterprise-level Web information system, store a large amount of data or even the data of magnanimity, paging query technology is a technology indispensable in large-scale Web development of information system.Relational database provides the sql like language of feature richness, has the paging query method of complete set maturation.
HBase be one have high reliability, high-performance literacy, towards row, telescopic distributed memory system.HBase adopts KeyValue key-value pair to store, but be different from some typical NoSQL databases, the Key of HBase is become by multiple part machine, comprising four dimensions is RowKey (line unit) respectively, ColumnFamily (row race), ColumnQualifier (row name) and Timestamp (timestamp), therefore the KeyValue of HBase can be expressed as { rowkey, columnfamily, columnqualifier, timestamp}-->value form, the object done like this is to allow user access the data of specifying more easily.The KeyValue form of HBase is as shown in the table.
Be different from traditional relational database, in HBase table, data volume is large, and the power function provided is limited, cannot provide the Paging in Stored Procedure being similar to relation data.Therefore, HBase paging query is a research extremely with Practical significance, and some scholars give also oneself solution.
(1) HBase tables of data paging query method, first carries out serial number to HBase table each row of data, thus makes each row of data have sequence number, is then stored in concordance list with corresponding row major key by data sequence number.When carrying out paging query, calculate serial number range by the line number of the page number and every page data, then according to serial number range search index table, obtain corresponding key assignments set, finally by the former tables of data of key assignments collection query, obtain Pagination Display data.This solves the problem of page jump inefficiency, but the record sum obtaining HBase is very difficult.Although when browsing all data, current record sum can be left in a database, if the data that inquiry request satisfies condition have a lot of bar, data traversal be totalized for one time the time needing cost longer.
(2) HBase method of Paged Browse, when realizing, front end does not need the total page number recording data, when paging query process, first calls scan method and processes, then call setFilter method and carry out query filter, finally adopt pageFilter to limit the data number returned; And devise a kind of caching mechanism, by binding each login user, when user browse data, record the rowKey of these data, thus avoid all data of scanning, then travel through the resource overhead problem brought one by one.The shortcoming of this scheme realizes comparatively complexity.And the present invention can solve problem above well.
Summary of the invention
The object of the invention is the problem of the paging query algorithm for HBase table, propose a kind of data page querying method stored based on descending, this method solve the problem that paging query algorithm resource consumption is large, search efficiency is low of HBase table, improve the search efficiency of HBase table data page inquiry, reduce data query operating lag.
The present invention solves the technical scheme that its technical matters takes: the present invention is by specifying size and the initial time of institute's data query, the line number supporting every page to return by PageFilter function, achieve data with time descending sort, and paging is presented to the function of user, reach the object reducing data network transmission cost.
Method flow:
Step 1: the data of searching page block district size in database, are stored on HDFS;
Step 2: system generation time stamp Tm, current time Tc, Tm-Tc and device id composition Rowkey;
Step 3: data are stored in HBase table after carrying out descending process according to Rowkey;
Step 4: input initial time Tn and every page of display data number N, arranging Tn=startRow, arranging stopRowkey constant for giving tacit consent to;
Step 5: call pageFilter (tableName, startRowkey, N+1) function, returns M bar data.
Further, step 1 of the present invention comprises:
1) paging process is carried out in database side;
2) when carrying out page turn over operation at every turn, the data of searching page block district size from database.
Further, the Rowkey of step 2 of the present invention comprises: in HBase table, data store according to the lexicographic order of Rowkey, and its timestamp increases progressively, new Rowkey is set, for the combination of Tm-Tc and device id, wherein, Tm-Tc is expressed as time stamp T m and current time Tc subtracts each other.
Further, the storage of step 3 of the present invention comprises: when Tabbed browsing, data temporally ascending sort are shown from front to back, what obtain at first is historical data, but user mostly compares concern to up-to-date data, therefore processing gathering the data come, making latest data be stored in HBase table top, meeting the demand of user to information.
Further, step 4 of the present invention comprises:
1) paging mode does not need record sum, is similar to social network sites and some forums, and client does not need to obtain the total number of records, whether also has data, provide the page-turning function of " lower one page " and " page up " to user after only needing to judge every page;
2) only provide nextpage page-turning function, do not carry out disposable paging to the data of whole tables of data, each data of taking out user's specific data size, improve search efficiency.
Further, step 5 of the present invention comprises:
1) by PageFilter (tableName, startRowkey, stopRowkey, N+1) the function line number of supporting every page to return, do not need data count and the every data line of mark in database of record, realize by data with time descending sort, and paging is presented to the function of user;
2) after having inquired about one page, the lower one page of request, upgrades page=page+1, calls page function; Request page up, upgrades page=page-1, judges whether page is 0, if 0 operation terminates, otherwise calls page function, obtains page data.
The present invention is applied to data page inquiry.
Beneficial effect:
1, the large-scale Web information system application scene that the present invention is directed to HBase realization does not support the original paging of relational database, the method increases the search efficiency of HBase table data page inquiry, reduces data query operating lag.
2, present invention achieves by data with time descending sort, and paging is presented to the function of user, reduces data network transmission cost.
Accompanying drawing explanation
Fig. 1 is the method flow diagram in the embodiment of the present invention.
Fig. 2 is the process schematic that user of the present invention issues a request to return data.
Fig. 3 is data Stored Procedure figure of the present invention.
Fig. 4 is data query process flow diagram of the present invention.
Fig. 5 is that data carry out the storage order figure before and after descending process in HBase table after descending stores.
Embodiment
Below in conjunction with Figure of description, the invention is described in further detail.
As shown in Figure 1, the present invention be directed to the paging query method of HBase tables of data, by generating new timestamp, forming new Rowkey, realize image data temporally descending be stored in the function in HBase table; The method does not re-use traditional mark each row of data and the mode of statistics sum, but adopts the initial Rowkey recording every page, calls the PageFilter method in HBase, provides nextpage page-turning function, achieve the requirement of paging query.
The process of specific implementation of the present invention, comprising:
1, paging query scheme
2, data descending storage means
3, paging query algorithm
4, data query flow process
1. paging query scheme:
For the typical three-tier architecture of Fig. 2, when user sends data inquiry request return data, all paging process can be carried out at database side, Web server end and client browser end (that is: Browser).The criterion that selection carries out paging at that one deck is: the speed of data processing and the expense of network transmission resource.Consider, select to carry out paging process in database side.
More rational paging query scheme: when at every turn carrying out page turn over operation, the data of searching page block district size from database.Although each page turning of this scheme all needs Query Database, the data acknowledgment number inquired is little, significantly reduces the data volume transmitted between network.In addition, for long DataBase combining process of establishing consuming time, can solve by usage data storehouse connection pool.
2. data descending storage means:
As can be seen from Figure 3, by data acquisition server, collect UNE real-time running data, and first these data are stored on HDFS, then descending process is carried out to the data gathered, be finally stored in HBase table.In HBase table, data store according to the lexicographic order of Rowkey, and wherein timestamp increases progressively, and up-to-date data are stored in the bottom of HBase table.When Tabbed browsing, data temporally ascending sort are shown from front to back, and what obtain at first is historical data, but user mostly compares concern to up-to-date data, need to process gathering the data come, and make latest data be stored in HBase table top.
The method of descending process is as follows, comprising:
Step 1: system generates a larger time stamp T m, when deducting current using the time stamp T m generated Tc as a part of storage data Rowkey;
Step 2:Tm-Tc and device id are combined into Rowkey;
Step 3: the operation of being subtracted each other by timestamp, is changed data in HBase, deposits order.
The storage order of Fig. 5 display data before and after descending process in HBase table.In original HBase table, Rowkey arranges according to lexicographic order, and latest data leaves the bottom of HBase tables of data in; Because timestamp increases progressively, through the process operation of subtracting each other, change data in HBase, deposit order, achieve data and be stored in function in HBase table according to time descending.
3. paging query algorithm:
The present invention adopts a kind of paging mode not needing to record sum, be similar to the way of social network sites, some forums, client does not need to obtain the total number of records, whether also has data, provide the page-turning function of " lower one page " and " page up " to user after only needing to judge every page:
(1) page number buffer memory is set, record the initial Rowkey of every one page, Storage Format is the < page number, startRowkey>, when carrying out " lower one page " and operate at every turn, much more all to take out data, and by its Rowkey stored in buffer memory, as the startRowkey of lower one page;
(2) a page variable and pageTemp variable are set, be used for recording the total page number that the page number at current place and user browse respectively, if page equals pageTemp, then Query Database obtains the startRowkey of lower one page, and upgrade buffer memory, otherwise, from buffer memory, directly read the startRowkey of upper nextpage.
Specific algorithm is described below, and comprising:
Input: initial time Tn and every page of display data number N.
Export: return N bar data.
Step 1: input time Tn, every page of display data number N.
Step 2: initialization page number page=1, initialization pageTemp=1, initialization Map<pageTemp, Tn> are used for depositing startRowkey corresponding to every one page.
Step 3: with Tn be startRowkey, stopRowkey be set to acquiescence constant, call PageFilter (tableName, startRowkey, stopRowkey, N+1) function, return M bar data.
, if so, then there is not lower one page in step 4: judge whether M is less than N, request " lower one page " operation terminates.
Step 5: if not, then show to there is lower one page, forward step 6 to, continues to perform.
Step 6: judge whether page equals pageTemp, does not wait and then illustrates that user asks number of pages within pageTemp, directly can perform step step 9 or step 10; Equal, continue to perform.
Step 7: upgrade pageTemp=pageTemp+1, record the current place page number.
Step 8: filter M article of data, the Rowkey taking out these data is stored in Map<pageTemp, Rowkey>, as the startRowkey of lower one page.
Step 9: as user's request " lower one page ", upgrade page=page+1, the value with page corresponding to key taking-up Map is as startRowkey, call PageFilter (tableName, startRowkey, stopRowkey, N+1) function.Repeated execution of steps 3,4,5.
Step 10: as user's request " page up ", upgrade page=page-1, judge whether page equals 0, if it is there is not page up, request " page up " operation terminates; Otherwise the value taken out corresponding to Map for key with page is startRowkey, calls PageFilter function, obtains page up data.
4, data query flow process
Data query is that user extracts interested data in Database Systems, is also the important component part of Data Analysis Services.In HBase system, data query flow process is generally divided into three phases, as shown in Figure 4, comprising:
(1) user is by the request of client submit Query, and inquiry request is uploaded to HBase cluster server (that is: HMaster) by network service by client.
(2) HMaster asks according to user, informs RegionService, and RegionService is responsible for retrieve data.
(3) RegionService returns to client by inquiring about the result obtained.
Claims (7)
1., based on the data page querying method that descending stores, it is characterized in that, described method comprises the steps:
Step 1: in database, the data of searching page block district size are stored on HDFS;
Step 2: system generation time stamp Tm, current time Tc, Tm-Tc and device id composition Rowkey;
Step 3: data are stored in HBase table after carrying out descending process according to Rowkey;
Step 4: input initial time Tn and every page of display data number N, arranging Tn=startRow, arranging stopRowkey constant for giving tacit consent to;
Step 5: call pageFilter (tableName, startRowkey, N+1) function, returns M bar data.
2. a kind of data page querying method stored based on descending according to claim 1, it is characterized in that, the step 1 of described method comprises:
1) paging process is carried out in database side;
2) when carrying out page turn over operation at every turn, the data of searching page block district size from database.
3. a kind of data page querying method stored based on descending according to claim 1, it is characterized in that, the Rowkey of described method step 2 comprises: in HBase table, data store according to the lexicographic order of Rowkey, described timestamp is for increasing progressively, Rowkey is set, that is: be the combination of Tm-Tc and device id, wherein, Tm-Tc is expressed as time stamp T m and current time Tc subtracts each other.
4. a kind of data page querying method stored based on descending according to claim 1, it is characterized in that, the storage of described method step 3 comprises: when Tabbed browsing, data temporally ascending sort are shown from front to back, what obtain at first is historical data, but user mostly compares concern to up-to-date data, therefore processes gathering the data come, make latest data be stored in HBase table top, meet the demand of user to information.
5. a kind of data page querying method stored based on descending according to claim 1, it is characterized in that, the step 4 of described method comprises:
1) paging mode does not need record sum, is similar to social network sites and some forums, and client does not need to obtain the total number of records, whether also has data, provide the page-turning function of " lower one page " and " page up " to user after only needing to judge every page;
2) only provide nextpage page-turning function, do not carry out disposable paging to the data of whole tables of data, each data of taking out user's specific data size, improve search efficiency.
6. a kind of data page querying method stored based on descending according to claim 1, it is characterized in that, the step 5 of described method comprises:
1) by PageFilter (tableName, startRowkey, stopRowkey, N+1) the function line number of supporting every page to return, do not need data count and the every data line of mark in database of record, realize by data with time descending sort, and paging is presented to the function of user;
2) after having inquired about one page, the lower one page of request, upgrades page=page+1, calls page function; Request page up, upgrades page=page-1, judges whether page is 0, if 0 operation terminates, otherwise calls page function, obtains page data.
7. a kind of data page querying method stored based on descending according to claim 1, is characterized in that, described method is applied to data page inquiry.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510557950.9A CN105045932B (en) | 2015-09-02 | 2015-09-02 | A kind of data page querying method based on descending storage |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510557950.9A CN105045932B (en) | 2015-09-02 | 2015-09-02 | A kind of data page querying method based on descending storage |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105045932A true CN105045932A (en) | 2015-11-11 |
| CN105045932B CN105045932B (en) | 2018-11-13 |
Family
ID=54452478
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510557950.9A Active CN105045932B (en) | 2015-09-02 | 2015-09-02 | A kind of data page querying method based on descending storage |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105045932B (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105843956A (en) * | 2016-04-14 | 2016-08-10 | 北京搜狐新媒体信息技术有限公司 | Paging query method and system |
| CN106021357A (en) * | 2016-05-09 | 2016-10-12 | 泰华智慧产业集团股份有限公司 | Distribution-based big data paging query method and system |
| CN106126731A (en) * | 2016-07-01 | 2016-11-16 | 百势软件(北京)有限公司 | A kind of method and device obtaining Elasticsearch paged data |
| CN107391749A (en) * | 2017-08-15 | 2017-11-24 | 杭州安恒信息技术有限公司 | A kind of inquiry divides the method that table data realize waterfall stream |
| CN108073661A (en) * | 2016-11-18 | 2018-05-25 | 北京京东尚科信息技术有限公司 | Data retrieval method and device, report generating system and method |
| CN108702308A (en) * | 2016-02-26 | 2018-10-23 | 霍尼韦尔国际公司 | System and method for intelligent event paging |
| CN109271597A (en) * | 2018-09-19 | 2019-01-25 | 郑州云海信息技术有限公司 | A kind of non-relational database multilist scene Pagination Display method and device thereof |
| CN109460404A (en) * | 2018-09-03 | 2019-03-12 | 中新网络信息安全股份有限公司 | A kind of efficient Hbase paging query method based on redis |
| CN110597859A (en) * | 2019-09-06 | 2019-12-20 | 天津车之家数据信息技术有限公司 | Method and device for querying data in pages |
| CN111221815A (en) * | 2019-11-07 | 2020-06-02 | 南京莱斯网信技术研究院有限公司 | Script-based web service paging data acquisition system |
| CN111400347A (en) * | 2020-03-20 | 2020-07-10 | 北京思特奇信息技术股份有限公司 | Paging query method, system and electronic equipment |
| CN111488370A (en) * | 2020-04-02 | 2020-08-04 | 杭州迪普科技股份有限公司 | List paging quick response system and method |
| CN111930889A (en) * | 2020-07-21 | 2020-11-13 | 银盛支付服务股份有限公司 | Rapid query method based on large-range date span of unstructured database |
| CN112182040A (en) * | 2020-09-30 | 2021-01-05 | 深圳前海微众银行股份有限公司 | Data query method, device, equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103268341A (en) * | 2013-05-10 | 2013-08-28 | 深圳市葡萄信息技术有限公司 | Time line integration method and system on basis of multi-source |
| CN103617232A (en) * | 2013-11-26 | 2014-03-05 | 北京京东尚科信息技术有限公司 | Paging inquiring method for HBase table |
| CN104850640A (en) * | 2015-05-26 | 2015-08-19 | 华北电力大学（保定） | HBase based storage and query method and system for power equipment status monitoring data |
-
2015
- 2015-09-02 CN CN201510557950.9A patent/CN105045932B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103268341A (en) * | 2013-05-10 | 2013-08-28 | 深圳市葡萄信息技术有限公司 | Time line integration method and system on basis of multi-source |
| CN103617232A (en) * | 2013-11-26 | 2014-03-05 | 北京京东尚科信息技术有限公司 | Paging inquiring method for HBase table |
| CN104850640A (en) * | 2015-05-26 | 2015-08-19 | 华北电力大学（保定） | HBase based storage and query method and system for power equipment status monitoring data |
Non-Patent Citations (1)
| Title |
|---|
| WWDUEST: "云数据库", 《百度文库》 * |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108702308B (en) * | 2016-02-26 | 2021-11-30 | 霍尼韦尔国际公司 | System and method for intelligent event paging |
| CN108702308A (en) * | 2016-02-26 | 2018-10-23 | 霍尼韦尔国际公司 | System and method for intelligent event paging |
| CN105843956A (en) * | 2016-04-14 | 2016-08-10 | 北京搜狐新媒体信息技术有限公司 | Paging query method and system |
| CN106021357B (en) * | 2016-05-09 | 2019-05-03 | 泰华智慧产业集团股份有限公司 | Based on distributed big data paging query method and system |
| CN106021357A (en) * | 2016-05-09 | 2016-10-12 | 泰华智慧产业集团股份有限公司 | Distribution-based big data paging query method and system |
| CN106126731A (en) * | 2016-07-01 | 2016-11-16 | 百势软件(北京)有限公司 | A kind of method and device obtaining Elasticsearch paged data |
| CN108073661A (en) * | 2016-11-18 | 2018-05-25 | 北京京东尚科信息技术有限公司 | Data retrieval method and device, report generating system and method |
| CN107391749A (en) * | 2017-08-15 | 2017-11-24 | 杭州安恒信息技术有限公司 | A kind of inquiry divides the method that table data realize waterfall stream |
| CN109460404A (en) * | 2018-09-03 | 2019-03-12 | 中新网络信息安全股份有限公司 | A kind of efficient Hbase paging query method based on redis |
| CN109271597A (en) * | 2018-09-19 | 2019-01-25 | 郑州云海信息技术有限公司 | A kind of non-relational database multilist scene Pagination Display method and device thereof |
| CN109271597B (en) * | 2018-09-19 | 2022-02-18 | 郑州云海信息技术有限公司 | Method and device for paging display of multi-table scene of non-relational database |
| CN110597859A (en) * | 2019-09-06 | 2019-12-20 | 天津车之家数据信息技术有限公司 | Method and device for querying data in pages |
| CN111221815A (en) * | 2019-11-07 | 2020-06-02 | 南京莱斯网信技术研究院有限公司 | Script-based web service paging data acquisition system |
| CN111221815B (en) * | 2019-11-07 | 2021-07-27 | 南京莱斯网信技术研究院有限公司 | Script-based web service paging data acquisition system |
| CN111400347A (en) * | 2020-03-20 | 2020-07-10 | 北京思特奇信息技术股份有限公司 | Paging query method, system and electronic equipment |
| CN111488370A (en) * | 2020-04-02 | 2020-08-04 | 杭州迪普科技股份有限公司 | List paging quick response system and method |
| CN111488370B (en) * | 2020-04-02 | 2023-09-12 | 杭州迪普科技股份有限公司 | List paging quick response system and method |
| CN111930889A (en) * | 2020-07-21 | 2020-11-13 | 银盛支付服务股份有限公司 | Rapid query method based on large-range date span of unstructured database |
| CN112182040A (en) * | 2020-09-30 | 2021-01-05 | 深圳前海微众银行股份有限公司 | Data query method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105045932B (en) | 2018-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105045932A (en) | Data paging inquiry method based on descending order storage | |
| CN102164186B (en) | Method and system for realizing cloud search service | |
| Römer et al. | Real-time search for real-world entities: A survey | |
| CN103646051B (en) | Big-data parallel processing system and method based on column storage | |
| CN103631909B (en) | System and method for combined processing of large-scale structured and unstructured data | |
| CN105338113B (en) | A kind of multi-platform data interconnection system for Urban Data resource-sharing | |
| CN102446225A (en) | Real-time search method, device and system | |
| CN106375369B (en) | The business recommended method of mobile Web and Collaborative Recommendation system based on user behavior analysis | |
| CN102722548B (en) | Distributed type remote graphics browsing method based on province and local combination type anti-accident maneuver | |
| CN105787091B (en) | Support the content delivering system and method for multiple terminals | |
| CN108920552A (en) | A kind of distributed index method towards multi-source high amount of traffic | |
| CN102096705A (en) | Article acquisition method | |
| CN105721944A (en) | News information recommendation method for smart television | |
| CN104778229A (en) | Telecommunication service small file storage system and method based on Hadoop | |
| CN108959663A (en) | A kind of micro- search platform based on mobile Internet | |
| CN102253939A (en) | Searching method and system based on cloud computing technology | |
| CN104281619A (en) | System and method for ordering search results | |
| CN108829704A (en) | Big data distributed mining analysis service technology | |
| CN106021357A (en) | Distribution-based big data paging query method and system | |
| CN105787066A (en) | Digital content distribution system based on total analysis | |
| CN102982034B (en) | The searching method and search system of Internet website information | |
| CN102156749B (en) | Anatomic search and judgment method, system and distributed server system for map sites | |
| CN106648917A (en) | Cache data differential updating method and system | |
| US20120317091A1 (en) | System and method for users to get newly updates | |
| CN103425694B (en) | The searching method of relational data and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20190726 Address after: Room 302 and 303, 86 blocks, 700 Yishan Road, Xuhui District, Shanghai Patentee after: Shanghai BETA Software Co., Ltd. Address before: 210003 Gulou District, Jiangsu, Nanjing new model road, No. 66 Patentee before: Nanjing Post & Telecommunication Univ. |
|
| TR01 | Transfer of patent right |