# US 2026/0093733 A1 · Method for extracting text records of a hierarchical classifier with several levels of nesting from a database

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0093733 A1
- Document ID: US20260093733A1
- Status: Published application
- Kind: A1
- Application number: 19/288,985
- Filed: 2025-08-02
- Published: 2026-04-02
- Earliest claimed: 2024-09-27
- Assignees: Anna Valerevna Chernyaeva
- Inventors: Maxim Andreevich Chernyaev
- Web page: https://patentgrep.com/patent/US20260093733A1

## CPC

- G06F 16/334: Query execution (filtering based on additional data G06F16/335)
- G06F 16/282: {Hierarchical databases, e.g. IMS, LDAP data stores or Lotus Notes}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In a preferred embodiment claimed a method for extracting a text record from a database (DB) of text records of a hierarchical classifier with several levels of nesting, performed by the processor of a computing device and containing the following steps: forming request to the database of text records of a hierarchical classifier with several levels of nesting, wherein the database contains at least a set of the associated text records, and each record has an associated at least one first sign of connectivity, and each first sign of connectivity corresponds to one of the subheadings, in which each unique text record is associated with a unique title, and each unique title contains a list consisting of at least plurality of the unique subheadings; and identified unique text records are associated in the database with one of the unique subheadings forming a set of associated text records; extracting at least one associated text record from the database.

## Claims

### Claim 1

A method for extracting a text record from a database (DB) of text records of a hierarchical classifier with several levels of nesting, performed by the processor of a computing device and containing the following steps:
forming request to the database of text records of a hierarchical classifier with several levels of nesting, wherein the database contains at least a set of the associated text records, and each record has an associated at least one first sign of connectivity, and each first sign of connectivity corresponds to one of the subheadings, in which each unique text record is associated with a unique title, and each unique title contains a list consisting of at least plurality of the unique subheadings;
and identified unique text records are associated in the database with one of the unique subheadings forming a set of associated text records;
extracting at least one associated text record from the database.

### Claim 2 (depends on 1)

The method according to claim 1, wherein at least the first associated text record and at least the first unique subtitle are extracted, the unique identifier of which is the first sign of the connectedness of the extracted first associated text record.

### Claim 3 (depends on 2)

The method according to claim 2, wherein a second unique subtitle is additionally extracted, with which the extracted first unique subtitle is associated.

### Claim 4 (depends on 3)

The method according to claim 3, wherein at least another first associated text record associated with the extracted second unique subtitle is additionally extracted.

### Claim 5 (depends on 1)

The method according to claim 1, wherein at least the first associated text record is extracted and at least the second associated text record associated with the extracted first associated text record.