A second tree walk then allocates one or more branch number ranges to each concept, which contains the number of all of their descendants. In this approach, a depth first tree walk is performed that applies an incremental number to each concept. In this approach, a database is used which supports the recursive testing of a chain of hierarchical relationships. This reduces the number of tests that need to be performed to recursively test the subtype relationships. A concept can only subsume concepts that include the same set of high-level concept flags. In this approach, flags are added to each concept to indicate the set of high-level concept nodes of which that concept is a subtype.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |