Abstract: An automated marketing system includes an interactive display that is configured to display blocks to generate a computer-executable workflow structure for a marketing operation. The blocks contain rules, logic, or both, and are used to construct the computer-executable workflow structure of the marketing operation. The data associated with the blocks is parsed and compiled into a marketing operation. The system executes the computer-executable workflow structure by transmitting one or more messages to one or more members of an audience. The system is configured to obtain and store metrics associated with the executed computer-executable workflow structure.

Abstract: A fleet of query accelerator nodes is established for a data store. Each accelerator node caches data items of the data store locally. In response to determining that an eviction criterion has been met, one accelerator node removes a particular data item from its local cache without notifying any other accelerator node. After the particular data item has been removed, a second accelerator node receives a read query for the particular data item and provides a response using a locally-cached replica of the data item.

Abstract: Embodiments of a system and method for dynamically selecting a communication technology based at least in part on the success in forming a peer-to-peer connection for playing an instance of a video game are disclosed. Further, the systems may dynamically select a communication technology based on the quality of service of an established communication connection between two or more computing systems corresponding to two or more users attempting to play the instance of the video game. In some embodiments, the identification of a communication technology may occur during a gaming session and the communication technology used at the start of the game play session may be transitioned to another communication technology enabling the maintenance of a level of quality of service.

Abstract: A fleet of query accelerator nodes is established for a data store. Each accelerator node caches data items of the data store locally. In response to determining that an eviction criterion has been met, one accelerator node removes a particular data item from its local cache without notifying any other accelerator node. After the particular data item has been removed, a second accelerator node receives a read query for the particular data item and provides a response using a locally-cached replica of the data item.

Abstract: A fleet of query accelerator nodes is established for a data store. Each accelerator node caches data items of the data store locally. In response to determining that an eviction criterion has been met, one accelerator node removes a particular data item from its local cache without notifying any other accelerator node. After the particular data item has been removed, a second accelerator node receives a read query for the particular data item and provides a response using a locally-cached replica of the data item.

Abstract: A fleet of query accelerator nodes is established for a data store. A particular node stores a binary encoding of a data item in a local data cache. The encoding identifies a metadata record indicating names of attributes of the data item. In response to receiving a particular query directed to the data item, an executable code component generated to produce a result for the query is cached in a local query code cache. When a second query which meets a matching criterion is received, the executable code component is re-used to obtain a result for the second query.

Abstract: An accelerator intermediary node (AIN) associated with a data store obtains an indication of a control setting to be applied with respect to a write request directed to a data item, where the control setting specifies a target for one or more of replication count, data durability, a transaction grouping with respect to a write request, or back-end synchronization node. Using the control setting, a write propagation node set is identified for the write request. The write propagation node set includes another accelerator intermediary node and/or a storage node of a data store. Respective operation requests corresponding to the write request are transmitted to one or more members of the write propagation node set. A write coordinator role may be verified prior to attempting a commit together of a plurality of write requests as part of a multi-write transaction.

Abstract: A fleet of query accelerator nodes is established for a data store. A particular node determines a write throughput limit for back-end writes from the fleet to the data store. A pool of write-back threads is established at the node. When a write request is received at the node, an entry is added to a selected partition of a write-back journal, and a write completion response is provided to the requester without applying the write to the data store. A write-back thread from the pool eventually schedules the back-end write.

Abstract: A method, system, and device supporting installation of updates to software and/or firmware in memory of an electronic device is described. The update information may be automatically generated based upon a list of all software components or packages already present on the electronic device, and may comprise software components for all dependencies of an application being installed by the update that are not already present on the electronic device.

Abstract: A method, system, and device supporting installation of updates to software and/or firmware in memory of an electronic device is described. The update information may be automatically generated based upon a list of all software components or packages already present on the electronic device, and may comprise software components for all dependencies of an application being installed by the update that are not already present on the electronic device.

Abstract: A Peer-to-Peer Application Data Routing Fabric is described. The Fabric provides routing between endpoints resident in peer nodes of a Service Oriented Architecture where the routing is based on endpoint presence, availability, status, and location to satisfy the requirements of fault tolerance and load balancing among homogenous endpoints; or routing by address among instances of differing type. In the preferred embodiment of the Fabric, the Session Initiation Protocol components, interactions and transport mechanisms are leveraged and extended.

Abstract: A Peer-to-Peer Application Data Routing Fabric is described. The Fabric provides routing between endpoints resident in peer nodes of a Service Oriented Architecture where the routing is based on endpoint presence, availability, status, and location to satisfy the requirements of fault tolerance and load balancing among homogenous endpoints; or routing by address among instances of differing type. In the preferred embodiment of the Fabric, the Session Initiation Protocol components, interactions and transport mechanisms are leveraged and extended.

Abstract: Techniques for generating and vending of unique sequence values are described. Each master of a ring of masters is configured to create and vend the unique sequence values downstream to filling pools for eventual client consumption. When a ring of masters is employed, each master communicates with one another to agree on a current range of values that should next be vended. A master may then vend these values to a layer of one or more filling pools, at least of which includes or has access to persistent and non-persistent storage memories.

Abstract: A method, system, and device supporting installation of updates to software and/or firmware in memory of an electronic device is described. The update information may be automatically generated based upon a list of all software components or packages already present on the electronic device, and may comprise software components for all dependencies of an application being installed by the update that are not already present on the electronic device.

Abstract: A method, system, and device supporting installation of updates to software and/or firmware in memory of an electronic device. The updates may be accompanied by advertising, promotional and information content that is dynamically displayed to a user during processing of the update in the electronic device. The update information may be automatically generated based upon a list of all software components or packages already present on the electronic device, and may comprise software components for all dependencies of an application being installed by the update that are not already present on the electronic device.

Abstract: In some embodiments, the instant invention provides for a computer-implemented method that includes steps of: receiving data feeds associated with healthcare-related entities, where a data schema of each data feed is unknown prior to the receipt; automatically determining, in real-time, for each entity, at least: a first type data fragment identifying an identifier associated with the entity and ii) second type data fragments containing items of information about the entity; automatically storing the entity information across distributed non-relational computer databases, by: creating, each time, records, where each record includes a row with columns, where the row is associated with the first identifier and where each column of the row has: 1) a name composed of a hierarchical path to a content of each column and 2) the item of information of the second type data fragment; and determining a verified record of the entity at a particular time.

Abstract: A method of updating computer software includes identifying an orphaned computer file in a second version of computer software, the orphaned computer file having a name that does not correspond to any name of a computer file in a first version of computer software and computing symmetric divergence between the orphaned computer file and each computer file in the first version of computer software. The method also includes choosing a file from the computer files in the first version of computer software that yields a minimum value of symmetric divergence between the file and the orphaned computer file and using the file as a reference file for compressing the orphaned computer file.

Abstract: A method and computer-readable memory device that enable processing of a first memory image comprising a plurality of compressed sub-blocks and uncompressed sub-blocks to produce a second memory image comprising contents of the first memory image arranged as a plurality of memory blocks. The memory blocks of the second memory image may be independently decompressible, to enable more efficient updating of an electronic device.

Abstract: In one embodiment, an initial series of bytes are scanned to determine a frequency of occurrence within the initial series of bytes for a plurality of byte strings. A data structure is generated containing the plurality of byte strings and count values representing a frequency of occurrence for the plurality of byte strings in the initial series of bytes. A most common byte string of the plurality of byte strings in the initial series of bytes is determined from the count values. Each instance of the most common byte string in the initial series of bytes is replaced with a first substitute byte string to form a revised series of bytes. A most common byte string in the revised series of bytes is determined from the data structure without resetting the count values associated with at least some of the plurality of byte strings.

Abstract: In one embodiment, an initial series of bytes are scanned to determine a frequency of occurrence within the initial series of bytes for a plurality of byte strings. A data structure is generated containing the plurality of byte strings and count values representing a frequency of occurrence for the plurality of byte strings in the initial series of bytes. A most common byte string of the plurality of byte strings in the initial series of bytes is determined from the count values. Each instance of the most common byte string in the initial series of bytes is replaced with a first substitute byte string to form a revised series of bytes. A most common byte string in the revised series of bytes is determined from the data structure without resetting the count values associated with at least some of the plurality of byte strings.