Abstract: A logical graph is generated using at least a portion of log data received from a set of agents executing on one or more nodes in one or more data centers. The logical graph is augmented using data obtained from one or more agents executing in containerized environments, including by representing communications between pods within the logical graph. The augmented logical graph is used to detect an anomaly.

Abstract: Methods, apparatus, systems, and articles of manufacture to estimate audience measurement metrics based on users represented in Bloom filter arrays are disclosed. An apparatus includes a communications interface to receive a first Bloom filter array from a first computer of a first database proprietor. The first Bloom filter array is representative of first users who accessed media. The first users are registered with the first database proprietor. The first Bloom filter array includes a first array of first elements. Values of respective ones of the first elements are either a 0 or a 1 based on whether quantities of the first users allocated to the respective ones of the first elements are even or odd. The apparatus further includes a Bloom filter array analyzer to estimate a first cardinality for the first Bloom filter array. The first cardinality is indicative of a total number of the first users who accessed the media.

Abstract: This application provides a data management system, method, terminal, and medium based on hybrid storage. The data management system includes: a first file system mount module, to mount at least one user-mode file system; a second file system mount module, to mount at least two independent back-end file systems based on the user-mode file system for storing hot data and cold data respectively; a data label module, to label the hot or cold attribute of the data in a user data request; a file system selection module, to store the data in the corresponding back-end file system and/or take the data out from the corresponding back-end file system according to the hot or cold attribute of the data.

Abstract: Techniques of federation of data during query time are disclosed herein. One example technique includes upon receiving an indication of interaction of a file by a user of a tenant, determining whether automatic replication of the file to a user shard corresponding to the user is permitted according to a company policy or a legal requirement, the user shard being in a second geographic region. The example technique can then include when automatic replication of the file is not permitted, storing the file in a tenant shard corresponding to the tenant in a network storage in the first geographic region and instead of replicating the file to the user shard in the second geographic region, creating, in the user shard in the second geographic region, a file reference that is a pointer to the file stored in the tenant shard in the network storage in the first geographic region.

Abstract: A system can register a first client and a second client to respectively receive information about updates to a write-ahead log structured storage engine that comprises a log. The system can read an entry in the log, the entry being of an update type. The system can, in response to determining that the first client is registered to receive at least some of the information about updates that are of the update type, sending, to the first client, entry information about the entry. The system can, in response to determining that the second client is registered to receive information about updates that are of the update type, sending, to the second client, the entry information about the entry.

Abstract: A method of synchronously executing input/output operations (IOs) for a plurality of applications using a storage device with a file system includes the steps of: receiving a first write IO including an instruction to write first data at a first address of the file system; determining that, within a first range of the file system comprising the first address, there are no pending unmap IOs for deallocating storage space of the storage device from files of the plurality of applications; after determining that there are no pending unmap IOs within the first range, locking the first range to prevent incoming unmap IOs from deallocating storage space within the first range from the files of the plurality of applications; after locking the first range, writing the first data to the storage device at the first address; and after writing the first data, unlocking the first range.

Abstract: A method for compressing a first application file and second application file includes accessing the first and the second application files, the first application file being in a first language and the second application being in a second language and being a counterpart of the first application file, decompressing the first and second application files to access internal files for the first and the second application files, comparing one of the first internal files to one of the second internal files, upon determining that the first internal file is identical to the second internal file, copying one of the internal files to an output folder, and upon determining that the files are not identical, copying both of the internal files to the output folder, or executing a differencing procedure on the first and second internal files to identify differences between them, storing data about the differences in the output folder, and compressing the output folder into one output file.

Abstract: A terminal and a method for naming a folder include receiving, by the terminal, indication information concerning creating or updating a folder, where the folder includes at least one application, displaying, by the terminal, at least one recommended name for the folder based on an application type of each of the at least one application, and selecting, by the terminal, one of the at least one recommended names as a name of the folder based on confirmation information from a user.

Abstract: Multi-database subsetting includes receiving a set of source tables. It further includes sorting the set of source tables based at least in part on dependency relationships among tables in the set of source tables. It further includes determining a traversal order based at least in part on the sorting of the set of source tables. It further includes executing the traversal order. Executing the traversal order includes visiting a table in the source set of tables according to the determined traversal order and issuing a query to extract a subset of data from the table being visited.

Abstract: Performance data characterizing operations of an application may be collected by time interval, and a plurality of keys may be associated with each element of the performance data. A first time interval may be received. An iterative group-and-filter search may be executed against the keyed elements within the first time interval, each iteration including an iteration key used to perform a key-based grouping operation followed by a group-based filter operation, wherein each iteration key is added to a composite key at each iteration. A selection of at least one keyed element within the first time interval and obtained from the iterative group-and-filter search may be received. A second time interval that precedes the first time interval may be received, and the keyed elements may be filtered using the composite key and within the second time interval to return the at least one keyed element within the second time interval.

Abstract: The present disclosure provides a virtual file management method and apparatus, and a computer-readable recording medium thereof, which may comprises obtaining an object identifier for distinguishing objects, wherein the object includes at least one of a virtual file or a virtual folder and obtaining the object based on the obtained object identifier.

Abstract: Data units of a dataset may be compressed by clustering the data units into clusters, selecting a reference unit for each unit cluster, and compressing data units of each unit cluster using the reference unit of the unit cluster as a dictionary. The computational efficiency of the clustering algorithm may be improved by not applying it to data units themselves, but rather to hash values of the data units, where the hash values have a much smaller size than the data units. The hash function may be a locality-sensitive hash (LSH) function. The reference unit of a cluster may be determined in any of a variety of ways, for example, by selecting a centroid or exemplar of the cluster. Clusters, including their references values, may be indexed in a cluster index (e.g., a Faiss index), which may be searched to assign future added or modified data units to clusters.

Abstract: Systems and methods that offer significant improvements to current content processing management systems for heterogeneous and widely distributed content sources are disclosed. The proposed systems and methods are configured to provide a framework and libraries of extensible components that together are designed enable creation of solutions to acquire data from one or more content repositories, possibly distributed around the world across a wide range of operating systems and hardware, process said content, and publish the resulting processed information to a search engine or other target application. The proposed embodiments offer an improved architecture that incorporates manager nodes and worker (processing) nodes, where worker nodes are configured to scan and process data, while manager nodes are configured to handle all allocation of work (including throttling) and control state and failover. Such an arrangement enables the system to perform with greater scalability and reliability.

Abstract: A memory for storing a directed acyclic graph (DAG) for access by an application being executed by one or more processors of a computing device is described. The DAG includes a plurality of nodes, wherein each node represents a data point within the DAG. The DAG further includes a plurality of directional edges. Each directional edge connects a pair of the nodes and represents a covering-covered relationship between two nodes. Each node comprises a subgraph consisting of the respective node and all other nodes reachable via a covering path that comprises a sequence of covering and covered nodes. Each node comprises a set of node parameters including at least an identifier and an address range. Each node and the legal address specify a cover path. Utilizing DAG Path Addressing with bindings the memory can be organized to store a generalization hierarchy of logical propositions.

Abstract: A rule storing unit stores a set of rules each defining facts and a relation between the facts, and weights representing importance levels of the rules. An input data storing unit stores input data. A query storing unit stores a query. An importance level calculating unit calculates an importance level of each fact type of the facts defined by the rules. A fact data generating unit generates, for each fact type, fact data in which true/false is observed as a fact by a number corresponding to the importance level of the fact type, from the input data. A fact data storing unit stores the fact data. An inference performing unit performs probabilistic inference of a result of the query by using the fact data, the rules, and the weights. An output unit outputs a result of the inference.

Abstract: A system and improved method for managing an individual's job applications and networking processes in a digital, visual manner. In one aspect of the present invention, the platform is realized in the form of a web application with different sections, including one for tracking job applications, one for tracking networking outreach and engagement, and another for seeing tasks from both of those other sections. Data relevant to individual job applications and networking opportunities is stored in each section and displayed in an interactive kanban board-manner to enable them to manipulate their status and stay organized. Additional integrations and features include permitting importing and exporting data to third party servicers, such as job boards, applicant tracking systems, and calendars, and automated movement and prioritization using artificial intelligence/machine learning techniques applied to specific and aggregated data from other users.

Abstract: A method may include updating database posting logic to obtain an updated database posting logic that, during a posting process to a database, adds a data field to a new line item being posted via the posting process. The method may further include receiving information from a data provider. The method may further include posting, using the updated database posting logic, the information to the database as a line item including various fields including the data field. The method may further include receiving a request to generate a transactional report. The method may further include using the data field to identify the line item. The method may further include generating the transactional report using the line item.

Abstract: The cloud hybrid application storage management system spans local data center and cloud-based storage and provides a unified view of content and administration throughout an enterprise. The system manages synchronization of storage locations, ensuring that files are replicated, uniquely identified, and protected against corruption. The system ingests digital media assets and creates instances of the assets with their own identification and rights and houses the identification and relationships in a CAR (Central Asset Registry). The system tracks the different instances of the assets in multiple storage locations using the CAR, which is a central asset registry that ties together disparate digital asset management repository systems (DAMs) and cloud-based storage archives in which the instances reside. While the invention treats and manages multiple files/instances independently, the CAR identifies them as related to each other.

Abstract: A transaction processing method includes: dividing a to-be-processed transaction obtained from a database into at least two subtransactions; dividing each subtransaction into N parts with an association relationship; processing the N parts of each subtransaction based on the association relationship, to obtain a processing result of a lastly executed part of the N parts; determining, upon detecting an abnormal subtransaction based on the processing result, a processing policy matching an abnormality reason of the abnormal subtransaction; and processing the abnormal subtransaction by using the processing policy, to obtain a final processing result of the to-be-processed transaction.

Abstract: Methods, non-transitory machine readable media, and computing devices that provide more efficient hierarchical propagation in tree structures are disclosed. With this technology, a first delta record for a first interior node is created optionally in an atomic transaction along with updating a first tally record for a leaf node based on a first value. The transaction is in response to an action associated with the leaf node and the first interior node is a parent of the leaf node in a hierarchical tree. A timer associated with the first delta record is then set. A second value is updated in a second tally record for the first interior node based on the first value, when the timer has expired. Accordingly, this technology advantageously maintains recursive properties or values throughout a hierarchical tree continually, with reduced cost, even in a distributed network and in hierarchical trees with large numbers of nodes.