Intelligent book design method and system for efficient query

Abstract

The invention discloses an intelligent book design method and system for efficient query, and relates to the technical field of book query and management, and the method comprises the specific steps: constructing a library node, a bookstore node, an individual user node and a management node based on a block chain technology, each node adopts a distributed account book to record book information and user reading information, the distributed account book synchronously records and stores data on each node, each node stores a complete account book copy, and the record of the account book copy comprises basic information of a book, a storage position of the book and reading information uploaded by a user. According to the intelligent book query and sharing system based on the block chain technology, the library node, the bookstore node and the individual user node are incorporated into a unified network architecture, so that the book information can be seamlessly shared and circulated among different nodes, and the user is no longer limited to the resource of a single node.

Description

Technical Field

[0001] The present invention relates to the technical field of book query and management, and in particular to an intelligent design method and system for efficient book query. Background Art

[0002] In today's era of information explosion, books, as an important carrier of knowledge, are showing an unprecedented growth in quantity and variety. Whether it is academic research, personal learning or cultural entertainment, people's demand for books is becoming increasingly diversified. However, with the continuous enrichment of book resources, how to efficiently query and manage these books has become an urgent problem to be solved. Traditional book query and management methods mainly rely on the library's collection system and the bookstore's sales system. These systems have met people's basic needs for books to a certain extent, but with the development of Internet technology and the continuous improvement of user needs, their limitations have become increasingly prominent.

[0003] At present, the existing book search system is isolated, and there is a lack of effective information sharing mechanism between libraries, bookstores and other book resource holders, resulting in users often only being able to obtain results within a limited range when searching for books. In addition, the traditional search method is mainly based on keyword matching, searching the database according to the keywords entered by the user, and returning relevant book results. This method often cannot accurately understand the user's query intention, resulting in a large number of irrelevant or low-relevance books in the returned results. Summary of the invention

[0004] The purpose of the present invention is to make up for the shortcomings of the prior art and provide a method and system for intelligent design of books with efficient query. It can realize global interconnection and rapid query of book information by constructing a distributed book database based on blockchain technology. At the same time, the method also records user reading information and provides an effective recording and sharing mechanism. In the implementation of the consensus algorithm, a distributed consensus mechanism based on weights and credit scores is adopted to improve the consensus efficiency and data synchronization speed.

[0005] In order to solve the above technical problems, the present invention provides the following technical solutions: On the one hand, a method for intelligent design of books for efficient query, the specific steps of the method are:

[0006] S100, builds library nodes, bookstore nodes, personal user nodes and management nodes based on blockchain technology. Each node uses a distributed ledger to record book information and user reading information.

[0007] The distributed ledger records and stores data synchronously on each node. Each node stores a complete copy of the ledger. The copy records basic information about the book, the storage location of the book, and the reading information uploaded by the user. The nodes use a consensus algorithm to ensure data synchronization and consistency. When new data is written, it can only be added to the ledger after verification and confirmation by the management node.

[0008] For uploading and storing basic information of books in library nodes and bookstore nodes, metadata is obtained by scanning the ISBN code of the book, and then uploaded to the blockchain network after encryption;

[0009] For individual users in the individual user node who manually input book information and additional information through the mobile application and web interface, the information is encrypted and uploaded after authorization;

[0010] S200, when implementing data query, the user enters query keywords through the query interface, sends the keywords to the corresponding local node, and integrates and filters the results after receiving them. The specific steps of S200 are:

[0011] S201, a user inputs a query keyword through a query interface, and the query interface sends the keyword input by the user to a corresponding local node;

[0012] S202, after receiving the query request, the local node performs a preliminary search in the locally stored copy of the ledger. The search algorithm matches the book information recorded in the ledger according to the keywords to find the book record. The matching methods include exact matching and fuzzy matching.

[0013] S203, for book records that meet the conditions found in the local ledger copy, the local node screens, sorts and sorts the results, and returns the sorted results to the user's query interface for display;

[0014] S204, if the local node does not find relevant records in the local ledger copy, it sends a query request to other nodes through the P2P communication protocol of the blockchain network, and the request message includes query keywords and query parameters;

[0015] S205, after receiving the query request, other nodes search in the corresponding ledger and use the corresponding search algorithm and matching method to find the book record;

[0016] S206, returning the search result to the local node that initiated the request, the returned result including the basic information, storage location and reading mark of the book;

[0017] S207, after receiving the query results from other nodes, the local node integrates all the results and displays the final sorted results on the user's query interface;

[0018] S300 records the reading annotations written by users and sets sharing. After encryption, it is associated with the book information. Other users need to authorize and decrypt to obtain it. A book review and discussion area is set up. The comments and discussion content are recorded in blockchain transactions and ranked and recommended according to user interaction behavior.

[0019] Furthermore, the consensus algorithm in S100 organizes the data into data blocks M when new book information and user reading information are added to the account book by the library node, bookstore node and individual user node. i , and calculate its hash value H(M i ), node i will M i and H(M i ) is broadcast to other nodes in the network, and other nodes j (j≠i) receive M broadcast by node i i and H(M i After that, according to the local current state S j (t) for M i Perform data verification and calculate the verification result V j (M i ,t), for verification through V j (M i ,t)=1, then node j sends a confirmation message to node i, and the data verification includes data format verification F format , Data integrity verification F integrity 、Rules compliance verification F rule , the verification result V j (M i ,t) represents the data block M proposed by node j to node i i The verification result after data verification within time t is V j (M i ,t)=F format ×F integrity ×F rule , when the format of the data block is correct and the data is complete, V j (M i ,t) is verified, that is, V j (M i ,t)=1.

[0020] Furthermore, when new data is written in S100, node i collects confirmation messages from other nodes, counts the number of confirmed nodes n, and calculates the consensus weight Where N is the number of nodes, W j (t) represents the weight of node j at time t, which is used to measure the importance of each node in the consensus process. The consensus threshold T is defined. When CW(t) ≥ T, the data block Mi A consensus is reached, and the data block M that reaches consensus i It will be added to the ledger of each node, and the node will update its local copy of the ledger and update the timestamp to t+1.

[0021] Furthermore, after the local node receives the query request, the S202 search algorithm performs a preliminary search in the locally stored copy of the account book. The search algorithm performs an accurate match based on the keywords and the book information recorded in the account book to find the book record. The specific steps of the search algorithm and accurate matching are:

[0022] The query keyword K input by the user is segmented and standardized to generate a keyword list K = {k 1 ,k 2 ,…,k m};

[0023] The information B of each book contains multiple fields, represented by B = {b 1 ,b 2 ,…,b n}, where each b j is a field, for each field b j Perform word segmentation and standardization to generate field vocabulary list b j ={w j1 ,w j2 ,…,w jp};

[0024] Calculate each keyword k i The matching degree S(k i ,B) is: Where: f(w jp ) represents the word w jp In field b j The frequency in, f(w q ) represents the word w q The frequency of occurrence in all fields, w jp is the field b in book information B j The words in the vocabulary list obtained after word segmentation and standardization, P j Indicates field b j The number of words in the field, Q represents the total number of words in all fields, TF-IDF(w jp ) represents the word w jp The term frequency-inverse document frequency value of TF(w jp ) represents the word w jp In field b j The word frequency in the blockchain network, N represents the total number of nodes in the blockchain network, DF(wjp ) represents the word w jp In how many different books does it appear?

[0025] Calculate the comprehensive matching degree S(K,B) between the entire keyword list K and book B. The comprehensive matching degree S(K,B) is:

[0026] All matched books are sorted according to the comprehensive matching degree S(K,B), and the sorted results are returned to the user's query interface for display.

[0027] Furthermore, the S202 uses a fuzzy matching algorithm to search for approximately matching books, and the fuzzy matching score F(k i ,w jp ) through the edit distance: Where: Lbjjl(k i ,w jp ) means k i Convert to w jp The minimum number of edit operations required, |k i and |w j p|represents k i and w j The length of p.

[0028] Furthermore, the P2P communication protocol in S204 allows direct communication and data exchange between nodes. When the local node fails to retrieve the book information in the local account book copy, it sends a query request to other nodes through the P2P communication protocol. After receiving the request, the other nodes search in the corresponding account book and return the result to the local node that initiated the request. The local node then integrates and filters the multiple results received.

[0029] Furthermore, the management node monitors the online status, operating performance and network connection of the library node, bookstore node and personal user node in real time, obtains the operating data of the node by maintaining communication and data exchange with each node, and if the node operating data is abnormal, it determines that the node is faulty and offline, and issues an alarm to notify the administrator.

[0030] On the other hand, an efficient query book intelligent design system, the components of which include: a block node module, a data upload module, a data query module, a blockchain network module and a management module;

[0031] The block node module includes library nodes, bookstore nodes, individual user nodes and management nodes, each of which has a corresponding distributed ledger to store, process and transmit data;

[0032] The data upload module uploads the basic information and reading annotations of the book through each node, uploads it to the blockchain network, and stores it in the corresponding account book copy;

[0033] When a user in the data query module queries book information by inputting a book keyword, the keyword is sent to the local node, and the local node performs a preliminary search in the locally stored copy of the ledger, and then returns the result to the user. If there is no data information in the copy, the keyword is transmitted to the blockchain network module;

[0034] The local node of the blockchain network module sends a query request to other nodes through the P2P communication protocol of the blockchain network, searches in its corresponding ledger, and returns the result to the node that initiated the request;

[0035] In the management module, the administrator allocates resources to each node, coordinates and synchronizes inventory information through the management node, and reviews the reading annotation data uploaded by the individual user node.

[0036] Compared with the prior art, the intelligent design method and system for efficient book search has the following beneficial effects:

[0037] 1. The present invention constructs a book intelligent query and sharing system based on blockchain technology, incorporates library nodes, bookstore nodes and personal user nodes into a unified network architecture, so that book information can be seamlessly shared and circulated between different nodes. Users are no longer limited to the resources of a single node, which broadens the channels for obtaining book resources and improves the utilization rate of resources.

[0038] 2. The present invention utilizes blockchain technology to integrate book information from different nodes into a distributed ledger. When users conduct inquiries, they can search data from multiple nodes at the same time, which greatly expands the scope of inquiries. It adopts an indexing mechanism and search algorithm, which can quickly respond to user query requests and return highly relevant results. This distributed architecture not only breaks the information island, but also improves the consistency and reliability of data, ensuring that users can obtain the latest and most comprehensive book information.

[0039] Other advantages, objectives and features of the present invention will be set forth in part in the following description and, in part, will be apparent to those skilled in the art based on an examination of the following or may be taught from the practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the prior art descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0041] Figure 1 A flowchart for an intelligent design method for efficient book query;

[0042] Figure 2 A module composition diagram for an efficient book query intelligent design system. DETAILED DESCRIPTION

[0043] The technical solutions in the embodiments of the present invention are described clearly and completely below. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0044] Embodiment 1

[0045] This embodiment describes in detail how to enter book data in the book intelligent design system based on blockchain technology. Through the joint participation of library nodes, bookstore nodes and individual user nodes, comprehensive, accurate and efficient entry of book information is achieved. The distributed ledger technology of blockchain is used to ensure the security and traceability of book data.

[0046] In the specific implementation, when entering the library node data, the library staff ensures that the scanning device is normally connected to the book intelligent design system of the library node, and scans the ISBN code of the book. After the scanning device reads the ISBN code, it obtains the metadata of the book, including the title, author, publisher, publication year, edition, number of pages, ISBN code, binding, and series information. The collected metadata and manually supplemented data are sorted to ensure the standardization and consistency of the data. The system encrypts and preliminarily verifies the sorted data, including data format verification F format , check whether the data meets the format requirements, that is, check whether the book title is a string type and the data format is correct, F format =1; otherwise, F format =0; then perform data integrity verification F integrity , ensure that all required metadata fields exist, that is, the key information of the title, author and publisher is not empty, and the data is complete, F integrity =1; otherwise, F integrity =0; rule meets verification F rule, check the data ISBN code verification, book classification, data compliance rules, F rule =1; otherwise, F rule =0, according to the formula V j (M i ,t)=F format ×F integrity ×F rule Calculate and verify the result V j (M i ,t)(j represents the verification node, i represents the upload node, and t represents time), when V j (M i ,t)=1, it means the verification is passed; when V j (M i When t0=0, it means verification failed. For data that failed verification, the system will notify the library node to recheck and upload the data. After the data is successfully uploaded and verified, a copy of the data is stored locally in the library node to facilitate local query and management. At the same time, the data is recorded in the distributed ledger. Each node will save a complete copy of the ledger to achieve redundant backup of the data. The management node regularly inspects the data uploaded by the library node to check the consistency and accuracy of the data. By comparing the data of the same books on different nodes, it ensures that the data has not been tampered with and inconsistent.

[0047] Then, when entering the bookstore node data, the bookstore user uses a scanning device to scan the ISBN code of the book to obtain the basic metadata of the book and the inventory information inside the bookstore. All the collected data are integrated, arranged and uploaded in the format specified by the system to ensure the accuracy and completeness of the data. The system verifies the uploaded encrypted data and performs the same data format verification as the library node data verification F format , Data integrity verification F integrity And the rules meet the verification F rule Steps, according to formula V j (M i ,t)=F format ×F integrity ×F rule Calculate and verify the result V j (M i ,t), if the verification passes (V j (M i ,t)=1), the system sends a confirmation message to the bookstore node; if the verification fails (V j (M i,t)=0), the bookstore node is notified to recheck and upload the data. The successfully uploaded data is stored locally in the bookstore node to facilitate local inventory management and query. At the same time, the data is recorded in the distributed ledger to achieve distributed storage and backup of data. The management node regularly manages the data of the bookstore node, including data backup, archiving and monitoring of inventory data changes.

[0048] Subsequently, when entering data for individual user nodes, the user opens the book entry function interface of the application or web page, and the user manually enters the information of the books he owns, including the book title, author, publisher, publication year, purchase channel, purchase time, and basic information of the book status. The user can choose to upload photos of the book to provide more intuitive book information. The system will automatically process and compress the photos to meet the storage and transmission requirements, organize the information entered by the user and the uploaded photos and other data, and combine them in the format specified by the system to form a data structure to be uploaded, and encrypt and verify the uploaded data. The verification process is the same as that of the library node and bookstore node. After the data is successfully uploaded, a copy of the data will be stored locally on the user's device to facilitate the user to view the book information uploaded by the user. At the same time, the data is recorded in the distributed ledger to realize distributed storage and sharing of data. The management node manages the data uploaded by the individual user node, including reviewing whether the book information uploaded by the user is true and valid, managing and supervising the user's sharing permissions, and ensuring the security and compliance sharing of user data.

[0049] Finally, the management node receives data uploaded from library nodes, bookstore nodes and individual user nodes in real time. For a large amount of book data uploaded by library and bookstore nodes, the management node will conduct sampling audits to check the accuracy and completeness of the data; for data uploaded by individual users, the management node will pay more attention to the audit of its authenticity to prevent users from uploading false and infringing book information, and supervise the data upload behavior of each node. If it is found that the node frequently uploads wrong data, the management node will issue a warning to notify the node administrator to make rectifications. The management node is responsible for planning the data storage architecture of the entire system and determining the storage method and location distribution of data in the distributed ledger. According to the type and frequency of use of data, storage resources are reasonably allocated to improve data access efficiency, formulate and implement data backup strategies, and regularly back up data in the distributed ledger. The management node is responsible for handling data synchronization issues between nodes to ensure that the data of each node can be quickly synchronized to the latest status. Through communication and data comparison with each node, the synchronization and integrity of the data of the entire system are guaranteed.

[0050] To sum up, in this embodiment, the complete process of library nodes, bookstore nodes, and personal user nodes when entering book data, as well as the comprehensive management and processing process of the management node on the entered data are described in detail. Through the collaborative work of each node and the effective supervision of the management node, the full life cycle management of book data from collection, encryption, uploading to verification, storage, management and security assurance is realized, ensuring the stable operation of the system.

[0051] Embodiment 2

[0052] This embodiment describes in detail the entire process of searching for book data in a book intelligent design system based on blockchain technology, starting from the user initiating a query, going through the links of local node search, cross-node search, result integration and display, and user feedback and interaction, searching for book records through precise matching and fuzzy matching algorithms, and using P2P communication protocols to achieve data exchange between nodes, ultimately presenting users with accurate and demand-compliant search results, and providing interactive functions to enhance user experience and knowledge exchange.

[0053] First, the user launches the application of the book intelligent query system on the personal device and accesses the corresponding web query interface, and enters the query keyword. The user enters the query keyword in the input box of the query interface, and the user further sets the query conditions according to his or her needs to narrow the search scope and improve the accuracy of the query. After the user completes the keyword input and query condition setting, the system will obtain the keywords entered by the user and the set query conditions, and give priority to local node retrieval. The local node pre-processes the query keyword entered by the user, splits the keywords into individual words, standardizes the words, removes stop words, and converts the words into a unified format to improve the accuracy of subsequent matching.

[0054] Then, the local node performs a preliminary search in the locally stored copy of the ledger, uses the search algorithm for precise matching, and for each book’s information B, performs word segmentation and standardization on each field, generates a field vocabulary list, and calculates the value of each keyword k. i The matching degree S(k i ,B), according to the formula Where f(w jp ) represents the word w j p in field b j The frequency in P j Indicates field b j The number of words in the field, Q represents the total number of words in all fields, TF-IDF(w jp ) represents the word w jp The term frequency inverse document frequency value and TF(w jp ) represents the word w jpIn field b j The word frequency in the blockchain network, N represents the total number of nodes in the blockchain network, DF(w jp ) represents the word w jp In how many different books does it appear? Calculate the comprehensive matching degree between the entire keyword list K and book B. Sort all the books in the local ledger copy according to the comprehensive matching degree S(K,B), and put the books with high matching degree in front. If the exact matching does not find enough or satisfactory results, the local node starts the fuzzy matching algorithm for further search and calculates the fuzzy matching score. Where Lbjjl(k i ,w jp ) means k i Convert to w jp The minimum number of edit operations required, |k i | and |w j p|represents k i and w j The length of the keyword is determined by fuzzy matching, and books that are approximately matched with the keyword are found to expand the search scope and increase the possibility of finding relevant books. The local node filters the search results according to the query conditions set by the user, removes books that do not meet the conditions, organizes the filtered results, and extracts the key information of the books to display to the user.

[0055] Subsequently, if the local node still fails to find book records that meet the user's query requirements after precise matching and fuzzy matching, or the number of results found is less than the threshold set by the system, the local node decides to start a cross-node search. The local node constructs a cross-node query request message, which contains the query keywords entered by the user, the set query conditions, and the identification of the local node. The local node uses the P2P communication protocol of the blockchain network to broadcast the query request message to other nodes (including library nodes, bookstore nodes, and other personal user nodes). The P2P communication protocol allows nodes to communicate and exchange data directly without the need for transit through a central server. After receiving the query request message, other nodes search in their own copies of the ledger. The search process is the same as the search process of the local node. The process is the same, including keyword preprocessing, exact match search, fuzzy match search, and result screening and sorting. Other nodes return the searched book results (including basic book information, storage location, and reading annotations) to the local node that initiated the request through the P2P communication protocol. The returned result format is consistent with the result format sorted by the local node, so that the local node can perform subsequent integration operations. The local node receives the search results from other nodes, merges them with the results obtained from the local search to form a complete search result set, integrates the merged result set, and removes duplicate book records. Since different nodes store the same book information, it is necessary to identify and remove duplicate items by comparing the book ISBN codes during the integration process to ensure that the results obtained by the user are accurate.

[0056] Next, the management node sorts the integrated data information, and the sorted results are displayed on the user's query interface. The displayed content includes the book cover image, title, author, publisher, publication year, brief introduction and acquisition method. Users click on each book entry to view more detailed information.

[0057] Finally, the user views the displayed search results, evaluates the results according to his or her own needs and expectations, and provides feedback on the accuracy and completeness of the search results. The system collects user feedback, analyzes the user's intention based on the results marked as "irrelevant", and adjusts the subsequent search strategy and algorithm parameters. For books marked as "interesting", the system records the user's interest preferences so that such books or books on related topics are given priority in subsequent search recommendations. At the same time, based on the user's feedback on unfound books, the system further expands the search scope or improves the search algorithm to improve the comprehensiveness and accuracy of the search. Users can view other Users can annotate their readings and review books, and can write their own book reviews and reading experiences, and share their views and experiences with other users. The content written by users is encrypted and associated with the book information and stored on the blockchain. Other users need authorization and decryption to view it. Users can like, comment on or share other users' book reviews, forming an active reading community. Through this interaction, users can gain different reading perspectives and insights, deepen their understanding of books, and also promote the exchange and sharing of knowledge. The system will sort and recommend book reviews based on the user's interactive behavior, and display high-quality and popular book reviews in a more prominent position, so that users can quickly discover valuable content.

[0058] To sum up, in this embodiment, the complete process of users searching for book data in the book intelligent query system based on blockchain technology is demonstrated in detail, the book records are found by using the precise matching and fuzzy matching algorithms, and the data exchange between nodes is realized with the help of the P2P communication protocol. After the results are integrated and displayed, the user is finally provided with accurate, comprehensive and demand-compliant book search results. The entire search process fully reflects the advantages of blockchain technology in distributed data query, breaks the information island, realizes the integration and efficient use of multi-node data, and provides users with convenient and intelligent book query services.

[0059] It will be apparent to those skilled in the art that the invention is not limited to the details of the exemplary embodiments described above and that the invention can be implemented in other specific forms without departing from the spirit or essential features of the invention. Therefore, the embodiments should be considered exemplary and non-limiting in all respects, and the scope of the invention is defined by the appended claims rather than the foregoing description, and it is intended that all variations falling within the meaning and scope of the equivalent elements of the claims be included in the invention. Any reference numeral in a claim should not be considered as limiting the claim to which it relates.

Claims

1. An intelligent design method for efficient book query, characterized in that: The specific steps of this method are: S100, builds library nodes, bookstore nodes, personal user nodes and management nodes based on blockchain technology. Each node uses a distributed ledger to record book information and user reading information. The distributed ledger records and stores data synchronously on each node. Each node stores a complete copy of the ledger. The copy records basic information about the book, the storage location of the book, and the reading information uploaded by the user. The nodes use a consensus algorithm to ensure data synchronization and consistency. When new data is written, it can only be added to the ledger after verification and confirmation by the management node. For uploading and storing basic information of books in library nodes and bookstore nodes, metadata is obtained by scanning the ISBN code of the book, and then uploaded to the blockchain network after encryption; For individual users in the individual user node who manually input book information and additional information through the mobile application and web interface, they are encrypted and uploaded after authorization; S200, when implementing data query, the user enters query keywords through the query interface, sends the keywords to the corresponding local node, and integrates and filters the results after receiving them. The specific steps of S200 are: S201, a user inputs a query keyword through a query interface, and the query interface sends the keyword input by the user to a corresponding local node; S202, after receiving the query request, the local node performs a preliminary search in the locally stored copy of the ledger. The search algorithm matches the book information recorded in the ledger according to the keywords to find the book record. The matching methods include exact matching and fuzzy matching. S203, for book records that meet the conditions found in the local ledger copy, the local node screens, sorts and sorts the results, and returns the sorted results to the user's query interface for display; S204, if the local node does not find relevant records in the local ledger copy, it sends a query request to other nodes through the P2P communication protocol of the blockchain network, and the request message includes query keywords and query parameters; S205, after receiving the query request, other nodes search in the corresponding ledger and use the corresponding search algorithm and matching method to find the book record; S206, returning the search result to the local node that initiated the request, the returned result including the basic information, storage location and reading mark of the book; S207, after receiving the query results from other nodes, the local node integrates all the results and displays the final sorted results on the user's query interface; S300 records the reading annotations written by users and sets sharing. After encryption, it is associated with the book information. Other users need to authorize and decrypt to obtain it. A book review and discussion area is set up. The comments and discussion content are recorded in blockchain transactions and ranked and recommended according to user interaction behavior.

2. The intelligent design method for efficient book search according to claim 1 is characterized in that: The consensus algorithm in S100 organizes the data into data blocks M when new book information and user reading information are added to the account book by the library node, bookstore node and individual user node. i , and calculate its hash value H(M i ), node i will M i and H(M i ) is broadcast to other nodes in the network, and other nodes j (j≠i) receive M broadcast by node i i and H(M i ) and then, according to the local current state S j (t) for M i Perform data verification and calculate the verification result V j (M i ,t0, for verification through V j (M i ,t)=1, then node j sends a confirmation message to node i, and the data verification includes data format verification F format , Data integrity verification F integrity 、Rules compliance verification F rule , the verification result V j (M i ,t) represents the data block M proposed by node j to node i i The verification result after data verification within time t is V j (M i ,t)=F format ×F integrity ×F rule , when the format of the data block is correct and the data is complete, V j (M i ,t) is verified, that is, V j (M i ,t)=1.

3. The intelligent design method for efficient book search according to claim 2 is characterized in that: When new data is written in S100, node i collects confirmation messages from other nodes, counts the number of confirmed nodes n, and calculates the consensus weight Where N is the number of nodes, W j ( t ) Represents the weight of node j at time t, which is used to measure the importance of each node in the consensus process. The consensus threshold T is defined. When CW(t) ≥ T, the data block M i A consensus is reached, and the data block M that reaches consensus i It will be added to the ledger of each node, and the node will update its local copy of the ledger and update the timestamp to t+1.

4. The intelligent design method for efficient book search according to claim 1 is characterized in that: After the local node receives the query request, the search algorithm in S202 performs a preliminary search in the locally stored copy of the account book. The search algorithm performs an accurate match based on the keywords and the book information recorded in the account book to find the book record. The specific steps of the search algorithm and accurate matching are as follows: The query keyword K input by the user is segmented and standardized to generate a keyword list K = {k1, k2, ..., k m }; The information B of each book contains multiple fields, represented as B = {b1, b2, ..., b n }, where each b j is a field, for each field b j Perform word segmentation and standardization to generate field vocabulary list b j ={w j1 ,w j2 ,…,w jp }; Calculate each keyword k i The matching degree S(k i ,B) is: Where: f(w jp ) represents the word w jp In field b j The frequency in, f(w q ) represents the word w q The frequency of occurrence in all fields, w jp is the field b in book information B j The words in the vocabulary list obtained after word segmentation and standardization, P j Indicates field b j The number of words in the field, Q represents the total number of words in all fields, TF-IDF(w jp ) represents the word w jp The term frequency-inverse document frequency value of TF(w jp ) represents the word w jp In field b j The word frequency in the blockchain network, N represents the total number of nodes in the blockchain network, DF(w jp ) represents the word w jp In how many different books does it appear? Calculate the comprehensive matching degree S(K,B) between the entire keyword list K and book B. The comprehensive matching degree S(K,B) is: All matched book data are sorted according to the comprehensive matching degree S(K, B), and the sorted results are returned to the user's query interface for display.

5. The intelligent design method for efficient book search according to claim 1 is characterized in that: S202 uses a fuzzy matching algorithm to find approximately matching books, and the fuzzy matching score F(k i ,w jp ) through the edit distance: Where: Lbjjl(k i ,w jp ) means k i Convert to w jp The minimum number of edit operations required, | k i and |w j p|represents k i and w j The length of p.

6. The intelligent design method for efficient book search according to claim 1, characterized in that: The P2P communication protocol in S204 allows direct communication and data exchange between nodes. When the local node fails to retrieve book information in the local account book copy, it sends a query request to other nodes through the P2P communication protocol. After receiving the request, the other nodes search in the corresponding account book and return the result to the local node that initiated the request. The local node then integrates and filters the multiple results received.

7. The intelligent design method for efficient book search according to claim 1, characterized in that: The management node monitors the online status, operating performance and network connection of library nodes, bookstore nodes and personal user nodes in real time, obtains the operating data of the nodes by maintaining communication and data exchange with each node, and if the node operating data is abnormal, it determines that the node is faulty and offline, and issues an alarm to notify the administrator.

8. An efficient query book intelligent design system, characterized in that: The system consists of: block node module, data upload module, data query module, blockchain network module and management module; The block node module includes library nodes, bookstore nodes, individual user nodes and management nodes, each of which has a corresponding distributed ledger to store, process and transmit data; The data upload module uploads the basic information and reading annotations of the book through each node, uploads it to the blockchain network, and stores it in the corresponding account book copy; When a user in the data query module queries book information by inputting a book keyword, the keyword is sent to the local node, and the local node performs a preliminary search in the locally stored copy of the ledger, and then returns the result to the user. If there is no data information in the copy, the keyword is transmitted to the blockchain network module; The local node of the blockchain network module sends a query request to other nodes through the P2P communication protocol of the blockchain network, searches in its corresponding ledger, and returns the result to the node that initiated the request; In the management module, the administrator allocates resources to each node, coordinates and synchronizes inventory information through the management node, and reviews the reading annotation data uploaded by the individual user node.

Images