Abstract: A schema consistency mechanism monitors data ingested by a data intake and query system for changes to the structure, or data schema, associated with the data. A schema consistency monitor obtains data from a data source (or, more generally, from any number of separate data sources) at a plurality of points in time. The data is analyzed to determine whether a first portion of the data received at a first point in time conforms to a first data schema and that a second portion of the data received at a second point in time conforms to a second data schema that is different from the first data schema (thereby indicating a change to the associated data schema). A graphical user interface (GUI) can be generated that includes indications of identified changes to one or more data schemas associated with data.

Abstract: A method of adapting a first key-value store to a second key-value store may include determining a conversion strategy based on one or more characteristics of the first key-value store and one or more characteristics of the second key-value store, converting the second key-value store to a converted key-value store based on the conversion strategy, and mapping the first key-value store to the converted key-value store based on a mapping function. The converted key-value store may be accessed on-the-fly. A data storage system may include a key-value interface configured to provide access to a lower key-value store, and a key-value adapter coupled to the key-value interface and configured to adapt an upper key-value store to the lower key-value store, wherein the key-value adapter may be configured to adapt at least two different types of the upper key-value store to the lower key-value store.

Abstract: It is provided a method and system for selectively separating organization for generating a second database by copying a first database, selecting data by mapping a condition of a deletion subject to a business object of the second database, extracting the selected data from the second database and saving it as a file, and generating a third database to be transferred by deleting data matched with the read data from a table in the second database.

Abstract: A determination device 1 includes: a history storage unit 101 configured to accumulate and store use history information in which application identification information, position information indicating a position of a user, and user identification information are correlated with each other; a use region UU number totaling unit 105 configured to total a UU number for each of a plurality of regions on the basis of the use history information for a specific application; a use region number totaling unit 106 configured to total the number of regions on the basis of the use history information for the specific application; a score calculating unit 107 configured to calculate a regionality score for each of the plurality of regions on the basis of the UU number and the number of regions for the specific application; and a determination unit 108 configured to determine whether there is regionality for the specific application on the basis of the regionality score.

Abstract: A size associated with a content file is determined to be greater than a threshold size. In response to the determination, file metadata of the content file split and stored across a plurality of component file metadata structures. The file metadata of the content file specifies tree structure organizing data components of the content file and each component file metadata structure of the plurality of component file metadata structures stores a portion of the tree structure. A snapshot tree is updated to reference the plurality of component file metadata structures for the content file.

Abstract: A deduplication engine maintains a deduplication hash table containing a plurality of fingerprint entries identifying a track of current data and a hash value computed from the data currently stored at the identified track. A hash table manager implements a dynamic deduplication hash table management process, that includes a fingerprint entry purge process and a fingerprint entry re-entry process. The purge process is implemented on the deduplication hash table to remove selected fingerprint entries of tracks of data currently stored on the managed drives from the deduplication hash table based on a first set of Thin Device (TDev) selection rules and a second set of track selection purge rules. The re-entry process is implemented on the deduplication hash table to re-enter selected fingerprint entries into the deduplication hash table based on a third set of TDev selection rules and a fourth set of track selection re-entry rules.

Abstract: Systems and methods are disclosed for implementing enhanced security measures that include utilizing a backup database included on node devices connected to a CAN bus, so that certain message identifiers are updated according to a matching table stored on the backup database. By updating the message identifiers, outside attackers will not be privy to the new message identifier assigned to the messages and will no longer target such messages.

Abstract: There is provided a computer-implemented method for duplicating an application state, the method including: recording one or more point-in-time characteristics of an original application state of an application, the recording including: parsing underlying code for the application to identify (i) a set of state variables that together define the original application state and (ii) a set of logical breadcrumbs identifying a pre-determined number of past actions that led to the original application state; establishing one or more logical anchor points based on the set of state variables; provisioning memory resources to support a duplicate application state; on the provisioned memory resources, initiating a copy of the application; transferring the one or more point-in-time characteristics to the provisioned memory resources, the transferring including: configuring the copy of the application using the one or more point-in-time characteristics to regenerate the original application state on the copy of the appli

Abstract: A computerized system and method of migrating data from a source database of a source host to a target database of a target host, including executing a first number of extraction components on the source host, executing a second number of send components on the source host, executing a third number of store components on the target host, and executing a monitor component to monitor performance of the source database, source host transient memory, target host transient memory, and the target database, and responsively, according to a pre-defined state table, changing at least one of the number of extraction, send, and store components being executed.

Abstract: Techniques for data processing may include: receiving a data block P having a binary representation; determining features for the data block P; determining, using at least one table of precomputed hash values, feature hashes for the features, wherein each of the feature hashes corresponds to a different feature, wherein each of the feature hashes is one of the precomputed hash values of the at least one table; and determining, in accordance with the feature hashes, a similarity hash for the data block P. Each feature may be a byte of P. The at least one table may be a single 3 dimensional or multiple 2 dimensional tables. Each row of a table of precomputed hash values may correspond to a single precomputed hash value. The row may include byte entries where each byte entry includes a single bit value of a precomputed hash.

Abstract: Some embodiments provide a method for migrating a set of data objects from a first database of a first database type to a second database of a second database type. The method retrieves a particular set of data from the first database and performs an automated process to analyze the particular set of data in order to select the second database type from multiple other database types. The method presents on a display the selected second database type and a user interface control for migrating the set of data objects stored in the first database to the second database of the second database type. In response to a selection of the user interface control, the method provisions the second database and transfers the set of data objects from the first database to the second database.

Abstract: A component management device according to an embodiment includes a database, a component searching unit, and a component operating unit. In the database, components are registered. Input-output of each component is defined for type of the component. The component searching unit receives input of the names, or the input examples, or the evaluation data of components; searches for the components registered in the database, according to the input; and presents the search result. The component operating unit sends the input from an application, which uses the searched component, to a component and sends the output of the component to the application.

Abstract: Technology is described for using spatial analysis of data objects associated with a multi-dimensional virtual environment to organize computational units in a distributed computing system. The data objects may be grouped together using spatial location information and collections of data objects may be treated as processing partitions (i.e., sub-divisions of the entire group of data objects). A mapping may be created between the data objects and processing partitions for processing applications which process data objects assigned to a processing partition. The processing partitions may be defined, in part, according to how the data objects are grouped together spatially. The processing partitions may be load-balanced across hardware hosts in the distributed computing system.

Abstract: Direct storage loading may be used to add data to a database. New data may be added to a database, using nodes different than a database engine to access a database. The addition of the new data may be assigned to different nodes. The nodes may obtain the data and store the data to storage locations according allocated space in the database by the database engine. The new data can then be made available for access at the database engine.

Abstract: Some embodiments provide an automated method for processing a query. The method receives a query from a client, where the query references an object in a source database, the object having two sets of properties. The method generates a full set of properties by retrieving one set of properties from the target database and retrieving the other set of properties from a metadata storage. Based on the full, combined set of properties, the method generates a new query for execution on the target database.

Abstract: Techniques and structures for providing a multitenant environment having both a relational database and a non-relational database. A database query is received with at least one server computing device providing a multitenant environment having a relational database system and a non-relational database system, the database query in a format corresponding to the relational database system. The query is parsed with the at least one server computing device to find one or more components of the query directed to data stored in the non-relational database system. One or more components of the query directed to data stored in the non-relational database system are converted to one or more scans of the non-relational database system. Results from the query of the relational database system and results from the one or more scans of the non-relational database system are collected. The results from the query and the results of the one or more scans to a combined result are combined.

Abstract: Aspects of the disclosure relate to management of databases in different server environments. In particular, various aspects of this disclosure relate to correction, synchronization, and/or migration of databases between different database servers. A feed file that is rejected from loading in a database associated with a source server may prioritized in a destination server. A feed file hierarchy of the rejected feed file may be determined and the destination server may process loading of the rejected feed file to a database based on the determine feed file hierarchy. Any corrections applied at the destination server may also be applied at the source server.

Abstract: A computer-implemented method includes receiving data structures in memory space and creating micro-heaps on a per-data structure basis. Each data structure is associated with a micro-heap allocator. The method also includes storing the data structures in a key-value store. Values of the key-value store are associated with the data structures. A computer program product includes one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media. The program instructions include program instructions to perform the foregoing method. A system includes a processor and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor. The logic is configured to perform the foregoing method.

Abstract: The present invention relates to a data processing arrangement 10 for collating information relating to distributed inanimate assets 14. The data processing arrangement 10 comprises a portable computing apparatus 16 operable by a user and a remote computing apparatus 12. The data processing arrangement 10 also comprises an application in the portable computing apparatus. The application is operative to control input by the user to the portable computing apparatus 16 of asset information for each of the distributed inanimate assets 14 and to convey the asset information input by the user to the remote computing apparatus 12. The data processing arrangement 10 further comprises a configurable data structure which is operative to determine what asset information is input by the user by way of the application and without the application being changed.

Abstract: Embodiments are directed to managing data using network computers. A data graph may be provided based on knowledge graphs and information provided by data sources. Concepts and entities may be provided based on the data graph. Scoring models may be determined based on the concepts and the entities. Thematic scores for the entities may be generated based on the scoring models and the data graph such that the thematic scores include values that quantify each relationship between the concepts and the entities and such that an entity with a higher thematic score value for a concept has a relationship strength value that exceeds another relationship strength value for another entity with a lower thematic score value for the concept. A report that includes the thematic scores, the entities, and the concepts may be provided.