MANAGING STORAGE OF INDIVIDUALLY ACCESSIBLE DATA UNITS
A method includes determining a length of a file and storing the length of the file in a first memory location. An endpoint of a last complete record within the file is determined and the endpoint is stored in a second memory location. The length of the file stored in the first memory location is compared to a current length of the file, and a data structure associated with the file is updated beginning at the endpoint if the current length of the file exceeds the length of the file stored in the first memory location.
1 . A method including:
determining a length of a file and storing the length of the file in a first memory location;
determining an endpoint of a last complete record within the file and storing the endpoint in a second memory location;
comparing the length of the file stored in the first memory location to a current length of the file; and
updating a data structure associated with the file beginning at the endpoint if the current length of the file exceeds the length of the file stored in the first memory location.
2 . The method of claim 1 wherein the data structure is an associative data structure.
3 . The method of claim 2 wherein the data structure is a binary tree or a hash table.
4 . The method of claim 1 wherein the endpoint also represents an end of the file.
5 . The method of claim 1 wherein the endpoint precedes an incomplete record in the file.
6 . The method of claim 1 further including checking the file for errors.
7 . The method of claim 6 wherein checking the file for errors includes determining whether the current length of the file is smaller than the length of the file stored in the first memory location
8 . The method of claim 1 wherein the file is an uncompressed data file.
9 . A method including:
simultaneously adding data from a data stream to a first file and to a buffer;
transferring the data associated with the buffer to a compressed file after a predefined condition is satisfied; and
after the data from the buffer has been transferred to the compressed file, creating a second file to receive data from the data stream.
10 . The method of claim 9 wherein the first file is deleted after the data from the buffer has been transferred to the compressed file.
11 . The method of claim 9 wherein status information identifies whether the first file is active.
12 . The method of claim 11 wherein the status information is locked while the data associated with the buffer is being transferred to the compressed file.
13 . The method of claim 11 wherein the status information is updated to reflect the creation of the second file, a deletion of the first file, and a transfer of data between the buffer and the compressed file.
14 . The method of claim 12 wherein, while the status information is locked, the status information is not accessible by indexing or search operations.
15 . The method of claim 13 wherein the status information is unlocked after it has been updated.
16 . The method of claim 15 wherein the first file is deleted after the status information has been updated.
17 . The method of claim 9 wherein the predefined condition is based on time.
18 . The method of claim 9 wherein the predefined condition is based on the size of the first file.
19 . The method of claim 9 wherein the predefined condition is based on a number of records.
20 . A computer-readable medium that stores executable instructions for use in obtaining a value from a device signal, the instructions for causing a computer to:
determine a length of a file and store the length of the file in a first memory location;
determine an endpoint of a last complete record within the file and store the endpoint in a second memory location;
compare the length of the file stored in the first memory location to a current length of the file; and
update a data structure associated with the file beginning at the endpoint if the current length of the file exceeds the length of the file stored in the first memory location.
21 . The computer-readable medium of claim 20 wherein the data structure is an associative data structure.
22 . The computer-readable medium of claim 21 wherein the data structure is a binary tree or a hash table.
23 . The computer-readable medium of claim 20 wherein the endpoint also represents an end of the file.
24 . The computer-readable medium of claim 20 wherein the endpoint precedes an incomplete record in the file.
25 . The computer-readable medium of claim 20 wherein the instructions further cause the computer to check the file for errors.
26 . The computer-readable medium of claim 25 wherein checking the file for errors includes determining whether the current length of the file is smaller than the length of the file stored in the first memory location.
27 . The computer-readable medium of claim 20 wherein the file is an uncompressed data file.
28 . A computer-readable medium that stores executable instructions for use in obtaining a value from a device signal, the instructions for causing a computer to:
simultaneously add data from a data stream to a first file and to a buffer;
transfer the data associated with the buffer to a compressed file after a predefined condition is satisfied; and
after the data from the buffer has been transferred to the compressed file, create a second file to receive data from the data stream.
29 . The computer-readable medium of claim 28 wherein the first file is deleted after the data from the buffer has been transferred to the compressed file.
30 . The computer-readable medium of claim 28 wherein status information identifies whether the first file is active.
31 . The computer-readable medium of claim 30 wherein the status information is locked while the data associated with the buffer is transferred to the compressed file.
32 . The computer-readable medium of claim 30 wherein the status information is updated to reflect the creation of the second file, a deletion of the first file, and a transfer of data between the buffer and the compressed file.
33 . The computer-readable medium of claim 31 wherein while the status information is locked, the status information is not accessible by indexing or searching operations.
34 . The computer-readable medium of claim 32 wherein the status information is unlocked after it has been updated.
35 . The computer-readable medium of claim 34 wherein the first file is deleted after the status information has been updated.
36 . The computer-readable medium of claim 28 wherein the predefined condition is based on time.
37 . The computer-readable medium of claim 28 wherein the predefined condition is based on the size of the first file.
38 . The computer-readable medium of claim 28 wherein the predefined condition is based on a number of records.
39 . A system including:
means for determining a length of a file and storing the length of the file in a first memory location;
means for determining an endpoint of a last complete record within the file and storing the endpoint in a second memory location;
means for comparing the length of the file stored in the first memory location to a current length of the file; and
means for updating a data structure associated with the file beginning at the endpoint if the current length of the file exceeds the length of the file stored in the first memory location.
40 . A system including:
means for simultaneously adding data from a data stream to a first file and to a buffer;
means for transferring the data associated with the buffer to a compressed file after a predefined condition is satisfied; and
means for creating a second file to receive data from the data stream after the data from the buffer has been transferred to the compressed file.