# US 6,295,537 B1 · User's database in networks and method of constructing the same

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

- Number: US 6,295,537 B1
- Document ID: US6295537B1
- Status: Granted
- Kind: B1
- Application number: 09/120,200
- Filed: 1998-07-22
- Granted: 2001-09-25
- Earliest claimed: 1998-01-19
- Assignees: Accton Technology Corporation
- Inventors: Wei-Yang Teng
- Web page: https://patentgrep.com/patent/US6295537B1

## CPC

- H04L 45/745: Address table lookup; Address filtering
- H04L 61/00: Network arrangements, protocols or services for addressing or naming
- H04L 61/35: {involving non-standard use of addresses for implementing network functionalities, e.g. coding subscription information within the address or functional addressing, i.e. assigning an address to a function}
- H04L 67/00: Network arrangements or protocols for supporting network services or applications (user-to-user messaging H04L51/00; network arrangements, protocols or services for supporting real-time applications in data packet communications networks H04L65/00)
- H04L 69/329: in the application layer [OSI layer 7]
- Y10S 707/959: Network
- Y10S 707/99942: Manipulating data structure, e.g. compression, compaction, compilation
- Y10S 707/99943: Generating database or data structure, e.g. via user interface
- Y10S 707/99953: Recoverability
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## Abstract

The present invention relates to a user's database structure in the network and a method of constructing the same, in particular, to a user's database structure and a method of constructing the same in Ethernet. The structure comprises a set of bytes having a plurality of fields, a main storage layer having the set of bytes, a plurality of sub-storage layers having the set of bytes, a plurality of main connection lines and sub-connection lines, to form a database of tree structure. For retrieval of the user's address data, only the main storage layer, the main connection line and sub-connection lines, and the last sub-storage layer are required to retrieve a user's address data so as to save the storage space occupied by the database.

## Claims

### Claim 1

A data base structure for use in a network to provide an addressable communication among a plurality of users of the network, each having an address, comprising:
a plurality of fields for storing basic codes of a user's address;
a main storage layer having said plurality of fields;
a plurality of sub-storage layers having said plurality of fields;
a plurality of user's address fields;
a plurality of main connection lines each for connecting said main storage layer to one of said sub-storage layers;
a plurality of sub-connection lines each for forming a connection between two of said sub-storage layers; and
a plurality of user's address connection lines each for connecting a sub-storage layer to at least one of said user's address fields;
whereby within such database structure, starting from said main storage layer and extending through said main connection lines and sub-connection lines to said sub-storage layers, the address of a user within said network is efficiently retrieved by said user's address connection lines.

### Claim 2 (depends on 1)

The database structure as claimed in claim 1, wherein the starting points of said plurality of main connection lines are respectively each of the fields in said main storage layer.

### Claim 3 (depends on 1)

The database structure as claimed in claim 1, wherein each of said main connection lines is connected to one sub-storage layer.

### Claim 4 (depends on 1)

The database structure as claimed in claim 1, wherein the starting points of said plurality of sub-storage layers are respectively each of the fields in an upper sub-storage layer.

### Claim 5 (depends on 1)

The database structure as claimed in claim 1, wherein each of said sub-connection lines is connected to only one next sub-storage layer.

### Claim 6 (depends on 1)

The database structure as claimed in claim 1, wherein the starting points of said plurality of user's address connection lines are respectively each of the fields in the last sub-storage layer.

### Claim 7 (depends on 1)

The database structure as claimed in claim 1, further comprising a plurality of searching pointers among a plurality of user's addresses so as to conduct a search from the present field of a user's address for the next or previous user's address data.

### Claim 8

A method of constructing a database for network users, comprising the following steps:
(a) checking from a main storage layer whether the main storage layer has a basic code identical to the first bit of the user's address data; if not, placing said basic code in the corresponding field of a plurality of fields of said main storage layer; placing a main connection line and a sub-storage layer connected thereto; and if present, following said main connection line of the field to the sub-storage layer connected thereto;
(b) checking whether said sub-storage layer stores the next basic code of the user's address data; if not, placing said basic code in the corresponding field of the plurality of fields of the sub-storage layer; at the corresponding field, producing a sub-connection line and a sub-storage layer connected thereto; if present, then following said sub-connection line to which the fields is connected, to said sub-storage layer;
(c) repeating step (b) until all basic codes of the user's address data are stored in the database;
(d) according to the field of the last basic code of the user's address data, producing a user's address connection line connected to the user's address field and storing said user's address data in the user's address field;
by means of the above procedure, a complete database for network users being established; and in retrieval of the user's address data, starting from said main storage layer along said main connection lines and sub-connection lines to the last sub-storage layer, a user's address being retrieved via the connection line.

### Claim 9 (depends on 8)

The method as claimed in claim 8, wherein said main storage layer has at least one main connection line connected to the plurality of sub-storage layers.

### Claim 10 (depends on 8)

The method as claimed in claim 8, wherein said sub-storage layer has at least one sub-connection line connected to the next layer of the plurality of sub-storage layers.

### Claim 11 (depends on 8)

The method as claimed in claim 8, wherein the step (d) further comprises the step of producing a plurality of searching pointers between two user's address fields so as to search from the present address field for a next or previous address data of the user.