Abstract:
A first query and a second query are received. The first query and the second query are evaluated and, based upon the evaluating, identifying first time series data required to fulfill the first query and second time series data required to fulfill the second query. An extent of overlap of the first time series data and the second time series data is determined. When the extent of overlap exceeds a predetermined threshold, the overlapping data is retrieved from a plurality of data storage devices in parallel, the data retrieved across all of the plurality of storage devices via a single read operation.
Abstract:
A session table includes one or more records, where each record represents a session. Session record information is stored in various fields, such as key fields, value fields, and timestamp fields. Session information is described as keys and values in order to support query/lookup operations. A session table is associated with a filter, which describes a set of keys that can be used for records in that table. A session table is populated using data contained in security information/events. Rules are created to identify events related to session information, extract the session information, and use the session information to modify a session table. A session table is partitioned so that the number of records in each session table partition is decreased. A session table is processed periodically so that active sessions are moved to the current partition.
Abstract:
A method and device are disclosed for an associative and approximate, analog or digital scanning of databases that allows for the asynchronous accessing of data from a mass storage medium. The invention includes circuitry and decision logic at the mass storage medium level for determining a key identifying the data of interest, continuously comparing the key to a signal generated from a reading of the data from the mass storage medium with an approximate or exact matching circuit to determine a pattern match, determining a correlation value between the key and the data as it is read in a continuous fashion, and determining a match based upon a preselected threshold value for the correlation value. The key and data may be either analog or digital.
Abstract:
The present invention relates to a computer implemented method and database management system for storing data on a storage device. A plurality of empty files at the storage device is pre-allocated in a processor of the database management system. Each of the empty files has a pre-determined file size. The empty files are overwritten sequentially with a plurality of data blocks. Each of the data blocks having a pre-determined size. The present invention relates to a database management system (DBMS) that coordinates both the physical and the logical components of data management.
Abstract:
In one embodiment, a method for searching a database includes receiving, by a processor from a user, a message, indicating a query 184, where the query comprises a pattern and determining, by the processor, a first threshold in accordance with a data set of the database 186. The method also includes comparing, by the processor, the pattern to a first key of the data set to produce a comparison 188 and determining, by the processor whether to jump to a second key of the data set or scan to a third key of the data set.
Abstract:
Techniques are provided for generating a "dimensional zonemap" that allows a database server to avoid scanning disk blocks of a fact table based on filter predicates in a query that qualify one or more dimension tables. The zonemap divides the fact table into sets of contiguous disk blocks referred to as "zones". For each zone, a minimum value and a maximum value for each of one or more "zoned" columns of the dimension tables is determined and maintained in the zonemap. For a query that contains a filter predicate on a zoned column, the predicate value can be compared to the minimum value and maximum value maintained for a zone for that zoned column to determine whether a scan of the disk blocks of the zone can be skipped.
Abstract:
The same data is stored in at least two different database management systems (DBMS's), including a columnar DBMS (320.2) and a non-columnar (e.g. row-oriented) DBMS (320.1). The columnar DBMS may provide fast responses to queries involving aggregation, and such queries can be routed to the columnar DBMS. A query may be routed to the non-columnar DBMS if for example the query execution involves only small DBMS tables on the non-columnar DBMS. In some situations, an execution time estimate can be obtained from each DBMS, and the query is routed to the DBMS providing the shortest estimate.