Construction method and system of folk song inheritance atlas

By collecting folk song lyrics data, dividing relationship hierarchy and constructing triple data, the problem of scattered information in the folk song inheritance map is solved, and the clear display of folk song relationships and data efficiency is achieved.

CN119539062AInactive Publication Date: 2025-02-28XICHANG COLLEGE

Patent Information

Application Number
CN202510095635.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-01-22
Publication Date
2025-02-28
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

The existing folk song heritage map construction methods have problems of scattered information and incomplete preservation, and it is difficult to effectively display the relationship and inheritance paths between folk songs.

Method used

By collecting the text data of folk songs lyrics, dividing the relationship hierarchy, converting it into triple data and storing it into a database, building a folk song sample tree, and improving query efficiency by optimizing the tree structure.

Benefits of technology

It realizes the systematic and standardization of the folk song inheritance map, clearly displays the relationship between folk songs, facilitates data mining and analysis, and improves the efficiency of data inheritance and utilization.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119539062A_ABST
    Figure CN119539062A_ABST
Patent Text Reader

Abstract

The invention discloses a method and a system for constructing a folk song inheritance atlas. The method comprises the following steps: acquiring lyric song text data of a folk song sample; dividing the subordinate relationship hierarchical structure of the folk song according to the text description; on the basis of the divided subordinate relationship hierarchical structure of the folk songs, representing the folk song samples as triads, and storing the triads into a database; generating a civil song sample tree based on the obtained civil song sample triple data; based on nodes with non-final knowledge in the civil song sample tree, performing reforming construction on the civil song sample tree to obtain a complete civil song sample tree; the method for constructing the civil song inheritance atlas based on the triple has the advantages that the civil song sample tree is constructed and the query efficiency is optimized through the digitalized and structured data model, and the systematic storage and inheritance efficiency of civil songs is effectively improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to a graph construction technology, and in particular to a method and system for constructing a folk song inheritance graph. Background Art

[0002] A method and system for constructing a folk song inheritance atlas collects folk song sample data and analyzes and divides the hierarchical structure of folk song relationships based on the information contained in these text data. For example, folk songs can be classified and archived based on factors such as region, style, and historical period. Then, each folk song is converted into a triple form, and these triple data are stored in a database. Based on the triple data, a folk song sample tree is constructed to present the hierarchical relationship and propagation path between folk songs. However, since there may be some non-final nodes in the sample tree, the tree is reorganized and optimized. By querying each node in the folk song sample tree and analyzing its average query time complexity, the tree structure is further optimized to improve query efficiency.

[0003] The current methods for constructing folk song inheritance maps on the market mainly rely on digital technology and multidisciplinary research methods. Through multi-dimensional analysis of folk song composition, lyrics, singing style, etc., combined with traditional music theory and modern computer science methods, a multi-level data model of folk songs is constructed. These models not only cover the geographical distribution and inheritance chain of folk songs, but also analyze the similarities and development context of different folk songs through algorithms. In addition, the construction of folk song inheritance maps also relies on cross-border cooperation in disciplines such as sociology and anthropology, combining field surveys and oral history to explore the social and cultural background and inheritance methods of folk songs. Finally, these data are displayed in a centralized manner through online platforms or databases for scholars, enthusiasts and related cultural institutions to conduct research and inheritance. Summary of the invention

[0004] In order to improve the existing method of constructing folk song inheritance maps, a method and system for constructing folk song inheritance maps are provided. The method collects folk song lyrics text data, divides its relationship hierarchy according to the text description, converts it into triples and stores it in the database, constructs a folk song sample tree, and then optimizes the query efficiency of the sample tree, reorganizes and improves the map structure to improve the inheritance and utilization efficiency of the data.

[0005] In order to achieve the above purpose, the technical solution adopted by the present invention is: A method for constructing a folk song inheritance atlas, comprising: Obtain lyrics song text data of folk song samples; Based on the obtained folk song sample text data, the folk songs are divided into hierarchical structures according to the text descriptions; Based on the hierarchical structure of the folk songs, the folk song samples are represented as triples and stored in the database. Based on the obtained folk song sample triple data, a folk song sample tree is generated; Based on the nodes with non-final knowledge in the folk song sample tree, the folk song sample tree is reorganized and constructed to obtain a complete folk song sample tree; Based on the obtained folk song sample tree, the average time complexity of querying the data of each node therein is obtained, and the folk song sample tree is optimized.

[0006] Preferably, the method of dividing the folk song belonging relationship hierarchy structure according to the text description based on the obtained folk song sample text data specifically includes: The belonging relationship hierarchy structure includes: a first relationship level, a second relationship level, ..., a last relationship level; Based on the name of the relationship level to which the folk song sample belongs, the name of the first relationship level is used as the first attribute of the folk song sample, the name of the second relationship level is used as the second attribute of the folk song sample, and so on.

[0007] Preferably, the folk song samples are represented as triples based on the divided folk song belonging relationship hierarchy, and stored in the database specifically includes: Based on the obtained folk song sample data, it is represented as a triple (x, y, z); The obtained triplet (x, y, z) of the folk song resource sample is uploaded to the database, and each triplet (x, y, z) of the folk song resource sample is a record.

[0008] Preferably, the folk song sample data obtained is expressed as a triple (x, y, z) and specifically includes: x is the subject of the folk song sample, which is composed of the attributes of the folk song sample; y is the relationship property between the subject x and the attribute value z of the folk song resource sample. The relationship property y is divided into: inclusion, equality; z is the attribute value of the folk song sample, which has two types: one is final knowledge and the other is non-final knowledge. The type of the attribute value z is determined by the last attribute in the subject x; The last attribute in subject x is: track, alias, performer, definition, indicating that the attribute value z is final knowledge; the last attribute in subject x is: type, classification, indicating that the attribute value z is non-final knowledge.

[0009] Preferably, the step of generating a folk song sample tree based on the acquired folk song sample triple data specifically includes: The folk song sample tree includes: main root O, branch point set B, subtree, where the branch point set is ,in, is the jth attribute of the folk song sample subject; Based on the stored triple records, a triple record represents a subtree, the first attribute m of the subject x in the triple record; like , then the attribute m is equal to a branch point in the branch point set B, and the subtree represented by the triple record is transferred to the branch point equal to the attribute m; like , then transfer the subtree represented by the triple record to the main root O of the knowledge tree, and add the attribute m to the branch point set B.

[0010] Preferably, the reorganizing and constructing the folk song sample tree based on the nodes with non-final knowledge in the folk song sample tree to obtain a complete folk song sample tree specifically includes: Based on the last attribute of subject x being type or classification, add attribute value z to branch point set B; When the attribute value z is the same as a branch point in the branch point set B, the folk song sample tree structure is reorganized, the subtree with the branch point as the root is separated from the original tree, and transferred to the subtree with the attribute value z as the root; Based on the above steps, the time complexity of constructing the folk song sample tree is obtained , the formula is:

[0011] Among them, n represents the size of the data. The complexity of halving the number of runs after each loop operation is Indicates that there is no loop structure in the operation; Time complexity based on folk song sample tree , calculate the average time complexity of building a tree , the formula is:

[0012] in, is the proportional coefficient, and the sum is 1; Repeat the above steps until all triple records are read and a complete folk song sample tree is obtained; Get the time complexity of building a folk song sample tree , the formula is:

[0013] Where N is the number of branch points, is the average time complexity.

[0014] Preferably, based on the obtained folk song sample tree, obtaining the average time complexity of querying each node data therein, optimizing the folk song sample tree specifically includes: Query time complexity for obtaining folk song sample tree , the formula is:

[0015] Among them, n is the size of the data, is the number of nodes in the query folk song sample tree, b is a dynamic parameter, hour, is a loop function, The data size is The time complexity of , The computation time outside the query; Query time complexity based on folk song sample tree , get the average time complexity of querying in the folk song sample tree , the formula is:

[0016] in, is the complexity of looping n times in the operation, is the number of commonly used nodes, is the number of the second most commonly used nodes, is the number of infrequently used nodes, , , The sum is 1.

[0017] Furthermore, in combination with a construction system of a folk song inheritance atlas, it is characterized by comprising: A hierarchical division module, the hierarchical division module is used to determine and divide the belonging relationship hierarchical structure of folk song samples according to the text description of the folk song; A triplet construction module, the triplet construction module is used to construct triples based on the attributes of each level in the hierarchy of the folk song sample; A storage module, the storage module is used to store folk song sample data, folk song sample triple data, and folk song sample tree data; A tree generation module, the tree generation module is used to convert the obtained folk song sample triples into a folk song sample tree; A tree reorganization module, which is used to adjust the tree nodes of non-final knowledge and integrate all subtrees converted from triple data into a complete folk song sample tree; A query module, the query module is used to query a single node or multiple nodes in the folk song sample tree to obtain the data of the folk song samples therein; A processor is used to convert triples into trees, reorganize folk song sample trees, calculate the time complexity of constructing folk song sample trees and the time complexity of querying each node.

[0018] Compared with the prior art, the advantages of the present invention are: Through digital technology and structured data models, the problem of scattered information and incomplete preservation in the process of folk song inheritance is effectively solved, making the inheritance of folk songs more systematic and standardized. Secondly, the use of triples to represent folk song samples can clearly show the relationship between folk songs, which is convenient for subsequent data mining and analysis, thereby revealing the regional, family or historical evolution characteristics of folk songs. In addition, the construction of the folk song sample tree makes the inheritance map more intuitive and hierarchical, and can deeply analyze the evolution and relationship of folk songs through the tree structure, and show the inheritance path and evolution process of each folk song node. By reorganizing and optimizing the folk song sample tree, the query efficiency can be improved, the retrieval time can be shortened, the efficient use and update of data can be ensured, and the access needs of a large amount of folk song data can be met. This method is highly scalable and adaptable, and continuously promotes the protection and promotion of folk songs. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] Figure 1 A schematic diagram of the graph construction of the method and system proposed in the present invention; Figure 2 A schematic diagram of the relationship hierarchy of the method and system proposed in the present invention; Figure 3 A triplet schematic diagram of the method and system proposed in the present invention; Figure 4 A schematic diagram of triple construction of the method and system proposed in the present invention; Figure 5 A schematic diagram of generating a folk song sample tree of the method and system proposed by the present invention; Figure 6 A schematic diagram of tree reorganization construction of the method and system proposed by the present invention; Figure 7 A query time diagram of the method and system proposed by the present invention; Figure 8 This is a schematic diagram of the electronic device in this solution; Fig. 9 This is a schematic diagram of the computer-readable storage medium structure in this solution. DETAILED DESCRIPTION

[0020] The following description is used to disclose the present invention so that those skilled in the art can implement the present invention. The preferred embodiments described below are only examples, and those skilled in the art may think of other obvious variations.

[0021] A system for constructing a folk song inheritance atlas, comprising: A hierarchical division module, the hierarchical division module is used to determine and divide the belonging relationship hierarchical structure of folk song samples according to the text description of the folk song; A triplet construction module, the triplet construction module is used to construct triples based on the attributes of each level in the hierarchy of the folk song sample; A storage module, the storage module is used to store folk song sample data, folk song sample triple data, and folk song sample tree data; A tree generation module, the tree generation module is used to convert the obtained folk song sample triples into a folk song sample tree; A tree reorganization module, which is used to adjust the tree nodes of non-final knowledge and integrate all subtrees converted from triple data into a complete folk song sample tree; A query module, the query module is used to query a single node or multiple nodes in the folk song sample tree to obtain the data of the folk song samples therein; A processor is used to convert triples into trees, reorganize folk song sample trees, calculate the time complexity of constructing folk song sample trees and the time complexity of querying each node.

[0022] Further, see Figure 1 As shown, in combination with the above system, this scheme also proposes a method for constructing a folk song inheritance atlas, including: Step 1: Obtain lyrics and song text data of folk song samples; Step 2: Based on the obtained folk song sample text data, the folk song’s belonging hierarchical structure is divided according to the text description; Step 3: Based on the divided folk song hierarchy, the folk song samples are represented as triples and stored in the database; Step 4: Generate a folk song sample tree based on the obtained folk song sample triple data; Step 5: Based on the nodes with non-final knowledge in the folk song sample tree, the folk song sample tree is reorganized and constructed to obtain a complete folk song sample tree; Step 6: Based on the obtained folk song sample tree, obtain the average time complexity of querying the data of each node therein, and optimize the folk song sample tree.

[0023] See also Figure 2 As shown, based on the obtained folk song sample text data, the hierarchical structure of the folk song belonging is divided according to the text description, which specifically includes: The belonging relationship hierarchy structure includes: a first relationship level, a second relationship level, ..., a last relationship level; Based on the name of the relationship level to which the folk song sample belongs, the name of the first relationship level is used as the first attribute of the folk song sample, the name of the second relationship level is used as the second attribute of the folk song sample, and so on.

[0024] See also Figure 3As shown, based on the divided folk song hierarchy, the folk song samples are represented as triples and stored in the database, specifically including: Based on the obtained folk song sample data, it is represented as a triple (x, y, z); The obtained triplet (x, y, z) of the folk song resource sample is uploaded to the database, and each triplet (x, y, z) of the folk song resource sample is a record.

[0025] It is understandable that the data of some folk song samples may be ambiguous. For example, the same folk song may belong to multiple regions or styles, and how to select an appropriate triple representation may become complicated. Therefore, for folk song samples involving multiple categories (such as multiple regions or styles), multiple triples can be generated for each category. For example, when folk song M belongs to region X and region Y, two triples are generated: (M, belongs to region, X) and (M, belongs to region, Y), and a weight is given to each category in a weighted manner.

[0026] See also Figure 4 As shown, based on the obtained folk song sample data, it is represented as a triple (x, y, z) specifically including: x is the subject of the folk song sample, which is composed of the attributes of the folk song sample; y is the relationship property between the subject x and the attribute value z of the folk song resource sample. The relationship property y is divided into: inclusion, equality; z is the attribute value of the folk song sample, which has two types: one is final knowledge and the other is non-final knowledge. The type of the attribute value z is determined by the last attribute in the subject x; The last attribute in subject x is: track, alias, performer, definition, indicating that the attribute value z is final knowledge; the last attribute in subject x is: type, classification, indicating that the attribute value z is non-final knowledge.

[0027] See also Figure 5 As shown, based on the obtained folk song sample triple data, generating a folk song sample tree specifically includes: The folk song sample tree includes: main root O, branch point set B, subtree, where the branch point set is ,in, is the jth attribute of the folk song sample subject; Based on the stored triple records, a triple record represents a subtree, the first attribute m of the subject x in the triple record; like , then the attribute m is equal to a branch point in the branch point set B, and the subtree represented by the triple record is transferred to the branch point equal to the attribute m; like , then transfer the subtree represented by the triple record to the main root O of the knowledge tree, and add the attribute m to the branch point set B.

[0028] See also Figure 6 As shown, based on the nodes with non-final knowledge in the folk song sample tree, the folk song sample tree is reorganized and constructed to obtain a complete folk song sample tree, specifically including: Based on the last attribute of subject x being type or classification, add attribute value z to branch point set B; When the attribute value z is the same as a branch point in the branch point set B, the folk song sample tree structure is reorganized, the subtree with the branch point as the root is separated from the original tree, and transferred to the subtree with the attribute value z as the root; Based on the above steps, the time complexity of constructing the folk song sample tree is obtained , the formula is:

[0029] Among them, n represents the size of the data. The complexity of halving the number of runs after each loop operation is Indicates that there is no loop structure in the operation; Time complexity based on folk song sample tree , calculate the average time complexity of building a tree , the formula is:

[0030] in, is the proportional coefficient, and the sum is 1; Repeat the above steps until all triple records are read and a complete folk song sample tree is obtained; Get the time complexity of building a folk song sample tree , the formula is:

[0031] Where N is the number of branch points, is the average time complexity.

[0032] See also Figure 7 As shown, based on the obtained folk song sample tree, the average time complexity of querying the data of each node therein is obtained, and the optimization of the folk song sample tree specifically includes: Query time complexity for obtaining folk song sample tree , the formula is:

[0033] Among them, n is the size of the data, is the number of nodes in the query folk song sample tree, b is a dynamic parameter, hour, is a loop function, The data size is The time complexity of , The computation time outside the query; Query time complexity based on folk song sample tree , get the average time complexity of querying in the folk song sample tree , the formula is:

[0034] in, is the complexity of looping n times in the operation, is the number of commonly used nodes, is the number of the second most commonly used nodes, is the number of infrequently used nodes, , , The sum is 1.

[0035] Specifically, the query time complexity of the folk song sample tree is optimized through the Splay tree. When querying a folk song sample, the Splay tree will promote the sample to the root of the tree through a stretching operation, thereby accelerating future access to the sample or related nodes. This is very effective for scenarios where certain specific folk song samples are frequently queried, especially when certain folk song samples are queried multiple times. The Splay tree can dynamically adjust the tree structure so that these samples are closer to the root node in subsequent operations, thereby reducing the query path length and query time. This optimization based on the principle of locality enables the folk song sample tree to process query requests more efficiently when facing actual use, especially when folk song samples are frequently accessed.

[0036] Furthermore, the method according to the embodiment of the present application can also be performed by Figure 8 The electronic device architecture shown in FIG. Figure 8 As shown, the electronic device 500 may include a bus 501, one or more CPUs 502, a read-only memory (ROM) 503, a random access memory (RAM) 504, a communication port 505 connected to a network, an input / output component 506, a hard disk 507, etc. The storage device in the electronic device 500, such as the ROM 503 or the hard disk 507, may store a method and system for constructing a folk song inheritance atlas provided by the present application. The electronic device 500 may also include a user interface 508. Of course, Figure 8 The architecture shown is only exemplary and can be omitted according to actual needs when implementing different devices. Figure 8 One or more components of an electronic device are shown.

[0037] Fig. 9 Schematic diagram of a computer-readable storage medium structure provided by an embodiment of the present application. Fig. 9 As shown, a computer-readable storage medium 600 according to an embodiment of the present application is shown. Computer-readable instructions are stored on the computer-readable storage medium 600. When the computer-readable instructions are executed by the processor, a method and system for constructing a folk song inheritance atlas according to an embodiment of the present application described with reference to the above figures can be executed. The storage medium 600 includes, but is not limited to, for example, volatile memory and / or non-volatile memory. Volatile memory may include, for example, random access memory (RAM) and cache memory (cache), etc. Non-volatile memory may include, for example, read-only memory (ROM), hard disk, flash memory, etc.

[0038] It should be noted that the sequence of the above embodiments of the present invention is only for description and does not represent the advantages and disadvantages of the embodiments. The above is a description of a specific embodiment of this specification. In addition, the processes depicted in the accompanying drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0039] The various embodiments in this specification are described in a progressive manner, and the same or similar parts between the various embodiments can be referenced to each other, and each embodiment focuses on the differences from other embodiments.

[0040] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for constructing a folk song inheritance atlas, characterized in that: include: Obtain lyrics song text data of folk song samples; Based on the obtained folk song sample text data, the folk songs are divided into hierarchical structures according to the text descriptions; Based on the hierarchical structure of the folk songs, the folk song samples are represented as triples and stored in the database. Based on the obtained folk song sample triple data, a folk song sample tree is generated; Based on the nodes with non-final knowledge in the folk song sample tree, the folk song sample tree is reorganized and constructed to obtain a complete folk song sample tree; Based on the obtained folk song sample tree, the average time complexity of querying the data of each node therein is obtained, and the folk song sample tree is optimized.

2. The method for constructing a folk song inheritance atlas according to claim 1, characterized in that: The method of dividing the folk song belonging hierarchy structure according to the text description based on the obtained folk song sample text data specifically includes: The belonging relationship hierarchy structure includes: a first relationship level, a second relationship level, ..., a last relationship level; Based on the name of the relationship level to which the folk song sample belongs, the name of the first relationship level is used as the first attribute of the folk song sample, the name of the second relationship level is used as the second attribute of the folk song sample, and so on.

3. The method for constructing a folk song inheritance atlas according to claim 2, characterized in that: The folk song samples are represented as triples based on the hierarchical structure of the folk song belonging to the division, and stored in the database specifically includes: Based on the obtained folk song sample data, it is represented as a triple (x, y, z); The obtained triplet (x, y, z) of the folk song resource sample is uploaded to the database, and each triplet (x, y, z) of the folk song resource sample is a record.

4. The method for constructing a folk song inheritance atlas according to claim 3, characterized in that: The folk song sample data obtained is expressed as a triple (x, y, z) and specifically includes: x is the subject of the folk song sample, which is composed of the attributes of the folk song sample; y is the relationship property between the subject x and the attribute value z of the folk song resource sample. The relationship property y is divided into: inclusion, equality; z is the attribute value of the folk song sample, which has two types: one is final knowledge and the other is non-final knowledge. The type of the attribute value z is determined by the last attribute in the subject x; The last attribute in subject x is: track, alias, performer, definition, indicating that the attribute value z is final knowledge; the last attribute in subject x is: type, classification, indicating that the attribute value z is non-final knowledge.

5. The method for constructing a folk song inheritance atlas according to claim 4, characterized in that: The step of generating a folk song sample tree based on the obtained folk song sample triple data specifically includes: The folk song sample tree includes: main root O, branch point set B, subtree, where the branch point set is ,in, is the jth attribute of the folk song sample subject; Based on the stored triple records, a triple record represents a subtree, the first attribute m of the subject x in the triple record; like , then the attribute m is equal to a branch point in the branch point set B, and the subtree represented by the triple record is transferred to the branch point equal to the attribute m; like , then transfer the subtree represented by the triple record to the main root O of the knowledge tree, and add the attribute m to the branch point set B.

6. The method for constructing a folk song inheritance atlas according to claim 5, characterized in that: The method of reorganizing and constructing the folk song sample tree based on the nodes with non-final knowledge in the folk song sample tree to obtain a complete folk song sample tree specifically includes: Based on the last attribute of subject x being type or classification, add attribute value z to branch point set B; When the attribute value z is the same as a branch point in the branch point set B, the folk song sample tree structure is reorganized, the subtree with the branch point as the root is separated from the original tree, and transferred to the subtree with the attribute value z as the root; Based on the above steps, the time complexity of constructing the folk song sample tree is obtained , the formula is: Among them, n represents the size of the data. The complexity of halving the number of runs after each loop operation is Indicates that there is no loop structure in the operation; Time complexity based on folk song sample tree , calculate the average time complexity of building a tree , the formula is: in, is the proportional coefficient, and the sum is 1; Repeat the above steps until all triple records are read and a complete folk song sample tree is obtained; Get the time complexity of building a folk song sample tree , the formula is: Where N is the number of branch points, is the average time complexity.

7. The method for constructing a folk song inheritance atlas according to claim 6, characterized in that: The method of obtaining the average time complexity of querying the data of each node in the folk song sample tree based on the obtained folk song sample tree and optimizing the folk song sample tree specifically includes: Query time complexity for obtaining folk song sample tree , the formula is: Among them, n is the size of the data, is the number of nodes in the query folk song sample tree, b is a dynamic parameter, hour, is a loop function, The data size is The time complexity of , The computation time outside the query; Query time complexity based on folk song sample tree , get the average time complexity of querying in the folk song sample tree , the formula is: in, is the complexity of looping n times in the operation, is the number of commonly used nodes, is the number of the second most commonly used nodes, is the number of infrequently used nodes, , , The sum is 1.

8. A system for constructing a folk song inheritance atlas, used to implement a method for constructing a folk song inheritance atlas as claimed in any one of claims 1 to 7, characterized in that: include: A hierarchical division module, the hierarchical division module is used to determine and divide the belonging relationship hierarchical structure of folk song samples according to the text description of the folk song; A triplet construction module, the triplet construction module is used to construct triples based on the attributes of each level in the hierarchy of the folk song sample; A storage module, the storage module is used to store folk song sample data, folk song sample triple data, and folk song sample tree data; A tree generation module, the tree generation module is used to convert the obtained folk song sample triples into a folk song sample tree; A tree reorganization module, which is used to adjust the tree nodes of non-final knowledge and integrate all subtrees converted from triple data into a complete folk song sample tree; A query module, the query module is used to query a single node or multiple nodes in the folk song sample tree to obtain the data of the folk song samples therein; A processor is used to convert triples into trees, reorganize folk song sample trees, calculate the time complexity of constructing folk song sample trees and the time complexity of querying each node.

9. An electronic device, characterized in that: include: at least one processor; and a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute a method for constructing a folk song inheritance map as described in any one of claims 1-7.

10. A computer-readable storage medium storing computer-readable instructions, characterized in that: When the computer-readable instructions are executed by a processor, a method for constructing a folk song inheritance map described in any one of claims 1-7 is implemented.

Citation Information

Patent Citations

  • Knowledge tree triple storage query method

    CN114186071A

Cited By

  • Construction method and system of folk song inheritance atlas

    CN120892578A