Abstract: A computerized method is disclosed including operations of receiving a data stream, performing a changepoint detection resulting in a detection of changepoints in the data stream including: maintaining a listing of starting indices for each run within the data stream in a buffer of size L wherein each index of the listing has a run length probability representing a likelihood of being a changepoint, receiving a new data point within the data stream and adding a new index to the buffer resulting in the buffer having size L+1, calculating a posterior run length probability that the new data point is a changepoint, and removing an index from the listing that has a lowest run length probability thereby returning the buffer to size L, and responsive to determining the index removed from the listing does not correspond to the new data point, identifying a changepoint associated with the new data point.

Abstract: Database commands may be asynchronously forwarded between nodes of a database system. A read-only node may receive a request, such as a read request or write request, and determine that the request should be forwarded to a read-only node for performance. A thread that handles the request may forward the request to the read-only node and register a call-back event for a response to the request and be made available to perform other work. When the response from the read-write node is received, the call-back event may be triggered and return a response to the request using the same or different thread.

Abstract: A method of obtaining a tree-based point cloud compression (PCC) media stream using moving picture experts group (MPEG)-dynamic adaptive streaming over http (DASH), is performed by at least one processor and includes obtaining, from a server, a media representation description (MPD) comprising a PCC uniform resource indicator (URI) and a PCC three-dimensional (3D) descriptor, and determining whether the PCC URI comprised in the obtained MPD indicates that the tree-based PCC media stream is to be accessed. The method further includes, based on the PCC URI being determined to indicate that the tree-based PCC media stream is to be accessed, obtaining, from the server, the tree-based PCC media stream, using the PCC 3D descriptor comprised in the obtained MPD.

Abstract: A message sending method includes: receiving a first input of a user on a target icon, where the target icon is used to indicate a target application; displaying a target interface in response to the first input, where the target interface includes at least one message, and each of the at least one message corresponds to at least one contact; receiving a second input of the user on a first message, the first message is a message in the at least one message; and sending, in response to the second input via the target application, the first message to at least one first contact corresponding to the first message.

Abstract: An edge computing device receives, from a user device via an isolated local area network, a request for computing services that are hosted on the edge computing device and not on the user device. The edge computing device accesses policies that are applicable to the user device and the requested computing services. Based on the policies and the requested computing services, the edge computing device instantiates a container configured to provide the requested computing services. The container receives offloaded processing tasks from the device. The container executes the offloaded processing tasks, and sends, to the user device, data indicative of the processed tasks.

Abstract: A method for a multi-cluster warehouse includes allocating processing units as part of a data warehouse. The processing units access data within one or more databases in cloud storage resources. The method also includes providing one or more queries to each processing unit within the data warehouse. In response to the queries, each processing unit performs database operations on a particular portion of a database table. The method also includes monitoring a workload of the processing units to determine that a processing capacity of the processing units has reached a threshold processing capacity. The method also includes dynamically adding additional processing units to and removing processing units from the data warehouse as needed based on a workload of the processing units.

Abstract: A claim editing engine for automated integration and error resolution of claim records is provided. The processor of the engine is configured to extract a set of claim components of a plurality of claim components. The processor is further configured to transform the set of claim components to conform to a standardized data format. The processor is also configured to integrate the set of transformed claim components into a set of unified claims by unifying each of the set of transformed claim components having matching claim identifiers into a unified claim. The processor is configured to apply a rule set to the set of unified claims to generate a simulation of execution of the set of claims and identify errors in the simulated execution. The processor is configured to transmit an instruction to resolve each identified error. The processor is configured to cause each resolved unified claim to be processed.

Abstract: A non-relational database system may handle requests to access separately stored items in different data stores. An access request for an item may be received that is stored in a table of a non-relational database. If the item is determined to be stored at a data store not implemented as part of the non-relational database, then an instruction to access the item may be sent to a query engine that can access the data store. A result from the second query engine may be used to respond to the access request for the item.

Abstract: Embodiments of the present specification provide a method, an apparatus, a client terminal, and a server for data processing. The method includes: selecting, based on a data attribute of to-be-processed data, a target coordinating server from a plurality of coordinating servers, the plurality of coordinating servers belonging to a plurality of server clusters respectively; and sending a data processing request to the target coordinating server, such that a server cluster to which the target coordinating server belongs processes the data processing request preferentially, the data processing request directing to the to-be-processed data.

Abstract: The described implementations relate to processing of electronic data. One implementation is manifest as a technique that can include obtaining a relational query that references one or more data items and associating progress intervals with the data items. The technique can also include converting the relational query into a corresponding streaming query, and providing the streaming query and the data items with the progress intervals to a stream engine that produces incremental results of the query. For example, the progress intervals can be based on row numbers of a relational database table. The progress intervals can be used to define event lifetimes of streaming events that are provided as inputs to the stream engine.

Abstract: A feature extractor for a convolutional neural network (CNN) is disclosed, wherein the feature extractor is deployed on a member of the group consisting of (1) a reconfigurable logic device, (2) a graphics processing unit (GPU), and (3) a chip multi-processor (CMP). A processing pipeline can be implemented on the member, where the processing pipeline implements a plurality convolution layers for the CNN, wherein each of a plurality of the convolutional layers comprises (1) a convolution stage that convolves first data with second data if activated and (2) a sub-sampling stage that performs a member of the group consisting of (i) a max pooling operation, (ii) an averaging operation, and (iii) a sampling operation on data received thereby if activated. The processing pipeline can be controllable with respect to which of the convolution stages are activated/deactivated and which of the sub-sampling stages are activated/deactivated when processing streaming data through the processing pipeline.

Abstract: A method of obtaining a tree-based point cloud compression (PCC) media stream using moving picture experts group (MPEG)-dynamic adaptive streaming over http (DASH), is performed by at least one processor and includes obtaining, from a server, a media representation description (MPD) comprising a PCC uniform resource indicator (URI) and a PCC three-dimensional (3D) descriptor, and determining whether the PCC URI comprised in the obtained MPD indicates that the tree-based PCC media stream is to be accessed. The method further includes, based on the PCC URI being determined to indicate that the tree-based PCC media stream is to be accessed, obtaining, from the server, the tree-based PCC media stream, using the PCC 3D descriptor comprised in the obtained MPD.

Abstract: A method of data replication in a distributed storage system of a mobile communications network is disclosed. The distributed storage system comprises a plurality of geographically separated storage locations. The method comprises, at a first storage location: receiving a first request for data stored in the distributed storage system; determining, based on the first request, further, different, data to be stored at the first storage location; determining a second, different, storage location, of the plurality of storage locations, at which the determined further data is stored; sending, to the determined second storage location, a replication request for replicating the determined further data; receiving, in response to the replication request, the further data; and storing the further data such that the further data is replicated at the first storage location in advance of a further request for the further data being received at the first storage location. Apparatus is also disclosed.

Abstract: Proposed are concepts for managing the distribution of data elements in a distributed data storage system comprising: a plurality of distributed assets; and a mobile asset associated with a home location. A proposed method comprises: allocating a data element based on a current location of the mobile asset. If the current location of the mobile asset differs from the home location associated with the mobile asset, a replica of the data element is allocated to another asset.

Abstract: A method, a system, and a computer program product for performing accelerated and memory efficient similarity matching. A data stream having a plurality of data zones is received. Each zone includes a zone identifier. A plurality of hashing values for each zone are generated. Each hashing value is generated based on a portion of a zone. A storage structure having a plurality of storage containers is generated. Each storage container stores one or more hashing values associated with each respective storage container and a plurality of zone identifiers referencing the associated hashing values. At least one storage container includes a listing of zone identifiers stored in each storage container. Using the storage structure, the received data stream is deduplicated.

Abstract: Proposed are concepts for managing the distribution of data elements in a distributed data storage system comprising: a plurality of distributed assets; and a mobile asset associated with a home location. A proposed method comprises: allocating a data element based on a current location of the mobile asset. If the current location of the mobile asset differs from the home location associated with the mobile asset, a replica of the data element is allocated to another asset.

Abstract: An example operation may include one or more of receiving a request to execute a cross-chain transaction, identifying disparate locations of two or more different blockchains that have stored therein data for the cross-chain transaction, retrieving data from data blocks of the two or more different blockchains, respectively, based on the identified disparate locations, executing the cross-chain transaction which takes the retrieved data from the two or more different blockchains as inputs to generate a cross-chain result, and storing the cross-chain result via a data block of a distributed ledger.

Abstract: A computer-implemented method includes receiving characteristic information of a container registry. The container registry includes a plurality of container images. The method includes selecting at least two container images in the container registry and selecting parameters for optimization based on the characteristic information. The method also includes generating a cost function based on the parameters for optimization and optimizing the at least two container images in the container registry based on the cost function. A computer-implemented method includes receiving a composition of each of at least two layers in a container image. The composition of each of the at least two layers includes at least one file. The method includes mapping overlap between the composition of the at least two layers and estimating a redundancy in the container image based on the overlap. The method also includes calculating new layers which reduce the redundancy in the container image.

Abstract: Techniques are provided for synchronous replication based cutover. An asynchronous replication process is executed to perform asynchronous incremental transfers of data of a storage object from a first computing environment to a replicated storage object at a second computing environment until a cutover criteria is met. A synchronous replication process is executed to synchronously replicate operations, targeting the storage object, to the replicated storage object based upon the cutover criteria being met. A cutover is performed to direct operations from targeting the storage object to targeting the replicated storage object based upon the synchronous replication process reaching a steady state of synchronous replication for sub-objects of the storage object, where operations are committed to both the storage object and the replicated storage object.

Abstract: A method and product for implementing application consistent snapshots of a sharded relational database across multiple storage arrays using a distributed and federated protection domains model across two or more storage clusters.

Abstract: Embodiments of present disclosure provides a method and an apparatus for data writing. An exemplary method includes: obtaining first to-be-written data; determining a first group identifier corresponding to the first to-be-written data; determining a master node corresponding to the first group identifier; and writing the first to-be-written data if the master node is the current node.

Abstract: A method for managing a storage device of a first electronic device is provided. The method for managing a storage device of a first electronic device including detecting a storage capacity of the storage device in response to a second electronic device accessing the storage device; and sending a trigger signal to a processor in response to detecting that the storage capacity meets a threshold, the trigger signal sending the first electronic device into an operating mode, wherein the first electronic device includes the processor and a network connector, and the second electronic device accesses the storage device through the network connector.

Abstract: Described embodiments include memory systems that may shadow certain data stored in a first memory device (e.g. NAND flash device) onto a second memory device (e.g. DRAM device). Memory systems may train and/or re-organize stored data to facilitate the selection of data to be shadowed. Initial responses to memory commands may be serviced from the first memory device, which may have a lower latency than the second memory device. The remaining data may be serviced from the second memory device. A controller may begin to access the remaining data while the initial response is being provided from the first memory device, which may reduce the apparent latency associated with the second memory device.

Abstract: Exemplary methods, apparatuses, and systems include a replica node storing a component of a storage object detecting that a primary coordinator for the storage object component is no longer available to serve as primary coordinator. The replica node is within a cluster of nodes storing components of the storage object. In response to detecting that the primary coordinator is no longer available, the replica node updates a first metadata entry indicating that a secondary coordinator for the storage object component is unhealthy. The replica node rejects connection requests from the secondary coordinator in response to the first metadata entry indicating that the secondary coordinator for the storage object component is unhealthy.

Abstract: Techniques are described for performing a copy operation. A first request is received to perform a copy operation to copy source data from a source area to a target area. The first request is partitioned into a plurality of other requests. Each of the plurality of other requests being a request to copy a portion of source data located in the source area to a corresponding location in the target area. A first number of the other requests is issued. Responsive to the issued requests, a copy operation is performed to copy a portion of the source data from the source area to the target area. Completion of a second number of the issued other requests is detected. The second number corresponds to a fraction of the first number such that the second number is greater than one and less than the first number. Upon detecting completion of the second number, a third number of the other requests is issued to copy another portion of the source data from the source area to the target area.

Abstract: A data storage system includes storage nodes adapted to provide retrieval of time-based data in response to a receipt of a time-based data retrieval request associated with data streams. Each of the data streams includes time-ordered data items having a header. The header includes timestamps representing a time interval associated with the data items. The data storage system further includes applications issuing the time-based data retrieval requests associated with the data streams and session managers coupled to the applications and storage nodes. Shared resources are dynamically allocated between the applications submitting the requests. Data requested by the requests is retrieved from the storage nodes using timestamp based indexes associated with the data streams in a substantially parallel manner. The retrieved data is merge-sorted by time. The sorted data is transmitted to the applications based on a delivery rate controlled by each application.

Abstract: A system may include a processor and a memory device having instructions executable by the processor to cause the processor to determine a list of available virtual data centers corresponding to pools of computing resources located on computing devices of service providers. The processor may receive a selection signal via a network from a computing device of a client corresponding to the client's selection of a virtual data center from the list. The processor may subsequently receive additional selection signals corresponding to the client's selection of a template, customization components, and a network for the virtual resource. The processor may generate the virtual resource according to the template customization components, and the network, and may provision the virtual resource on the selected virtual data center.

Abstract: Methods are provided for enabling secure big data analytics in the cloud. A method includes reading a secure file, by a Secure Distributed File System in a public cloud service provider. The reading step includes computing a hash of a name of the secure file to obtain a hashed file name, finding metadata for the secure file using the hashed file name, retrieving a sharing policy identifier from the metadata, and obtaining authorization from an external entity to decrypt the secure file. The reading step further includes extracting a security key and encrypted data file names from the metadata using the sharing policy identifier, requesting one or more encrypted data files that form the secure file from a node of the public cloud service provider, and at least one of decrypting and reconstructing plaintext data for the secure file from the one or more encrypted data files.

Abstract: A method, system, and computer-readable storage device for selecting a heterogeneous platform configuration is described herein. In one aspect, a heterogeneous evaluation system may receive a platform configuration request from the tenant system. The platform configuration request can specify a job list and a quality of service metric. The heterogeneous evaluation system may then generate a heterogeneous platform configuration selection based on simulations of sub-lists formed from the job list. The heterogeneous platform configuration selection can specify a first platform configuration for a first duster and a second platform configuration for a second duster. The heterogeneous evaluation system can communicate the heterogeneous platform configuration selection to the tenant system.

Abstract: Various embodiments for data management in a replicated storage environment, by a processor device, are provided. In one embodiment, a method comprises storing a plurality of data replicas under a plurality of heterogeneous compression algorithms, wherein one of the data replicas is optimized for a data operation.

Abstract: A method of managing a commitment time that includes providing at least a first client and a second client in communication with at least a transaction management server in an NoSQL environment; and determining with the transaction management server when the first client reads a value in a first transaction that is being updated by the second client in a second transaction whether the value has been committed. If it is determined that the value has not been committed, the transaction management server causes the second client to commit after the start time of the first transaction.

Abstract: A method and apparatus for handling a server request received at a data server. The data server comprises a policy request handler. The policy request handler is activated within the data server in response to the server request being received at the data server. The policy request handler is configured to receive a plurality of asynchronous data streams. The policy request handler is further configured to merge data points in the plurality of asynchronous data streams together to form time-ordered data points. The policy request handler is further configured to form policy-based data according to a server policy identified in the server request using the time-ordered data points.

Abstract: According to some embodiments, system, apparatus and methods are provided comprising a development environment; one or more system components configured to operate within the development environment; a graphical user interface in the development environment that enables a user to: develop at least one model using an arbitrary language, wherein development of the at least one model includes accessing the one or more system components; wherein the development environment includes program code for a platform in the arbitrary language; and an execution model configured to execute the developed model on the platform. Numerous other aspects are provided.

Abstract: A primary storage system is equipped with a local storage subsystem having a mirror volume of a volume in a primary storage subsystem, and a remote storage subsystem having a mirror volume of the volume in the primary storage subsystem at a secondary site. When storing a write data from a host to a volume, the primary storage subsystem determines an SEQ# to be stored in a journal corresponding to the write request, creates a journal including the relevant SEQ# and a replica of the write data, and transmits the relevant SEQ# to the local storage subsystem, which creates a journal including the relevant SEQ# and stores it in its own journal volume. But when creation of the journal including the relevant SEQ# is stopped, the local storage subsystem creates a dummy journal including the relevant SEQ# but not including the write data.

Abstract: A keyed join is used in the processing of streaming data to streamline processing to provide higher throughput and decreased use of resources. The most recent event for each unique replacement key value(s) is maintained substituting older events with the same key. An incoming event is joined with the data received from one or more other data sources, and the correlations are output.

Abstract: An allocation instruction is received that includes a target data operand and a storage medium operand indicating a storage medium for storing the target data. A data dependency is identified that specifies metadata that includes access control information specifying which users have permission to perform a write operation to the file that includes the target data. In response to determining that the allocation instruction allocates the target data from a first storage medium to a second storage medium having a faster data IO rate, the allocation instruction is modified to also allocate the metadata specified in the data dependency to the second storage medium. In another aspect, the allocation instruction is modified to also allocate the metadata identified in the data dependencies to one or more storage mediums with data IO rates that are at least as fast as the second storage medium.

Abstract: A state manager provides transactional distributed lifecycle management of a group of different application-level state providers, namely, differently structured application program data structures. The state providers are atomic with respect to one another. The state provider is replicated to one or more secondary nodes of a distributed network. The state providers are persistent despite one or more node operational failures. State provider lifecycle operations include creation of a transactional distributed state provider as a member of a group of different application-level state providers which include differently structured application program data structures, deletion of a previously created transactional distributed state provider, and/or enumeration of any previously created transactional distributed state providers. A given state provider may be read or written by one or more applications. Implementation restrictions and other avoidance conditions are satisfied in particular cases.

Abstract: Provided are techniques for dynamically maintaining data structures driven by heterogeneous clients in a distributed data collection system. In response to determining that a client-specific data structure has been modified in a source coupled to each of a plurality of clients, a metadata specification is generated, at each of the plurality of clients, from data structure metadata that includes attributes of the client-specific data structure; and data driven structure definitions are generated, at each of the plurality of clients, from the metadata specification, wherein the data driven structure definitions from each of the plurality of clients are to be aggregated to form a common data model in a central server.

Abstract: A database management system has a query interface for receiving a query and a query executor for executing the received query. The query executor dynamically generates a task, and executes a plurality of tasks in parallel. In execution of each task, each time data is required to be read from a database, the query executor generates a task for acquiring the data, and in execution of the generated task, issues a data read request for reading the data from the database, to thereby shorten a time taken to execute each task.

Abstract: Methods are provided for enabling secure big data analytics in the cloud. A method includes reading a secure file, by a Secure Distributed File System in a public cloud service provider. The reading step includes computing a hash of a name of the secure file to obtain a hashed file name, finding metadata for the secure file using the hashed file name, retrieving a sharing policy identifier from the metadata, and obtaining authorization from an external entity to decrypt the secure file. The reading step further includes extracting a security key and encrypted data file names from the metadata using the sharing policy identifier, requesting one or more encrypted data files that form the secure file from a node of the public cloud service provider, and at least one of decrypting and reconstructing plaintext data for the secure file from the one or more encrypted data files.

Abstract: Large amounts of memory can be consumed in streaming joins because events from one stream are held in memory while waiting for matching events from a second stream. Memory needs can be reduced by analyzing the join condition to determine the bounds on the time discrepancy between events in the two streams. When it is determined that an event from one stream must occur prior to the matching event from the other stream, the later-arriving stream data can be ingested with an intentional delay. When it is determined that regardless of input received from a first stream, no output will be produced when there is no input from the second stream, pulling data from the first stream can cease. A multi-stage join plan can be employed so that a less busy stream can be scanned with increasing amounts of intentional delay. Only unmatched data is stored.

Abstract: The present disclosure relates to voicemail categorization and access. An apparatus, for example a PBX, is provided for categorizing voicemails. The apparatus is configured to store voicemail messages and to determine and store metadata associated with the voicemail messages. The apparatus allows searches of the stored voicemail messages to be performed using the associated metadata. A user interface may reside on a user device or be provided by the apparatus. The interface allows other user to search for voicemails using the metadata associated with them and subsequently displays information about the voicemails which match the search criteria.

Abstract: A replication chain comprising one or more replication nodes of a multi-tenant stream management system is assigned to store data records of a partition of a particular data stream. A data record of the partition is received at a selected replication node of the replication chain. In a sequential order, a respective replica of the data record is stored at each replication node of the chain. An acknowledgement of a successful storage of the data record is provided after the replications are completed.

Abstract: Customizing functions performed by data flow operators when processing data streams. An open-executor(s) is provided as part of the data stream analytics platform, wherein such open-executor allows for both of: 1) customizing user plug-ins for the operators, to accommodate changes in user requirements; and 2) predefining templates that are based on specific meta-properties of various operators and that are common therebetween.

Abstract: Representative embodiments are disclosed for providing network and system security. A representative apparatus includes an input-output connector coupleable to a data network; a network interface circuit having a communication port; a nonvolatile memory storing a configuration bit image; and a field programmable gate array (“FPGA”) coupled to the network interface circuit through the communication port, the FPGA configurable to appear solely as a communication device to the first network interface circuit, and to bidirectionally monitor all data packets transferred between the input-output connector and the first network interface circuit and any coupled host computing system. In another embodiment, the FPGA is further configurable for only a partial implementation of a communication protocol, such as a PCIe data link and/or physical layers. The FPGA may also monitor host memory and provide encryption and decryption functionality.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for identifying answer boxes for presentation to a user. In general, one aspect of the subject matter described in this specification can be embodied in methods that include the actions of, while receiving an input entered in a search engine query input field by a first user, and before the first user has submitted the input as a search request, obtaining content for an answer box for the input and presenting the answer box to the first user. The answer box can be an answer box associated with a dominant query for the input, or can be an answer box identified from historical answer box data for the input.

Abstract: An allocation instruction is received that includes a target data operand and a storage medium operand indicating a storage medium for storing the target data. A data dependency is identified that specifies metadata that includes access control information specifying which users have permission to perform a write operation to the file that includes the target data. In response to determining that the allocation instruction allocates the target data from a first storage medium to a second storage medium having a faster data IO rate, the allocation instruction is modified to also allocate the metadata specified in the data dependency to the second storage medium. In another aspect, the allocation instruction is modified to also allocate the metadata identified in the data dependencies to one or more storage mediums with data IO rates that are at least as fast as the second storage medium.

Abstract: A re-configurable logic device such as a field programmable gate array (FPGA) can be used to deploy a data processing pipeline, the pipeline comprising a plurality of pipelined data processing engines, the plurality of pipelined data processing engines being configured to perform processing operations, wherein the pipeline comprises a multi-functional pipeline, and wherein the re-configurable logic device is further configured to controllably activate or deactivate each of the pipelined data processing engines in the pipeline in response to control instructions and thereby define a function for the pipeline, each pipeline function being the combined functionality of each activated pipelined data processing engine in the pipeline.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for identifying answer boxes for presentation to a user. In general, one aspect of the subject matter described in this specification can be embodied in methods that include the actions of, while receiving an input entered in a search engine query input field by a first user, and before the first user has submitted the input as a search request, obtaining content for an answer box for the input and presenting the answer box to the first user. The answer box can be an answer box associated with a dominant query for the input, or can be an answer box identified from historical answer box data for the input.

Abstract: A system and method of providing enhanced data processing and analysis in a storage node, such as a solid state drive (SSD). The SSD includes flash memory and an SSD processing unit capable of executing searches and analysis on the data in the flash memory without returning all of the data to be searched to a host CPU outside of the SSD. Other processing capabilities incorporated into the SSD may include encryption and decryption, compression and decompression, and in-line indexing of data, and data analytics.