Abstract: A method for categorizing content related to an entity comprising locating at least one source associated with an entity, requesting access to the at least one source, receiving a set of requirements to receive a first set of content from one of the at least one sources, accommodating the set of requirements associated with source, receiving the first set of content, parsing the first set of content, wherein predetermined content is removed thereby creating a second set of content, categorizing the second set of content based on a predetermined set of categories, wherein the categories are based on the source, and storing the second set of content.

Abstract: A computer system receives a data stream with a plurality of packets. In response to receiving the data stream with the plurality of packets, the computer system distributes individual packets of the plurality of packets to the inputs of each of a plurality of processing nodes. Each respective processing node has a local queue storing a respective number of packets to be processed by the respective processing node. Distributing a respective packet of the plurality of packets to the inputs of each of the plurality of processing nodes includes delaying sending the respective packet to each of the plurality of processing nodes by a delay time that is a non-linear function of an average number of packets in the local queues of the respective processing nodes.

Abstract: A computer system identifies high-value information in data streams. The computer system receives a filter graph definition. The filter graph definition includes a plurality of filter nodes, each filter node including one or more filters that accept or reject packets. Each respective filter is categorized by a number of operations, and the one or more filters are arranged in a general graph. The computer system performs one or more optimization operations, including: determining if a closed circuit exists within the graph, and when the closed circuit exists within the graph, removing the closed circuit; reordering the filters based at least in part on the number of operations; and parallelizing the general graph such that the one or more filters are configured to be executed on one or more processors.

Abstract: Disclosed herein are systems and methods for joining datasets. The system may include one or more processors and a memory storing instructions that, when executed by the one or more processors. The processor may cause the system to perform determining at least a first database table to be annotated, the first database table including a set of columns and rows of a dataset. In some embodiments, the system may include determining at least one typeclass that applies to one or more columns included in the first database table, wherein the typeclass describes values stored in the one or more columns and annotating the one or more columns, wherein the annotated columns are associated with the typeclass.

Abstract: A lower-dimensional representation (e.g., approximation) of a dataset is determined. The lower-dimensional representation can be used, for example, to perform semantic document analysis. Given a matrix of input data points, where each entry of the matrix indicates a number of times a particular term in a set of terms appears in a particular document in a set of documents, a lower-dimensional compressed matrix is obtained from the matrix by sampling rows of the matrix based on a target rank parameter, a desired accuracy tolerance, leverage scores calculated for the rows, and/or distances from rows of the matrix to a span of the initial set of sampled rows. The compressed matrix is used to determine a similarity metric indicative of a degree of similarity between documents. The documents can then be classified into a same document cluster or different clusters based on whether the similarity metric satisfied a threshold value.

Abstract: A method and a system for converting and replicating data stored in a source database into target database without a load of the source database due to a replication operation. The system includes a first operating server for the source database, a second operating server for the target database, and a replication server extracting a structured query language (SQL) transmitted from a client to the source database in a network stream transmitted from a client to the first operating server and transmit the converted data structure to the second operating server, thereby synchronizing the source database with a replication database.

Abstract: A method, a master database node and a subscriber database node for optimizing an index. The method for optimizing index includes: checking, by a master database node, if role information of an index matches role information of the master database node, when the index is added into the master database node; updating database information by using the index when the role information of the index matches the role information of the master database node. In this invention, unnecessary indexes in the master database node and the subscriber database node are reduced while keeping the schema the same. Furthermore, unnecessary logs transmitted from the master database node to the subscriber database node are reduced.

Abstract: A method for processing text information is provided, the method including: obtaining text information and extracting text characters contained in the text information; extracting, from the text characters, target characters satisfying a predetermined rule; calculating a filtering index of the text information according to the target characters; and when the filtering index meets a predetermined condition, executing an operation corresponding to the predetermined condition on the text information. In addition, an apparatus for processing text information is further provided. The method and apparatus for processing text information can improve the accuracy and efficiency of filtering out junk text information.

Abstract: A method, a computer program product and a system are provided. A case expression is analyzed for redundant expressions, patterns equivalent to a built-in function, and specific functions to form a simplified expression, wherein the case expression is written in a language supported by a database management system. The simplified expression is optimized based on a cost benefit evaluation of no optimization, native code generation, hashing inputs, and a results caching algorithm to form an execution plan. The execution plan is utilized in the database management system for the case expression.

Abstract: Described herein are methods, systems, and storage media having computer-processable instructions for cross-referencing in a computationally efficient manner different data sets each having pluralities of n-dimensional identifiers of physical assets. The disclosed cross-referencing approach can be used to determine relationships between different assets and their respective asset identifier strings. The relationships can be established based on user-selected heuristics. For example, at least two asset identifier strings can be compared, and user-defined heuristics can be applied to determine whether “a match” exists. A match can be defined according to the particular heuristic. In one instance, the comparison and heuristic can be applied to determine if two different asset identifier strings refer to a single physical asset.

Abstract: A distributed file system (DFS) is provided that is configured to store data in a General Parallel File system (GPFS) and interface with a client configured to interface with a HADOOP Distributed File System (HDFS). The DFS includes a first Node; and a plurality of second Nodes including the GPFS. The first Node is configured to convert an HDFS command from the client into a GPFS command, apply the GPFS command to the GPFS to access a GPFS file, format an HDFS data structure to include identifiers of a set of the second nodes storing the GPFS file, a filename of the GPFS file, and an offset into the GFPS file, and send the HDFS data structure to the client. Each of the second Nodes is configured to access the GPFS using a part of the HDFS data structure received from the client.

Abstract: A system synchronizes change-data in a multi-tenant system with one or more external service provider systems.

Abstract: The subject matter of this disclosure relates to a software platform that ingests data from a variety of data sources, processes the data, and makes the data available for search. In addition, a data portal is described through which users can quickly find information and improve metadata to take advantage of the enterprise's data assets. Various aspects of disclosed software platforms include technologies for obtaining metadata without touching underlying data assets, technologies for using table or database lineage as a factor in determining document relevance, processes for receiving data pushed from data sources, and processes for exposing what a user needs to do to access particular data assets.

Abstract: A method is provided for reducing computer memory usage and processing time in assessing effectiveness of a prediction model. The method includes acquiring a plurality of records and sorting the records based on prediction values. The method also includes determining two of three performance data parameters, including a number of selected records and a number of correct decisions, and determining a level of effectiveness of the prediction model based on the two of three performance data parameters. The method further includes generating a graph illustrating the level of effectiveness of the prediction model based on the two of three performance parameters, and visually conveying the level of effectiveness of the prediction model utilizing the generated graph.

Abstract: A method, system and computer program product for storing a sub-table by deciding one of a plurality of table storage areas, the sub-tables resulting from partitioning of a table in a database. To provide efficient table partitioning, a database is described for distributively locating a plurality of sub-tables resulting from partitioning of a table in a database. This includes an acquiring section that monitors access occurrences to each of the sub-tables to acquire a history of access occurrences. Also a deciding section decides a table storage area in which a sub-table is to be located, based on the history of access occurrences to each of the sub-tables.

Abstract: Systems, methods, and computer programmable products are described herein for tracking modifications of a hierarchical database table of an application. Data including a modification to the hierarchical database table having a plurality of database entries is received. A change trigger table having a record corresponding to the modification of a database entry of the plurality of database entries is defined. The change trigger table is provided to a unified instance authorization application for further definition of an explosion database table.

Abstract: Described herein are methods, systems, and storage media having computer-processable instructions for assigning an n-dimensional asset identifier to an asset (n?3). The identifier can be generated by determining a position of the asset in n dimensions, wherein the position is based at least on the center of mass of the asset's geometry. Extents are determined for each of the n dimensions, wherein each extent is measured from the center of mass to a surface of an n-dimensional bounding polytope containing the asset. The position and the extents of the asset can then be encoded or embedded into a single, non-opaque, code string. The position and the extent information are intrinsic to the string.

Abstract: To reduce a burden on a user in editing tree structure data with a text editor. When a selection range is designated on an edit screen, a node selection unit of a tree structure data editing device selects one or more node IDs in the tree structure data, based on the position of the selection range. When a paste target for the selection range is designated on the edit screen, a connection target determination unit determines a connection target node ID in the tree structure data, based on the position of the paste target. A tree structure data editing unit edits the tree structure data such that the node or nodes identified by the one or more node IDs is/are connected to the node identified by the connection target node ID. A conversion unit convers the tree structure data edited by the tree structure data editing unit into text data. A display control unit updates the edit screen displayed, based on the text data converted by the conversion unit.

Abstract: Embodiments of the disclosure provide a data write-in method and apparatus. The data write-in method includes: selecting a target replica server from a plurality of replica servers managed by a metadata server according to remaining capacity of the plurality of replica servers; selecting a write-in disk in the target replica server according to remaining capacity and load of disks managed by the target replica server; and storing write-in data into the write-in disk through the target replica server.

Abstract: A technique for archiving NAS (network attached storage) servers includes replicating multiple locally-backed volumes, which support respective file systems of a NAS server, to respective cloud-backed volumes backed by a cloud-based data store. After replication has updated the cloud-backed volumes with contents from the locally-backed volumes, the technique further includes performing a group snapshot operation on the cloud-backed volumes. The group snapshot operation creates a point-in-time version of the cloud-backed volumes, which provides a replica of the NAS server archived in the cloud.