Abstract: A method includes selecting, from a database, messages of a first electronic control (ECU) unit according to a specified datum that the first ECU is programmed to provide via a communications bus, generating a first file of the messages of the first ECU, sorting the messages in the first file according to a hierarchy that includes the specified datum, and outputting a third file describing a comparison of the first file and a second file that includes messages of a second ECU.

Abstract: While a mounted file system with a file system transaction logging capability is in a metadata frozen state, a file system transaction on the file system is performed, the transaction comprising a logged set of metadata updates required to implement the transaction in the file system, the performing comprising diverting the set of metadata updates from the file system to a temporary storage location outside the file system. During the metadata frozen state, a consistency check on metadata of the file system is performed, the consistency check attempting to identify an inconsistency in the metadata. The file system is recovered from the metadata frozen state, the recovering comprising implementing the diverted set of metadata updates on the file system.

Abstract: Examples include techniques for backing up a file to long term “cold” storage by using circuitry, and logic for execution by the circuitry, to receive a request to back up the file in a distributed file system to cold storage, to copy the file from at least one data node of the distributed file system to cold storage, to set a location of the file in cold storage in a name node of the distributed file system, and to set a length of the file to zero in the name node.

Abstract: Systems, methods, and other embodiments associated with indexing spatial data in a distributed file system are described. A query window defining a portion of a spatial data space is received, and candidate partitions containing the spatial data within the query window are identified. An intermediate partition dataset comprising each of the identified candidate partitions is created. Execution of a distributed function is limited to the identified candidate partitions, and a data structure including at least one record included in the result of the query is generated, and returned as the result of the query over a communication network.

Abstract: A computer implemented method for managing data received from a video source device is disclosed. At least a first storage tier and a second storage tier on a storage medium are identified for respectively storing different categories of data. As data streams are received from the video source, the data streams are associated with at least the first storage tier or the second storage tier and data from the received streams are stored in the associated storage tier. When the storage medium is full or meets some other specified maximum capacity threshold, data is deleted beginning with data that has an age that exceeds one or more specified maximum retention times, followed by data with the oldest age from one or both of the first and second storage tiers.

Abstract: Systems and methods to optimize utilization of a tablespace for export from a native database recovery environment are described. The system receives a database from a source host, operating in a native database recovery environment, at a backup host operating in a foreign database recovery environment. The foreign database recovery environment utilizes foreign snapshot files and foreign incremental files for storing the database. The system receives a tablespace identifier that identifies a tablespace and a point-in-time that identifies file information for export from the backup host to the source host. The backup host initiates a job to generate script information; create directories; materialize the file information; utilize an auxiliary database to generate tablespace metadata information; and communicate the tablespace metadata information and the script information and the file information, via the directories, and over a network, to the source host, to enable the source host to recover the tablespace.

Abstract: There is provided a database management system (DBMS) in order to make anonymization processing of the database efficient. When receiving a query including a conversion rule, the database management system is configured to process a relationship table in the database based on the conversion rule. At that time, the DBMS is configured to acquire data from a processing result table (result of processing the relationship table) stored in the past for tuples the number of which for each value appearing in a predetermined attribute satisfies a condition required for the anonymization processing. On the other hand, for tuples the number of which for each value appearing in a predetermined attribute does not satisfy the condition required for the anonymization processing, the DBMS is configured to acquire data from the database or from a result of processing the relationship table, the result being stored in rather than the processing result table.

Abstract: Systems and method of the present invention are directed to data transfer systems and methods. Embodiments enable a user to access an electronic file to ascertain certain attribute data associated with one or more files, and allow the user to modify certain elements of the subject attributes file during the course of transferring the one or more files from a source location to a target or destination location.

Abstract: The subject matter described herein relates to managing data with flexible schema. A method, computer storage medium, and system are provided for managing data with flexible schema. In one embodiment, the method comprises providing a logical view for logical tables of a database; and managing mappings between the logical tables and a physical table according to predefined mapping constraints, each of the logical tables mapped as a part of the physical table. The mapping constraints at least specify that (i) a logical column in the logical tables is mapped to at least one physical column in the physical table, and (ii) distinct logical columns in one of the logical tables are mapped to distinct physical columns in the physical table. As a result, schema evolution may be done with minimized data migration.

Abstract: Aspects of the disclosed technology include a method including receiving, from a user device, an identification of content; receiving, by a computing device, the identified content; accessing search engine processing logic; processing the received content using the subset of search engine processing logic, without indexing the received content to be accessed for responding to search queries from the search engine; generating a representation of a predicted search result of the received content based on the processing; and transmitting, to the user device, the representation of the predicted search result.

Abstract: A computer-readable non-transitory physical storage medium having stored thereon machine-executable code for electronically facilitating contact between mutually interested entities, said machine-executable code to be executed by a microprocessor, said machine executable code which when executed by said microprocessor causes the microprocessor to perform operations including suggesting to a first user other users that first user may be interested in, where the suggested other users are filtered based on their location, causing a device to display a graphical user interface (GUI) for the first user to input a rating of the first user's level of interest in one or more respects in at least one other user, accepting the first user's level of interest rating via the GUI while not displaying the first user's rating to the at least one other user, and electronically notifying a pair of users that have rated each other above a threshold level.

Abstract: A method of providing material based on a user-initiated request utilizing an electronic database includes receiving search keywords to conduct a search and accessing a first database having previously stored contact information for the particular user in an initial table record. The method includes transforming data in the fields of the record for the particular user in the initial table to generate a record in a sanitized table, accessing a second electronic database having previously stored data structures corresponding to businesses, where each data structure maps selected keyword combinations to corresponding icons, and to particular material corresponding to each keyword combination, and displaying icons associated with search results having corresponding selected keywords near associated result items on an electronic display.

Abstract: Systems and methods are provided for enhanced processing of time series data via parallelization of instructions. An example method includes receiving a query indicating time series datasets and operations to be performed on the time series datasets. Nodes associated with the query are identified, with each node associated with a time series dataset. Nodes associated with operations to be performed are generated. The nodes are assembled into query tree, with parent nodes of the query tree indicating operations that are to be applied to children nodes. Instructions for processing the query tree are generated. At least a subset of the instructions is provided to one or more compute systems for processing in parallel. Results are received, and presented in a user interface.

Abstract: Techniques for document analysis using machine learning are provided. A selection of an index is received document, and a plurality of documents that refer to the index document is identified. For each respective document in the plurality of documents, a respective portion of the respective document is extracted, where the respective portion refers to the index document, and a respective vector representation is generated for the respective portion. A plurality of groupings is generated for the plurality of documents based on how each of the plurality of documents relate to the index document, by processing the vector representations using a trained classifier. Finally, at least an indication of the plurality of groupings is provided, along with the index document.

Abstract: Bias identification in social network posts. A method performs a semantic comparison of social network posts by a user of a social network to identify a group of social network posts by the user about a specific topical content category. The method determines a respective semantic sense of each social network post of the group. The method also ascertains a semantic sense pattern among social network posts in the group of social network posts about the specific topical content category. The method identifies a bias in at least one social network post of the group of social network posts based on identifying that the respective semantic sense in each of the at least one social network post deviates from the ascertained sematic sense pattern. The method uses the identified bias to predict bias in one or more other social network posts made by the user on the topical content category.

Abstract: The present disclosure provides a spark query method and system supporting trusted computing. The method comprises receiving a SQL query statement input by a user; performing parsing, logical plan analysis, logical plan optimization and physical plan generation for the SQL query statement; re-implementing an operator in the physical plan by using SGX API, and generating an execution code; invoking an enclave trusted environment to implement trusted computing for the operator, and executing the execution code. Through the present disclosure, safety of data during the calculation is ensured while the query request is processed in parallel through the spark architecture. Moreover, the spark interface provides the user with more available service and is user-friendly.

Abstract: A method for applying bloom filter on a large data set consisting of key-value pairs, using at least one processor includes: partitioning large data-set of key-value pairs into data chunks; determining Bloom filter Vector and number of segments in the vector for each data chunk; Encoding all keys of a given Chunk into a Bloom filter vector; Determining the segment-id of a given key using H (0) hash function; Encoding Key into a Bloom filter segment with the determined segment-id, using a K-bit array produced by H1, . . . Hk functions; and Packing of segments into extent data structures where each extent includes segments of different chunks, but with the same segment-id wherein a single extent filters multiple chunks, depending on a packing factor (the number of segments packed into a single extent).

Abstract: Techniques are disclosed for toponym disambiguation. Toponym disambiguation can be performed for a set of geographic location data, such as placenames. A subset of the data and additional location information associated with the subset of the data can be initially determined. The remaining geographic location data in the set of geographic location data can be scored in order to determined additional location information for the remaining geographic location data. Additional location information for the remaining geographic location data can be determined based on calculated scores.

Abstract: An analysis management server stores a factory A catalog group including a plurality of catalogs in factory A, an application destination catalog including a plurality of catalogs in factory B, and an application source analysis data correspondence table associating columns between a target table of factory A and a defect factor analysis table. A CPU is configured to: identify an unconnected catalog for which a catalog of factory B having an identical correspondence does not exist among the plurality of catalogs of factory A included in the application source analysis data correspondence table; identify an unconnected correspondence, which is a correspondence of the unconnected catalog in the application source analysis data correspondence table, sensor data of factory B, and an identical path correspondence which is a correspondence of a catalog on a path including the unconnected catalog; and display information of the unconnected correspondence and the identical path correspondence.

Abstract: Embodiments of the present invention are directed to a computer-implemented method for determining topic specific reliability for a question answering system. A non-limiting example of the computer-implemented method includes receiving a topic specific input query by the question answering system. The method further includes detecting a source that provides a reference containing the ground truth answers to the ground truth questions. The method further includes traversing sources detect similar references in other sources and assigning reliability scores for each source based upon ground truth answers in the other sources. The method further includes providing a ranked list of answers based upon the reliability of each source upon for each answer.