WO2017005094A1 - Procédé et dispositif d'interrogation de données - Google Patents

Procédé et dispositif d'interrogation de données Download PDF

Info

Publication number
WO2017005094A1
WO2017005094A1 PCT/CN2016/086870 CN2016086870W WO2017005094A1 WO 2017005094 A1 WO2017005094 A1 WO 2017005094A1 CN 2016086870 W CN2016086870 W CN 2016086870W WO 2017005094 A1 WO2017005094 A1 WO 2017005094A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
page
information
database
queried
Prior art date
Application number
PCT/CN2016/086870
Other languages
English (en)
Chinese (zh)
Inventor
林锦成
Original Assignee
阿里巴巴集团控股有限公司
林锦成
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 阿里巴巴集团控股有限公司, 林锦成 filed Critical 阿里巴巴集团控股有限公司
Publication of WO2017005094A1 publication Critical patent/WO2017005094A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • 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/242—Query formulation
    • G06F16/2425—Iterative querying; Query formulation based on the results of a preceding query

Definitions

  • the present application relates to the field of data processing technologies, and in particular, to a data query method and a data query device.
  • a database is a repository that organizes, stores, and manages data according to its data structure. With the development of information technology and the market, data management is no longer just about storing and managing data, but transforming into a variety of data management methods that users need. There are many types of databases, ranging from the simplest tables that store various data to the large database systems that can store massive amounts of data. With the wide application of large databases, how to quickly query data in the database is particularly important.
  • HBASE In a structured database like mysql, since the primary key is basically sequential, it is easy to query the data based on the primary key.
  • rowkey In the semi-structured storage environment of HBASE, data is stored in the form of key-value, rowkey is the key in the storage of HBASE, analogous to the primary key in mysql, usually the user uses rowkey as the query field.
  • rowkey In HBASE, in order to achieve data balance distribution, generally rowkey does not use self-added value, but uses a hash value, that is, rowKey is irregular. Therefore, in this case, when data query is performed based on rowkey, only one page of data in HBASE can be searched sequentially. This kind of query method, especially in the case of querying a large amount of data, takes a long time and is inefficient.
  • the technical problem to be solved by the embodiments of the present application is to provide a data query method, which can improve data query efficiency.
  • the embodiment of the present application further provides a data query device for ensuring implementation and application of the foregoing method.
  • a data query method including:
  • the data page information includes at least each single page data identifier in the database
  • the data to be queried corresponding to the data to be queried is queried in the requested data.
  • a method for obtaining data page information of the database includes:
  • the data page information is received and added to the memory queue, the data page information including at least a single page data identifier of each page of the database.
  • the to-be-queried data information includes at least one rowkey of the data to be queried.
  • the to-be-queried data information includes a start and stop page of the data to be queried in the database; the data page information further includes page code information corresponding to the single-page data identifier of each page of the database.
  • the to-be-queried data information includes a start page and a data amount of the data to be queried in the database; the data page information further includes page code information and a page corresponding to the single-page data identifier of each page of the database. The amount of data inside.
  • the requesting, by the database, data corresponding to the single page data identifier corresponding to the to-be-queried data information include:
  • the database is a semi-structured storage database with an irregular key value.
  • the embodiment of the present application further discloses a data query device, including:
  • a request receiving unit configured to receive a data query request, where the data query request includes data information to be queried
  • a determining unit configured to determine, according to the data page information of the database obtained in advance, a single page data identifier corresponding to the to-be-queried data information; the data page information includes at least each single page data identifier in the database ;
  • a data requesting unit configured to request, from the database, data corresponding to the single-page data identifier corresponding to the to-be-queried data information
  • the query unit is configured to query, in the requested data, the data to be queried corresponding to the data information to be queried.
  • the device further includes:
  • An information obtaining unit configured to obtain data page information of the database
  • the information acquiring unit includes:
  • a request subunit configured to send a data page information query request to the database
  • the storage subunit is configured to receive the data page information and add it to the memory queue, the data page information including at least a single page data identifier of each page of the database.
  • the data requesting unit includes:
  • Pulling a subunit configured to enable at least two threads to pull different single page data identifiers corresponding to the to-be-queried data information in the memory queue in parallel;
  • the data requesting subunit is configured to occupy the data corresponding to the at least two threads in parallel requesting the pulled single page data identifier from the database.
  • the embodiments of the present application include the following advantages:
  • the embodiment of the present application obtains the data page information by using the single page data identifier in the database, and according to the data page information, can directly obtain a page or a certain page of data corresponding to the data information to be queried in the database for data query,
  • the query method does not need to perform data query page by page in the database, which simplifies the data query process and improves the data query efficiency.
  • FIG. 1 is a flow chart showing the steps of an embodiment of a data query method of the present application
  • FIG. 2 is a flow chart showing the steps of an embodiment of a method for obtaining data page information of a database in the present application
  • FIG. 3 is a flow chart showing the steps of another data query method embodiment of the present application.
  • FIG. 5 is a flow chart showing the steps of another data query method embodiment of the present application.
  • FIG. 6 is a structural block diagram of an embodiment of a data query apparatus of the present application.
  • FIG. 7 is a structural block diagram of another embodiment of a data query apparatus of the present application.
  • FIG. 8 is a structural block diagram of an information acquisition unit in the present application.
  • FIG. 9 is a structural block diagram of a data request unit in the present application.
  • FIG. 1 a flow chart of steps of an embodiment of a data query method of the present application is shown, which may specifically include the following steps:
  • Step 101 Receive a data query request, where the data query request includes data information to be queried.
  • the device for querying data obtains the data to be queried information included in the request after receiving the data query request, and the data to be queried may include at least one data to be queried.
  • the rowkey needs the device to find the data to be queried corresponding to the rowkey in the database; the data information to be queried may also include the start and end pages of the data to be queried in the database, and the device needs to find the start and end page in the database.
  • the data to be queried may also be a start page and a data amount including the data to be queried in the database, and the device needs to satisfy the data amount after the start page is found in the database.
  • the data to be queried may also include other information for querying data, which will not be enumerated here.
  • Step 102 Determine, according to the data page information of the database obtained in advance, a single page data identifier corresponding to the data information to be queried, where the data page information includes at least each single page data identifier in the database.
  • the device obtains the data page information of the database in advance before performing the step, which may be the device requesting the database in advance.
  • the data page information includes at least each order in the database
  • the page data identifier, the single page data identifier can uniquely identify the corresponding data page, for example, in the HBASE database, the marker is the starting identifier of the data page; the data page information can also include a single page with each page in the database.
  • the page data identifies corresponding page number information; it may also include an amount of in-page data corresponding to a single page data identifier of each page of data in the database.
  • a single page data identifier corresponding to the data information to be queried may be determined, and the determined single page data identifier may be one or multiple
  • the data pages corresponding to multiple single page data identifiers may be continuous or discontinuous in the database.
  • Step 103 Request data corresponding to the single page data identifier corresponding to the data information to be queried to the database.
  • the thread may be required to request the data corresponding to the single page data identifier from the database, and when the determined single page data identifier is multiple, the thread may be occupied in parallel to the database. Request data corresponding to each single page data identifier.
  • Step 104 Query the data to be queried corresponding to the data information to be queried in the requested data.
  • the data to be queried can be queried according to the data information to be queried.
  • the data to be queried may be the data requested in the previous step, or may be part of the data in the requested data.
  • the embodiment of the present application obtains the data page information by using the single page data identifier in the database, and according to the data page information, can directly obtain a page or a certain page of data corresponding to the data information to be queried in the database for data query,
  • the query method does not need to perform data query page by page in the database, which simplifies the data query process and improves the data query efficiency.
  • the method for obtaining data page information of a database may include the following steps:
  • Step 201 Send a data page information query request to the database.
  • the device sends a query request to the database.
  • the database After receiving the request, the database obtains at least a single page data identifier of each page of data according to the request, and may also obtain page number information and/or amount of data in the page corresponding to the single page data identifier of each page of data in the database according to the requested content. Generate data page information, then Then return it to the device.
  • Step 202 Receive data page information, and add data page information to a memory queue, where the data page information includes at least a single page data identifier of each page of data in the database.
  • the device After receiving the data page information sent by the data, the device adds it to the memory queue so that it can be quickly called at any time.
  • the device can quickly and easily determine a page or a certain number of pages in the database for data query according to the data query request, and does not simplify the data query process and improve the data query efficiency.
  • FIG. 3 a flow chart of steps of another data query method embodiment of the present application is shown, which may specifically include the following steps:
  • Step 301 Receive a data query request, where the data query request includes at least one rowkey of the data to be queried.
  • the application scenario of this embodiment is to perform a query according to the rowkey of the data.
  • Step 302 Determine, according to the data page information of the database obtained in advance, all the single page data identifiers of the database.
  • the data page information of the database obtained in advance may include only a single page data identifier of each page of data in the database.
  • the single page data identified in this step is identified as all single page data of the database.
  • step 303 at least two threads are enabled to pull all the different single page data identifiers in the memory queue in parallel.
  • multiple threads need to be enabled, and multiple threads execute in parallel.
  • Each thread pulls a single page data identifier in the memory queue, and the single page data identifiers drawn by different threads are different.
  • Step 304 The at least two threads are occupied in parallel to request data corresponding to the pulled single page data identifier from the database.
  • the thread After each thread pulls the single page data identifier, the thread requests the data corresponding to the pulled single page data identifier in parallel.
  • Step 305 Query, in the requested data, the data to be queried corresponding to the rowkey of the data to be queried.
  • each thread inquires the data corresponding to the extracted single page data identifier, and queries the data of the request path in parallel with the data to be queried corresponding to rowkey in step 301.
  • the above threads execute in parallel.
  • the thread can repeatedly execute steps 303-305 until all the single page data identifiers in the database are pulled.
  • FIG. 4 a flow chart of steps of another embodiment of the data query method of the present application is shown, which may specifically include the following steps:
  • Step 401 Receive a data query request, where the data query request includes a start and end page of the data to be queried in the database.
  • the application scenario of this embodiment is to query data between the start and end pages of a specified data page in the database.
  • the start and end page can also be the same page, that is, requesting a page of data in the database.
  • Step 402 Determine, according to the data page information of the database obtained in advance, a single page data identifier of the data page between the start and end pages in the database, where the data page information includes a single page data identifier of each page of the database and corresponding Page number information.
  • the device may determine a single page data identifier of the data page between the start and end pages according to the single page data identifier of each page of data in the database and its corresponding page number information.
  • Step 403 enabling at least two threads to pull the determined different single page data identifiers in the memory queue in parallel.
  • the thread is directly enabled to pull the single page data identifier from the memory queue, and the data corresponding to the single page data identifier is requested from the database.
  • At least two threads are enabled to respectively extract different single page data identifiers in the memory queue.
  • step 303 The process of enabling multiple threads to pull a single page data identification is similar to step 303 in the previous example.
  • Step 404 occupying the at least two threads to request data corresponding to the extracted single page data identifier in parallel to the database.
  • step 304 This process is similar to step 304 in the foregoing embodiment, and details are not described herein again.
  • the data requested in step 404 is the data between the start and end pages of the database requested in step 401.
  • the single-page data identifier is used to request corresponding data from the database, which simplifies the operation process of the database, and can obtain data simultaneously through multiple threads, thereby improving data query efficiency.
  • FIG. 5 a flow chart of steps of another data query method embodiment of the present application is shown, which may specifically include the following steps:
  • Step 501 Receive a data query request, where the data query request includes a start page and a data amount of the data to be queried in the database.
  • the application scenario in this embodiment is that the device needs to query data that reaches the required data amount after the start page.
  • Step 502 Determine, according to the data page information of the database obtained in advance, a single page data identifier corresponding to the start page and the data amount in the database, where the data page information includes a single page data identifier of each page of the database and Corresponding page number information and amount of data in the page.
  • the single page data identifier corresponding to the start page is determined according to the page number information corresponding to the single page data identifier, and then the data after the start page is estimated according to the amount of data in the page corresponding to the single page data identifier and the data amount included in the request. Pages, and determine the single page data identifier corresponding to these data pages. It is possible that the amount of data contained in the request corresponds to all the data in the determined data page, and it is also possible that the amount of data contained in the request is smaller than all the data in the determined data page, for example, in the last data page determined. Need to query some of the data.
  • Step 503 enabling at least two threads to pull the determined different single page data identifiers in the memory queue in parallel.
  • Step 504 occupying the at least two threads to request data corresponding to the pulled single page data identifier in parallel to the database.
  • the steps 503-504 are similar to the steps 403-404 in the foregoing embodiment, and details are not described herein again.
  • Step 505 Query, in the requested data, the data to be queried corresponding to the start page and the data amount of the data to be queried in the database.
  • the data requested in step 504 is the data requested in step 501.
  • the data to be queried can be obtained according to the data volume in the request. .
  • the data processing may be further performed according to the obtained data, for example, data comparison, data backup, and the like.
  • the foregoing method embodiment can be applied to a semi-structured storage database whose database has an irregular key value, such as HBASE, wherein the single page data identifier is a marker.
  • FIG. 6 a structural block diagram of an embodiment of a data query apparatus according to the present application is shown, which may specifically include the following units:
  • the request receiving unit 601 is configured to receive a data query request, where the data query request includes data information to be queried.
  • the determining unit 602 is configured to determine, according to the data page information of the database obtained in advance, a single page data identifier corresponding to the to-be-queried data information; the data page information includes at least each single page data in the database Logo.
  • the data requesting unit 603 is configured to request, from the database, data corresponding to the single page data identifier corresponding to the to-be-queried data information.
  • the querying unit 604 is configured to query, in the requested data, the data to be queried corresponding to the data information to be queried.
  • the device obtains the data page information by using the single page data identifier in the database through the above unit, and according to the data page information, directly obtains a certain one of the database corresponding to the data information to be queried.
  • the page or a few pages of data for data query the device query mode does not need to query the data page by page in the database, which simplifies the data query process and improves the data query efficiency.
  • the device may further include:
  • the information acquisition unit 701 is configured to obtain data page information of the database.
  • the information obtaining unit 701, as shown in FIG. 8, may further include:
  • the request subunit 801 is configured to send a data page information query request to the database.
  • the storage sub-unit 802 is configured to receive the data page information and add it to the memory queue, the data page information including at least a single-page data identifier of each page of the database.
  • the to-be-queried data information may include at least one rowkey of the data to be queried.
  • the to-be-queried data information may further include a start and stop page of the data to be queried in the database; the data page information further includes page code information corresponding to the single-page data identifier of each page of the database.
  • the to-be-queried data information may further include a start page and a data amount of the data to be queried in the database; the data page information further includes a single-page data identifier corresponding to each page of the database. Page number information and the amount of data in the page.
  • the data requesting unit 603 may include:
  • the pull subunit 901 is configured to enable at least two threads to pull different single page data identifiers corresponding to the to-be-queried data information in the memory queue in parallel.
  • the data requesting subunit 902 is configured to occupy the data corresponding to the at least two threads in parallel requesting the extracted single page data identifier from the database.
  • the above database may be a semi-structured storage database with an irregular key value, such as HBASE, wherein the single page data identifier is a marker.
  • the embodiment of the present application further provides an electronic device, including a memory, a transceiver, and a processor.
  • the processor and the memory and the transceiver are connected to each other through a bus; the bus may be an ISA bus, a PCI bus or an EISA bus.
  • the bus can be divided into an address bus, a data bus, a control bus, and the like.
  • the memory is used to store a program, in particular, the program may include program code,
  • the program code includes computer operating instructions.
  • the memory may include a high speed RAM memory and may also include a non-volatile memory such as at least one disk memory.
  • the transceiver is configured to receive a data query request, where the data query request includes data to be queried; and request, by the database, data corresponding to the single page data identifier corresponding to the to-be-queried data information.
  • the processor is used to read the program code in the memory and perform the following steps:
  • the data page information includes at least each single page data identifier in the database
  • the data to be queried corresponding to the data to be queried is queried in the requested data.
  • the description is relatively simple, and the relevant parts can be referred to the description of the method embodiment.
  • embodiments of the embodiments of the present application can be provided as a method, apparatus, or computer program product. Therefore, the embodiments of the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware. Moreover, embodiments of the present application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • the computer device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
  • the memory may include non-persistent memory, random access memory (RAM), and/or non-volatile memory in a computer readable medium, such as read only memory (ROM) or flash memory.
  • RAM random access memory
  • ROM read only memory
  • Memory is an example of a computer readable medium.
  • Computer readable media includes both permanent and non-permanent, removable and non-removable media
  • Information storage can be accomplished by any method or technique.
  • the information can be computer readable instructions, data structures, modules of programs, or other data.
  • Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read only memory. (ROM), electrically erasable programmable read only memory (EEPROM), flash memory or other memory technology, compact disk read only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, Magnetic tape cartridges, magnetic tape storage or other magnetic storage devices or any other non-transportable media can be used to store information that can be accessed by a computing device.
  • computer readable media does not include non-persistent computer readable media, such as modulated data signals and carrier waves.
  • Embodiments of the present application are described with reference to flowcharts and/or block diagrams of methods, terminal devices (systems), and computer program products according to embodiments of the present application. It will be understood that each flow and/or block of the flowchart illustrations and/or FIG.
  • These computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, embedded processor or other programmable data processing terminal device to produce a machine such that instructions are executed by a processor of a computer or other programmable data processing terminal device
  • Means are provided for implementing the functions specified in one or more of the flow or in one or more blocks of the flow chart.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing terminal device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the instruction device implements the functions specified in one or more blocks of the flowchart or in a flow or block of the flowchart.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Linguistics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention concerne un procédé et un dispositif d'interrogation de données. Le procédé d'interrogation de données comprend les étapes suivantes : recevoir une demande d'interrogation de données, avec la demande d'interrogation de données contenant des informations à propos de données devant être interrogées (101) ; déterminer un identifiant de données de page unique correspondant aux informations à propos de données devant être interrogées selon des informations de page de données à propos d'une base de données acquise à l'avance, avec les informations de page de données contenant au moins tous les identifiants de données de page unique dans la base de données (102) ; demander des données correspondant à l'identifiant de données de page unique correspondant aux informations à propos de données devant être interrogées à partir de la base de données (103) ; et interroger des données devant être interrogées correspondant aux informations à propos de données devant être interrogées dans les données demandées (104). En acquérant des informations de page de données en utilisant un identifiant de données de page unique dans une base de données, et selon les informations de page de données, des données peuvent être interrogées en acquérant directement une ou plusieurs pages de données correspondant à des informations à propos de données devant être interrogées dans la base de données. Le procédé d'interrogation simplifie le processus d'interrogation de données, et augmente l'efficacité de l'interrogation de données.
PCT/CN2016/086870 2015-07-03 2016-06-23 Procédé et dispositif d'interrogation de données WO2017005094A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510388093.4 2015-07-03
CN201510388093.4A CN106326309B (zh) 2015-07-03 2015-07-03 一种数据查询方法和装置

Publications (1)

Publication Number Publication Date
WO2017005094A1 true WO2017005094A1 (fr) 2017-01-12

Family

ID=57684666

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/086870 WO2017005094A1 (fr) 2015-07-03 2016-06-23 Procédé et dispositif d'interrogation de données

Country Status (2)

Country Link
CN (1) CN106326309B (fr)
WO (1) WO2017005094A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109408532A (zh) * 2018-09-26 2019-03-01 平安科技（深圳）有限公司 数据获取方法、装置、计算机设备和存储介质
CN110765132A (zh) * 2019-10-22 2020-02-07 北京思特奇信息技术股份有限公司 一种基于HBase的数据存储、检索方法及装置
CN111459949A (zh) * 2019-01-18 2020-07-28 阿里巴巴集团控股有限公司 针对数据库的数据处理方法、装置及设备和索引更新方法
CN112100245A (zh) * 2020-09-18 2020-12-18 咪咕文化科技有限公司 数据导出方法、装置、电子设备和存储介质
CN112182040A (zh) * 2020-09-30 2021-01-05 深圳前海微众银行股份有限公司 数据查询方法、装置、设备和存储介质
CN112866339A (zh) * 2020-12-30 2021-05-28 金蝶软件（中国）有限公司 数据传输方法、装置、计算机设备和存储介质
CN112100245B (zh) * 2020-09-18 2024-05-31 咪咕文化科技有限公司 数据导出方法、装置、电子设备和存储介质

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110019213A (zh) * 2017-12-04 2019-07-16 北京京东尚科信息技术有限公司 数据管理方法、装置、电子设备及存储介质
CN110019274B (zh) * 2017-12-29 2023-09-26 阿里巴巴集团控股有限公司 一种数据库系统以及查询数据库的方法和装置
CN109656980A (zh) * 2018-12-27 2019-04-19 Oppo（重庆）智能科技有限公司 数据处理方法、电子设备、装置及可读存储介质
CN110032604B (zh) * 2019-02-02 2021-12-07 北京奥星贝斯科技有限公司 数据存储装置、转译装置及数据库访问方法
CN111427885B (zh) * 2020-03-03 2023-06-09 中科驭数（北京）科技有限公司 基于查找表的数据库管理方法和装置

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7158996B2 (en) * 2003-01-27 2007-01-02 International Business Machines Corporation Method, system, and program for managing database operations with respect to a database table
US7461060B2 (en) * 2005-10-04 2008-12-02 International Business Machines Corporation Generalized partition pruning in a database system
CN101876983A (zh) * 2009-04-30 2010-11-03 国际商业机器公司 数据库分区方法与系统
CN102725753A (zh) * 2011-11-28 2012-10-10 华为技术有限公司 优化数据访问的方法及装置、优化数据存储的方法及装置
CN102799628A (zh) * 2012-06-21 2012-11-28 新浪网技术(中国)有限公司 在key-value数据库中进行数据分区的方法和装置
CN103593436A (zh) * 2013-11-12 2014-02-19 华为技术有限公司 文件合并方法和装置

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102375852A (zh) * 2010-08-24 2012-03-14 中国移动通信集团公司 建立数据索引的方法、利用该索引查询数据的方法和系统
CN103514214B (zh) * 2012-06-28 2018-09-21 深圳中兴网信科技有限公司 数据查询方法及装置
CN104182405B (zh) * 2013-05-22 2017-05-24 阿里巴巴集团控股有限公司 一种连接查询方法及装置
CN103488720A (zh) * 2013-09-12 2014-01-01 金蝶软件（中国）有限公司 一种数据查看方法、系统和客户端
CN103617232B (zh) * 2013-11-26 2018-03-30 北京京东尚科信息技术有限公司 一种针对HBase表的分页查询方法
CN104750681B (zh) * 2013-12-25 2018-02-23 中国移动通信集团辽宁有限公司 一种海量数据的处理方法及装置
CN104102710A (zh) * 2014-07-15 2014-10-15 浪潮(北京)电子信息产业有限公司 一种海量数据查询方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7158996B2 (en) * 2003-01-27 2007-01-02 International Business Machines Corporation Method, system, and program for managing database operations with respect to a database table
US7461060B2 (en) * 2005-10-04 2008-12-02 International Business Machines Corporation Generalized partition pruning in a database system
CN101876983A (zh) * 2009-04-30 2010-11-03 国际商业机器公司 数据库分区方法与系统
CN102725753A (zh) * 2011-11-28 2012-10-10 华为技术有限公司 优化数据访问的方法及装置、优化数据存储的方法及装置
CN102799628A (zh) * 2012-06-21 2012-11-28 新浪网技术(中国)有限公司 在key-value数据库中进行数据分区的方法和装置
CN103593436A (zh) * 2013-11-12 2014-02-19 华为技术有限公司 文件合并方法和装置

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109408532A (zh) * 2018-09-26 2019-03-01 平安科技（深圳）有限公司 数据获取方法、装置、计算机设备和存储介质
CN109408532B (zh) * 2018-09-26 2023-12-19 平安科技（深圳）有限公司 数据获取方法、装置、计算机设备和存储介质
CN111459949A (zh) * 2019-01-18 2020-07-28 阿里巴巴集团控股有限公司 针对数据库的数据处理方法、装置及设备和索引更新方法
CN111459949B (zh) * 2019-01-18 2023-12-19 阿里巴巴集团控股有限公司 针对数据库的数据处理方法、装置及设备和索引更新方法
CN110765132A (zh) * 2019-10-22 2020-02-07 北京思特奇信息技术股份有限公司 一种基于HBase的数据存储、检索方法及装置
CN112100245A (zh) * 2020-09-18 2020-12-18 咪咕文化科技有限公司 数据导出方法、装置、电子设备和存储介质
CN112100245B (zh) * 2020-09-18 2024-05-31 咪咕文化科技有限公司 数据导出方法、装置、电子设备和存储介质
CN112182040A (zh) * 2020-09-30 2021-01-05 深圳前海微众银行股份有限公司 数据查询方法、装置、设备和存储介质
CN112866339A (zh) * 2020-12-30 2021-05-28 金蝶软件（中国）有限公司 数据传输方法、装置、计算机设备和存储介质
CN112866339B (zh) * 2020-12-30 2022-12-06 金蝶软件（中国）有限公司 数据传输方法、装置、计算机设备和存储介质

Also Published As

Publication number Publication date
CN106326309B (zh) 2020-02-21
CN106326309A (zh) 2017-01-11

Similar Documents

Publication Publication Date Title
WO2017005094A1 (fr) Procédé et dispositif d'interrogation de données
RU2729960C1 (ru) Способ и устройство хранения данных и запроса на основе цепочки блоков
WO2018214835A1 (fr) Procédé et dispositif d'acceptation et de consensus de service de chaîne de blocs
KR101994021B1 (ko) 파일 조작 방법 및 장치
EP3158480B1 (fr) Procédé et appareil d'interrogation de données
TWI613555B (zh) 搜索方法和裝置
US10748220B2 (en) Account processing method and apparatus
WO2018040722A1 (fr) Procédé et dispositif d'interrogation de données de tables
JP2015531941A5 (fr)
TW201220197A (en) for improving the safety and reliability of data storage in a virtual machine based on cloud calculation and distributed storage environment
WO2017016423A1 (fr) Procédé et dispositif de mise à jour de nouvelles données en temps réel
US20170060878A1 (en) Field Extension in Database System
CN111159219B (zh) 一种数据管理方法、装置、服务器及存储介质
WO2017161540A1 (fr) Procédé d'interrogation de données, procédé de stockage d'objets de données et système de données
WO2019085601A1 (fr) Procédé et appareil d'exécution de tâche
CN107423037B (zh) 应用程序接口定位方法及设备
WO2019076102A1 (fr) Procédé et dispositif de restauration de données et support d'informations lisible par ordinateur
TW201702870A (zh) 一種資源分配方法和裝置
CN104572809A (zh) 一种分布式关系数据库自由扩展方法
CN111723161A (zh) 一种数据处理方法、装置及设备
CN108153777B (zh) 数据访问信息的获取方法及装置
JP2015212961A (ja) ファイルバリアントを作成する方法、システム、及びコンピュータ可読な媒体
CN108491457A (zh) 一种用于同步公共云资源的方法及设备
JP7440007B2 (ja) データベースをクエリするためのシステム、方法および装置
CN110019357B (zh) 数据库查询脚本生成方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16820745

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16820745

Country of ref document: EP

Kind code of ref document: A1