Data structure determining method for hierarchically structured data corresponding to identifiers and apparatus thereof

• US 5,819,280 A
• Filed: 01/30/1996
• Issued: 10/06/1998
• Est. Priority Date: 04/04/1995
• Status: Expired due to Fees

• Current Assignee: Fujitsu Limited
• Original Assignee: Fujitsu Limited
• Inventors: Nagai, Tsuyoshi
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): Coby, Frantz
• Application Number:
  US08/593,821
• Time in Patent Office: 980 Days
• Field of Search: 395/613, 395/611, 395/800, 364/200, 364/300, 707/101, 707/102, 707/103, 707/100
• US Class Current: 1/1
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99944 Object-oriented database structure

Abstract

A structure of hierarchically structured data including two or more data pieces having a hierarchical relationship is determined. An identifier is added to a data piece that is an element of the hierarchically structured data. The method determines whether or not there are two or more data pieces with the same identifier as the identifier of a first data piece, in a hierarchical data sequence composed of the first data piece and a second data piece placed below the first data piece, determines that an infinite hierarchical structure takes place when there are two or more data pieces with the same identifier if the second data piece is placed below the first data piece, and determines that an infinite hierarchical structure does not take place when there are not two or more data pieces with the same identifier, even if the second data piece is placed below the first data piece. Corresponding to the determined result, the data placement that results in an occurrence of an infinite hierarchical structure can be prevented.

Claims

1. A data structure determining method for hierarchically structured data including two or more data pieces having a hierarchical relationship, comprising the steps of:

adding an identifier to a data piece that is an element of the hierarchically structured data;

determining whether or not there are two or more data pieces with the same identifier in a hierarchical data sequence including a first data piece and a second data piece placed below the first data piece, by retrieving data pieces in different hierarchical levels and comparing identifiers of the data pieces in the different hierarchical levels; and

determining that an infinite hierarchical structure takes place when there are two or more data pieces with the same identifier if the second data piece is placed below the first data piece.

2. The data structure determining method as set forth in claim 1, further comprising the steps of:

prohibiting the second data piece from being placed below the first data piece when it has been determined that an infinite hierarchical structure takes place; and

permitting the second data piece to be placed below the first data piece when it has been determined that an infinite hierarchical structure does not take place.

3. The structure determining method as set forth in claim 1, further comprising the steps of:

determining whether or not an identifier of the second data piece accords with an identifier of the first data piece or an identifier of a data piece in a higher hierarchical level than the first data piece; and

determining that an infinite hierarchical structure takes place when the identifier of the second data piece accords with the identifier of the first data piece or an identifier of a data piece in a higher hierarchic level than the first data piece.

4. The data structure determining method as set forth in claim 1, further comprising the steps of:

determining whether or not an identifier of the first data piece accords with an identifier of the second data piece or an identifier of a data piece in a lower hierarchical level than the second data piece; and

determining that an infinite hierarchical structure takes place when the identifier of the first data piece accords with the identifier of the second data piece or the identifier of a data piece in a lower hierarchical level than the second data piece.

5. The data structure determining method as set forth in claim 4, further comprising the steps of:

determining whether or not the second data piece can have a third data piece in a lower hierarchical level than the second data piece;

determining whether or not the identifier of the first data piece accords with the identifier of the second data piece or the identifier of a data piece in a lower hierarchical level than the second data piece when the second data piece can have a third data piece; and

determining that an infinite hierarchical structure does not take place when the second data piece cannot have a third data piece.

6. The data structure determining method as set forth in claim 5, further comprising the steps of:

determining whether or not the third data piece can have a fourth data piece in a lower hierarchical level than the third data piece when the identifier of the first data piece does not accord with the identifier of the second data piece;

determining whether or not the identifier of the first data piece accords with the identifier of the third data piece or the identifier of a data piece in a lower hierarchical level than the third data piece when the third data piece can have a fourth data piece; and

determining that an infinite hierarchical structure takes place when the identifier of the first data piece accords with the identifier of the third data piece or the identifier of a data piece in a lower hierarchical level than the third data piece.

7. The data structure determining method as set forth in claim 6, further comprising the steps of:

determining whether or not there is a data piece can have a data piece in a lower hierarchical level in the same hierarchical level as the third data piece when the third data piece can not have the fourth data piece; and

determining that the infinite hierarchical structure does not take place when there is no data piece that can have a data piece in a lower hierarchical level.

8. A data structure determining apparatus for hierarchically structured data comprised of two or more data pieces having a hierarchical relationship, comprising:

data storing means for storing a data piece that has an identifier and that is an element of the hierarchically structured data; and

processing means for determining whether or not there are two or more data pieces with the same identifier in a hierarchical data sequence comprising a first data piece and a second data piece placed below the first data piece, by retrieving data pieces in different hierarchical levels and comparing identifiers of the data pieces in the different hierarchical levels, and determining that an infinite hierarchical structure takes place when there are two or more data pieces with the same identifier if the second data piece is placed below the first data piece.

9. The data structure determining apparatus as set forth in claim 8,

wherein said data storing means is adapted for correlating management information including at least one of a parent pointer and a child pointer with a data piece that is an element of the hierarchically structured data and storing the resultant data piece, and

wherein said processing means is adapted for determining whether or not there are two or more data pieces with the same identifier in the hierarchical data sequence with reference to the management information.

10. The data structure determining apparatus as set forth in claim 8,

wherein said processing means is adapted for not placing the second data piece below the first data piece when said processing means has determined that an infinite hierarchical structure takes place, and for placing the second data piece below the first data piece when said processing means has determined that an infinite hierarchical structure does not take place.

11. The data structure determining apparatus as set forth in claim 8, further comprising:

input/output means for prompting a user whether or not the second data piece should be placed below the first data piece and receiving a reply from the user when said processing means has determined that an infinite hierarchical structure takes place.

12. The data structure determining apparatus as set forth in claim 11,

wherein said processing means is adapted for not placing the second data piece below the first data piece when said input/output means has received a reply that represents the user has not permitted a data placement, and for placing the second data piece below the first data piece when said input/output means has received a reply that represents the user has permitted the data placement.

13. The data structure determining apparatus as set forth in claim 8,

wherein said processing means is adapted for determining whether or not an identifier of the second data piece accords with an identifier of the first data piece or an identifier of a data piece in a higher hierarchical level than the first data piece and determining that an infinite hierarchical structure takes place when the identifier of the second data accords with the identifier of the first data piece or the identifier of a data piece in a higher hierarchical level than the first data piece.

14. The data structure determining apparatus as set forth in claim 13,

wherein said data storing means is adapted for correlating management information including a parent pointer with a data piece that is an element of the hierarchically structure data and storing a resultant data piece, and

wherein said processing means is adapted for determining whether or not the identifier of the second data piece accords with the identifier of the first data piece or the identifier of a data piece in a higher hierarchical level than the first data piece with reference to the management information.

15. The data structure determining apparatus as set forth in claim 8,

wherein said processing means is adapted for determining whether or not an identifier of the first data piece accords with an identifier of the second data piece or an identifier of a data piece in a lower hierarchical level than the second data piece determining that an infinite hierarchical structure takes place when the identifier of the first data piece accords with the identifier of the second data piece or the identifier of a data piece in a lower hierarchical level than the second data piece.

16. The data structure determining apparatus as set forth in claim 14,

wherein said data storing means is adapted for correlating management information including a child pointer with a data piece that is an element of the hierarchically structure data and storing a resultant data piece, and

wherein said processing means is adapted for determining whether or not the identifier of the first data piece accords with the identifier of the second data piece or the identifier of a data piece in a lower hierarchical level than the second data piece.

17. A data structure determining method for hierarchically structured data including two or more data pieces having a hierarchical relationship, comprising the steps of:

determining that an infinite hierarchial structure takes place when there are two or more same data pieces in a hierarchical data sequence in which a data piece is newly placed, by retrieving data pieces in different hierarchical levels and comparing the data pieces in the different hierarchical levels; and

determining that an infinite hierarchical structure does not take place when there are not the same data pieces in the hierarchical data sequence in which the data piece is placed.

18. The data structure determining method as set forth in claim 17, further comprising the steps of:

prohibiting the data piece from being newly placed in the hierarchical data sequence when it has been determined that an infinite hierarchical structure takes place; and

permitting the data pieces to be newly placed in the hierarchical data sequence when it has been determined that an infinite hierarchical structure does not take place.

19. A method for managing hierarchically structured data pieces including a destination data piece having a corresponding destination identifier, comprising the steps of:

adding a new identifier to a new data piece placed in a hierarchical level of a hierarchical sequence different from the destination data piece;

determining whether the destination data piece can have a lower hierarchical structure;

retrieving and comparing the destination data piece and the new data piece; and

adding the new data piece to the lower hierarchical structure of the destination data piece, if the new identifier is different from the destination identifier.

20. The data structure determining method as set forth in claim 19, further comprising the steps of:

determining that an infinite hierarchical structure takes place when there are two or more data pieces with the same identifier if the new data piece is placed below the destination data piece; and

determining that an infinite hierarchical structure does not take place when there are not two or more data pieces with the same identifier even if the new data piece is placed below the destination data piece.

21. A method for structuring data pieces as elements of hierarchically structured data, including a first data piece positioned in a first hierarchical level of a hierarchical data sequence, and a second data piece positioned in a second hierarchical level of the hierarchical data sequence different from the first hierarchical level, comprising the steps of:

retrieving and comparing the first data piece and the second data piece; and

determining that an infinite hierarchical structure takes place when the first data piece is the same as the second data piece.