Abstract: A mechanism is provided for backing up metadata in a data storage system. Given metadata stored on the data storage system is implemented by way of a tree structure operable by fixed mapping. A stream of snapshots is taken of leaves in the metadata tree structure of given metadata stored on persistent data storage. The metadata tree structure of the given metadata stored on the persistent data storage is reconstructed on a basis of the stream of snapshots taken for backing up the given metadata stored on the persistent data storage. A journal over the reconstructed metadata tree structure is then replayed. In response to a given status discrepancy being flagged in respect of any given metadata, the status of a given leaf corresponding thereto in the reconstructed data tree structure is modified for consistency with the corresponding journal entry in the journal for that given metadata.

Abstract: A method for generating a pattern matching machine for identifying matches of a plurality of symbol patterns in a sequence of input symbols, the method comprising: providing a state machine of states and directed transitions between states corresponding to the plurality of patterns; applying an Aho-Corasick approach to identify mappings between states in the event of a failure, of the state machine in a state and for an input symbol, to transition to a subsequent state based on the directed transitions of the state machine, characterized in that one of the symbol patterns includes a wildcard symbol, and mappings for one or more states representing pattern symbols including the wildcard symbol are based on an input symbol to be received, by the pattern matching machine in use, to constitute the wildcard.

Abstract: The subject disclosure is directed towards a sensor fusion interface that enables interaction between one or more entities of a physical environment and a computerized device component. A plurality of sensor modules generate multiple sensor input data associated with one or more entities in an environment and store such data in a shared library in accordance with a uniform and common schema. The multiple sensor input data is refined until a certain level of accuracy is achieved. Using the sensor fusion interface, entity state data is extracted from the shared library and exposed to the computerized device component.

Abstract: In one embodiment, a method includes receiving an input corresponding to a search query from an online page of a social-networking system. The online page corresponds to a target user of the social-networking system. The method also includes identifying one or more of a number of content objects associated with the target user. The association is based at least in part on analyzing text, audio, or visual content of each of the plurality of content objects as well as interactions by the target user with each of the plurality of content objects. The method also includes scoring each of the identified content objects based at least in part on an affinity score of the content object relative to a querying user; and ranking each of the identified content objects based at least in part on the affinity score.

Abstract: Documents can be deconstructed into component blocks for reuse in productivity applications using a document shredder. The document shredder can identify specific objects within a source document that are likely to be reused, replicate the objects, and store the objects, or component blocks, separate from the source document. The productivity application can access the objects and present these objects to a user of the productivity application for easy insertion into the user's document. The component blocks, or identified relevant objects can be from document sources of previously generated content from a same or different author than the user of a productivity application.

Abstract: Altering a database structure based on software updates in a distributed computing system can include identifying a plurality of software updates that include alterations to structural elements in the database structure and identifying, for the plurality of software updates, a plurality of alterations corresponding to a first structural element of the structural elements. A combined alteration can be generated by combining the plurality of alterations. A database statement can be generated for altering the first structural element according to the combined alteration. The database structure can then be updated using the database statement. The structural elements can define logical relationships between data stored in the database structure. The alterations can be expressed using a markup language and the database statement can be expressed using a query language.

Abstract: The present invention extends to methods, systems, and computing system program products for incrementally calculating Z-score for Big Data or streamed data. Embodiments of the invention include incrementally calculating one or more components of a Z-score for a modified computation subset based on one or more components of a Z-score calculated for a pre-modified computation subset and then calculating a Z-score for a selected data element in the modified computation subset based on one or more of the incrementally calculated components. Incrementally calculating Z-score avoids visiting all data elements in the modified computation subset and performing redundant computations thereby increasing calculation efficiency, saving computing resources and reducing computing system's power consumption.

Abstract: Disclosed herein are distributed ledger systems and methods for efficiently creating and updating a query optimized distributed ledger. In particular, the present disclosure introduces methods and apparatuses for efficiently updating indexes when new blocks are added to the distributed ledger by using snapshots of data and appending new snapshot tables and indexes to previous snapshot tables and indexes.

Abstract: The present specification provides a method comprising: providing a value file containing a value entry associated with a recording event and a recording record file containing a recording record entry associated with the value entry and also with the recording event. The method also comprises, at a computing device, associating in a data quantum file the value entry with the corresponding recording record entry; generating a data quantum unique identifier by applying an algorithm to the data quantum file such that any change to the value entry or the recording record entry produces a corresponding change to the data quantum unique identifier according to the algorithm; and associating in a registration file the data quantum unique identifier and a data quantum file locator. The data quantum unique identifier allows for detecting alterations of any one of the value entry and the recording record entry.

Abstract: A method is provided for rendering a representation of and interacting with transmedia content on an electronic device. Transmedia content data is received at the electronic device. The transmedia content data comprises: a plurality of transmedia content data items; linking data which define time-ordered content links between the plurality of transmedia content data items, whereby the plurality of transmedia content data items are arranged into linked transmedia content subsets comprising different groups of the transmedia content data items and different content links therebetween; a visualization model of the transmedia content data; and a hierarchical structure of the linked transmedia content subsets and clusters of linked transmedia content subsets.

Abstract: A technology is described for managing storage snapshots of storage volumes. An example method may include launching a compute service function on computing resources in response to an event, the compute service function being configured to: retrieve from a data store a storage snapshot policy for invoking storage snapshots of storage volumes assigned to computing instances included in a service provider environment; identify at least one tag assigned to at least one computing instance included in the service provider environment that corresponds to the storage snapshot policy; identify a storage volume assigned to a computing instance associated with the at least one tag identified as corresponding to the storage snapshot policy; and create a storage snapshot of the storage volume assigned to the computing instance based in part on the storage snapshot policy.

Abstract: A method and system for generating a clarity grading look-up table includes collecting actual inclusion parameter data for a plurality of gems, where the actual inclusion parameter data includes an actual clarity grade and an actual inclusion parameter data combination. A mathematical relationship between a clarity grade and a particular inclusion parameter combination is then extrapolated from the actual inclusion parameter data. A derived clarity grade is then assigned to a plurality of inclusion parameter combinations as a function of the mathematical relationship and a set of inputted inclusion parameters. Also, a method and system for providing a clarity grade includes receiving a plurality of inclusion characteristics associated with a gem and parameterizing each of the inclusion characteristics, so that a parameter value is assigned to each inclusion characteristic. The parameter values are then input to a mathematical formula so as to provide a parameterized clarity grade for the gem.

Abstract: In embodiments of field value search drill down, a search system exposes a search interface that displays one or more events returned as a search result set. A field-value pair can be emphasized in the field-value pairs of an event displayed in the search interface, and a menu is displayed with search options that are selectable to operate on the emphasized field-value pair of the event. The menu includes the search options to add search criteria of the emphasized field-value pair to a search command in a search bar of the search interface, exclude the search criteria of the emphasized field-value pair from a search, or create a new data search based on the emphasized field-value pair. A selection of one of the search options in the menu can be received, and the search command in the search bar is updated based on the search option that is selected.

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.

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.

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.

Abstract: Disclosed herein is a data estimation technique for a data intake and query system. The system receives user inputs indicative that a first data source is to be the subject of a storage related estimate. The system receives a first plurality of events generated by the first data source. The system indexes only a sample of the received first plurality of events, based on a sampling criterion, where the sample is fewer than all of the first plurality of events. The system generates the storage related estimate based on at least some of the first plurality of events, and causes an indication of the estimate to be output to a user.

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.

Abstract: Methods, systems, and computer-readable media are provided for facilitating mapping of semantically similar terms between and among two or more information systems. In particular, to facilitate automatic discovery, establishment, and/or statistical validation of linkages between a plurality of different nomenclatures employed by a plurality of information systems, such as multiple electronic health record systems. In embodiments, the imputation of latent synonymy in corpora comprised of samples of historical records from each system enables automated terminology mapping between disparate systems' records, thereby establishing reliable linkages that may subsequently be utilized for realtime decision support, data mining-based research, or other valuable purposes.

Abstract: A search engine to index web content with user content. A server computer receives, from a first client computer operated by a first user, an identification of first web content displayed by a web browser of the first client computer in a main browser window. The identification of the first web content is transmitted by the first user to the server computer via a user interface separate from the main browser window. The server computer then indexes the first web content. In response to receiving a search query from a web browser of a second client computer operated by a second user, the server computer transmits search results to the web browser of the second client computer. The search results include the first web content identified by the first user in a position relative to identifications of other web content received from other users.