Abstract: Batch, or “offline”, blocking takes a set of records and generates sets (or blocks, hence the name blocking) of potentially matching records for the entire set. The blocks of potential matches are then passed to a matching process to evaluate which records match. Applications include but are not limited to individual matching such as student identification, householding, business matching, supply chain matching, financial matching, news or text matching, and other applications.

Abstract: A processing server is disclosed. The server comprises a processor, a memory, and an application stored in the memory. The application when executed by the processor formats data into a data container, wherein the data is comprised of audio and video content of a movie. The application then writes metadata in to the data container, wherein the metadata identifies what processing has been done on the data and identifies algorithms that are applied to the data, and identifies a source location from which the data container is obtained, and identifies a plurality of different data containers with different versions of the audio or video content that have different processing or algorithms applied to them and the source locations from which the different data containers are obtained. The application then stores the data container in a data store, whereby the data container is sourced to playback devices.

Abstract: The method includes identifying a first data table that includes a set of rows and a structure. The method further includes creating a second data table and a third data table having a matching structure as the first table. The method further includes distributing the set of rows of the first data table, wherein the set of rows is distributed between one or more of the second data table and the third data table based upon preset parameters. The method further includes, generating one or more operations for the set of rows. The method further includes executing one of the one or more generated operations on the second data table and the third data table.

Abstract: A data marketplace infrastructure provides a crowd sourcing solution to development, discovery and publication of decision applications. Applications can be submitted from a user to a data warehouse in association with a data feed. One or more discovery properties are determined with regard to each application. The applications are made available to other client systems in association with the data feed. A relevant data feed and a relevant application can be identified based on satisfaction of a discovery request by the one or more determined discovery properties of the application. The application can be selected and downloaded to the user for evaluation and customization. The customized application can then be submitted to the data warehouse for publication with the other applications associated with the data feed.

Abstract: Various methods and apparatuses are described for performing high speed format translations of incoming data, where the incoming data is arranged in a delimited data format. As an example, the data in the delimited data format can be translated to a fixed field format using pipelined operations. A reconfigurable logic device can be used in exemplary embodiments as a platform for the format translation.

Abstract: A method of communicating data in a data grid. The method includes receiving, from an iterator in a data grid, a search request to search for data matching search criteria in a first memory coupled to a node. The method further includes searching, by a processor of the node, for data in the memory matching the search criteria to obtain result data. The method further includes communicating, by the processor, the result data to the iterator. The method further includes pausing communicating the result data to the iterator in view of a pause condition pertaining to the memory capacity threshold of the second memory. The method further includes, in response to a resume condition, resuming communicating the result data to the iterator.

Abstract: A system and method for data synchronization using revision control includes receiving, by a synchronization module being executed by one or more processors of a server, inbound edits to a shared document from a client, retrieving a first version of the shared document associated with the client from a revision history, updating the first version based on the inbound edits to create a second, adding the second version to the revision history when the second version is not included among a plurality of stored versions of the shared document in the revision history, and incrementing a reference counter that records a number of clients associated with the second version when the second version is included among the stored versions in the revision history. The revision history provides access to the stored versions of the shared document. The revision history includes version data used to access each stored version and the associated reference counters.

Abstract: A computer-implemented method of providing text entry assistance data includes receiving at a system location information associated with a user, receiving at the system information indicative of predictive textual outcomes, generating dictionary data using the location information, and providing the dictionary data to a remote device.

Abstract: Techniques for providing a data confidence index are presented herein. In one embodiment, a method includes setting a default confidence index for a remote computing device, the confidence index indicating trustworthiness of data provided by the remote computing device, the remote computing device operating as part of a network of cooperating devices; applying a plurality of ordered rules for the remote computing device, respective rules comprising a rule pre-condition and a confidence index adjustment, respective rules considering one of a behavior of the remote computing device and a property of the remote computing device; and adjusting the confidence index for the remote computing device responsive to results of applying the plurality of ordered rules. A system and apparatus substantially perform steps of the disclosed method.

Abstract: One embodiment of the present invention provides a system that differentiates service provided to a database user based on a security profile of the user. During operation, the system receives a sequence of commands from a user at a database system. The system then uses the sequence of commands to determine a security profile which indicates whether the user is behaving suspiciously. Next the system associates a resource consumer group with the user based on the security profile. Finally, the system differentiates service provided to the user based on the resource consumer group.

Abstract: The invention provides efficient searching with fuzzy criteria in very large information systems. The technique of the present invention uses the Pigeonhole Principle approach. This approach can be utilized with different embodiments, but the most effective realization would be to amplify some already given intrinsic approximate matching capabilities, like those in the FuzzyFind method [1][2]. Considering the following problem, data to be searched is presented as a bit-attribute vector. The searching operation includes finding a subset of this bit-attribute vector that is within particular Hamming distance. Normally, this search with approximate matching criteria requires sequential lookup for the whole collection of the attribute vector. This process can be easily parallelized, but in very large information systems this still would be slow and energy consuming.

Abstract: A system includes a first storage, a second storage, and a processor. The first storage is configured to store a Cuckoo hash table which includes a plurality of locations. The second storage is configured to store a graph including a plurality of nodes. The processor coupled to the first storage and the second storage is configured to map each of the locations in the Cuckoo hash table to each of the nodes in the graph, and to determine whether a first entry to be added to a first location in the Cuckoo hash table creates a loop in the graph by executing a filter module. More particularly, the processor is to execute the filter module by detecting a presence of the loop before the first entry to occupy the first location in the Cuckoo hash table, the first location associated with a node, in the graph, occupied by a second entry.

Abstract: Described are techniques for processing an instance of a data structure. A request to process an instance of a data structure at a first point in time is received. At least one of the data elements in the data structure is a dynamic data element that uses an association specifying how to access data for the dynamic data element in accordance with criteria evaluated using a current context determined at a point in time. In response to receiving the request, first processing is performed including determining whether the dynamic data element is referenced at the first point in time, and, if so, evaluating the criteria using a current context determined at the first point in time, and retrieving data for the dynamic data element in accordance with a current context determined at the first point in time.

Abstract: A method for updating a plurality of database statistics during a query execution is provided. The method may include receiving a compiled query. The method may also include determining if the received compiled query requires at least one table scan operation on a full table to resolve the received compiled query. The method may further include determining if a plurality of table statistics associated with the full table has not been updated within a pre-defined time-period, whereby the determining is based on the determination that the received compiled query requires at least one table scan operation on the full table to resolve the received compiled query. The method may additionally include collecting a plurality of statistics associated with the full table based on the determination that the plurality of table statistics associated with the full table has not been updated within the pre-defined time-period.

Abstract: A method for performing a comparison between first and second points in time snapshots of a file system entity, the method may include: (I) receiving by a storage system a command that was sent from a host computer, the command is network file system protocol compliant, wherein the command comprises (i) an operation code, and (ii) information about a virtual path, the virtual path that comprises (ii.a) first fields that comprise snapshot comparison parameters indicative of the first and second points in time snapshots of the file system entity, and (ii.

Abstract: A system or computer usable program product for representing a piece of a road as a first ordered series of line segments connected in an end-to-end fashion; representing the piece of the road as a second ordered series of line segments connected in an end-to-end fashion; for each given pair of two consecutive points of the second ordered series of points, determining a corresponding plurality of in-between points from the first ordered series of points; for each given line segment of the second ordered series of line segments, determining a first traffic characteristic value corresponding to the given line segment and a portion of the piece of the road which the given line segment represents; and presenting a visual representation of the piece of the road.

Abstract: Each of a plurality of events associated with a workspace or stream are stored to a functional data structure. Each of the plurality of events includes at least an indication of when an operation in the workspace or stream occurred and who performed the operation. Nodes of a change set history tree corresponding to the events can be recursively identified until a node corresponding to a change set of interest is identified. Responsive to identifying the node corresponding to the change set of interest, the event corresponding to such node can be identified as an event that added the change set of interest to the workspace or stream. The indication of when the operation represented by the event occurred and who performed the operation can be retrieved from the subject event. The indication of when the operation represented by the event occurred, and who performed the operation, can be output.

Abstract: Each of a plurality of events associated with a workspace or stream are stored to a functional data structure. Each of the plurality of events includes at least an indication of when an operation in the workspace or stream occurred and who performed the operation. Nodes of a change set history tree corresponding to the events can be recursively identified until a node corresponding to a change set of interest is identified. Responsive to identifying the node corresponding to the change set of interest, the event corresponding to such node can be identified as an event that added the change set of interest to the workspace or stream. The indication of when the operation represented by the event occurred and who performed the operation can be retrieved from the subject event. The indication of when the operation represented by the event occurred, and who performed the operation, can be output.

Abstract: A dispersed storage device manages a file system directory of a dispersed storage network by receiving a data object to be stored and a user file name of the data object, calculating a data compression function of the data object, creating a file identifier based on a result of the data compression function, creating a source name for the data object using the file identifier and linking the user file name to the source name in the file system directory.

Abstract: According to one embodiment, a system includes an event processing module, a notification controller, and a publication manager. The event processing module includes listeners configured to generate a snapshot of a database. The event processing module also includes an event processor configured to compare the snapshot with a stored historical snapshot to determine data elements in the database that changed, to generate a message indicating the plurality of changes, and to push the message to a queue. The notification controller is configured to receive the message from the queue, to determine, based on stored publication rules, a change from the plurality of changes that should be published, and to format the change based on stored format rules. The publication manager is configured to receive the formatted change, to determine, based on stored subscriptions, whether the formatted change should be communicated to a client, and to communicate the change.