Abstract: A data query and retrieval system receives a query request and identifies a plurality of data warehouses, or stores, where data needed to satisfy the query is stored. Data items, or fields, called for by the query request are grouped into sets based on fields stored at the same data warehouse. Individual data connections are generated for each data warehouse accessed, and a database view defined for the fields available at each respective data warehouse. The individual views are invoked in a single query statement by a query processor for accessing the respective data warehouses via the corresponding database view. In this manner, a query operator or user need not define multiple query expressions or perform separate queries for accessing data fields or dimensions residing at different data warehouses.

Abstract: Techniques for join elimination are described herein. Join elimination can identify and eliminate unnecessary joins in a query plan node. For example, join elimination can involve a semantic query optimization technique, which removes reference to a table whose columns are only referenced in join predicates if the joins do not filter/expand rows in the result. Such joins can cause significant performance issues on larger datasets if not optimized.

Abstract: Example methods and systems for indexing fingerprints are described. Fingerprints may be made up of sub-fingerprints, each of which corresponds to a frame of the media, which is a smaller unit of time than the fingerprint. In some example embodiments, multiple passes are performed. For example, a first pass may be performed that compares the sub-fingerprints of the query fingerprint with every thirty-second sub-fingerprint of the reference material to identify likely matches. In this example, a second pass is performed that compares the sub-fingerprints of the query fingerprint with every fourth sub-fingerprint of the likely matches to provide a greater degree of confidence. A third pass may be performed that uses every sub-fingerprint of the most likely matches, to help distinguish between similar references or to identify with greater precision the timing of the match. Each of these passes is amenable to parallelization.

Abstract: Systems, devices, computer-implemented methods, and tangible non-transitory computer-readable media for generating reports from one or more databases that store disparate datasets are provided. Specifically, the proposed systems enable the intelligent generation of reports from multiple datasets by automatically determining a proposed set of join configurations for combination of the multiple datasets. The proposed set of join configurations can be executed as proposed and/or can be edited or customized by the user to generate reports from the multiple datasets. Thus, the proposed systems and methods can provide intuitive and user-friendly tools for generating data reports that accurately synthesize and summarize data contained in multiple different datasets.

Abstract: Provided are a data management method and system for a security protection terminal, a device and a medium. The method includes: respectively generating an initial universally unique identifier for each security protection terminal; determining a target search field, calculating corresponding search field identifier information, and inputting the same into the initial universally unique identifier to obtain a target universally unique identifier; storing data corresponding to the security protection terminals in corresponding sub-databases based on a horizontal partitioning and modulus mode according to the target universally unique identifier; and receiving a data search request, and locating to the sub-databases based on the horizontal partitioning and modulus mode according to the target search field identifier information, thereby facilitating subsequent data search in the sub-databases.

Abstract: An illustrative method includes generating a logical graph by performing a clustering operation with respect to log data associated with one or more machines, the clustering operation performed using a first clustering criteria and causing the logical graph to initially include a first set of nodes generated in accordance with relationship requirements of an underlying model and a first set of edges representing communication between nodes included in the first set of nodes; and reclustering, using a second clustering criteria, the logical graph to include, in place of the first set of nodes, a second set of nodes generated while maintaining the relationship requirements of the underlying model and a second set of edges representing communication between nodes included in the second set of nodes.

Abstract: A method of analyzing measurement data includes sorting EDSs into similarity clusters including a representative RDS; labeling the similarity clusters; sorting the EDSs or RDSs into sub-clusters; selecting one of the EDSs or RDSs in each of the sub-clusters as a search seed representative of the sub-cluster; sorting measurement EDSs from measurement data into measurement clusters including a representative measurement RDS; determining for each search seed a most similar one of the measurement EDSs or RDSs; identifying the determined most similar one of the measurement EDSs or RDSs for each search seed as a classification segment corresponding to the search seed; sorting new measurement EDSs or RDSs into classification clusters with the classification segments; classifying all the new measurement EDSs or RDSs in each classification cluster the same as the corresponding classification segment; and determining whether patterns of interest are in the measurement data stream based on the classification clusters.

Abstract: Methods and systems for storing and managing biosystem on a chip data disclosed. To store the data, operation data from the biosystem on a chip may be stored in a database. To manage use of the stored data, a graph representation of the biosystem on a chip. The nodes of the graph representation may correspond to the architectural features of the biosystem on a chip. The edges between the nodes may be based on whether the corresponding architectural features are in communication with one another. Each of the nodes may be associated with pointers that point to portions of the operation data in the database that is relevant to the architecture feature associated with the respective node.

Abstract: An illustrative data storage management system relies on a specially configured proxy server to operate software containers on a proxy server, maintain resources needed by the software containers, and interwork with other system components. Illustratively, a catalog service on the proxy server maintains a software cache according to maintenance rules and also maintains an associated cache catalog. The software containers are generally managed and operated by an illustrative container manager also hosted by the proxy server. The illustrative software cache comprises contents needed by the software containers, such as pre-configured container templates, DBMS software components, lightervisors representing target operating systems, and storage management software for performing test and storage operations. The maintenance rules govern when cache contents should be purged and moved into offline archive copies.

Abstract: The described platform's infrastructure transforms domain-specific data into unique graphic component parts (a shape), providing a visual graph representation of the current status of the domain data. The software on the platform provides instructions to allow users to manipulate the domain-specific data and shapes. The domain-specific information may be used in hypothesis generation, prioritization among domains, decision support, and domain modeling over a time period. The platform enables industry contributors and consumers to collaborate using all the domains. The domain-specific shape is created then used by Platform Machine Vision, enabling time-saving decision support across all domains and industries. Additional benefit of creating each domain shape is the shapes may be combined for an Overall Graphic, which is a new kind of visual representation across domains. The Overall Graphic is a portable industry status.

Abstract: This disclosure is directed to systems and methods for generating a communication associated with or based on optimization data. Generating a communication may include (i) receiving first data associated with a first computing device or a first computing device user; (ii) generating at least two of: verification data, consistency data, and activity data; and (iii) generating optimization data.

Abstract: A non-transitory computer readable medium with a file genealogy identification program configured to cause a computer to perform: receiving a plurality of document files each having been added to with a unique identifier each time the document file has been saved by an application program and having a set of identifiers based on the added identifiers; determining a genealogical relationship between first and second document files in the plurality of document files based on a similarity calculated by obtaining an intersection based on comparison of a first set of identifiers collected from the first document file to a second set of identifiers collected from the second document file, obtaining a union of the first set of identifiers and the second set of identifiers, and calculating the similarity based on the number of unique identifiers in the intersection and the number of unique identifiers in the union.

Abstract: Techniques are disclosed relating to index metadata that is usable for accessing multi-level data structures. A computer system may operate a database, including maintaining a set of records having a set of corresponding keys. The computer system may create multi-level data structures that facilitate key range lookups against those records. A given multi-level data structure may store key information indicative of a subset of the corresponding keys. The computer system may create separate index metadata that is usable for accessing the multi-level data structures. The index metadata may specify indications of key information that is stored in the multi-level data structures and locations of the multi-level data structures. The computer system may perform a key range lookup that includes using the index metadata to determine a particular set of the multi-level data structures whose key information corresponds to a key range of the key range lookup.

Abstract: Synchronizing requests with a respective context includes, responsive to a determination that there are more pages to explore, performing regular crawling operations for a current page, recording a current page in a list of explored pages and extracting links from the current page. Responsive to a determination that there are more links to extract, a next link to analyze is selected to form a selected link and responsive to a determination that there is a new request associated with the selected link, a new request identifier is created and saved as an entry in a hashmap. Responsive to a determination that there is not a new request associated with selected link, a request associated with the selected link is updated with a new link value when the link value differs.

Abstract: A computerized method is disclosed that includes operations of obtaining a data set, selecting candidate parameter pairs to be analyzed, wherein the candidate parameter pairs include a window length and a sensitivity multiplier, and wherein the window length is a number of data points, performing an anomaly detection process for each candidate parameter pair including importing each candidate parameter pair into a predetermined search query thereby generating a set of populated predetermined search queries, wherein the predetermined search query is configured to perform the anomaly detection process, executing each search query of the set of populated predetermined search queries on the data set to obtain a set of anomaly detection results, and scoring each anomaly detection result by applying a set of heuristics to the set of the anomaly detection results, and generating an auto-tuned search query by selecting a first candidate parameter pair based on a score of each of the set of anomaly detection results a

Abstract: Information is stored that maps storage units to a pool of data protection appliances on which the storage units reside. The stored information includes a set of Internet Protocol (IP) addresses through which each data protection appliance can be reached. A connection request is received from a client. The connection request includes an identification of a particular storage unit which the client seeks to access for a data protection job. The particular storage unit is looked up in the stored information to identify a particular data protection appliance on which the particular storage unit currently resides. A list of multiple IP addresses through which the particular data protection appliance can be reached according to the stored information is returned to the client. The client, upon receipt of the list, selects an IP address from the list to attempt an initial connection to the particular data protection appliance.

Abstract: Techniques described herein relate to a method for reporting database backup information. The method may include starting a monitor process; generating a flag file for the database backup comprising a parent process identifier (PID) of a parent process of a first child process; associating a second child process with the monitor process by identifying the flag file using the parent PID; receiving channel close alerts from the child processes; making a first determination that backup jobs performed in a first channel were successful; making a second determination that backup jobs performed in the second channel were successful; and transmitting, based on the first determination and the second determination, a backup success report to a backup coordinator.

Abstract: In the case of a platform device (100) located at a web-site and capable of forming a network with a plurality of ID-detectable users or participants for gathering and processing items of information stored in a plurality of in each case code-identifiable and in each case topic-assigned storage spaces (110) of a platform (100) by the users or participants, a situation in which consensus-gaining evaluability and modifiability of the stored items of information with the formation of collective knowledge is achieved by the users or participants in that the storage spaces (110) present on the platform (100) and containing a plurality of various topics are in each case formed by a dual unit DuU, a dual unit DuU comprising in each case a first storage space (111) assigned to a predefinable topic and provided with initial items of information formulated by an initial participant but not editable by any other individual user or participant and a second storage space (112) assigned to the first storage space (111), wh

Abstract: A performance adjusting method and apparatus for a file system architecture. The method includes: determining a plurality of internet bandwidths among a client, an Object Storage Server (OSS), and a storage controller in a file system architecture; determining an overall network architecture of the file system architecture and a maximum transmission bandwidth of the file system architecture; testing read-write performance of a single Object Storage Target (OST) to calculate an Input/Output (IO) processing capability of a storage node; determining whether the maximum transmission bandwidth matches the IO processing capability of the storage node to add or reduce a storage array accordingly to adjust a number of OSTs; executing a performance benchmark test to determine IO read-write performance of the file system architecture; and determining whether the maximum transmission bandwidth matches the IO read-write performance to adjust a number of OSSs or a number of storage arrays accordingly.

Abstract: A system for identifying and deleting records of hosts includes a local data manager. The local data manager identifies a discovery event associated with the host and a record type of record types, obtains, in response to identifying, all previously discovered records on the host associated with the record type from a host record repository, obtains discovered records associated with the record type and associated with the host, after obtaining all discovered records and previously discovered records, selects a previously discovered record of the previously discovered records, makes a determination that the previously discovered record does not match any discovered records of the discovered records and is not tagged with a soft delete tag or a hard delete tag, and in response to the determination, tags the previously discovered record with a soft delete tag, and notifies a data manager of modifications to the previously discovered records.