Abstract: Time-series columnar-based information is received and indexed in a compute infrastructure for cost-effective cloud-based object storage. The approach leverages a file format that enables highly-performant search and retrieval of the data stored in the cloud. In operation, an indexer receives the time-series information, indexes that information according to the file format, and forwards the indexed information for storage to the object store, where it is stored as a set of time-based partitions. A partition comprises a set of files, namely, a manifest file, a data file, and an index file. These files are structured as a compact instance of a set of raw unstructured data that comprises the given partition. Highly-performant information retrieval is enabled in response to a time-bounded query, because operations at a query peer (with respect to one or more partitions) are carried out in real-time during query processing and without requiring retrieval of the data file as a whole.

Abstract: Exemplary embodiments of the present disclosure relate to systems, methods, and non-transitory computer-readable media that achieve eventual consistency of interrelated data in a computing system based on a relationship between the interrelated data (e.g., dependencies between interrelated data) and a configuration of an application programmed to consume the interrelated data. Exemplary embodiments can utilize one or more implicit or explicit dependency graphs, such as an implied or explicit directed acyclic graph corresponding to the interrelated data and the dependencies between the interrelated data. Subsets of the interrelated data can be associated with one or more groups or boundaries in the dependency graphs based on a configuration of applications programmed to consume the interrelated data and/or based on the dependencies between the interrelated data.

Abstract: A blog content search method and system are provided. The blog content search method may include receiving a search request. The search request may include a search term and a search time segment range. The method may include searching for an inverted data block of the search term from a database. Based on a timestamp skip list of the inverted data block and the search time segment range, the inverted data block may be skipped, and instead, another inverted data block may be identified that includes data that meets a condition of the search request. The identified inverted data block may be used for performing a merging. The search result may be obtained based on the result of the merging.

Abstract: A method for multicategory classification of streaming data records includes receiving a list of signature rules, each comprising a Boolean expression of a set of atomic recognizers (ARs) of one or more input fields of an input record and an assignment of a signature if the Boolean expression evaluates to TRUE, generating a list of all signature contexts from the list of signature rules, generating a context lookup table for each context, and processing a stream of input records on which signature detection is performed by using said ARs, said list of signature contexts, and said context lookup table for each context, wherein each input record in the stream of input records is classified into one of a plurality of categories based on the signature detection result, wherein an amount of processing grows sublinearly with a number of signature rules being processed.

Abstract: A computer-implemented method for cognitive matching of narrative data may include collecting a set of data for a party and determining, by analyzing the set of data, an identifiable event for the party. In addition, the method may include identifying, using the identifiable event, a relevant feature of a corpus and providing an output corresponding to the relevant feature.

Abstract: A cognitive matching of narrative data mechanism may include a collecting module configured to collect a set of data for a party and a determining module configured to determine, by analyzing the set of data, an identifiable event for the party. The mechanism may include an identifying module configured to identify, using the identifiable event, a relevant feature of a corpus, and a providing module configured to provide an output corresponding to the relevant feature.

Abstract: Aspects of the invention relate to a computer-implemented method of improving the efficiency of an electronic collateralisation search engine that uses assets distributed on one or more remotely-located asset depositories. The method comprises selecting from a database of asset records of the remotely-located assets of a collateral giver, a subset of asset records having asset characteristics that satisfy a collateral giver's one or more predefined threshold criteria. Restricting a received search of collateral giver's asset records, which match a collateral receiver's query, to the subset of collateral giver's asset records.

Abstract: An online data management (ODM) system can be configured to parse tool data for a particular project provided from a plurality of disparate software tools employed for project management. The ODM system can also be configured to generate a data structure based on the tool data, wherein the data structure comprises a hierarchy of interconnected objects. The ODM system can further be configured to identify relationships between objects of the data structure.

Abstract: A computer program product for data compression is provided. The computer program product includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and executable by a processing circuit to cause the processing circuit to execute software compression for first requests for data compression that have respective sizes below a predefined threshold, forward second requests for data compression having respective sizes above the predefined threshold to a hardware accelerator and maintain a persistence of a compression dictionary used for executing the second requests across executions of the first and second requests.

Abstract: According to one embodiment, an information processing terminal includes a generator, an acquisition unit, and an output unit. The generator analyzes an electronic document to generate a metadata item including text information in an electronic document and structure information on the electronic document. The acquisition unit transmits the metadata item to an information management apparatus, causes the information management apparatus to estimate a similar metadata item similar to the metadata item and acquires an annotation information item corresponding to the similar metadata item. The output unit outputs the annotation information item in association with the electronic document.

Abstract: One embodiment provides a method comprising maintaining a multi-dimensional data structure partitioned into cells utilizing a tree data structure (“tree”) comprising intervals for each dimension of a multi-dimensional space. To partition an interval for a node of the tree into multiple subintervals, multiple leaf nodes (“leaves”) are generated, each leaf descending from the node. To merge multiple intervals for multiple nodes of the tree, a parent node (“parent”) and multiple leaves descending from the parent are generated, the parent and the leaves are time constrained, and the leaves are scheduled for a merger. When transient data in cells included in a list that corresponds to a leaf scheduled for merger expires, each cell in the list is converted into a cell for inclusion in a different list corresponding to a parent of the leaf, each leaf of the parent removed, and the parent turned into a leaf.

Abstract: The present subject matter relates to entity resolution, and in particular, relates to providing an entity resolution from documents. The method comprises obtaining a plurality of documents corresponding to a plurality of entities, from at least one data source. Upon receiving the plurality of documents, the plurality of documents is blocked into at least one bucket based on textual similarity. Further, a graph including a plurality of record vertices and at least one bucket vertex is created. The plurality of record vertices and the at least one bucket vertex are indicative of the plurality of documents and the at least one bucket, respectively. Subsequently, a notification is provided to a user for selecting one of a Bucket-Centric Parallelization (BCP) technique and a Record-Centric Parallelization (RCP) technique for resolving entities from the plurality of documents. Based on the selection, a resolved entity-document for each entity is created.

Abstract: A mechanism for responding to a natural language query. Linguistic parsing is applied to the natural language query to generate a set of language element(s). One or more of those language elements are mapped to parameters and/or data elements of a parameterized report, which is selected for use in responding to the query based on the mapping. The selection of the parameterized report and/or mapping to the parameterized report may use the schema of the underlying dataset that the parameterized report uses in order to perform more precise mapping and selection. The selected parameterized report is then used to construct structured data that is responsive to the query. For instance, the structured data could include visualizations. In this manner, already existing parameterized reports that were previously used to generated structured data in the form of reports, may again be used in order to respond to natural language queries.

Abstract: The present subject matter relates to entity resolution, and in particular, relates to providing an entity resolution from documents. The method comprises obtaining the plurality of documents from at least one data source. The plurality of documents is blocked into at least one bucket based on textual similarity and inter-document references among the plurality of documents. Further, within each bucket, a merged document for each entity may be created based on an iterative match-merge technique. The iterative match-merge technique identifies, from the plurality of documents, at least one matching pair of documents and merges the at least one matching pair of documents to create the merged document for each entity. The merged documents may be merged to generate a resolved entity-document for each entity based on a graph clustering technique.

Abstract: Mechanisms to persist object relations are provided. A project is defined as a series of interrelated objects having dependencies and relationships with one another. The dependencies and relationships are maintained via a storage organization for files that define the objects within a project storage environment for the project. Thus, the dependencies and relationships are not maintained via hardcoded instructions or references that are included within the files.

Abstract: Upon receiving a medium storage request from a client apparatus, an information management server apparatus according to an embodiment evaluates, based on at least one policy file read out based on at least one parent management ID in the medium storage request and user information in the medium storage request, whether medium storage responding to the medium storage request is possible. Upon evaluating that the medium storage is possible, the information management server apparatus creates composite access control which do not violate any management rules included in the at least one policy file.

Abstract: A computer program product for data compression is provided. The computer program product includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and executable by a processing circuit to cause the processing circuit to execute software compression for first requests for data compression that have respective sizes below a predefined threshold, forward second requests for data compression having respective sizes above the predefined threshold to a hardware accelerator and maintain a persistence of a compression dictionary used for executing the second requests across executions of the first and second requests.

Abstract: Embodiments are directed towards managing data. Attributes of model fields of a plurality of model objects may be analyzed. If the analysis of the attributes discovers primary key fields in the model objects, the characteristics of the primary keys may be compared with the characteristics of other model objects. If affirmative results of the comparison indicate that one or more foreign key fields may be in the other model objects, one or more relationships that associate the primary key fields with the foreign key fields may be provided. And, a system model may be provided based on the relationships and the model objects that include the primary key fields and the model objects that include the foreign key fields.

Abstract: The present invention provides a method and system for identifying, retrieving and presenting electronic documents responsive to user queries. The three distinct inventive concepts are relevancy ranking of responsive documents based on component query technique; cross-lingual searching; and search expansion using analytics of initial results to derive and generate a modified query. Each of these inventions enhances document search and retrieval systems and the three solutions may be used separately or in any combination. The three inventions apply in layers above an underlying search system, controlling the submission of requests to the underlying system in support of received search requests, typically originating with an end user. Invention (I) involves use of focus-spectrum expanded search queries and either of two general types of enhanced OR operator that may be offered by the underlying search system.

Abstract: A hardware accelerator includes a bitmap processor that processes a bitmap structure for multiple list population. A population count processor processes population counts for data and aggregates the population counts. The bitmap data structure includes bitmap bit fields interleaved with aggregated population count fields.