A method for storing time-based data streams in a high capacity network, the method comprising: receiving a time-based data storage request from an application, the data storage request is associated with one or more data streams, each of the one or more data streams comprising a plurality of time-ordered data items having a header comprising two or more timestamps representing a time interval associated with each of the plurality of time-ordered data items, wherein the timestamps representing a time interval associated with each of the plurality of time-ordered data items comprise a first timestamp, tBegin, indicating data item's begin time and a second timestamp, tEnd, indicating data item's end time; processing the received data storage request to accumulate time-ordered data items in a plurality of data files and identify time-based information and corresponding virtual offset information related to the accumulated data items; storing the time-based information and the virtual offset information related to the accumulated data items in a data repository; wherein each entry in the data repository includes time-based information associated with the entry, the time-based information comprising a lowest tBegin timestamp for items associated with the entry, a highest tBegin timestamp for items associated with the entry, a lowest tEnd timestamp for items associated with the entry, and a highest tEnd timestamp for items associated with the entry; determining whether adjustment is necessary for sorting of the stored data in the data repository; comparing the time-based information related to the accumulated data items with data entries previously stored in the data repository; determining whether at least one of a) to d):- a) a new entry's highest tBegin timestamp is not strictly greater than a previous entry's highest tBegin timestamp, b) the new entry's lowest tBegin timestamp is not strictly greater than the previous table entry's lowest tBegin entry, c) the new entry's highest tEnd timestamp is not strictly greater than the previous table entry's highest tEnd timestamp, d) the new entry's lowest tEnd timestamp is not strictly greater than the previous table entry's lowest tEnd timestamp; selectively performing the sorting adjustment responsive to the determination; and selectively extending a time range associated with the time-based information based on the determination. receiving a time-based data storage request from an application, the data storage request is associated with one or more data streams, each of the one or more data streams comprising a plurality of time-ordered data items having a header comprising two or more timestamps representing a time interval associated with each of the plurality of time-ordered data items, wherein the timestamps representing a time interval associated with each of the plurality of time-ordered data items comprise a first timestamp, tBegin, indicating data item's begin time and a second timestamp, tEnd, indicating data item's end time; processing the received data storage request to accumulate time-ordered data items in a plurality of data files and identify time-based information and corresponding virtual offset information related to the accumulated data items; storing the time-based information and the virtual offset information related to the accumulated data items in a data repository; wherein each entry in the data repository includes time-based information associated with the entry, the time-based information comprising a lowest tBegin timestamp for items associated with the entry, a highest tBegin timestamp for items associated with the entry, a lowest tEnd timestamp for items associated with the entry, and a highest tEnd timestamp for items associated with the entry; determining whether adjustment is necessary for sorting of the stored data in the data repository; comparing the time-based information related to the accumulated data items with data entries previously stored in the data repository; determining whether at least one of a) to d):- a) a new entry's highest tBegin timestamp is not strictly greater than a previous entry's highest tBegin timestamp, b) the new entry's lowest tBegin timestamp is not strictly greater than the previous table entry's lowest tBegin entry, c) the new entry's highest tEnd timestamp is not strictly greater than the previous table entry's highest tEnd timestamp, d) the new entry's lowest tEnd timestamp is not strictly greater than the previous table entry's lowest tEnd timestamp; a) a new entry's highest tBegin timestamp is not strictly greater than a previous entry's highest tBegin timestamp, b) the new entry's lowest tBegin timestamp is not strictly greater than the previous table entry's lowest tBegin entry, c) the new entry's highest tEnd timestamp is not strictly greater than the previous table entry's highest tEnd timestamp, d) the new entry's lowest tEnd timestamp is not strictly greater than the previous table entry's lowest tEnd timestamp; selectively performing the sorting adjustment responsive to the determination; and selectively extending a time range associated with the time-based information based on the determination.