Time series search in primary and secondary memory
First Claim
Patent Images
1. A method for building a searchable data store, comprising:
- electronically receiving machine data produced by devices in an information processing environment;
segmenting the machine data into a plurality of events by determining a beginning and ending of each event in the plurality of events in the machine data;
associating a time stamp with each event in the plurality of events by applying an extraction rule to the machine data segmented for each event in order to extract time information to use as the time stamp for that event;
repeatedly generating buckets in volatile, random access memory;
designating a time span for each bucket of the generated buckets;
inserting a time stamped event in the plurality of events into a particular bucket in the generated buckets based at least in part on the associated time stamp and the time span of the particular bucket;
advancing a full bucket to full bucket status that does not accept further events;
transferring the full bucket into non-volatile storage, the full bucket is available for searching;
determining that a full bucket in non-volatile storage has expired; and
based on determining that the full bucket has expired, moving the full bucket out of active status.
1 Assignment
0 Petitions
Accused Products
Abstract
Methods and apparatus consistent with the invention provide the ability to organize, index, search, and present time series data based on searches. Time series data are sequences of time stamped records occurring in one or more usually continuous streams, representing some type of activity. In one embodiment, time series data is organized into discrete events with normalized time stamps and the events are indexed by time and keyword. A search is received and relevant event information is retrieved based in whole or in part on the time indexing mechanism, keyword indexing mechanism, or statistical indices calculated at the time of the search.
-
Citations
15 Claims
-
1. A method for building a searchable data store, comprising:
-
electronically receiving machine data produced by devices in an information processing environment; segmenting the machine data into a plurality of events by determining a beginning and ending of each event in the plurality of events in the machine data; associating a time stamp with each event in the plurality of events by applying an extraction rule to the machine data segmented for each event in order to extract time information to use as the time stamp for that event; repeatedly generating buckets in volatile, random access memory; designating a time span for each bucket of the generated buckets; inserting a time stamped event in the plurality of events into a particular bucket in the generated buckets based at least in part on the associated time stamp and the time span of the particular bucket; advancing a full bucket to full bucket status that does not accept further events; transferring the full bucket into non-volatile storage, the full bucket is available for searching; determining that a full bucket in non-volatile storage has expired; and based on determining that the full bucket has expired, moving the full bucket out of active status. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A system that builds a searchable data store, comprising:
-
a processor and memory coupled to the processor, the memory storing program instructions that when executed cause; electronically receiving machine data produced by devices in an information processing environment; segmenting the machine data into a plurality of events by determining a beginning and ending of each event in the plurality of events in the machine data; associating a time stamp with each event in the plurality of events by applying an extraction rule to the machine data segmented for each event in order to extract time information to use as the time stamp for that event; repeatedly generating buckets in volatile, random access memory; designating a time span for each bucket of the generated buckets; inserting a time stamped event in the plurality of events into a particular bucket in the generated buckets based at least in part on the associated time stamp and the time span of the particular bucket; advancing a full bucket to full bucket status that does not accept further events; transferring the full bucket into non-volatile storage, the full bucket is available for searching; determining that a full bucket in non-volatile storage has expired; and based on determining that the full bucket has expired, moving the full bucket out of active status. - View Dependent Claims (7, 8, 9, 10)
-
-
11. A computer program product including memory that stores program instructions that, when executed on a computer, cause:
-
electronically receiving machine data produced by devices in an information processing environment; segmenting the machine data into a plurality of events by determining a beginning and ending of each event in the plurality of events in the machine data; associating a time stamp with each event in the plurality of events by applying an extraction rule to the machine data segmented for each event in order to extract time information to use as the time stamp for that event; repeatedly generating buckets in volatile, random access memory; designating a time span for each bucket of the generated buckets; inserting a time stamped event in the plurality of events into a particular bucket in the generated buckets based at least in part on the associated time stamp and the time span of the particular bucket; advancing a full bucket to full bucket status that does not accept further events; transferring the full bucket into non-volatile storage, the full bucket is available for searching; determining that a full bucket in non-volatile storage has expired; and based on determining that the full bucket has expired, moving the full bucket out of active status. - View Dependent Claims (12, 13, 14, 15)
-
Specification