CN110188096B - Index creating method, device and equipment for data record - Google Patents

Index creating method, device and equipment for data record Download PDF

Info

Publication number
CN110188096B
CN110188096B CN201910313734.8A CN201910313734A CN110188096B CN 110188096 B CN110188096 B CN 110188096B CN 201910313734 A CN201910313734 A CN 201910313734A CN 110188096 B CN110188096 B CN 110188096B
Authority
CN
China
Prior art keywords
data
data block
block
record
index
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.)
Active
Application number
CN201910313734.8A
Other languages
Chinese (zh)
Other versions
CN110188096A (en
Inventor
杨新颖
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Advanced New Technologies Co Ltd
Advantageous New Technologies Co Ltd
Original Assignee
Advanced New Technologies Co Ltd
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 Advanced New Technologies Co Ltd filed Critical Advanced New Technologies Co Ltd
Priority to CN201910313734.8A priority Critical patent/CN110188096B/en
Publication of CN110188096A publication Critical patent/CN110188096A/en
Priority to PCT/CN2020/078419 priority patent/WO2020211569A1/en
Priority to TW109110761A priority patent/TW202040387A/en
Priority to US16/885,958 priority patent/US10990705B2/en
Priority to US17/239,819 priority patent/US11126751B2/en
Application granted granted Critical
Publication of CN110188096B publication Critical patent/CN110188096B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2255Hash tables
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2458Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
    • G06F16/2471Distributed queries

Abstract

An index creating method, device and equipment for data records are disclosed. According to the scheme provided by the embodiment of the specification, for the data record written in the account book, the service attribute of the data record and the storage position in the account book are determined, the corresponding relation between the service attribute and the storage position is established, and the inverted index with the service attribute as the main key is created.

Description

Index creating method, device and equipment for data record
Technical Field
The embodiment of the specification relates to the technical field of information, in particular to a method, a device and equipment for creating an index of a data record.
Background
When a centralized database server provides services to the outside in a block-chain type account book, the account book records related data records required to be stored by related users.
In practical applications, a centralized database server generally interfaces with enterprise users, and data records that the enterprise users need to store often have different business attributes. Such as the source of the data record, the user, the item to which it belongs, etc. In the block chain type account book, the storage of the data records related to the same service attribute is often dispersed, and the state statistics of the data records related to the same service attribute is inconvenient.
Based on this, there is a need for an index creation scheme with respect to the business attributes of data records.
Disclosure of Invention
The embodiment of the application aims to provide a method for creating an index in a centralized block chain type account book.
In order to solve the above technical problem, the embodiment of the present application is implemented as follows:
an index creating method for data records is applied to a centralized database service provider for storing data through a block chain type account book, and comprises the following steps:
acquiring a designated identification field in a data record, wherein the designated identification field is used for identifying the service attribute of the data record;
determining position information of the data record in the ledger, wherein the position information comprises a block height of a data block where the data record is located and an offset in the located data block;
establishing a corresponding relation between the specified identification field and the position information, and writing an index taking the specified identification field as a main key;
in the block chain type account book, except for an initial data block, each data block comprises at least one data record, each data block comprises a hash value of a previous data block and a hash value of a data block determined by the data record contained in the data block, and the block height of the data block is monotonically increased based on the sequence of blocking time.
Correspondingly, an embodiment of the present specification further provides an index creating apparatus for data records, which is applied to a centralized database service provider that stores data by a block chain ledger, and includes:
the acquisition module is used for acquiring a specified identification field in a data record, wherein the specified identification field is used for identifying the service attribute of the data record;
the determining module is used for determining the position information of the data record in the ledger, wherein the position information comprises the block height of the data block where the data record is located and the offset of the data block where the data record is located;
the writing module is used for establishing the corresponding relation between the specified identification field and the position information and writing an index taking the specified identification field as a main key;
in the block chain type account book, except for an initial data block, each data block comprises at least one data record, each data block comprises a hash value of a previous data block and a hash value of a data block determined by the data record contained in the data block, and the block height of the data block is monotonically increased based on the sequence of blocking time.
According to the scheme provided by the embodiment of the specification, for the data record written into the account book, the service attribute of the data record and the storage position in the account book are determined, the corresponding relation between the service attribute and the storage position is established, the inverted index with the service attribute as the main key is created, the service details of the user do not need to be known, and the data record can be correspondingly counted and subsequently inquired and verified based on the service attribute from the index.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of embodiments of the invention.
In addition, any one of the embodiments in the present specification is not required to achieve all of the effects described above.
Drawings
In order to more clearly illustrate the embodiments of the present specification or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the embodiments of the present specification, and other drawings can be obtained by those skilled in the art according to the drawings.
Fig. 1 is a schematic flowchart of a process for generating a block chain ledger according to an embodiment of the present disclosure;
FIG. 2 is a schematic diagram of a system architecture according to an embodiment of the present disclosure;
FIG. 3 is a flowchart illustrating a method for creating an index of a data record according to an embodiment of the present disclosure;
fig. 4 is a schematic structural diagram of an index creating apparatus for data records according to an embodiment of the present specification;
fig. 5 is a schematic structural diagram of an apparatus for configuring a method according to an embodiment of the present disclosure.
Detailed Description
In order to make those skilled in the art better understand the technical solutions in the embodiments of the present specification, the technical solutions in the embodiments of the present specification will be described in detail below with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only a part of the embodiments of the present specification, and not all the embodiments. All other embodiments that can be derived by one of ordinary skill in the art from the embodiments given herein are intended to be within the scope of protection.
First, a centralized block chain type ledger in the embodiments of the present specification will be described. In a centralized database service provider, a block chain type ledger is generated as follows, as shown in fig. 1, fig. 1 is a schematic flow chart of generating a block chain type ledger provided by an embodiment of this specification, and includes:
s101, receiving data records to be stored, and determining hash values of the data records.
The data records to be stored here may be various consumption records of individual users of the client, and also may be business results, intermediate states, operation records, and the like generated by the application server when executing business logic based on instructions of the users. Specific business scenarios may include consumption records, audit logs, supply chains, government regulatory records, medical records, and the like.
S103, when the preset blocking condition is reached, determining each data record to be written into the data block, and generating the Nth data block containing the hash value of the data block and the data record.
The preset blocking condition comprises the following steps: when the number of data records to be stored reaches a number threshold, for example, a new data block is generated every time one thousand data records are received, and one thousand data records are written into the block; alternatively, a time interval from the last blocking time reaches a time threshold, e.g., every 5 minutes, a new data block is generated, and the data records received within the 5 minutes are written into the block.
N here refers to a sequence number of the data block, that is, in the embodiment of the present specification, the data block is arranged in a block chain manner, and is arranged in sequence based on the blocking time, so that the data block has a strong timing characteristic. The block height of the data block is monotonically increased based on the sequence of the blocking time. The block height may be a sequence number, and at this time, the block height of the nth data block is N; the block height may also be generated in other ways.
When N is 1, the data block at this time is the initial data block. The hash value and the block height of the initial data block are given based on a preset mode. For example, the initial data block does not contain data records, the hash value is any given hash value, and the block height blknum is 0; for another example, the trigger condition for generation of the initial data block is consistent with the trigger conditions of other data blocks, but the hash value of the initial data block is determined by hashing all of the contents in the initial data block.
When N >1, since the content and hash value of the previous data block have already been determined, at this time, the hash value of the current data block (nth data block) may be generated based on the hash value of the previous data block (i.e., nth-1 data block), for example, one possible way is to determine the hash value of each data record to be written into the nth data block, generate a mercker tree in the order of arrangement in the blocks, concatenate the root hash value of the mercker tree with the hash value of the previous data block, and generate the hash value of the current block again using the hash algorithm. For example, the hash value of the data block may be generated by concatenating the data records in the order of the data records in the block and hashing the concatenated data records to obtain the hash value of the entire data record, concatenating the hash value of the previous data block and the hash value of the entire data record, and performing a hash operation on the concatenated string.
After the user successfully uploads the data, the hash value of the corresponding data record and the hash value of the located data block can be obtained and stored, and integrity verification can be initiated based on the hash values. The specific verification mode is to recalculate the hash value of the data record and the hash value of the data block in the database, and compare the calculated hash values with those stored locally.
By the above-mentioned manner of generating data blocks, each data block is determined by a hash value, and the hash value of the data block is determined by the content and the sequence of data records in the data block and the hash value of the previous data block. The user can initiate verification based on the hash value of the data block at any time, and modification of any content in the data block (including modification of data record content or sequence in the data block) can cause inconsistency between the hash value of the data block calculated during verification and the hash value generated during data block generation, so that verification failure is caused, and centralized non-tampering is realized.
When the block chained account book is verified, generally, a segment of data block is designated for continuous integrity verification, or continuous integrity verification is performed from the initial data block. The verification mode is to obtain the hash value of the previous data block, and recalculate the hash value of the data block according to the data record of the data block and the hash value of the previous data block by adopting the same algorithm as that used for generating the hash value of the data block.
The foregoing description describes a block chain type account book according to an embodiment of the present specification. In practical applications, the database service side is often oriented to various organizations, and the organizations can record data generated between the organizations and third-party users (including other organizations or individuals) in the database service side for storage. As shown in fig. 2, fig. 2 is a schematic diagram of a system architecture according to an embodiment of the present disclosure. In this illustration, one enterprise may be oriented to multiple users, and each user may query the database service provider through its corresponding enterprise.
For example, the organization that the database server side interfaces with is a certain financial product company, and the data record can be a financial record of the individual user at the financial product company; alternatively, the mechanism of the interface may be a government department, wherein the data records are overhead details of public projects managed by the government department; or the mechanism for the database server to interface is a certain hospital, and the data records are medical records of patients; alternatively, the institution to which the database facilitator interfaces is a third party payment institution, the data records may be payment records of individual users through the institution, and so on.
As mentioned above, although these data records have strong timing characteristics when the account book is written, the data records are usually stored in a plurality of data blocks in a distributed manner for the user. For example, medical records for all patients in a hospital are sequentially uploaded in a time-generated order. For a certain user in a hospital, there may be multiple medical histories, and the time interval is relatively large, and if the hospital or the user needs to select the data record of the user from the account book, the user needs to query the account book according to the hash value of each medical record determined in the storage process, which is very inconvenient.
Based on this, embodiments of the present specification provide an index creating method for data records, which is applied to a centralized database service provider that stores data through a block chain type account book, and can implement creating an inverted index that uses a service attribute as a main key when service details of a docking mechanism are not needed to be known, thereby facilitating service processing of the docking mechanism and improving user experience.
The technical solutions provided by the embodiments of the present description are described in detail below with reference to the accompanying drawings. As shown in fig. 3, fig. 3 is a schematic flowchart of an index creating method for data records provided in an embodiment of this specification, where the flowchart specifically includes the following steps:
s301, acquiring a designated identification field in the data record, wherein the designated identification field is used for identifying the service attribute of the data record.
In each mechanism for interfacing with the database server, the service attribute generally exists only in the interfacing mechanism, and the service attribute is based on different service scenes and can comprise a user name, a user identity card number, a driving license number, a mobile phone number, a unique item number and the like.
For example, for a third-party payment mechanism, the data record is a consumption record of a user, and the service attribute at this time is a user identifier (including a mobile phone number, an identity card number, a user name, and the like), or a hash value obtained by performing a hash algorithm on the user identifier; alternatively, for a government agency, the data records are a running stream of costs for multiple common items, and the business attribute at this time may be a unique number for each item.
The specific location of the specified identification field and the manner of acquisition may be a prior negotiation between the database server and the docking mechanism. For example, when the data record provided by the docking mechanism is a standard structured data record, the specified identification field may be obtained from a specified offset in the data record, or the start position and the end position are identified by specific characters; or, when the data records provided by the docking mechanism are unstructured data, the header containing the service attribute can be directly spliced at the head of each data record when the docking mechanism uploads the unstructured data, and the database server can directly acquire the designated identification field of each data record from the header.
And S303, determining the position information of the data record in the account book, wherein the position information comprises the block height of the data block where the data record is located and the offset in the located data block.
As mentioned above, a block-chained ledger is composed of a plurality of data blocks, and a data block usually contains a plurality of transactions. Therefore, in the embodiments of the present specification, the location information specifically refers to which data block in the ledger a data record is stored on, and at what location in the data block.
In the data blocks provided in the embodiments of the present specification, there are many ways to identify different data blocks, including hash values or block heights of the data blocks.
The hash value of the data block is obtained by performing hash calculation according to the hash value of the previous block and the data record of the data block, and can be used for uniquely and definitely identifying one data block. In the block chain type account book, the block height of the first data block is 0 generally, and 1 is added for each additional data block; alternatively, the blocking time of a data block may be converted to a large sequence of monotonically increasing integer data (typically 12 to 15 bits) as the block height of the data block. Thus, a data block typically has a definite block height.
For another example, in a determined data block to be written into the database, the ordering of the data records is also fixed, so that the sequence number of a data record in the data block is also clear, and when the length of the data record is a fixed unit, the sequence number can also be used to clear the position information of the data record in the data block where the data record is located.
Meanwhile, since a plurality of data records are usually included in one data block, the data records in the data block can be identified by the address offset of each data record in the data block. Obviously, the address offset of each data record is not the same in the same data block.
Of course, since the specific format of the data block can be customized in the manner provided in the embodiments of the present specification (for example, the metadata information and remark information included in the block header of the data block, the form taken by the block height of the data block, and the like), the content of the location information may also be different in different formats, which does not form a limitation to the present solution.
S305, establishing the corresponding relation between the specified identification field and the position information, and writing an index taking the specified identification field as a main key.
That is, the index is an inverted index. In this index, the primary key is a business attribute contained in the data record. The specific writing mode is that when the main key in the index does not contain the specified identification field, an index record with the specified identification field as the main key is created in the index table.
And when the primary key in the index contains the specified identification field, writing the position information into the index record in which the specified identification field is located. Here, the writing is not overwriting, but position information is added to the value of the index record, and is present in the index record in parallel with other position information.
As shown in table 1, table 1 is an exemplary index table provided in the embodiments of the present specification. The Key is a specific Value of the service attribute, each array of the Value part is a piece of position information, the front part of each array is high, the rear part of each array is a serial number of a data record in the data block, and a data record can be uniquely determined through the block height and the serial number. It is easily understood that one key may correspond to a plurality of location information in the index table.
TABLE 1
Key Value
0X123456 (2,08),(2,10),(300,89),(300,999)
344X0001 (5,01),(8,22)
…… ……
According to the scheme provided by the embodiment of the specification, for the data record written into the account book, the service attribute of the data record and the storage position in the account book are determined, the corresponding relation between the service attribute and the storage position is established, the inverted index with the service attribute as the main key is created, the service details of the user do not need to be known, and the data record can be correspondingly counted and subsequently inquired and verified based on the service attribute from the index.
In an embodiment, when a database server side acquires a specified identification field in a data record, an acquisition mode can be synchronously created, that is, when the data record is received, a service attribute is directly analyzed to obtain, and when a data block is written into an account book, an index is synchronously created. In another mode, after the data block is written into the ledger, the index does not need to be created immediately, but when the database has spare resources, the index is created asynchronously for each data record in the data block newly written into the ledger, and under the asynchronous creation mode, the database server side is facilitated to save resources.
In the index table, since one service attribute may correspond to a plurality of location information (i.e., correspond to a plurality of data records), when the location information is written into the index, the location information may also be sequentially arranged according to the sequence of the data records in the account book, which is beneficial to query and verification of the user. The sequence of the data records in the ledger can be embodied by the time stamp of the data record written in the ledger (i.e. the blocking time stamp of the data block), and for the data records in the same data block, the sequence in the data block can be embodied.
After the index table is created, the status query and statistics of the service attribute can be performed based on the index table. For example, a query request is received that contains specific values of service attributes (in general, the query request may be sent in the form of instructions). The query request may come from the docking facility or from a service user of the docking facility. Thus, the database can be matched from the index table according to the specific value of the service attribute. For example, after table 1 is created, the user inputs a query command, Retrieve (0X123456, & v, FULL), that is, location information (2,08), (2,10), (300,89), (300,999) of the data record corresponding to the user "0X 123456" can be obtained from the index table, and the corresponding data record is obtained according to the location information query and returned to the user.
Further, a block height parameter for specifying a data block interval may also be included in the query, for example, a user input query instruction, Retrieve (0X123456, & v, 100), for querying a data record of the specified user 0X123456 before the block height 100. Thus, the position information (2,08), (2,10) is obtained, and the corresponding data record is obtained.
And, a data block can also be determined by two data block heights, for example, a user input query instruction, Retrieve (0X123456, & v, 200, 1000) is used for querying data records of the specified user 0X123456 between the block height 200 and the block height 1000 in the ledger, so as to obtain the data records corresponding to the location information (300,89), (300,999).
In one embodiment, the block height of the data block may be large integer data (typically monotonically increasing 12-to 15-bit integer data) obtained by symmetric encryption based on the blocking timestamp of the data block, e.g., a 13-bit large integer. Since the large integer is obtained based on time symmetric encryption, when the blocking time of the data block is needed, the blocking time can be obtained by the same symmetric decryption.
For example, for the blocking time "20 xx-01-1903: 14: 07.938576", after symmetric encryption, it can be converted into a large integer "1547838847938", since the integer data monotonically increases with time, and thus "1547838847938", which can be the block height of the data block and is used to identify the data block.
In this specification, the block height is monotonically increased based on the blocking time, so that even if large integer data is used, the order between them is still from small to large, reflecting the order between the data blocks. For example, if the blocking time of the next data block is "20 xx-01-1903: 16: 07.235125", it can be converted into another larger large integer "1547838848125" by using a preset symmetric encryption algorithm.
In this way, when the user inputs the block height parameter (the database server may provide a time-to-large integer conversion mode so that the user obtains the block height parameter corresponding to the time) to determine the data block interval, the corresponding query time period is actually determined, i.e., the user may perform the query based on the time period, for example, the user may query the data records generated by the user in one month or one day based on the self ID (i.e., the service attribute) and the current time, or query the data records generated between certain specified time periods, without performing traversal query from the data block, thereby improving the efficiency.
When some statistics are carried out on the data records, the statistics can be carried out only by directly according to the index table. For example, the docking mechanism may count the number of data records of each user, or the user may know the number of data records of the user and the docking mechanism, and then directly count the Value number after each Key Value in the index table.
It is readily understood that for the service attribute "0X 123456", the user is more concerned about the integrity of the data records and data blocks associated with it, and the other data blocks are not of interest to the user. For this purpose, the user can also perform a jump-type verification in the ledger based on the index table.
Specifically, a database server side receives a verification instruction containing a specific value of a service attribute; matching from an index table according to the specific value of the user service attribute, and determining the position information corresponding to the specific value of the service attribute in the index table; and carrying out integrity verification on the data record and/or the data block corresponding to the position information according to the position information. For example, for the data records in table 1, the user enters the validation instruction: VERIFY (0X123456, & v, FULL), that is, to VERIFY the data record corresponding to the service attribute "0X 123456" and the data block where the data record is located, the database server can obtain from the index to perform integrity verification on the data record corresponding to the location information (2,08), (2,10), (300,89), (300,999) and the two data blocks with block heights of 2 and 300.
The verification method for the data record is to obtain the data record, determine the hash of the record and the hash values of other data records in the data block where the data record is located, form a tacle tree, and verify whether the tacle tree root hash of the tacle tree can be regenerated. And the verification mode of the data block is to recalculate the hash value of the data block according to the hash value of the previous data block and the data record of the data block, and verify whether the hash value is consistent with the hash value obtained by the previous calculation.
Similar to the query, the user may also include a block height parameter in the validation instruction that specifies the validation interval. And only the data blocks falling into the verification interval are verified during verification.
The result returned during the verification is a "yes" or "no" metadata, and the database server can also add the signature of the server to the verification result. It can be seen that, through the index provided in the embodiment of the present specification, in the process of querying and verifying in the block chain type account book, the database base server is unaware of specific business contents, so that decoupling of data storage and business contents is realized, different business mechanisms can be simultaneously connected, and the adaptability is wider.
Correspondingly, an embodiment of the present specification further provides an index creating apparatus for data records, which is applied to a centralized database service provider that stores data by block chain ledger, as shown in fig. 4, where fig. 4 is a schematic structural diagram of an index creating apparatus for data records provided by an embodiment of the present specification, and includes:
an obtaining module 401, configured to obtain a specified identifier field in a data record, where the specified identifier field is used to identify a service attribute of the data record;
a determining module 403, configured to determine location information of the data record in the ledger, where the location information includes a block height of a data block where the data record is located and an offset in the located data block;
a write-in module 405, configured to establish a corresponding relationship between the specified identifier field and the location information, and write in an index using the specified identifier field as a primary key;
in the block chain type account book, except for an initial data block, each data block comprises at least one data record, each data block comprises a hash value of a previous data block and a hash value of a data block determined by the data record contained in the data block, and the block height of the data block is monotonically increased based on the sequence of blocking time.
Further, the obtaining module 401 obtains the specified identification field in the data record when receiving the data record sent by the user; or determining data records contained in the data blocks in the account book, and acquiring the designated identification fields of any data record contained in the data blocks.
Further, the writing module 405, when the primary key in the index does not contain the specified identification field, creates an index record with the specified identification field as the primary key in the index table; and when the primary key in the index contains the specified identification field, writing the position information into the index record in which the specified identification field is located.
Further, the writing module 405 determines timestamps of the data records, and sequentially writes the position information of the data records into the values of the index records in the same index record according to the sequence of the timestamps.
Further, in the centralized database service provider, the centralized database service provider further includes a data block generating module 407, which receives data records to be stored, and determines hash values of the data records, where the data records include designated identification fields; when a preset blocking condition is reached, determining each data record to be written into the data block, and generating an nth data block containing the hash value of the data block and the data record, specifically comprising:
when N is 1, the hash value and the block height of the initial data block are given based on a preset mode;
and when N is greater than 1, determining the hash value of the Nth data block according to the hash values of the data records to be written in the data block and the (N-1) th data block, and generating the Nth data block comprising the hash value of the Nth data block and the data records, wherein the block height of the data block is monotonically increased based on the sequence of the blocking time.
Further, the preset blocking condition includes: the number of data records to be stored reaches a number threshold; alternatively, the time interval from the last chunking time reaches a time threshold.
Further, the apparatus further includes an inquiry module 409, which receives an inquiry command containing a specific value of the service attribute; matching from an index table according to the specific value of the user service attribute, and determining the position information corresponding to the specific value of the service attribute in the index table; and acquiring the corresponding data record from the account book according to the position information, and returning the acquired corresponding data record to the query instruction sender.
Further, the apparatus further includes a verification module 411, which receives a verification instruction including a specific value of a service attribute, and matches the verification instruction from an index table according to the specific value of the user service attribute, and determines location information corresponding to the specific value of the service attribute in the index table; and carrying out integrity verification on the data record and/or the data block corresponding to the position information according to the position information.
Embodiments of the present specification further provide a computer device, which at least includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the index creation method for data records shown in fig. 3 when executing the program.
Fig. 5 is a schematic diagram illustrating a more specific hardware structure of a computing device according to an embodiment of the present disclosure, where the computing device may include: a processor 1010, a memory 1020, an input/output interface 1030, a communication interface 1040, and a bus 1050. Wherein the processor 1010, memory 1020, input/output interface 1030, and communication interface 1040 are communicatively coupled to each other within the device via bus 1050.
The processor 1010 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits, and is configured to execute related programs to implement the technical solutions provided in the embodiments of the present disclosure.
The Memory 1020 may be implemented in the form of a ROM (Read Only Memory), a RAM (Random Access Memory), a static storage device, a dynamic storage device, or the like. The memory 1020 may store an operating system and other application programs, and when the technical solution provided by the embodiments of the present specification is implemented by software or firmware, the relevant program codes are stored in the memory 1020 and called to be executed by the processor 1010.
The input/output interface 1030 is used for connecting an input/output module to input and output information. The i/o module may be configured as a component in a device (not shown) or may be external to the device to provide a corresponding function. The input devices may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output devices may include a display, a speaker, a vibrator, an indicator light, etc.
The communication interface 1040 is used for connecting a communication module (not shown in the drawings) to implement communication interaction between the present apparatus and other apparatuses. The communication module can realize communication in a wired mode (such as USB, network cable and the like) and also can realize communication in a wireless mode (such as mobile network, WIFI, Bluetooth and the like).
Bus 1050 includes a path that transfers information between various components of the device, such as processor 1010, memory 1020, input/output interface 1030, and communication interface 1040.
It should be noted that although the above-mentioned device only shows the processor 1010, the memory 1020, the input/output interface 1030, the communication interface 1040 and the bus 1050, in a specific implementation, the device may also include other components necessary for normal operation. In addition, those skilled in the art will appreciate that the above-described apparatus may also include only those components necessary to implement the embodiments of the present description, and not necessarily all of the components shown in the figures.
The present specification also provides a computer readable storage medium, on which a computer program is stored, which when executed by a processor implements the index creation method for data records shown in fig. 3.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, 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 disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
From the above description of the embodiments, it is clear to those skilled in the art that the embodiments of the present disclosure can be implemented by software plus necessary general hardware platform. Based on such understanding, the technical solutions of the embodiments of the present specification may be essentially or partially implemented in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., and includes several instructions for enabling a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments of the present specification.
The systems, methods, modules or units described in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. A typical implementation device is a computer, which may take the form of a personal computer, laptop computer, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email messaging device, game console, tablet computer, wearable device, or a combination of any of these devices.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, as for the method embodiment, since it is substantially similar to the method embodiment, it is relatively simple to describe, and reference may be made to the partial description of the method embodiment for relevant points. The above-described method embodiments are merely illustrative, wherein the modules described as separate components may or may not be physically separate, and the functions of the modules may be implemented in one or more software and/or hardware when implementing the embodiments of the present specification. And part or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of the embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
The foregoing is only a specific embodiment of the embodiments of the present disclosure, and it should be noted that, for those skilled in the art, a plurality of modifications and decorations can be made without departing from the principle of the embodiments of the present disclosure, and these modifications and decorations should also be regarded as the protection scope of the embodiments of the present disclosure.

Claims (17)

1. An index creating method for data records is applied to a centralized database service provider for storing data through a block chain type account book, and comprises the following steps:
acquiring a designated identification field in a data record, wherein the designated identification field is used for identifying the service attribute of the data record;
determining position information of the data record in the ledger, wherein the position information comprises a block height of a data block where the data record is located and an offset in the located data block;
establishing a corresponding relation between the specified identification field and the position information, and writing an index taking the specified identification field as a main key;
in the block chain type account book, except for an initial data block, each data block comprises at least one data record, each data block comprises a hash value of a previous data block and a hash value of a data block determined by the data record contained in the data block, and the block height of the data block is monotonically increased based on the sequence of blocking time.
2. The method of claim 1, obtaining a specified identification field in a data record, comprising:
when receiving a data record sent by a user, acquiring a designated identification field in the data record; alternatively, the first and second electrodes may be,
determining data records contained in data blocks in the account book, and acquiring a designated identification field of any data record contained in the data blocks.
3. The method of claim 1, writing an index that is primary to the specified identification field, comprising:
when the primary key in the index does not contain the specified identification field, creating an index record with the specified identification field as the primary key in the index table;
and when the primary key in the index contains the specified identification field, writing the position information into the index record in which the specified identification field is located.
4. The method of claim 3, writing the location information to an index record in which the specified identification field is located, comprising:
determining a timestamp of the data record;
and sequentially writing the position information of the data record into the value of the index record in the same index record according to the sequence of the time stamps.
5. The method of claim 1, wherein at the centralized database service provider, the data chunks are pre-generated by:
receiving data records to be stored, and determining hash values of the data records, wherein the data records comprise designated identification fields;
when a preset blocking condition is reached, determining each data record to be written into the data block, and generating an nth data block containing the hash value of the data block and the data record, specifically comprising:
when N is 1, the hash value and the block height of the initial data block are given based on a preset mode;
and when N is greater than 1, determining the hash value of the Nth data block according to the hash values of the data records to be written in the data block and the (N-1) th data block, and generating the Nth data block comprising the hash value of the Nth data block and the data records, wherein the block height of the data block is monotonically increased based on the sequence of the blocking time.
6. The method of claim 5, the preset blocking condition comprising:
the number of data records to be stored reaches a number threshold; alternatively, the first and second electrodes may be,
the time interval from the last blocking instant reaches a time threshold.
7. The method of claim 1, further comprising:
receiving a query instruction containing a specific value of a service attribute;
matching from an index table according to the specific value of the user service attribute, and determining the position information corresponding to the specific value of the service attribute in the index table;
and acquiring the corresponding data record from the account book according to the position information, and returning the acquired corresponding data record to the query instruction sender.
8. The method of claim 1, further comprising:
receiving a verification instruction containing a specific value of a service attribute;
matching from an index table according to the specific value of the user service attribute, and determining the position information corresponding to the specific value of the service attribute in the index table;
and carrying out integrity verification on the data record and/or the data block corresponding to the position information according to the position information.
9. An index creating apparatus for data records, applied to a centralized database service provider that stores data by block chaining ledgers, comprising:
the acquisition module is used for acquiring a specified identification field in a data record, wherein the specified identification field is used for identifying the service attribute of the data record;
the determining module is used for determining the position information of the data record in the ledger, wherein the position information comprises the block height of the data block where the data record is located and the offset of the data block where the data record is located;
the writing module is used for establishing the corresponding relation between the specified identification field and the position information and writing an index taking the specified identification field as a main key;
in the block chain type account book, except for an initial data block, each data block comprises at least one data record, each data block comprises a hash value of a previous data block and a hash value of a data block determined by the data record contained in the data block, and the block height of the data block is monotonically increased based on the sequence of blocking time.
10. The apparatus of claim 9, wherein the obtaining module, when receiving a data record sent by a user, obtains a specified identification field in the data record; or determining data records contained in the data blocks in the account book, and acquiring the designated identification fields of any data record contained in the data blocks.
11. The apparatus of claim 9, the write module to create an index record in the index table with the specified identification field as a primary key when the primary key in the index does not contain the specified identification field; and when the primary key in the index contains the specified identification field, writing the position information into the index record in which the specified identification field is located.
12. The apparatus of claim 11, the write module to determine a timestamp of the data record; and sequentially writing the position information of the data record into the value of the index record in the same index record according to the sequence of the time stamps.
13. The apparatus of claim 9, further comprising a data block generation module, at a centralized database service provider, for receiving data records to be stored, and determining a hash value of each data record, wherein the data records include a designated identification field; when a preset blocking condition is reached, determining each data record to be written into the data block, and generating an nth data block containing the hash value of the data block and the data record, specifically comprising:
when N is 1, the hash value and the block height of the initial data block are given based on a preset mode;
and when N is greater than 1, determining the hash value of the Nth data block according to the hash values of the data records to be written in the data block and the (N-1) th data block, and generating the Nth data block comprising the hash value of the Nth data block and the data records, wherein the block height of the data block is monotonically increased based on the sequence of the blocking time.
14. The apparatus of claim 13, the preset blocking condition comprising: the number of data records to be stored reaches a number threshold; alternatively, the time interval from the last chunking time reaches a time threshold.
15. The apparatus according to claim 9, further comprising a query module for receiving a query instruction containing a specific value of a service attribute; matching from an index table according to the specific value of the user service attribute, and determining the position information corresponding to the specific value of the service attribute in the index table; and acquiring the corresponding data record from the account book according to the position information, and returning the acquired corresponding data record to the query instruction sender.
16. The apparatus according to claim 9, further comprising a verification module, receiving a verification instruction containing a specific value of a service attribute, matching from an index table according to the specific value of the user service attribute, and determining location information corresponding to the specific value of the service attribute in the index table; and carrying out integrity verification on the data record and/or the data block corresponding to the position information according to the position information.
17. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 8 when executing the program.
CN201910313734.8A 2019-04-18 2019-04-18 Index creating method, device and equipment for data record Active CN110188096B (en)

Priority Applications (5)

Application Number Priority Date Filing Date Title
CN201910313734.8A CN110188096B (en) 2019-04-18 2019-04-18 Index creating method, device and equipment for data record
PCT/CN2020/078419 WO2020211569A1 (en) 2019-04-18 2020-03-09 Method for constructing index of data record
TW109110761A TW202040387A (en) 2019-04-18 2020-03-30 Method for constructing index of data record
US16/885,958 US10990705B2 (en) 2019-04-18 2020-05-28 Index creation for data records
US17/239,819 US11126751B2 (en) 2019-04-18 2021-04-26 Index creation for data records

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910313734.8A CN110188096B (en) 2019-04-18 2019-04-18 Index creating method, device and equipment for data record

Publications (2)

Publication Number Publication Date
CN110188096A CN110188096A (en) 2019-08-30
CN110188096B true CN110188096B (en) 2021-08-17

Family

ID=67714709

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910313734.8A Active CN110188096B (en) 2019-04-18 2019-04-18 Index creating method, device and equipment for data record

Country Status (1)

Country Link
CN (1) CN110188096B (en)

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110555297B (en) * 2018-06-01 2021-06-15 本无链科技(深圳)有限公司 Method and system for managing certificates through block chain
US10990705B2 (en) 2019-04-18 2021-04-27 Advanced New Technologies Co., Ltd. Index creation for data records
WO2020211569A1 (en) * 2019-04-18 2020-10-22 创新先进技术有限公司 Method for constructing index of data record
CN110569398A (en) * 2019-09-09 2019-12-13 广州虎牙科技有限公司 data processing method and device, computer equipment and readable storage medium
CN110727679A (en) * 2019-09-25 2020-01-24 支付宝(杭州)信息技术有限公司 Cooperative tracking method, system, device and equipment for court case
CN110750533A (en) * 2019-09-25 2020-02-04 支付宝(杭州)信息技术有限公司 Data storage method, device and equipment based on multiple service attributes
CN110717196A (en) * 2019-09-25 2020-01-21 支付宝(杭州)信息技术有限公司 Method, device and equipment for storing securities trading data
CN110825737A (en) * 2019-10-18 2020-02-21 支付宝(杭州)信息技术有限公司 Index creation and data query method, device and equipment
CN110837502B (en) * 2019-10-18 2021-03-12 蚂蚁区块链科技(上海)有限公司 Data storage method, device and equipment in block chain type account book
EP3834157B1 (en) 2020-04-22 2023-09-13 Alipay (Hangzhou) Information Technology Co., Ltd. Managing transaction requests in ledger systems
WO2020143854A2 (en) * 2020-04-22 2020-07-16 Alipay (Hangzhou) Information Technology Co., Ltd. Managing transaction requests in ledger systems
CN111506661B (en) * 2020-04-22 2021-09-28 腾讯科技(深圳)有限公司 Content access management method, device and storage medium
SG11202103218YA (en) 2020-04-22 2021-04-29 Alipay Hangzhou Inf Tech Co Ltd Managing transaction requests in ledger systems
CN111444194B (en) * 2020-06-12 2020-10-30 支付宝(杭州)信息技术有限公司 Method, device and equipment for clearing indexes in block chain type account book
CN112632069B (en) * 2020-12-22 2021-08-31 中科驭数(北京)科技有限公司 Hash table data storage management method, device, medium and electronic equipment
CN113064901A (en) * 2021-04-06 2021-07-02 北京瑞卓喜投科技发展有限公司 Method and device for forming data micro-index in contract on chain and electronic equipment
CN116955363B (en) * 2023-09-21 2023-12-26 北京四维纵横数据技术有限公司 Method, device, computer equipment and medium for creating index of modeless data

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101620617A (en) * 2009-07-28 2010-01-06 中兴通讯股份有限公司 Method and device for searching and processing log file
CN107273556A (en) * 2017-08-23 2017-10-20 上海点融信息科技有限责任公司 Block chain data index method and equipment
CN107515901A (en) * 2017-07-24 2017-12-26 中国科学院信息工程研究所 A kind of chain type daily record storage organization and its Hash Index Structure, data manipulation method and server, medium
CN107729383A (en) * 2017-09-18 2018-02-23 联动优势科技有限公司 A kind of library generation method, data verification method, device and platform
CN109299336A (en) * 2018-09-30 2019-02-01 腾讯科技(深圳)有限公司 Data back up method, device, storage medium and calculating equipment
CN109408551A (en) * 2018-08-06 2019-03-01 杭州复杂美科技有限公司 Data query method and system, common recognition method and system, equipment and storage medium

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9960920B2 (en) * 2016-01-26 2018-05-01 Stampery Inc. Systems and methods for certification of data units and/or certification verification
CN108647361B (en) * 2018-05-21 2021-12-03 中国工商银行股份有限公司 Data storage method, device and system based on block chain
CN108830104A (en) * 2018-06-15 2018-11-16 宁波大学 BIM data organization method based on block chain
CN108962343A (en) * 2018-07-04 2018-12-07 南京百市通数字科技有限公司 A kind of teenager's view light data method for tracing based on block chain technology

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101620617A (en) * 2009-07-28 2010-01-06 中兴通讯股份有限公司 Method and device for searching and processing log file
CN107515901A (en) * 2017-07-24 2017-12-26 中国科学院信息工程研究所 A kind of chain type daily record storage organization and its Hash Index Structure, data manipulation method and server, medium
CN107273556A (en) * 2017-08-23 2017-10-20 上海点融信息科技有限责任公司 Block chain data index method and equipment
CN107729383A (en) * 2017-09-18 2018-02-23 联动优势科技有限公司 A kind of library generation method, data verification method, device and platform
CN109408551A (en) * 2018-08-06 2019-03-01 杭州复杂美科技有限公司 Data query method and system, common recognition method and system, equipment and storage medium
CN109299336A (en) * 2018-09-30 2019-02-01 腾讯科技(深圳)有限公司 Data back up method, device, storage medium and calculating equipment

Also Published As

Publication number Publication date
CN110188096A (en) 2019-08-30

Similar Documents

Publication Publication Date Title
CN110188096B (en) Index creating method, device and equipment for data record
CN110162662B (en) Verification method, device and equipment for data records in block chain type account book
CN110162526B (en) Method, device and equipment for inquiring data records in block chain type account book
CN110825737A (en) Index creation and data query method, device and equipment
CN111352935B (en) Index creating method, device and equipment in block chain type account book
CN110349019B (en) Verification method, device and equipment in block chain type account book
CN110347679B (en) Data storage method, device and equipment based on receipt
CN110879687B (en) Data reading method, device and equipment based on disk storage
CN110716965B (en) Query method, device and equipment in block chain type account book
CN110837502B (en) Data storage method, device and equipment in block chain type account book
US11126751B2 (en) Index creation for data records
CN110474775B (en) User creating method, device and equipment in block chain type account book
US10999062B2 (en) Blockchain-type data storage
CN111046069B (en) Aggregation calculation method, device and equipment in block chain type account book
CN111046052B (en) Method, device and equipment for storing operation records in database
CN110750533A (en) Data storage method, device and equipment based on multiple service attributes
CN110347678B (en) Financial data storage method, system, device and equipment
CN111444194B (en) Method, device and equipment for clearing indexes in block chain type account book
CN110727679A (en) Cooperative tracking method, system, device and equipment for court case
CN110636042B (en) Method, device and equipment for updating verified block height of server
CN110362570B (en) Data storage method, device and equipment
CN110688664B (en) Authority management method, device and equipment in block chain type account book
CN111444195B (en) Method, device and equipment for clearing indexes in block chain type account book
CN111444215A (en) Blocking method, device and equipment in block chain type account book
CN111444197B (en) Verification method, device and equipment for data records in block chain type account book

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20200929

Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands

Applicant after: Innovative advanced technology Co.,Ltd.

Address before: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands

Applicant before: Advanced innovation technology Co.,Ltd.

Effective date of registration: 20200929

Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands

Applicant after: Advanced innovation technology Co.,Ltd.

Address before: A four-storey 847 mailbox in Grand Cayman Capital Building, British Cayman Islands

Applicant before: Alibaba Group Holding Ltd.

GR01 Patent grant
GR01 Patent grant