CN111831725A - Synchronous storage method and device for internet tourism data on block chain - Google Patents

Synchronous storage method and device for internet tourism data on block chain Download PDF

Info

Publication number
CN111831725A
CN111831725A CN201911325770.2A CN201911325770A CN111831725A CN 111831725 A CN111831725 A CN 111831725A CN 201911325770 A CN201911325770 A CN 201911325770A CN 111831725 A CN111831725 A CN 111831725A
Authority
CN
China
Prior art keywords
data
storage
internet
user equipment
storage nodes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201911325770.2A
Other languages
Chinese (zh)
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.)
Beijing Aimo Ruice Technology Co Ltd
Original Assignee
Beijing Aimo Ruice Technology 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 Beijing Aimo Ruice Technology Co Ltd filed Critical Beijing Aimo Ruice Technology Co Ltd
Priority to CN201911325770.2A priority Critical patent/CN111831725A/en
Publication of CN111831725A publication Critical patent/CN111831725A/en
Pending legal-status Critical Current

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/27Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/62Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6245Protecting personal data, e.g. for financial or medical purposes

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Health & Medical Sciences (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • Data Mining & Analysis (AREA)
  • Computing Systems (AREA)
  • Medical Informatics (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • Software Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application discloses a synchronous storage method and a device for internet tourism data on a block chain, wherein the block chain system comprises a storage node and a block outlet node, and the method is applied to the block outlet node and comprises the following steps: receiving an internet tourism data storage request sent by user equipment; selecting a preset number of storage nodes, and sending the internet tourism data to the preset number of storage nodes; receiving storage certificates sent by a predetermined number of storage nodes, wherein the storage certificates comprise the internet tourism data which is verified, the storage addresses of the storage nodes, the private key signatures of the storage nodes and the public keys of the storage nodes; the storage attestation is transmitted to the user device to prompt the user device that the internet travel data has been stored. The data after the verification need not be verified again by the node, so that the chaining time of the internet tourism data is greatly shortened, and the user experience is improved.

Description

Synchronous storage method and device for internet tourism data on block chain
Technical Field
The invention relates to the technical field of internet big data, in particular to a method and a device for synchronously storing internet tourism data on a block chain.
Background
Currently, the blockchain technology is a distributed stored ledger that uses technologies such as encryption algorithm and consensus mechanism. With the application of the block chain technology, more and more internet data can be stored on the block chain; see patent nos.: 201910306004.5.
the existing shared economic data is stored in a block chain, and block chain link points need to pack the data into blocks; and then storing the blocks into a block chain after the blocks are identified. If the workload proves PoW consensus method is adopted, the uplink process needs about 60 minutes; if the DPoS method is adopted, the uplink process needs about 15 minutes; the two consensus methods, PoW and DPoS, are the mainstream consensus methods of the current block chain system. When a user needs to link internet travel data (e.g., platform data such as a pig tour network), the experience of the user using the blockchain technique is affected by the often tens of minutes of link time.
Therefore, how to shorten the time for user data uplink for the shared economy data uplink storage is an urgent problem to be solved.
The foregoing description is merely for convenience in understanding and is not to be construed as limiting the prior art to the present application.
Disclosure of Invention
Based on the problems, the application provides a synchronous storage method and a device for internet tourism data on a block chain, the method adopts a practical Byzantine consensus algorithm (PBFT) to verify each piece of internet tourism data needing to be stored, and after the verification is passed; the verified data is packaged into a block chaining by the block discharging node, and the block discharging node does not need to verify the verified data again, so that the chaining time of the internet tourism data is greatly shortened, and the user experience is improved.
The first aspect of the application discloses a synchronous storage method of internet tourism data on a block chain, wherein a block chain system comprises a storage node and a block output node, the block output node is used for packaging the internet tourism data into a block uplink, the storage node stores the internet tourism data through a local database, and the method is applied to the block output node and comprises the following steps:
receiving an internet tourism data storage request sent by user equipment, wherein the internet tourism data comprises an internet tourism data ID, a user equipment private key signature and a user equipment public key;
selecting a preset number of storage nodes, and sending the internet tourism data to the preset number of storage nodes, so that the preset number of storage nodes adopt a practical Byzantine algorithm to perform consensus verification on the internet tourism data;
receiving storage certificates sent by the storage nodes with the preset number, wherein the storage certificates comprise the internet tourism data which is verified, the storage addresses of the storage nodes, the private key signatures of the storage nodes and the public keys of the storage nodes;
sending the storage certificate to the user device to prompt the user device that the internet travel data has been stored.
In one possible embodiment, the method further comprises: the block-out node acquires the Internet travel data from a data pool, wherein the data pool comprises the Internet travel data verified by the storage nodes with the preset number;
and packaging the Internet travel data into a block uplink so that the user equipment can inquire the Internet travel data through the Internet travel data ID or the user ID.
In one possible embodiment, the internet travel data includes one or more of travel ticket reservation data, hotel reservation data for tourist attractions, and ticket reservation data for travel itineraries.
In one possible embodiment, the predetermined number is 3M +1, M ≧ 1, and M is an integer.
In one possible embodiment, the method further comprises: the block-out node receives an integral mortgage request of the user equipment;
distributing corresponding storage space permission to the user equipment according to the number of the points in the point mortgage request;
and sending the storage space authority to the user equipment, wherein the storage space authority is the storage space authority X storage time in unit time.
In one possible implementation, the block node receives an internet travel data storage request from a user device, and then further comprises:
the block output node checks the storage space authority of the user equipment;
and confirming that the storage space authority of the user equipment is more than or equal to the storage space authority required by the internet tourism data storage, and deducting the storage space authority required by the internet tourism data storage from the storage space authority of the user equipment.
In one possible implementation, the block node receives a credit mortgage request sent by the user equipment;
acquiring the storage permission of the residual space of the user equipment;
and sending the integral corresponding to the storage authority of the residual space to the user equipment.
In a possible implementation manner, a product of downtime rates of the storage nodes in the predetermined number of storage nodes is smaller than a preset downtime rate threshold value.
In one possible implementation, M ═ 1, i.e., 4 storage nodes, are common to the pragmatism byzantine algorithm (PBFT).
In one possible embodiment, the unit time is one day, one week or one month.
The second aspect of the application discloses a synchronous storage device of internet tourism data on a block chain, wherein a block chain system comprises a storage node and a block-out node, the block-out node is used for packaging the internet tourism data into a block chain, the storage node stores the internet tourism data through a local database, the method is applied to the block-out node, and the block-out node comprises a receiving unit, a processing unit and a sending unit; wherein,
the receiving unit receives an internet tourism data storage request sent by user equipment, wherein the internet tourism data comprises an internet tourism data ID, a user equipment private key signature and a user equipment public key;
the processing unit selects a preset number of storage nodes and sends the internet tourism data to the preset number of storage nodes, so that the preset number of storage nodes adopt a practical Byzantine algorithm to carry out consensus verification on the internet tourism data;
the receiving unit receives storage certificates sent by the storage nodes with the preset number, wherein the storage certificates comprise the internet tourism data which is verified, the storage addresses of the storage nodes, the private key signatures of the storage nodes and the public keys of the storage nodes;
the sending unit sends the storage certificate to the user equipment to prompt that the internet travel data of the user equipment is stored.
In one possible embodiment, the processing unit obtains the Internet travel data from a data pool that includes Internet travel data that has been validated by the predetermined number of storage nodes;
the processing unit packages the internet travel data into a block uplink so that the user equipment can query the internet travel data through the internet travel data ID or the user ID.
In one possible embodiment, the internet travel data includes one or more of travel ticket reservation data, hotel reservation data for tourist attractions, and ticket reservation data for travel itineraries.
In one possible embodiment, the predetermined number is 3M +1, M ≧ 1, and M is an integer.
In the application, a plurality of storage nodes in a block chain system can tell a user that travel data is stored by completing consensus verification on the travel data through PBFT; the block-out node only needs to pack the verified travel data into blocks and link the blocks; because the travel data is verified, the travel data is bound without initiating the consensus verification again by the block-out node; in addition, PBFT consensus verification is performed on a plurality of storage nodes, the speed is high, and DPoS consensus or PoW consensus is much faster; the user can directly receive the feedback that the travel data of the block chain system are stored, and the user experience is directly improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic diagram of a block chain system and a terminal device according to the present disclosure;
FIG. 2 is a flow chart illustrating a method for synchronously storing Internet travel data on a blockchain according to the present disclosure;
FIG. 3 is a schematic view of an Internet travel data synchronous storage device according to the present disclosure;
FIG. 4 is a block diagram illustrating a synchronous Internet travel data storage device according to the present disclosure.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "first" and "second" in this application are used for convenience of understanding only, and are not to be construed as sequential or limiting in any way.
For the purpose of facilitating understanding of the embodiments of the present invention, the following description will be further explained with reference to specific embodiments, which are not to be construed as limiting the embodiments of the present invention.
As shown in fig. 1, in the method for synchronously storing internet travel data in a blockchain, a blockchain system includes a storage node and a block-out node, the block-out node is used for packaging the internet travel data into a blockchain, and the storage node stores the internet travel data through a local database.
As shown in fig. 2, the method is applied to a block output node, and includes steps S201 to S204.
S201, receiving an Internet tourism data storage request sent by user equipment, wherein the Internet tourism data comprises an Internet tourism data ID, a user equipment private key signature and a user equipment public key.
S202, selecting a preset number of storage nodes, and sending the Internet tourism data to the preset number of storage nodes, so that the preset number of storage nodes adopt a practical Byzantine algorithm to perform consensus verification on the Internet tourism data.
In one example, the predetermined number is 3M +1, M ≧ 1, and M is an integer.
In one example, M ═ 1, i.e., 4 storage nodes, are common to the pragmatism byzantine algorithm (PBFT).
In this case, the smaller the number of storage nodes performing PBFT consensus, the shorter the time for performing consensus verification, and the shorter the time for returning the storage certificate to the user, the better the user experience. In addition, the travel data subjected to PBFT consensus verification does not need to be verified by the block-out node again, so that the time for verifying the block-out node is saved; meanwhile, the data are acquired from the data pool and packaged by the block-out node, so that the traveling data in the verified data pool can be linked up, namely, when the storage certificate is returned to the user, the internet traveling data is linked up.
In addition, the storage node will also store the validated travel data in a local database.
S203, receiving storage certificates sent by the storage nodes with the preset number, wherein the storage certificates comprise the Internet travel data which is verified, the storage addresses of the storage nodes, private key signatures of the storage nodes and public keys of the storage nodes.
S204, the storage certificate is sent to the user equipment to prompt that the Internet travel data of the user equipment is stored.
It should be noted that, in the present application, the travel data verified by the predetermined number of storage nodes is placed in the data pool, and the block output node directly obtains the verified travel data from the data pool, and links the data after packaging into blocks, which is short in time consumption; different from the prior art, after the block-out nodes are packed into blocks, the common identification check is needed, which consumes time. Not only is the user experience improved, but also the resource consumption of the block chain system is saved, and the performance of the block chain system can be improved.
In one example, the method further comprises: the block-out node acquires the Internet travel data from a data pool, wherein the data pool comprises the Internet travel data verified by the storage nodes with the preset number; and packaging the Internet travel data into a block uplink so that the user equipment can inquire the Internet travel data through the Internet travel data ID or the user ID.
In one example, the internet travel data includes one or more of travel ticket reservation data, hotel reservation data for tourist attractions, and ticket reservation data for travel itineraries.
In one example, the method further comprises: the block-out node receives an integral mortgage request of the user equipment; distributing corresponding storage space permission to the user equipment according to the number of the points in the point mortgage request; and sending the storage space authority to the user equipment, wherein the storage space authority is the storage space authority X storage time in unit time.
In one example, the chunking node receives an Internet travel data storage request from a user device and thereafter further comprises: the block output node checks the storage space authority of the user equipment; and confirming that the storage space authority of the user equipment is more than or equal to the storage space authority required by the internet tourism data storage, and deducting the storage space authority required by the internet tourism data storage from the storage space authority of the user equipment.
In one example, the product of the downtime rates of the storage nodes in the predetermined number of storage nodes is less than a preset downtime rate threshold value.
In one example, the unit time is one day, one week, or one month.
In one example, the method further comprises: the block-out node receives an integral mortgage-removing request sent by the user equipment; acquiring the storage permission of the residual space of the user equipment; and sending the integral corresponding to the storage authority of the residual space to the user equipment.
In the application, a plurality of storage nodes in a block chain system can tell a user that travel data is stored by completing consensus verification on the travel data through PBFT; the block-out node only needs to pack the verified travel data into blocks and link the blocks; because the travel data is verified, the travel data is bound without initiating the consensus verification again by the block-out node; in addition, PBFT consensus verification is performed on a plurality of storage nodes, the speed is high, and DPoS consensus or PoW consensus is much faster; the user can directly receive the feedback that the travel data of the block chain system are stored, and the user experience is directly improved.
As shown in fig. 4, the synchronous storage device for internet travel data on a blockchain, the blockchain system includes a storage node and a block-out node, the block-out node is used for packaging the internet travel data into a blockchain, the storage node stores the internet travel data through a local database, and the method is applied to the block-out node, and the block-out node includes a receiving unit, a processing unit and a transmitting unit.
The receiving unit receives an internet tourism data storage request sent by user equipment, wherein the internet tourism data comprises an internet tourism data ID, a user equipment private key signature and a user equipment public key;
the processing unit selects a preset number of storage nodes and sends the internet tourism data to the preset number of storage nodes, so that the preset number of storage nodes adopt a practical Byzantine algorithm to carry out consensus verification on the internet tourism data;
the receiving unit receives storage certificates sent by the storage nodes with the preset number, wherein the storage certificates comprise the internet tourism data which is verified, the storage addresses of the storage nodes, the private key signatures of the storage nodes and the public keys of the storage nodes;
the sending unit sends the storage certificate to the user equipment to prompt that the internet travel data of the user equipment is stored.
In one example, the processing unit obtains the Internet travel data from a data pool that includes Internet travel data that has been validated by the predetermined number of storage nodes; the processing unit packages the internet travel data into a block uplink so that the user equipment can query the internet travel data through the internet travel data ID or the user ID.
In one example, the internet travel data includes one or more of travel ticket reservation data, hotel reservation data for tourist attractions, and ticket reservation data for travel itineraries.
In one example, the predetermined number is 3M +1, M ≧ 1, and M is an integer.
It should be noted that, in the above device embodiments, the same or similar parts as those in the method embodiments may be referred to each other, and are not described in detail in the device embodiments.
In the application, a plurality of storage nodes in a block chain system can tell a user that travel data is stored by completing consensus verification on the travel data through PBFT; the block-out node only needs to pack the verified travel data into blocks and link the blocks; because the travel data is verified, the travel data is bound without initiating the consensus verification again by the block-out node; in addition, PBFT consensus verification is performed on a plurality of storage nodes, the speed is high, and DPoS consensus or PoW consensus is much faster; the user can directly receive the feedback that the travel data of the block chain system are stored, and the user experience is directly improved.
The application further discloses 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 of the above embodiments when executing the program.
The present application also discloses a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method of any of the above embodiments.
Fig. 3 shows a schematic diagram of a computer device, which may include: a processor 310, a memory 320, an input/output interface 330, a communication interface 340, and a bus 350. Wherein the processor 340, the memory 320, the input/output interface 330, and the communication interface 340 are communicatively coupled to each other within the device via a bus 350.
The processor 310 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 specification.
The Memory 320 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 320 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 320 and called to be executed by the processor 310.
The input/output interface 330 is used for connecting an input/output module to realize information input and output. 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 340 is used for connecting a communication module (not shown in the figure) to implement communication interaction between the present device and other devices. 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 350 includes a path that transfers information between the various components of the device, such as processor 310, memory 320, input/output interface 330, and communication interface 340.
It should be noted that although the above-mentioned device only shows the processor 310, the memory 320, the input/output interface 330, the communication interface 340 and the bus 350, 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.
Those of skill would further appreciate that the various illustrative components and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied in hardware, a software module executed by a processor, or a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are only illustrative of the present invention and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the scope of the present invention should be included in the scope of the present invention.

Claims (10)

1. The method for synchronously storing the internet tourism data on the block chain is characterized in that a block chain system comprises a storage node and a block outlet node, the block outlet node is used for packaging the internet tourism data into a block chain, the storage node stores the internet tourism data through a local database, and the method is applied to the block outlet node and comprises the following steps:
receiving an internet tourism data storage request sent by user equipment, wherein the internet tourism data comprises an internet tourism data ID, a user equipment private key signature and a user equipment public key;
selecting a preset number of storage nodes, and sending the internet tourism data to the preset number of storage nodes, so that the preset number of storage nodes adopt a practical Byzantine algorithm to perform consensus verification on the internet tourism data;
receiving storage certificates sent by the storage nodes with the preset number, wherein the storage certificates comprise the internet tourism data which is verified, the storage addresses of the storage nodes, the private key signatures of the storage nodes and the public keys of the storage nodes;
sending the storage certificate to the user device to prompt the user device that the internet travel data has been stored.
2. The method of claim 1, further comprising:
the block-out node acquires the Internet travel data from a data pool, wherein the data pool comprises the Internet travel data verified by the storage nodes with the preset number;
and packaging the Internet travel data into a block uplink so that the user equipment can inquire the Internet travel data through the Internet travel data ID or the user ID.
3. The method of claim 1, wherein the internet travel data includes one or more of travel ticket reservation data, hotel reservation data for tourist attractions, and ticket reservation data for travel itineraries.
4. The method of claim 1, wherein the predetermined number is 3M +1, M ≧ 1, and M is an integer.
5. The method of claim 1, further comprising:
the block-out node receives an integral mortgage request of the user equipment;
distributing corresponding storage space permission to the user equipment according to the number of the points in the point mortgage request;
and sending the storage space authority to the user equipment, wherein the storage space authority is the storage space authority X storage time in unit time.
6. The method of claim 5, wherein the chunking node receives an Internet travel data storage request from a user device, and thereafter further comprising:
the block output node checks the storage space authority of the user equipment;
and confirming that the storage space authority of the user equipment is more than or equal to the storage space authority required by the internet tourism data storage, and deducting the storage space authority required by the internet tourism data storage from the storage space authority of the user equipment.
7. The synchronous storage device of the internet tourism data on the block chain is characterized in that a block chain system comprises a storage node and a block outlet node, wherein the block outlet node is used for packaging the internet tourism data into a block chain, the storage node stores the internet tourism data through a local database, the method is applied to the block outlet node, and the block outlet node comprises a receiving unit, a processing unit and a sending unit; wherein,
the receiving unit receives an internet tourism data storage request sent by user equipment, wherein the internet tourism data comprises an internet tourism data ID, a user equipment private key signature and a user equipment public key;
the processing unit selects a preset number of storage nodes and sends the internet tourism data to the preset number of storage nodes, so that the preset number of storage nodes adopt a practical Byzantine algorithm to carry out consensus verification on the internet tourism data;
the receiving unit receives storage certificates sent by the storage nodes with the preset number, wherein the storage certificates comprise the internet tourism data which is verified, the storage addresses of the storage nodes, the private key signatures of the storage nodes and the public keys of the storage nodes;
the sending unit sends the storage certificate to the user equipment to prompt that the internet travel data of the user equipment is stored.
8. The apparatus of claim 7,
the processing unit obtains the internet travel data from a data pool, wherein the data pool comprises the internet travel data verified by the storage nodes with the preset number;
the processing unit packages the internet travel data into a block uplink so that the user equipment can query the internet travel data through the internet travel data ID or the user ID.
9. The apparatus of claim 7, wherein the internet travel data comprises one or more of travel ticket reservation data, hotel reservation data for tourist attractions, and ticket reservation data for travel itineraries.
10. The apparatus of claim 7, wherein the predetermined number is 3M +1, M ≧ 1, and M is an integer.
CN201911325770.2A 2019-12-20 2019-12-20 Synchronous storage method and device for internet tourism data on block chain Pending CN111831725A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911325770.2A CN111831725A (en) 2019-12-20 2019-12-20 Synchronous storage method and device for internet tourism data on block chain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911325770.2A CN111831725A (en) 2019-12-20 2019-12-20 Synchronous storage method and device for internet tourism data on block chain

Publications (1)

Publication Number Publication Date
CN111831725A true CN111831725A (en) 2020-10-27

Family

ID=72912758

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911325770.2A Pending CN111831725A (en) 2019-12-20 2019-12-20 Synchronous storage method and device for internet tourism data on block chain

Country Status (1)

Country Link
CN (1) CN111831725A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112766526A (en) * 2021-01-28 2021-05-07 重庆周游科技有限公司 Automatic packaging method for travel product scheme

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112766526A (en) * 2021-01-28 2021-05-07 重庆周游科技有限公司 Automatic packaging method for travel product scheme

Similar Documents

Publication Publication Date Title
CN111078715A (en) Synchronous storage method and device for internet advertisement data on block chain
CN110674218A (en) Company business license tracing method and device related to block chain
CN111831669A (en) Method and device for storing internet voting data according to block chain
CN111831725A (en) Synchronous storage method and device for internet tourism data on block chain
CN111831738A (en) Method and device for storing Internet recruitment data on block chain
CN110647768A (en) Passport deposit method and device based on block chain
CN111835815A (en) Synchronous storage method and device for internet self-media data on block chain
CN110445620A (en) The marriage certificate for being related to block chain deposits card method and device thereof
CN111125250A (en) Method and device for storing internet evaluation data on block chain
CN111831670A (en) Storage method and device related to internet comment data on block chain
CN111046048A (en) Method and device for storing Internet business license data on block chain
CN111125251A (en) Storage method and device for sharing economic data on block chain
CN111831724A (en) Synchronous storage method and device for internet search data on block chain
CN111833054A (en) Method and device for storing Internet e-commerce data on block chain
CN111831723A (en) Method and device for storing social data of internet on block chain
CN111831649A (en) Method and device for processing business license data on block chain
CN111078795A (en) Method and device for storing social data of internet on block chain
CN111833053A (en) Method and device for storing knowledge payment data on block chain
CN111078716A (en) Method and device for storing book data on block chain
CN111832076A (en) Method and device for processing identity card data on block chain
CN111831879A (en) Method and device for storing community data on block chain
CN111061751A (en) Synchronous storage method and device for internet research data on block chain
CN111831671A (en) Method and device for storing internet advertisement data on block chain
CN111831735A (en) Synchronous storage method and device for life service data on block chain
CN110992036A (en) Synchronous storage method and device for Internet e-commerce data on block chain

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20201027

WD01 Invention patent application deemed withdrawn after publication