Abstract: A method of building a knowledge graph, performed by a processing device, includes: classifying news articles to a main event associated with sub events, using the main event as a first node of the knowledge graph, using the sub events as second nodes of the knowledge graph respectively, connecting the second nodes to the first node, extracting event summaries from the news articles respectively according to a template, using the event summaries as third nodes of the knowledge graph respectively, and connecting each of the third nodes to one of the second nodes according to association between the event summaries and the sub events, extracting commenter identities from the event summaries, and using the commenter identities as fourth nodes of the knowledge graph, and connecting each of the fourth nodes to one of the third nodes.

Abstract: The system includes a search service application builder that provides a search model. The search model represents a search service application for an object. The search model uses an end-user input field for a first attribute for the object and a user-defined search result output field for a second attribute of the object. The search model has code to generate a user interface. The interface includes an input section for receiving values for the first attribute and a search results section for outputting values of the second attribute. The interface also includes code to generate a search query using a search query model for a selected query type. The interface also includes code to receive search result data returned in response to the search query and code to format the search result data for the search results section.

Abstract: Aspects for remote analysis of file system metadata are described. In an example, a computer-readable file from a client system is received. The computer-readable file comprises file system metadata of a file system, and corresponding source location of the file system metadata on a volume of the client system. Thereafter, a target location on a target volume is identified, wherein the target location corresponds to the source location on the volume of the client system. In an example, the file system metadata is replicated onto the target location based on the computer-readable file, for analysis.

Abstract: Aspects of the current subject matter are directed to a user-facing approach for migration of unstructured data. A graphical user interface is provided to enable a user to execute a migration process of attachments between content repositories, where the execution is end to end with simple commands and/or user actions through interaction with the graphical user interface. The commands and/or user actions are translated into a background execution of the steps of the migration process in the proper order with proper parameters. Aspects of the current subject matter provide for the migration process to be transparent to the end user. Logs or reports relating to the migration process may be available and accessible to the user.

Abstract: Aspects of the present invention disclose a method, computer program product, and system for recording changes to records whilst preserving record availability. The method includes one or more processors capturing a change to a record object. The changes include details of the record object to be changed and a change method instruction by which the object is to be changed. The method further includes one or more processors storing a change object as a standalone object and storing the change method instruction and metadata pointing to the record object. The method further includes one or more processors modifying metadata of previous versions of the record object to include a pointer to the change object. The method further includes one or more processors applying the change method instruction to the record object when responding to a retrieve or restore request for the record object.

Abstract: Embodiments described herein are directed to detecting data inconsistencies within a distributed database and identifying the cause thereof. For example, lineage events are emitted from different components of the distributed system that operate on various data files. A consistency checking engine analyzes these events and detects inconsistencies with respect to the data files. The embodiments described herein checks the integrity of the database and assists in understanding the root cause in case of a corruption. Moreover, it provides the timeline for the corruption and whether it is repairable or not. These properties enable determining the right time to restore the customer's database or the right set of actions to repair the corruption. In case of repairable corruption, the correct compensating repair actions may be applied.

Abstract: Techniques are disclosed relating to processing of time-restricted data records. In various embodiments, a computing system receives a request to store a record that includes a timestamp identifying a time to live (TTL) for the record in a database, with the database being organized in a layered data structure. The computing system stores the record in the database in a particular location in the layered data structure, with the particular location being selected based on the TTL timestamp for the record. The timestamp may be used by a compaction process to indicate that the record TTL has expired and the data record may be written to a message queue by an eviction process.

Abstract: A generation device that generates a feature amount range visualization element that defines a continuous feature amount range for each of the factors based on time series data including feature amounts of different factors existing in time series and generates an inter-feature amount visualization element that defines relevance between a first feature amount of a first factor and a second feature amount of a second factor that are continuous in time. The device also generates visualization information indicating a relationship of the feature amounts related to the plurality of different factors by associating, by the inter-feature amount visualization element, a first feature amount range visualization element of the first factor with a second feature amount range visualization element of the second factor.

Abstract: Example embodiments facilitate creation of efficient tree structures (and strategic modification of and manipulation of existing tree structures), such that the resulting tree structures enable rapid computing operations, including, but not limited to, rapid relational set operations (e.g., joining trees, comparing tree structures, determining structural similarities of trees, adding tree nodes, removing or replacing tree nodes, accessing tree data, updating tree data, and so on). An example method relates to a method and/or system for creating and manipulating tree data structures (also simply called trees herein) as, for example, in relational databases. One embodiment uses compact bit-wise path encoding that stores structural data related to tree branches to which a current node belongs.

Abstract: Systems and methods for generation and use of document analysis architectures are disclosed. A model builder component may be utilized to receiving user input data for labeling a set of documents as in class or out of class. That user input data may be utilized to train one or more classification models, which may then be utilized to predict classification of other documents. Trained models may be incorporated into a model taxonomy for searching and use by other users for document analysis purposes.

Abstract: Columns of a non-relational data store may be efficiently dropped. A drop column request for a table stored in a non-relational database may be received. In response to the drop column request, schema information for the table may be updated to filter out the column from subsequent read responses to read requests. A backup of the table is created and evaluated to identify those items in the table that include the column. The column is then deleted from the identified items.

Abstract: Disclosed is a system for tracking user activities with a user identification tag stored at the user's Internet-capable device. For example, the system can store a pixel having a color scheme that identifies the user but that is hidden to the user and identifiable by an external computer. The pixel can be stored in the user device's cache for later identification of the user.

Abstract: A system is presented that profiles authors and social media data across different media platforms and is capable of determining the author's overall social impact. In one aspect, this is accomplished by using a data retrieval service to trawl various web-sites and social media platforms for information about authors which can then be associated with those authors in a profile database. In one example, an author may post an entry on his/her blog and the data retrieval service can access the profile information of the author, on the blog, where various aspects of the profile information (e.g., real name, employee information, home address) can be matched with candidates in a profile database. From the information gathered, authors can be linked across multiple, different platforms, and an overall social impact of each of the authors can be determined.

Abstract: The present disclosure provides an information processing system and an information processing method that, in a material analyzing service that is provided via a network, can appropriately manage data of a high degree of confidentiality. The system and method involve a user terminal that provides a data ID to a combination of first data that relates to a material, and second data that is data obtained by measuring the material and is data whose degree of confidentiality is lower than the first data. The user terminal stores the first data and data ID and transmits the second data and data ID to an information processing device. The information processing device carries out material analysis corresponding to the second data and transmits analysis results data to the user terminal. Accordingly, data having a high degree of confidentiality can be managed appropriately in a material analyzing service over a network.

Abstract: Systems and methods which provide for bidirectional data parity in a multi-service connected environment using a canonicalization and order connection data structure are described. Bidirectional data parity logic using a canonicalization and order connection data structure with respect to a plurality of systems of a multi-service connected environment may provide for the state of a particular order and/or other data for that order being accurately reflected in each such system for which corresponding record is maintained. Using a canonicalization database and an order connection database, bidirectional data parity logic may recognize all records for a particular instance of an order as being for that order, and thus provide data parity for that order throughout all systems having a record for that order instance.

Abstract: Embodiments of the present disclosure are directed to specific, networked, and technological processes and operations. For example, various embodiments are directed to a distributed and collaborative planning tool that allows users to create events based on a presently-approved production plan, enable/disable events submitted by other users, submit proposals, approve proposals, and integrate proposals to update the presently-approved production plan. An event published by a first user is communicated to other users using a single, universal framework that tracks and communicates proposed changes between remote users and their associated client devices during the planning cycle without the need to store multiple iterations of full-size production plans.

Abstract: A digital content delivery tracking method performed by a central server includes generating a transfer chain for first digital content in a database of the central server, wherein the generating is performed by a transfer chain manager; authenticating a first user, wherein the authenticating is performed by a user authenticator; and generating a first ownership transfer node in the transfer chain, generating a first ownership indicator indicating the first digital content, recording the first ownership indicator in the first ownership transfer node, and recording an identifier of the first user in the first ownership transfer node, which are performed by the transfer chain manager.

Abstract: A social intelligence system is presented that streams information from a source, queues the streamed information, analyzes/scores the queued data, and stores the analyzed/scored data in an analysis database. The analyzed/scored data can then be retrieved from the database for post-processing and stored in a client specific database for further reporting. By streaming the data into various message queues and scoring the data before storing in the analysis database, large volumes of data can be efficiently processed and analyzed for a particular person and/or entity.

Abstract: A computing device displays, in a graphical user interface, a data visualization and a plurality of phrases that collectively define the data visualization. The device receives user input to specify a natural language command related to the data visualization. The device determines that the natural language command includes a metacommand to: (1) add a data field to the data visualization, or (2) remove a data field from the data visualization, or (3) replace a data field in the data visualization with another data field. The device determines one or more proposed actions in accordance with the determined metacommand and ranks the proposed actions. The device receives user selection of a first proposed action. In response to the user selection, the device generates and displays an updated data visualization and one or more updated phrases that collectively define the updated data visualization.

Abstract: The present technology proposes techniques for ensuring globally consistent transactions. This technology may allow distributed systems to ensure the causal order of read and write transactions across different partitions of a distributed database. By assigning causally generated timestamps to the transactions based on one or more globally coherent time services, the timestamps can be used to preserve and represent the causal order of the transactions in the distributed system. In this regard, certain transactions may wait for a period of time after choosing a timestamp in order to delay the start of any second transaction that might depend on it. The wait may ensure that the effects of the first transaction are not made visible until its timestamp is guaranteed to be in the past. This may ensure that a consistent snapshot of the distributed database can be determined for any past timestamp.