Abstract: A distributed storage method includes offline merging, by a first thread service of a distributed storage system, M small files in a file system; generating, by the first thread service, M pieces of metadata in the offline merging process; loading, by a second thread service of the distributed storage system, the M pieces of metadata into a metadata set; searching, by the second thread service, the metadata set for metadata of a first small file when the second thread service receives a first instruction; and performing, by the second thread service, the operation corresponding to the first instruction when the second thread service finds the metadata of the first small file in the metadata set.

Abstract: A method and system are provided for code coverage for test systems for testing source code. The method obtains a trace with trace records written at entry and exit to one or more test modules for function calls to the test modules. The method compares response codes for the functions extracted from the trace with a finite list of response codes retrieved from metadata for the source code for the functions and analyzes a code coverage based on the comparison.

Abstract: Disclosed are example methods, systems, and devices that allow for secure digital authorization via generated datasets. The techniques include receiving a first dataset of a first user and a second dataset of a second user and generating a first set of identity elements and a second set of identity elements based on the first dataset and the second dataset, respectively. A linkage definition can be generated based on the first and second datasets, which can be associated with a set of activation elements. The techniques include determining that a set of inputs satisfy one or more of the set of activation elements and, in response, generating a set of security access tokens based on the linkage condition. The security access tokens can be transmitted to a computing device upon analyzing and verifying biometric data received from that computing device.

Abstract: Examples described herein generally relate to database operations including encoding, within a length field for a first value to be stored in a column of a database as a token that includes information for processing a large object, an indicator indicating that the first value is of a token type, and storing, in the column of the database, the first value with the length field including the indicator.

Abstract: A database system stores a table as a set of column files in a columnar format in a manner that improves the write performance of the table and avoids use of separate metadata repository. In embodiments, each column file groups values into entity chunks indexed by an entity index. Each chunk includes a live value index that determines which rows in chunk has live values. New values are written to the column file by appending an updated copy of the entity chunk. The entity index to refer to the newly written chunk as the latest version. This approach avoids expensive in-place updating of individual column values and allows the update to be performed much more quickly. In embodiments, the database system encodes metadata such as table schema information using file naming and placement conventions in the file store, so that a centralized metadata repository is not required.

Abstract: Methods, apparatus, systems, and computer-readable media are set forth for receiving data from a client device, the data associated with an operation occurring at an exploration and production system, ingesting the received data into a data lake, applying one or more transformations to the ingested data prior to consumption of the data, and tracking the one or more transformations made to the ingested data.

Abstract: Techniques are provided for multi-cloud data protection using threshold-based file reconstruction. One method comprises obtaining a file comprising metadata and data for storage in a cloud environment; generating a plurality of encrypted file portions from the data; and uploading each of the encrypted file portions with the metadata as cloud objects to multiple different cloud environments. A threshold number of the encrypted file portions are needed from at least two different cloud environments to reconstruct the file. For file reconstruction, the threshold number of encrypted file portions can be validated, merged and decrypted.

Abstract: Techniques are provided for tiering snapshots to archival storage in remote object stores. A restore time metric, indicating that objects comprising snapshot data of snapshots created within a threshold timespan are to be available within a storage tier of a remote object store for performing restore operations, may be identified. A scanner may be executed to evaluate snapshots using the restore time metric to identify a set of candidate snapshots for archival from the storage tier to an archival storage tier of the remote object store. For each candidate snapshot within the set of candidate snapshots, the scanner may evaluate metadata associated with the candidate snapshot to identity one or more objects eligible for archival from the storage tier to the archival storage tier, and may archive the one or more objects from the storage tier to the archival storage tier.

Abstract: Techniques are provided for access control of protected data using storage system-based multi-factor authentication. One method comprises obtaining, in a storage system, an input/output request for data; determining, by the storage system, whether a multi-factor authentication is required for the requested data; initiating, by the storage system, a multi-factor authentication of a user associated with the input/output request, in response to a result of the determining, to obtain a verification result; and processing, in the storage system, the input/output request for the data based at least in part on the verification result. The data may be marked as protected data using a manual process and/or an automated process that processes one or more smart tags associated with the data. The marking of the data as protected data may comprise marking a partition comprising the data, marking a protected folder comprising the data, and/or marking a protected file comprising the data.

Abstract: Embodiments in the present description provide an operation request processing method and apparatus, and a device, and a readable storage medium, and a system. In the present embodiment, after obtaining an operation request for a data table, a read-write node can return a request processing completion message to a requester in time without waiting for all read-only nodes; a locking operation is performed on the data table, a log of locking the data table is written into a redo log file; and after status information of the log of locking is written into a status record, a monitoring processing process can achieve log playback monitoring of all the read-only nodes by using the status record and the log of locking. Thus, an asynchronous processing mechanism is achieved, and the stability and efficiency of operation request execution are improved.

Abstract: A tiered storage arrangement is contemplated that provides high speed tier 1 storage for rapid access to recalled data, mid-speed tier 2 storage for data that is not frequently recalled and tier 3 storage for archive purposes that may include tape library storage and even cold storage in vaults. Embodiments contemplate a server linked to all tiered storage devices on one end and a host computer on another. Data files can be migrated between the tiered storage systems based on migration policies, such as time elapsed from being filed or last accessed. Also, embodiments contemplate a time bar displayed at the host computer that provides accurate time predictions of data recall including information of the kind of storage on which a target file is stored and the pathway to recall the target file/s locally to the host computer.

Abstract: Systems and methods are directed to a compression scheme for stable universally unique identities in a collaborative editing environment. A client receives edits to a document and immediately creates a local short identity for an element of each edit, whereby the local short identity represents an offset from a base unique identity associated with the client from which a unique identifier assigned to the element is derivable. The local short identity information including the local short identity for each element is transmitted to a server. Subsequently, global short identity information is received from the server from which one or more global short identities that each map to a local short identity of a client of a plurality of clients collaborating on the document can be determined by the client. Each global short identity is a compact identity that is universally unique to the plurality of clients including the client.

Abstract: A federation management service may generate a federated application program interface (API) based on multiple data sources. The federation management service may detect changes to one or more of the multiple data sources, which may result in generation of a new version of the federated API. The changes to the data sources may be documented in a change event log. The change event log may be used to recreate a prior version of the federated API by applying changes of the change event log to a federated schema corresponding to the federated API. A snapshotting technique may capture the state of the federated schema at various points in time, and snapshots may be used to regenerate a prior version of the federated API using the change events of the change event log.

Abstract: The present disclosure relates to a method for managing an object, an apparatus for the same, a computer program for the same, and a recording medium storing computer program thereof. A method for managing an object using a trace-identifier (T-ID) according to the present disclosure may comprise: updating T-ID information for the object at a timepoint at which the object is saved after the object is opened at an endpoint; writing the updated T-ID information as metadata of the object; and transmitting the metadata including the T-ID information to a server.

Abstract: Techniques and solutions are provided for providing federated data access to parameterized data objects. At a local system, a virtual parameterized data object is created. A remote computing system is contacted to obtain parameters used by a parameterized data object of the remote computing system to which the virtual parameterized data object corresponds. Parameter information received from the remote system is stored in a definition of the virtual parameterized data object at the local system. When a request for a database operation involving the virtual parameterized data object is received, the parameter information can be used to determine whether the request is correctly formed, or can be used in preparing a request to be sent to the remote system to be performed using the parameterized data object to obtain information specified in the request for a database operation.

Abstract: A source site includes a controller, a set of source worker nodes, and a message queue connected between the controller and source worker nodes. The message queue receives messages and stores the messages for retrieval. A destination site includes a set of destination worker nodes. Tasks are generated to replicate changes to objects at the source site to the destination site. The controller pushes messages corresponding to the tasks onto the message queue. A source worker node retrieves a message corresponding to a task from the message queue for processing in conjunction with a destination worker node. The message is indicated as having been retrieved from the message queue.

Abstract: Implementations described herein relate to methods, systems, and computer-readable media to provide an alert based on a release of a software application implemented in a distributed computing system. In some implementations, the method includes receiving, at a processor, an indication of the release of the software application, obtaining a first set of metric values for each metric of a list of metrics for a first time period preceding a time of release of the release, obtaining a second set of metric values for each metric of the list of metrics for a second time period following the time of release, comparing the first set of metric values to the second set of metric values to determine a deviation score, generating an alert based on the deviation score, and transmitting the alert via one of a user interface and a communication channel.

Abstract: Monitoring is performed for the activation of a set of one or more previously attached Kprobes. A determination is made that a strategy pattern match has occurred. The strategy pattern comprises a set of one or more behaviors including the activation of the at least one Kprobe included in the set of Kprobes. A remedial action is taken in response to the determination. Examples of such remedial actions include generating an alert and terminating a network connection.

Abstract: A recovery storage system asynchronously protecting a synchronously replicated dataset, where the asynchronous protection of the synchronously replicated dataset includes: receiving, by a recovery storage system, an identifier of a synchronously replicated dataset, wherein the synchronously replicated dataset is a dataset synchronously replicated across the plurality of storage systems; asynchronously replicating, on the recovery storage system, the synchronously replicated dataset from the plurality of storage systems; detecting that each dataset in the synchronously replicated dataset on the plurality of storage systems has become unavailable; and restoring the dataset on the recovery storage system.

Abstract: A method that includes receiving a first configuration and a second configuration that define a set of rules for matching and merging a set of source data objects that are associated with a tenant and that are received from a plurality of data sources. The method may further include generating a set of merged data objects from the set of source data objects based on an identification of matching values from fields of the set of source data objects and selecting a value for each field of each merged data object having multiple values. The method may further include generating a mapping between primary keys associated with each merged data object and corresponding primary keys of the source data objects. The method may further include storing the merged data objects and the mappings in a first datastore and a second datastore that is different from the first datastore.

Abstract: Methods, systems, and apparatus are described for processing mutations for a remote database. In one aspect, a method includes receiving a log of database mutations from a client device, the log of database mutations indicating changes previously made to a client version of a database stored on the client device, and each database mutation specifying: an entity included in the database; an operation for the entity; and a client version number for the entity; identifying, in the log of database mutations, two or more database mutations that each specify a same client version number for a same entity; determining, based on a conflict resolution policy, that the two or more database mutations are eligible for collapsing; and collapsing the two or more database mutations into a single database mutation.

Abstract: Agent lifecycle management for backup and restore applications is described. A system enables selection of application hosts, each of which meets installation requirements for installing instances of application agents from a backup and restore application, then downloads, in parallel, the instances of the application agent to the corresponding selected application hosts. The system installs, in parallel, the instances of the application agent in the corresponding selected application hosts, then registers, in parallel, the instances of the application agent with the backup and restore application. The system subsequently initiates sessions which download and install, in parallel, an update in instances of the application agent in in corresponding application hosts. The system unregisters at least one of the instances of the application agent, in at least one application host, from the backup and restore application.

Abstract: Various implementations disclosed herein provide a mechanism for determining that a configuration status of a compliant device is too far out-of-date, and subsequently bridging the configuration status of the compliant device to the up-to-date configuration data and instructions in response. In various implementations, determination of the configuration status of the compliant device is possible using a single request from the compliant device, which in turn reduces the amount of network traffic and utilization of network resources needed to update the compliant device with the up-to-date configuration data and instructions.

Abstract: A data management system (DMS) may perform techniques for snapshotting a host environment data store using a resource volume. The DMS may transmit, to the host environment a first request for a full backup of a data store of the host environment, where the first request results in mounting of a resource volume in an empty state. The DMS may generate a snapshot of the resource volume after completion of the backup at the host. The DMS may transmit one or more second requests for incremental backups, where the second requests result in mounting of the volume in a state corresponding to a previous backup of the host. The DMS may generate a second snapshot of the resource volume. For a subsequent full backup, the DMS may cause mounting of the volume in the empty state to the host rather than mounting the resource volume corresponding to a prior snapshot.

Abstract: A video receiver apparatus, for receiving video from a video transmitter apparatus, comprises: a memory portion for memorizing receiver apparatus information of the video receiver apparatus; and a transmitter/receiver portion for receiving a request for obtaining the receiver apparatus information transmitted from the video transmitter apparatus, and also for transmitting the receiver apparatus information memorized in the memory portion responding to the obtaining request, and wherein, further within the memory portion is memorized history information, changing depending on alternation of the receiver apparatus information, and wherein the receiver portion is able to receive the history information, which the video transmitter apparatus holds therein, as well as, the obtaining request from the video transmitter, and when the received history information from the video transmitter apparatus and the history information, which the video transmitter apparatus holds therein, are inconsistent with each other, then

Abstract: A version control system implemented in software and executed by one or more processors that provides for change set integration for diverse types of objects. The system may be configured to handle a wide range of objects of different types committed to the version system by storing and/or versioning the objects, change sets, and complex relationships between objects and object dependencies. Unified support for development operations may be provided as assets under version control may optionally be deployed, rolled back, compared to a corresponding live environment, and tested thus providing for sophisticated development and operational cycles. The system provides automatic and/or semi-automatic object integration such as may be useful for continuous development and integration and feature based development.

Abstract: Techniques for detecting and presenting rewards for presence are disclosed. Presence of a mobile device within a building is detected based on a plurality of triggers including a degradation of a first signal and a concurrent improvement of a second signal. The triggers are identified by a client-side application of the mobile device or a corresponding server-side processor with which the client-side application is in communication and from which the client-side application is configured to automatically receive available rewards. In response to detecting presence within the building, the server-side processor determines that a user of the mobile device is eligible for a reward, and the reward is provided to the user via the client-side application at the mobile device.

Abstract: A method includes generating a task using a plurality of logical statements embedded in a database, the plurality of logical statements corresponding to a data modification. Database data is ingested into a staging table that is configured within the database. The task is executed based on applying the data modification to a first set of partitions storing the database data and generating a second set of partitions. The second set of partitions store modified data corresponding to the database data. A stream of committed transactions is advanced at least in part by adding an entry into the stream. The entry corresponds to committed transactions performed on the first set of partitions during the data modification. A data processing task is scheduled for execution on the modified data based on the advancing of the stream offset.

Abstract: A block-request streaming system provides for improvements in the user experience and bandwidth efficiency of such systems, typically using an ingestion system that generates data in a form to be served by a conventional file server (HTTP, FTP, or the like), wherein the ingestion system intakes content and prepares it as files or data elements to be served by the file server. A client device can be adapted to take advantage of the ingestion process. The client device might be configured to optimize use of resources, given the information available to it from the ingestion system. This may include configurations to determine the sequence, timing and construction of block requests based on monitoring buffer size and rate of change of buffer size, use of variable sized requests, mapping of block requests to underlying transport connections, flexible pipelining of requests, and/or use of whole file requests based on statistical considerations.

Abstract: Some embodiments provide a program that receives a selection of a data object relationship definition. The data object relationship definition specifies a plurality of data objects managed by a plurality of applications and a set of relationships between data objects in the plurality of data objects. The program sends each application in a first subset of the plurality of applications a request for instances of data objects in the plurality of data objects managed by the application. The program receives, from each application in the first subset of the plurality of applications, a list of a set of candidate instances of data objects. Based on the list of the sets of candidate instances of data objects, the program further determines a set of groups of instances of data objects. The program deletes a group of instances of data objects in the set of groups of instances of data objects.

Abstract: Disclosed herein are techniques for matching symbols between code sets. Techniques include accessing a first symbol associated with a first version of software; accessing a second symbol associated with a second version of the software; comparing the first symbol to the second symbol; determining, based on the comparing, whether the second symbol is a functional equivalent of the first symbol; and performing a designation action based on whether the second symbol is a functional equivalent of the first symbol.

Abstract: A data segment is encrypted to produce an encrypted data segment, and a data tag associated with the data segment is generated. The encrypted data segment is encoded to generate a set of encoded data slices. At least a read-threshold number of encoded data slices are required to reconstruct the encrypted data segment. A set of write slice requests, which includes the set of encoded data slices and the data tag, is transmitted to a DSN memory. A determination is made, based on the data tag, whether a first encoded data slice of the set of encoded data slices is a duplicate of a second encoded data slice already stored within the DSN memory. If it is a duplicate, rather of storing the first encoded data slice, a reference to a location of the second encoded data slice is stored.

Abstract: A tenant data store contains information associated with tenants of a cloud computing environment, including an indication that a first customer subscribed to an exclusive tenant that receives an upcoming version of runtime software. A notification system pushes a notification about the upcoming runtime to an integration service for the first customer. A tenant preview service may contain the upcoming version of runtime software, and a software update store may contain new integration scenario content (created and tested by the first customer) in connection with the upcoming version of runtime software. An integration content mapper determines, based on old and new integration scenario content metadata, if an automatic port of the new integration scenario content in the software update store should be automatically provided to a runtime node. If it should be automatically provided, the integration content mapper may use a software update tool to automatically deploy the new integration scenario content.

Abstract: Content is captured and archived at an archive center (AC) and, depending upon records management (RM) policy, is managed by the AC or under RM control by a content server (CS). Both the AC and CS may be part of an enterprise content management system. The AC provides a user-friendly interface through which retention zones may be defined, and functionality for applying RM policy. The functionality can be triggered via a specific content property or through a retention zone under RM control. The RM control can be turned on or off from within the AC using the user-friendly interface. Archived content is not moved or duplicated. Rather, metadata and a link to the storage location are sent to the CS which, in turn, creates a content server document that is linked to the archived content. Only a portion of archived content is exposed to the CS through the AC.

Abstract: The present disclosure relates to a broadcast receiving apparatus and an operating method thereof.

Abstract: A device and corresponding method are provided to provide accurate estimates of how long it will take to install updates to compute nodes in a large-scale computer deployment. a duration prediction model is trained using historical data from previous updates to compute nodes. The features selected to train the duration prediction model are update features including update component type, update component size, update component duration and compute node features including operating system, BMC type/version, UEFI type/version, and generation for each of the compute nodes updated. The historical data for the features is accessed from a metadata store.

Abstract: Systems and methods for managing concurrent access to a shared resource in a distributed computing environment are provided. A reference counter counts is incremented for every use of an object subtype in a session and decremented for every release of an object subtype in a session. A session counter is incremented upon the first instance of fetching an object type into a session cache and decremented upon having no instances of the object type in use in the session. When both the reference counter and the session counter are zero, the object type may be removed from the cache.

Abstract: Example implementations relate to journals for metadata changes. An example includes detecting, by a storage controller of a deduplication storage system, a cloning operation of a manifest range; loading a journal from persistent storage into memory in response to the detected cloning operation, wherein the journal is to store changes to a container index associated with the manifest range, and wherein the container index is not loaded into the memory in response to the detected cloning operation; and updating the journal in the memory to include an indication of changes to metadata of the container index that is not loaded into the memory, wherein the changes to the metadata are associated with the detected cloning operation.

Abstract: The present disclosure relates to systems, non-transitory computer-readable media, and methods for transforming data metrics to conform to a production schema for cross-domain uniformity. In particular, in one or more embodiments, the disclosed systems receive a metric having an initial schema, determine that the initial schema is inconsistent with a production schema, transform the metric to conform with the production schema, and store the metric in a standardized-schema database.

Abstract: A data model is derived from transaction data. The model is represented in a combination data structure for a tree and a hash table. The hash table provides direct access to leaves of the tree, each leaf comprises a frequency count for a particular unique basket of items detected in the transaction data. Mining the combination data structure does not require recursive traversal of the tree. Moreover, derivation is performed with just two passes on the transaction data, during each pass multiple concurrent reducer tasks handle a unique portion of the transaction data providing parallel processing during creation and derivation which improves the processor elapsed time to complete the combination data structure. Furthermore, updates to the data structure are incremental without requiring any additional passes on the original transaction data and without requiring full traversal of the tree. Output from the mining is provided as input to predictor services.

Abstract: A block processing section divides a file generated by an application into a plurality of data blocks and stored the data blocks in an auxiliary storage device. A metadata processing section stores, in the auxiliary storage device, first metadata including a hash value and information for identifying a storage location of each of the plurality of data blocks. When the file is updated, the block processing section stores an updated data block in another storage location. The metadata processing section stores, in the auxiliary storage device, second metadata including a hash value and information for identifying a storage location of each of a plurality of data blocks including the updated data block. A metadata switching section sets the second metadata to be used for file access.

Abstract: Embodiments of methods and systems for informatics systems are disclosed. Such informatics systems may utilize a unifying format to represent text to facilitate linking between data from the text and one or more ontologies, and the commensurate ability to mine such data.

Abstract: An optimization method includes generating a constrained causal graph according to an observation data received from a distributed unit, performing a finite domain representation planning using the constrained causal graph to generate an action data about a plurality of radio unit parameters after optimization, and outputting the action data to the distributed unit. A number of a plurality of causal variables of the constrained causal graph and a causal structure of the constrained causal graph are determined at a time.

Abstract: Aspects described herein may provide determination of compliance with accessibility rules by a webpage. A first version of a webpage may be compliant with the accessibility rules. The first version of the webpage may be modified to create the second version of the webpage. The second version of the webpage may be displayed. A voiceover of the second version of the webpage may be initiated. The voiceover may include starting automatic text-to-speech software that reads aloud the second version of the webpage. The voiceover of the second version of the webpage may be recorded and stored. A textual transcript of the stored recording may be generated. Compliance of the second version of the webpage with the accessibility rules may be determined based on the textual transcript of the stored recording and based on the first version of the webpage.

Abstract: A computer implemented method determines differences between documents. The method includes parsing a first document and a second document into respective distinct instances of content. The distinct instances of content are classified into different categories. Category specific matching algorithms are applied to each of the respective instances of content to determine a similarity score for each of the respective instances of content. Semantic differences between the first document and the second document are analyzed as a function of the similarity scores. A characterization of the semantic differences is generated.

Abstract: The subject technology receives a query, the query including a query range for processing the query. The subject technology sends a request to a key-value store for blob metadata and a set of recent writes for the query range. The subject technology receives the blob metadata, the blob metadata including information related to a set of blob files. The subject technology determines whether the set of blob files is stored in a local cache. The subject technology, in response to at least one blob file being missing from the set of blob files, sends a request to a blob store to retrieve the at least one blob file of the set of blob files. The subject technology transforms the retrieved at least one blob file to a column file format. The subject technology stores the transformed at least one blob file in the local cache.

Abstract: Techniques are provided for orphan object detection, invalid sequence number detection, and asynchronous object cleanup. A storage system may store data within one or more tiers of storage, such as a storage tier (e.g., solid state storage and disks maintained by the storage system), a remote object store (e.g., storage provided by a third party storage provider), and/or other storage tiers. Orphan objects, within the remote object store, that are no longer used by the storage system may be detected and/or deleted. When an aggregate of volumes is deleted, corresponding objects, within the remote object store, may be identified and/or deleted. Invalid sequence numbers (e.g., lost or corrupt sequence numbers locally maintained in a metafile) assigned to objects within the remote object store may be identified, deleted, and/or fixed.

Abstract: There is provided a method for network function management. The method is performed by a node of a first network. The method comprises activating (100) a first version of a network function only if activation of the first version of the network function is allowed by a gateway that is configured to allow the first network and a second network to communicate.

Abstract: Response delay associated with a state-based client-server application can be reduced with utilization of an application state server-side cache. A server caches data for a set of one or more possible states of a client-server application that may follow a current state of the application. The server rapidly responds to a client request with data that corresponds to an appropriate new state of the application in accordance with the application state server-side cache. The server determines that the application will transition to the appropriate new state from the current state of the application with the application state server-side cache based, at least in part, on an operation indicated by the client request.

Abstract: A branch of a main database is created, comprising a copy of the main database schema. A user edits the branch and requests that it be merged back into the main database. A schema diff is generated and used to determine differences between the main database and the edited branch. The merge is performed if it does not create a conflict. A second branch is created and edited by a second user. When the second user indicates to merge the second branch back into the main database, differences between the two branches are determined, relative to the main database. If merging the second branch back into the main database on top of the first branch does not create a conflict, a three-way merge is performed of the first branch, the second branch, and the version of the main database from which the first and second branches were generated.