Abstract: A method, system, and computer program product for detecting data tampering with resilient watermarking is provided. The method accesses a first relational data set on a data repository. The first relational data set includes a plurality of data elements. The first relational data set is sorted to generate a first sorted list and a second sorted list of the plurality of data elements. The method generates a watermark from the first sorted list and the second sorted list. The watermark contains a hash corresponding to the first sorted list and the second sorted list of the plurality of data elements. In response to an access request for the first relational data set, the method verifies an integrity of the first relational data set based on the watermark.

Abstract: Embodiments of a method and/or system of transmitting and/or receiving data is disclosed.

Abstract: Various embodiments disclose a method for maintaining file versions in volatile memory. The method includes storing, in volatile memory for at least a first portion of a first sync interval, a first version of a file that is not modifiable during the at least the first portion of the first sync interval. The method also includes storing, in volatile memory for at least a second portion of the first sync interval, a second version of the file that is modifiable during the at least the second portion of the first sync interval. The method also includes subsequent to the first sync interval, replacing in nonvolatile memory, a third version of the file with the first version of the file stored in volatile memory. Further, the method includes marking the second version of the file as not modifiable during at least a first portion of a second sync interval.

Abstract: Disclosed methods and systems provide domain-specific type ahead suggestions for search query terms with a customer self-service system for a tax return preparation system, according to one embodiment. Type ahead suggestions include suggestions for completing a single search query term and/or suggestions for completing a search query having multiple search query terms. The customer self-service system receives one or more search query terms in a search text box, searches for potential search queries that are likely to complete the one or more search query terms, and provides a selected one of the potential search queries in the search text box as a type ahead suggestion, adjacent to the received one or more search query terms, according to one embodiment. The customer self-service system selects one of the potential search queries based on the received search query terms, the user's profile, and/or the user's tax data, according to one embodiment.

Abstract: Techniques are described herein for leveraging and extending relational data sharding infrastructure to provide comprehensive support for sharding semi-structured and unstructured data, in addition to the relational data, in a single sharded database system. Specifically, techniques are described in which a catalog server pre-gathers all data it needs to answer fetches from a dynamically created temporary lob. In addition, techniques are provided in which a catalog server encodes shard identifiers in lob locators sent to the client. Techniques are provided for pushing down various operators to shard servers.

Abstract: Disclosed are some implementations of systems, apparatus, methods and computer program products for performing data ingestion. A request received from a client device is processed, where the request has a payload including a plurality of data items pertaining to a data object. An identifier associated with the data object is generated. Information including the data items is obtained from the request. The information including the data items is stored in association with the identifier in a first data store, where the first data store is not a relational database. The data items and identifier are obtained from the first data store and stored in a second data store, where the second data store is a relational database. A query including the identifier is processed to obtain the identifier from the query. It is determined whether the identifier obtained from the query is in the first data store.

Abstract: Systems and methods for generating and maintaining data objects may include server(s) for receiving first and second data points associated with entities and root relationships between entities. The first data points may have entity values which are defined according to an entity type and one or more attributes of the entity. The second data points may have relationship values which are defined according to a root relationship type and one or more attributes of the root relationship. The server(s) may generate entity base layer data objects and relationship base layer data objects for the first and second data points. The server(s) may provide access to base layer data objects for identifying contextual relationships between respective base layer data objects. The contextual relationships may be identified by applying conditional rules received from a computing device to data corresponding to the entity values and/or the relationship values.

Abstract: An information processing apparatus includes an acquisition unit that acquires a text being input, and an output unit that, when search information for searching for target information is created or updated, from suggestion information created or updated by being extracted from the target information or the search information, extracts the suggestion information corresponding to the text acquired by the acquisition unit, and outputs display information for displaying the extracted suggestion information with a suggestion content predetermined for each operation authority of a user.

Abstract: An embodiment may involve data values and metadata defining a relational chart, wherein the relational chart includes one or more symbols, and wherein the symbols each contain a respective plurality of symbol segments. The embodiment may further involve one or more processors configured to: receive a request for the relational chart; generate markup language representing the relational chart, wherein generating the markup language involves, for each respective symbol of the one or more symbols: (i) generating a block of the markup language representing the respective symbol, wherein the block includes a unit of the metadata that defines a label for the respective symbol, and (ii) based on the data values, generating sub-blocks of the markup language that are embedded within the block, wherein the sub-blocks represent symbol segments of the respective symbol; and transmit the markup language representing the relational chart.

Abstract: The present disclosure describes systems and methods for enhancing the space utilization of storing keys in hierarchical data structures, such as B+Tree leaf blocks, by partially or fully compressing the keys. Partially compressing the keys may include storing certain keys as offsets from a start key. Fully compressing the keys may include setting a “type” value included in the header of the leaf block to a value indicating that the keys are implicitly represented by an ordinal key index, which defines the ordinal arrangement of keys in the leaf block. Partially or fully compressing keys, according to the implementations described herein, reduces the amount of space needed to store keys in a leaf block of a B+Tree.

Abstract: A request is received to create a graph database from one or more relational databases. For each relational database, data objects in the relational database are identified. For each data object, a graph data object corresponding to the data object is created. The graph data object is linked to the data object. A set of associated data objects in the relational database are determined, and for each associated data object, an associated graph data object is created if a graph data object corresponding to the data object does not exist. For each created graph data object, a graph data relation object is created that represents a relationship between the graph data object and the associated graph data object. Created graph data objects, associated graph data objects, and graph data relation objects are stored in the graph database. The graph database is provided to one or more applications.

Abstract: A method includes receiving a request to process a set of data using a data processing application. The method includes, based on a feature associated with the set of data, selecting between (i) a first mode in which one or more running processes of the data processing application are used to process the set of data and (2) a second mode in which one or more new processes of the data processing application are started up. The method includes causing the data processing application to be executed according to the selected mode to process the set of data.

Abstract: Journey information is mapped by first identifying an acceptable trigger condition type, such as a photo trigger condition type, of a plurality of trigger condition types. Once a journey has begun, a trigger condition of the acceptable trigger condition type may be detected at a mobile computing device, for example when the mobile computing device captures a photo. A location of the mobile computing device is then identified in response to the detection of the trigger condition, and a marker is placed on a map identifying the location. The marker is also associated with data associated with the trigger condition, for example by allowing the photo captured by the mobile computing device to be viewable at the marker.

Abstract: Embodiments of methods and/or systems of manipulating tree expressions are disclosed.

Abstract: A computer-implemented method is provided for evaluating a next action of a target object in an environment. The method includes simulating, by a hardware processor for each of possible actions of the target object in the environment, a next state occurring thereafter to obtain a plurality of simulated next states, based on a pessimistic scenario which is randomly generated by sampling a plurality of costs from a distribution of cost. The distribution of cost is an area where the target object is likely to visit in a near future. The method further includes identifying, by the hardware processor, a safety area for the target object in each of the plurality of simulated next states. The method also includes evaluating, by the hardware processor, each of the possible actions of the target object, based on the safety area.

Abstract: Embodiments for determining processing performed on a data element are provided. A file system call associated with a data element stored in a storage system is detected. The file system call is analyzed. Data lineage for the data element is determined based on the analyzing of the file system call.

Abstract: In one aspect, a computerized method for building a secondary index used to access index keys in a distributed database includes the step of providing a distributed database. The computerized method includes the step of providing a database file of the distributed database or on a cluster. The computerized method includes the step of building a first database index of index keys of the database file. The computerized method includes the step of organizing the first database index. The computerized method includes the step of, based on the organization of the first database index, building a second database index.

Abstract: The present disclosure provides a method and apparatus for pushing search results, an apparatus and a non-volatile computer storage medium. The method comprises: performing real-time search according to the user's key word to obtain current search results; performing statistics of access heat of each content in the current search results; obtaining, from the current search results, content whose access heat meets heat requirements, as content to be pushed; pushing the content to be pushed to the user. According to the present disclosure, while the real-time search is implemented, the search results are screened according to the access heat, which facilitates reduction of the number of search results pushed to the user, and thereby reduces network resources consumed in pushing the search result to the user.

Abstract: A method, system, and computer program product are provided for displaying query items (e.g., patient attributes) and answers (e.g., treatment recommendations) by performing a ranking analysis of query items by running a cognitive analysis comparison of each marginal answer confidence improvement metric for each unspecified query item in the first plurality of query items to rank the query items in sorted order from largest to smallest marginal answer confidence improvement metric.

Abstract: Techniques for implementing nested group hierarchies for analytics applications are disclosed. In some embodiments, a computer-implemented method comprises: creating a hierarchy object in a semantic layer based on a request comprising a definition for a nested group hierarchy, the definition specifying a hierarchical relationship structure for non-leaf group nodes and at least one leaf node, the non-leaf group nodes and the leaf node(s) corresponding to data stored in a data source in a non-hierarchical structure, the hierarchy object specifying the hierarchical relationship structure based on the definition; generating a query result based on a request comprising an indication of the hierarchy object using the hierarchy object from the semantic layer to retrieve the data from the data source; and causing the query result to be displayed on a computing device using the hierarchy object to display the retrieved data in a hierarchical format indicating the hierarchical relationship structure.