Method for data retrieval in a data-string set by extracting related link-information from a parent node

{
  "publication_number": "US5864858A",
  "country": "US",
  "kind": "A",
  "title": "Method for data retrieval in a data-string set by extracting related link-information from a parent node",
  "abstract": "A data retrieval method in a data-string set including a plurality of data strings, each data string having a data identification name storage area, a parent data storage area storing link-information data, wherein when data strings are consecutively traced on the basis of link-information data stored in parent data storage areas of data strings, with arbitrary link-information data stored in the parent data storage area of a certain data string as a starting point, until the parent data storage area of the traced data string is empty, the link-information data about the certain data string is included in none of the parent data storage areas of the traced data strings; the method comprising recursively extracting a data string on the basis of link-information data stored in a parent data storage areas of the data string storing a data identification name to be retrieved and the extracted data string, until the parent data storage area of the extracted data string is empty.",
  "claims": [
    "1. A data retrieval method in a data-string set including a plurality of data strings, each data string DS -- 1 having (1) a data identification name storage area storing a data identification name, (2) a data level storage area storing a data level value, and (3) a parent data storage area storing link-information data about a data string DS -- 2 storing a data identification name which indicates a set including the data identification name stored in the data string DS -- 1, wherein: (A) the data string DS -- 2 has a larger data level value than the data string DS -- 1 has, (B) the parent data storage area of the data string DS -- 1 does not contain link-information data about the data string DS -- 1 itself, and the link-information data stored in the parent data storage area of the data string DS -- 1 differ from one another, and (C) when data strings are consecutively traced on the basis of link-information data stored in parent data storage areas of data strings, with arbitrary link-information data stored in the parent data storage area of the data string DS -- 1 as a starting point, until the parent data storage area of the traced data string is empty, the link-information data about the data string DS -- 1 is included in none of the parent data storage areas of the traced data strings, the method comprising the steps of (a) inputting a data identification name corresponding to data to be retrieved, (b) extracting a data string on the basis of link-information data stored in a parent data storage area of a data string whose data identification name storage area stores the same data identification name as the inputted data identification name, and further extracting a data string on the basis of link-information data stored in a parent data storage area of the extracted data string until the parent data storage area of the extracted data string is empty, and (c) outputting the extracted data string.",
    "2. A data retrieval method in a data-string set including a plurality of data strings, each data string DS -- 1 having (1) a data identification name storage area storing a data identification name, (2) a data level storage area storing a data level value, and (3) an element data storage area storing link-information data about a data string DS -- 0 storing a data identification name which is an element of a set indicated by the data identification name stored in the data string DS -- 1, wherein: (A) the data string DS -- 0 has a smaller data level value than the data string DS -- 1 has, (B) the element data storage area of the data string DS -- 1 does not contain link-information data about the data string DS -- 1 itself, and the link-information data stored in the element data storage area of the data string DS -- 1 differ from one another, and (C) when data strings are consecutively traced on the basis of link-information data stored in element data storage areas of data strings, with arbitrary link-information data stored in the element data storage area of the data string DS -- 1 as a starting point, until the element data storage area of the traced data string is empty, the link-information data about the data string DS -- 1 is included in none of the element data storage areas of the traced data strings, the method comprising the steps of (a) inputting a data identification name corresponding to data to be retrieved, (b) extracting a data string on the basis of link-information data stored in an element data storage area of a data string whose data identification name storage area stores the same data identification name as the inputted data identification name, and further extracting a data string on the basis of link-information data stored in an element data storage area of the extracted data string until the element data storage area of the extracted data string is empty, and (c) outputting the extracted data string.",
    "3. A data retrieval method in a data-string set including a plurality of data-strings, each data string DS -- 1 having (1) a data identification name storage area storing a data identification name, (2) a data level storage area storing a data level value, (3) a parent data storage area storing link-information data about a data string DS -- 2 storing a data identification name which indicates a set including the data identification name stored in the data string DS -- 1, and (4) an element data storage area storing link-information data about a data string DS -- 0 storing a data identification name which is an element of a set indicated by the data identification name stored in the data string DS -- 1, wherein: (A) the data string DS -- 2 has a larger data level value than the data string DS -- 1 has, (B) the parent data storage area of the data string DS -- 1 does not contain link-information data about the data string DS -- 1 itself, and the link-information data stored in the parent data storage area of the data string DS -- 1 differ from one another, (C) when data strings are consecutively traced on the basis of link-information data stored in parent data storage areas of data strings, with arbitrary link-information data stored in the parent data storage area of the data string DS -- 1 as a starting point, until the parent data storage area of the traced data string is empty, the link-information data about the data string DS -- 1 is included in none of the parent data storage areas of the traced data strings, (D) the data string DS -- 0 has a smaller data level value than the data string DS -- 1 has, (E) the element data storage area of the data string DS -- 1 does not contain link-information data about the data string DS -- 1 itself, and the link-information data stored in the element data storage area of the data string DS -- 1 differ from one another, and (F) when data strings are consecutively traced on the basis of link-information data stored in element data storage areas of data strings, with arbitrary link-information data stored in the element data storage area of the data string DS -- 1 as a starting point, until the element data storage area of the traced data string is empty, the link-information data about the data string DS -- 1 is included in none of the element data storage areas of the traced data strings, the method comprising the steps of (a) inputting a data identification name corresponding to data to be retrieved, (b) extracting a data string on the basis of link-information data stored in a parent data storage area of a data string whose data identification name storage area stores the same data identification name as the inputted data identification name, and further extracting a data string on the basis of link-information data stored in a parent data storage area of the extracted data string until the parent data storage area of the extracted data string is empty, (c) extracting a data string on the basis of link-information data stored in an element data storage area of the data string whose data identification name storage area stores the same data identification name as the inputted data identification name, and further extracting a data string on the basis of link-information data stored in an element data storage area of the extracted data string until the element data storage area of the extracted data string is empty, and (d) outputting the extracted data strings.",
    "4. A data retrieval method in a data-string set including a plurality of data-strings, each data string DS -- 1 having (1) a data identification name storage area storing a data identification name, (2) a data level storage area storing a data level value, (3) a parent data storage area storing link-information data about a data string DS -- 2 storing a data identification name which indicates a set including the data identification name stored in the data string DS -- 1, and (4) an element data storage area storing link-information data about a data string DS -- 0 storing a data identification name which is an element of a set indicated by the data identification name stored in the data string DS -- 1, wherein: (A) the data string DS -- 2 has a larger data level value than the data string DS -- 1 has, (B) the parent data storage area of the data string DS -- 1 does not contain link-information data about the data string DS -- 1 itself, and the link-information data stored in the parent data storage area of the data string DS -- 1 differ from one another, (C) when data strings are consecutively traced on the basis of link-information data stored in parent data storage areas of data strings, with arbitrary link-information data stored in the parent data storage area of the data string DS -- 1 as a starting point, until the parent data storage area of the traced data string is empty, the link-information data about the data string DS -- 1 is included in none of the parent data storage areas of the traced data strings, (D) the data string DS -- 0 has a smaller data level value than the data string DS -- 1 has, (E) the element data storage area of the data string DS -- 1 does not contain link-information data about the data string DS -- 1 itself, and the link-information data stored in the element data storage area of the data string DS -- 1 differ from one another, and (F) when data strings are consecutively traced on the basis of link-information data stored in element data storage areas of data strings, with arbitrary link-information data stored in the element data storage area of the data string DS -- 1 as a starting point, until the element data storage area of the traced data string is empty, the link-information data about the data string DS -- 1 is included in none of the element data storage areas of the traced data strings, the method comprising the steps of (a) inputting a data identification name corresponding to data to be retrieved, (b) extracting a data string on the basis of link-information data stored in an element data storage area of a data string whose data identification name storage area stores the same data identification name as the data identification name to be retrieved, and further extracting a data string on the basis of link-information data stored in an element data storage area of the extracted data string until the element data storage area of the extracted data string is empty, (c) extracting a data string on the basis of link-information data stored in the parent data storage area of the extracted data string whose element data storage area is empty, from among the data strings extracted in the step (b), and further extracting a data string on the basis of link-information data stored in a parent data storage area of the extracted data string until the parent data storage area of the extracted data string is empty, and (d) outputting the extracted data string."
  ],
  "description_excerpt": "This application is a division of Ser. No. 8/659,163 filed Jun. 5, 1996 now U.S. Pat. No. 5,749,080.\n\nThe present invention relates to a data retrieval method in a data structure which can constitute, e.g., database or an artificial intelligence, and a method of adding link-information data to a data string of the data structure.\n\nA variety of databases are practically used at present, and above all, a relational database is the most widely used. A variety of data are stored in a database, and data stored in the database is retrieved by various methods.\n\nWith reference to an example in which each of concept names such as DESK, PENCIL, WOOD, GRAPHITE, MICA and BRUSH OF MOTOR consists of element names as shown in the following Table 1, and in a record, the concept name is stored in a concept field and element name(s) is/are stored in element field(s), the outline of a conventional relational database will be explained below. In Table 1, numerals show record numbers, and alphabets show element field numbers.\n\nIn the relational database, a new record relationship can made by deriving the relationship of X{Z} on the basis of a combination of two records of X{..., Y,... } and Y {..., Z,... }. A capital letter located before the brace \"{\" stands for a concept name, and capital letters in the braces \"{ }\" stand for element names. For example, concept name \"DESK\" and element name \"COMBUSTIBILITY\" can be combined as\n\nDESK{COMBUSTIBILITY}\n\non the basis of a combination of records of\n\nDESK{WOOD,... }",
  "cpc": [
    "G06F 16/90344",
    "G06F 16/284",
    "G06F 16/9024",
    "Y10S 707/99933"
  ],
  "ipc": [
    "G06F 17/30"
  ],
  "inventors": [
    "Shigeru Matsumoto",
    "Takahisa Yamamoto"
  ],
  "filing_date": "1998-01-23",
  "publication_date": "1999-01-26",
  "grant_date": "1999-01-26",
  "priority_date": "1995-06-05",
  "application_number": "US-1272998-A",
  "family_id": "15734381",
  "cited_by_count": 12,
  "citations": [
    "US4468728A",
    "US4611298A",
    "US5265244A",
    "US4831543A",
    "US4945475A",
    "US5343559A",
    "US5442784A",
    "US5581756A",
    "US5247666A",
    "US5644776A",
    "US5557722A",
    "US5664181A",
    "US5511159A",
    "US5627748A",
    "US5530957A",
    "US5640551A",
    "US5625812A"
  ]
}