# US 2013/0086092 A1 · Systems and methods related to a temporal log structure database

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

- Number: US 2013/0086092 A1
- Document ID: US20130086092A1
- Status: Published application
- Kind: A1
- Application number: 13/251,199
- Filed: 2011-09-30
- Published: 2013-04-04
- Earliest claimed: 2011-09-30
- Assignees: BMC Software, Inc.
- Inventors: Brian B. James; Eric T. Hardison; David L. Janicek
- Web page: https://patentgrep.com/patent/US20130086092A1

## CPC

- G06F 16/2477: {Temporal data queries}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In one general aspect, a computer-implemented method includes a computer-implemented method that includes executing, using at least one processor, instructions recorded on a non-transitory computer-readable storage medium. The method includes receiving a request to insert a data record within a database of a data collection system. The data record can be placed within a buffer in a main memory of the data collection system. A record data structure and a record index structure associated with the data record are defined. The record data structure and the record index structure are stored within a storage chunk in a storage medium of the database, and the storage medium is different than the main memory. The storage chunk has an associated index that can be used to retrieve the data record and the storage chunk can include other data records different than the data record associated with the received request.

## Claims

### Claim 1

A computer-implemented method including executing, using at least one processor, instructions recorded on a non-transitory computer-readable storage medium, the method comprising:
receiving a request to insert a data record within a database of a data collection system;
placing the data record within a buffer in a main memory of the data collection system;
selecting a record data structure and a record index structure associated with the data record; and
storing the record data structure and the record index structure within a particular storage chunk of a log file comprising a plurality of storage chunks, including the particular storage chunk, in a storage medium of the database, the storage medium being different than the main memory,
wherein the particular storage chunk includes:
at least one associated coarse index that stores two index values, a low index value representing the lowest value stored in the chunk and a high index value representing the highest value stored in the chunk, and
at least one associated index structure that includes the record index structure that can be used to retrieve the data record, and
other data records different than the data record associated with the received request.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, further comprising:
prior to placing the data record in the buffer, identifying the buffer from a plurality of buffers within a buffer pool having sufficient storage space to place the data record.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein the low index value and the high index value represent:
a time corresponding to a period in which the data record was received at the database.

### Claim 4

(canceled)

### Claim 5

(canceled)

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, further comprising:
generating a header and a trailer associated with the record data structure; and
placing the data record within the storage chunk within a boundary defined by the header and the trailer.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, further comprising:
moving the particular storage chunk with the record data therein from the buffer to the storage medium.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein the associated index structure is a first associated index structure and storing the record data structure and the record index structure within the particular storage chunk includes:
determining that additional space in the database is needed;
identifying a second chunk with an oldest timestamp; and
replacing a pointer to an index structure associated with the second chunk with a pointer to the first associated index structure within the storage medium.

### Claim 9

A computer program product, the computer program product being tangibly embodied on a non-transitory computer-readable storage medium storing instructions that when executed cause a processor to perform a process, the instructions comprising instructions to:
receive at a data collection system, a first request to insert a data record within a database of the data collection system;
place the data record within a buffer in a main memory of the data collection system;
define a record data structure and a record index structure associated with the data record;
store the record data structure and the record index structure within a particular storage chunk of a log file comprising a plurality of storage chunks, including the particular storage chunk, in a storage medium of the database, the storage medium being different than the main memory, wherein the particular storage chunk includes:
at least one associated coarse index that stores two index values, a low index value representing the lowest value stored in the chunk and a high index value representing the highest value stored in the chunk, and
at least one associated index structure that includes the record index structure that can be used to retrieve the data record, and
other data records different than the data record associated with the first request; and
receive a second request to retrieve data records from the data collection system, the request including a first search parameter corresponding to the coarse index;
examine the coarse indexes of the plurality of storage chunks to identify storage chunks that meet the first search parameter of the second request; and
when a storage chunk from the plurality of storage chunks is identified, examine the record index structure to determine data records responsive to the second request and retrieve the data records responsive to the second request.

### Claim 10 (depends on 9)

The computer program product of claim 9, further comprising instructions to:
prior to placing the data record in a buffer, identifying a buffer from a plurality of buffers within a buffer pool having sufficient storage space to place the data record.

### Claim 11 (depends on 9)

The computer program product of claim 9, wherein the low index value and the high index value represent
a time corresponding to the data record was received at the database.

### Claim 12

(canceled)

### Claim 13

(canceled)

### Claim 14 (depends on 9)

The computer program product of claim 9, further comprising instructions to:
generating a header and a trailer associated with the record data structure; and
place the data record within the storage chunk within a boundary defined by the header and the trailer.

### Claim 15 (depends on 9)

The computer program product of claim 9, further comprising instructions to:
move the storage chunk with the record data therein from the buffer to the storage medium.

### Claim 16 (depends on 9)

The computer program product of claim 9, wherein the associated index structure is a first associated index structure and storing the record data structure and the record index structure within the particular storage chunk includes:
determining that additional space in the database is needed;
identifying a second chunk with an oldest timestamp; and
replacing a pointer to an index structure associated with the second chunk with a pointer to the first associated index structure within the storage medium.

### Claim 17

(canceled)

### Claim 18

(canceled)

### Claim 19

(canceled)

### Claim 20

(canceled)

### Claim 21

(canceled)

### Claim 22

(canceled)

### Claim 23

(canceled)

### Claim 24 (depends on 1)

The computer-implemented method of claim 1, wherein the log file is part of a set that includes a plurality of log files, the log files having a respective associated coarse index.

### Claim 25 (depends on 1)

The computer-implemented method of claim 1, wherein the record data structure and the record index structure associated with the data record are selected based on a record type of the data record.

### Claim 26 (depends on 1)

The computer-implemented method of claim 1, wherein the log file is one of a plurality of log files, the log files of the plurality having at least one coarse index that stores a low index value representing the lowest value stored in the log file and a high index value representing the highest value stored in the log file.

### Claim 27

A computer-implemented method including executing, using at least one processor, instructions recorded on a non-transitory computer-readable storage medium, the method comprising:
receiving a request to retrieve data records from a log file for a data collection system, the log file comprising a plurality of storage chunks, wherein each storage chunk includes:
at least one associated coarse index that stores two index values, a low index value representing the lowest value stored in the chunk and a high index value representing the highest value stored in the chunk,
at least one associated record index structure that can be used to retrieve the data record, and
other data records different than the data record associated with the received request, and wherein the request includes a first search parameter corresponding to the coarse index;
examining the coarse indexes of the plurality of storage chunks to identify storage chunks that meet the first search parameter of the request; and
when a storage chunk from the plurality of storage chunks is identified, examining the record index structure to determine data records responsive to the request and retrieving the data records responsive to the request.

### Claim 28 (depends on 27)

The computer-implemented method of claim 27, wherein the first search parameter represents a time span and wherein the low index value and the high index value represent a time corresponding to a period in which the data record was received at the data collection system.

### Claim 29 (depends on 27)

The computer-implemented method of claim 27, further comprising:
prior to examining the record index structure, moving the storage chunk from a storage disk to a main memory of the data collection system.

### Claim 30 (depends on 27)

The computer-implemented method of claim 27, wherein examining the coarse indexes includes looping through a directory entry associated with a respective storage chunk form the plurality of storage chunks and determining whether the first search parameter falls between the high index value and the low index value.

### Claim 31 (depends on 27)

The computer-implemented method of claim 27, further comprising:
prior to examining the coarse indexes, identifying a buffer pool within the data collection system configured to receive storage chunks.

### Claim 32 (depends on 27)

The computer-implemented method of claim 27, wherein the log file is part of a set that includes a plurality of log files, the log files having a respective associated coarse index, and the method further comprises:
prior to examining the coarse index, examining the coarse index of the log files; and
performing the examining of the coarse index for a storage chunk when the first search parameter falls between the high index value and the low index value of the coarse index for the log file.

### Claim 33 (depends on 27)

The computer-implemented method of claim 27, further comprising:
determining if the received request includes a request for the data record in ascending or descending order; and
determining a starting point for the examining the coarse indexes based on whether the request is for the data record in ascending or descending order.
