Abstract: The technology disclosed relates to improving parallel functional processing using abstractions and methods defined based on category theory. In particular, the technology disclosed provides a range of useful categorical functions for processing large data sets in parallel. These categorical functions manage all phases of distributed computing, including dividing a data set into subsets of approximately equal size and combining the results of the subset calculations into a final result, while hiding many of the low-level programming details. These categorical functions are extraordinarily well-ordered and have a sophisticated type system and type inference, which allows for generating maps and reducing them in an elegant and succinct way using concise and expressive programs that can significantly efficientize a whole software development process.

Abstract: The present invention is directed toward methods and systems for data de-duplication. More particularly, in various embodiments, the present invention provides systems and methods for data de-duplication that may utilize a vectoring method for data de-duplication wherein a stream of data is divided into “data sets” or blocks. For each block, a code, such as a hash or cyclic redundancy code may be calculated and stored. The first block of the set may be written normally and its address and hash can be stored and noted. Subsequent block hashes may be compared with previously written block hashes.

Abstract: A content management apparatus as an embodiment of the present invention associates content information on content with group information on a user participation group in a posting management service that approves control for the content, and stores the associated information. The apparatus then acquires group information on the user participation group from the posting management service, upon receipt of a content control request. The apparatus determines whether or not the requested control is to be approved, based on the acquired group information and the group information stored in association with the content information on the content. This configuration allows the content management apparatus for managing the content to control access authorization according to setting of the group in the posting management service.

Abstract: A method and associated systems for using cloud processing to integrate ETL into an analytic reporting mechanism. A computerized reporting tool receives information from which it infers an information query. The tool determines whether existing reusable ETL code may be used in order to respond to such an inferred query. If not, the tool modifies existing instructions or generates new instructions that may be reused when responding to future queries. The system provisions a virtual computing environment on a cloud-computing platform and populates the environment with virtual components that run the reusable ETL code and then stream the resulting transformed datasets to the tool. The reporting tool then uses the returned datasets to generate or update an animated or real-time report.

Abstract: For each of a plurality of e-mail files contained in a first data repository, at least one score for the e-mail file can be determined. Determining the at least one score can include determining whether the e-mail file contains at least one design element and, responsive to determining that the e-mail file contains at least one design element, determining whether the design element is authored by a template developer. Based on scores assigned to the plurality of e-mail files, a ranking can be assigned to each of the plurality of e-mail files, the ranking assigned to each e-mail file indicating a priority of the e-mail file as a candidate for migration to a second data repository. A listing comprising each of the e-mail files and the ranking assigned to each of e-mail files can be output.

Abstract: Certain example embodiments relate to techniques for real-time generation of temporal comparative and superlative analytics. For instance, certain example embodiments analyze real-time events to generate building blocks that are assemblable into natural language question templates. These natural language question templates, which may include natural language phrases and templated fields, may be comparative or superlative in nature. User selectable options or parameters may be inserted in place of the templated fields, and complete questions, including user selections and the comparative or superlative, may be translated into a formal query language for execution on the real-time data source. In certain example embodiments, a GUI may enable users to build pre-constructed questions with selectable parameters.

Abstract: Various embodiments for optimizing deduplication in a computing storage environment by a processor. Links between data regions are intelligently formed, based on up-to-date popularity statistics, including a number of times a particular one of the data regions was a target for a potential link with another one of the data regions.

Abstract: A method implemented in a content node configured to operate in an information centric network (ICN) comprising allocating each of a plurality of memory spaces coupled to a processor exclusively to a particular thread from a plurality of threads allocated in the processor, wherein the processor is in a content node; assigning each of a plurality of namespaces at a defined level exclusively to one of the particular threads from the plurality of threads based on an assignment algorithm; and partitioning entries from a Forwarding Information Base (FIB) table, wherein the entries map content names to ports on the content node, wherein each entry is partitioned in a FIB sub-table to the memory space allocated to the one of the particular threads associated with the namespace corresponding to the content name contained within the entry.

Abstract: To perform a join operation on database objects, data structures contained in a first database object are distributed across database partitions in accordance with a partitioning scheme. Data structures of the first database object are associated with respective indices computed complementarily to the partitioning scheme. Other indices are computed from the respective data structures of a second database object. The join operation is performed at each of the database partitions on the data structures in the respective first and second database objects having the indices and the other indices in common.

Abstract: A file generation system for storage of structured data onto a distributed database includes an intermediate data generation module to generate a set of intermediate key-value pairs for each of one or more records in at least one subset of the structured data. A key-value pair includes a key and a value corresponding to the key, where the key is a unique identifier of the value. A file generation system further includes an intermediate data sorting module to sort the set of intermediate key-value pairs to generate a plurality of output files. Each of the plurality of output files includes at least one key-value pair. Further, the file generation system includes a file storing module to store the plurality of output files in the distributed database, where the plurality of output files are representative of the structured data.

Abstract: A mechanism is provided in a data processing system for content delivery. The mechanism identifies a candidate user of a social networking service. The candidate user has an associated profile including at least one concept of interest. The mechanism determines a probability that the candidate user is interested in an item of content based on a semantic similarity of the at least one concept of interest and at least one concept tag associated with the item of content using a weighted semantic graph. Responsive to the probability exceeding a probability threshold, the mechanism delivers the item of content to the candidate user. Responsive to receiving feedback comprising at least one action taken by the candidate user with respect to the item of content, the mechanism adjusts weights in the weighted semantic graph.

Abstract: Various systems described herein facilitate storage of files in various formats. A client device can generate a request for a particular file or content. The client device can submit a request with various request parameters. A file service can identify an appropriate file in an appropriate format. The appropriate file in the appropriate format can be provided to the client device in response to the request.

Abstract: A data base system is disclosed for storing meta-data about labeled predominantly non-text items in a collection of labeled predominantly non-text items (lpnt items). The system comprises a storage facility (10), a keyword generation facility (20) and a meta-data enrichment facility (30). The storage facility (10) stores respective meta-data for lpnt items (i) within said collection, said meta-data comprising at least one lpnt item classification (gi) and a lpnt item description (Ti), said classification defining classes. The keyword generation facility (20), which generates keyword data for respective classes, comprises a retrieval module for retrieving terms from lpnt item descriptions of lpnt items associated with said classes.

Abstract: A method and apparatus distributes graph data in a distributed computing environment. The method of distributing graph data in a distributed computing environment includes searching graph data for common sub-graphs, generating a partition by merging the common sub-graphs if, as a result of the search, the common sub-graphs are present and generating a partition by arranging the graph data if, as a result of the search, the common sub-graphs are not present, and calculating a processing cost of the graph data and allocating the partition based on the calculated processing cost.

Abstract: Embodiments described herein enable a storage system configured with a cache, i.e., a caching storage system, to obtain soft locks on a plurality of files, including non-regular file types, supported by a plurality of file access protocols. The cache is illustratively embodied as a flexible volume configured to temporarily store information, such as contents of the files, through replication of attributes and data of the files from an origin storage system. The soft locks are illustratively implemented as delegations; a delegation on a file enables the caching storage system to serve the attributes and the data for the file without verifying validity of the data with the origin storage system.

Abstract: Disclosed are various embodiments for a similarity service. Multiple samplings of user accounts are randomly selected from a pool of user accounts. Interaction history data for each of the user accounts is used to determine item similarities corresponding to each of the user account samplings. The item similarity data is aggregated to determine similar items.

Abstract: A method and apparatus are provided to store transaction records in a retrievable form and to enable subsequent search and retrieval of stored transaction records. Transaction records are captured and then grouped according to predetermined grouping criteria such that they may be indexed to a first level and then efficiently compressed for bulk storage. In the event that records need to be retrieved subsequently, the first level index may be used to select one or more groups of records satisfying first level search criteria and, following retrieval of the selected groups from storage and de-compression, a second level index may be created to enable a more detailed record-level search for matching records in the retrieved groups. Preferably, the same indexing technique is used for both the first and second level of indexing.

Abstract: A method for processing a database query on a database system includes receiving the database query at the database system, determining a sequence of database operations for processing the database query, estimating a number of incoming data elements of the database system to be processed for each of the database operations, estimating a workload of a programmable integrated circuit of the database system for each of the database operations based on the estimated number of incoming data elements, assuming each of the database operations is performed in a single instantiation, selecting a number of instantiations Ni for a database operation i of the sequence of database operations based on the estimated workload of the programmable integrated circuit for the database operation i, and configuring the programmable integrated circuit to execute the determined sequence of database operations, the database operation i is instantiated Ni times.

Abstract: A processor determines a predicted quantity of updates to be made to a set of data using a history of updates. The set of data is associated with a category of replication that indicates a first frequency of data replication to be applied to the set of data. The processor determines whether the first predicted quantity of updates meets a first threshold for a frequency of replication of the set of data. The first threshold indicates an allowed number of updates and meeting the first threshold indicates that an adjustment to the frequency of replication of the set of data is to be initiated. The processor responds to a determination that the first threshold has been met by associating the set of data with a category of replication that has a second frequency of data replication to be applied to the set of data.

Abstract: A method and associated system for generating a service specification of a solution. Each process of at least one process is decomposed into at least one atomic service process. The service specification of the solution to be compatible with both a process model framework that includes the at least one process and a data model framework that includes at least one data element that is indirectly matched to the at least one process. The service specification represents a respective process interface of each atomic service process that performs a respective atomic service in the solution. The customized service specification is stored in a database.