Generating and storing summarization tables for sets of searchable events

    公开(公告)号:US09990386B2

    公开(公告)日:2018-06-05

    申请号:US14815973

    申请日:2015-08-01

    Applicant: Splunk Inc.

    Abstract: Embodiments are directed are towards the transparent summarization of events. Queries directed towards summarizing and reporting on event records may be received at a search head. Search heads may be associated with one more indexers containing event records. The search head may forward the query to the indexers the can resolve the query for concurrent execution. If a query is a collection query, indexers may generate summarization information based on event records located on the indexers. Event record fields included in the summarization information may be determined based on terms included in the collection query. If a query is a stats query, each indexer may generate a partial result set from previously generated summarization information, returning the partial result sets to the search head. Collection queries may be saved and scheduled to run and periodically update the summarization information.

    Taxonomic fingerprinting
    5.
    发明授权

    公开(公告)号:US09953043B1

    公开(公告)日:2018-04-24

    申请号:US14587410

    申请日:2014-12-31

    Inventor: John Sloan

    CPC classification number: G06F17/30321 G06F17/30595 G16H40/20

    Abstract: A method for matching an instance to exemplars within a system includes receiving a plurality of literature regarding medical subject matter; including the received plurality of literature related to the medical subject matter into a text artifact; indexing the artifact using encodings to derive an initial code signature; deriving association rules from the artifact seeded by the signature to obtain a list of terminology to code mappings; receiving extensions to each of the code mappings to augment the mappings with the received extensions; indexing the artifact using the received extensions to obtain an exemplar code signature for the certain subject matter; and storing the generated exemplars for matching and instance; receiving an instance and generating an instance code signature using the received extensions; matching the instance code signature to one or more exemplar code signatures.

    Data restoration utilizing redundancy data

    公开(公告)号:US09922111B1

    公开(公告)日:2018-03-20

    申请号:US14953379

    申请日:2015-11-29

    Abstract: In some embodiments, techniques for data backup and restoration comprise creating a redundancy data element by computing an erasure correcting code on elements of data from a first set of computers that includes a first computer and a second computer, wherein the elements of data includes a first data element from the first computer and a second data element from the second computer; transmitting the redundancy data element to a third computer for storage thereon; receiving a request for data restoration relating to the first data element; creating a restoration data, wherein the restoration data is a reconstruction of the first data element, wherein creating the restoration data includes computing an erasure correcting code on elements of data that include the second data element and the redundancy data element; and providing the restoration data responsive to the request for data restoration.

    Atomical moving data elements between or within linked data structures

    公开(公告)号:US09910908B2

    公开(公告)日:2018-03-06

    申请号:US14831465

    申请日:2015-08-20

    Inventor: Paul E. McKenney

    CPC classification number: G06F17/30595 G06F17/30359 G06F17/30371

    Abstract: A data element of a linked data structure is atomically moved without delaying lockless readers. A status-indicating entity is allocated, associated with the data element, and indicates validity of the data element with respect to the first linked data structure. A copy element, or a pointer thereto, is created from the data element. The status-indicating entity is associated with the copy element and indicates no validity of the copy element with respect to a second linked data structure. The copy element is linked to the second linked data structure. The status-indicating entity is atomically updated to indicate no validity of the data element with respect to the first linked data structure and validity of the copy element with respect to the second linked data structure. The data element is deleted and the status-indicating entity is disassociated from the copy element. Both structures may be deallocated in a deferred reader-friendly manner.

Patent Agency Ranking