Abstract: Systems and methods for securing transaction messages are described. In an example, a rule set may be accessed. The rule set may specify a selection of a key from a plurality of keys or an obfuscation process from a plurality of obfuscation processes. The selection may be based on a condition associated with securing transaction messages. The keys or the obfuscation processes may be stored at a card reader. An instruction about the selection may be provided to the card reader based on the rule set and a determination that the condition is satisfied. In turn, a secure transaction message may be received from the card reader. The secure transaction message may have been secured based on the key or the obfuscation process. The secure transaction message may be provided to a transaction system that includes a management system associated with the key or the obfuscation process.

Abstract: Systems and methods for securing transaction messages are described. In an example, a transaction network may receive a transaction message. The transaction message may have been secured based on a key or an obfuscation process. They key or the obfuscation process may be associated with a management system of the transaction network. The transaction message may be received based on a rule set specifying a selection of the key from a plurality of keys or the obfuscation process from a plurality of obfuscation processes. The selection may be based on a condition associated with securing the transaction message. The keys or the obfuscation processes may be stored at least at a card reader. The management system may access the transaction message and may provide transaction data to an endpoint based at least in part on the transaction message being accessed.

Abstract: A balance tracker application is disclosed that can track a numerical value, an accumulating value, or any other balance. Time-series tables are employed to store a transaction history. The time-series tables facilitate higher transaction throughput and reduces the likelihood that a managed database will partition tables storing transaction data.

Abstract: Categorization of data may be performed using rule-based data categorization. Rules may be used to categorize the data into a limited number of categories for a temporary, ad hoc, or updatable process. The rules may be validated to make sure the rules are not ambiguous, contradictory, unattainable, or otherwise ineffective. The rules may include a priority value which may be used as a tie breaker when more than one rule applies to a record. To implement the rules, a lookup flow may be generated to enable rapid or quick traversal of applicable rules for a particular lookup while bypassing at least a portion of the rules. In some embodiments, a record (e.g., an item, etc.) may be categorized during a transaction process to determine a tax classification, a promotion, or another type of classification, which may then be used to complete the transaction.

Abstract: A normalized caching system is configured to modify one or more parameters of a service request to generate a “normalized” service request, causing the service to return a normalized response. The normalized response is typically useful for servicing a wider range of subsequent requests than is a non-normalized response. Thus, a wider range of subsequent service requests can be serviced from the cache, without the need to send such service requests to the service.

Abstract: A method and system is provided for maintaining customer data in a data store system utilizing a scalable partitioning framework. More specifically, the data store of a customer service system is partitioned (divided) into multiple partitions by a partitionable key of customer data so that each partition owns a subset of the customer data. By maintaining several partitions that store a subset of the customer data exclusive to each other, blackout or brownout problems can be local to one partition and, thus, the availability for the entire system will be increased. Moreover, a set of partitionable keys, a minimal unit to be moved between partitions, is grouped and associated with a partition. By eliminating direct dependencies between the partitions and the partitionable keys, the system can have great flexibility with regard to migrating customer data between partitions and adding a new partition.

Abstract: A normalized caching system is configured to modify one or more parameters of a service request to generate a “normalized” service request, causing the service to return a normalized response. The normalized response is typically useful for servicing a wider range of subsequent requests than is a non-normalized response. Thus, a wider range of subsequent service requests can be serviced from the cache, without the need to send such service requests to the service.

Abstract: A method and system is provided for maintaining customer data in a data store system utilizing a scalable partitioning framework. More specifically, the data store of a customer service system is partitioned (divided) into multiple partitions by a partitionable key of customer data so that each partition owns a subset of the customer data. By maintaining several partitions that store a subset of the customer data exclusive to each other, blackout or brownout problems can be local to one partition and, thus, the availability for the entire system will be increased. Moreover, a set of partitionable keys, a minimal unit to be moved between partitions, is grouped and associated with a partition. By eliminating direct dependencies between the partitions and the partitionable keys, the system can have great flexibility with regard to migrating customer data between partitions and adding a new partition.

Abstract: A normalized caching system may receive a data request from a requestor, the request associated with a requested service. The normalized caching system may generate a normalized request by modifying one or more parameters of the request. A normalized response is typically useful for servicing a wider range of subsequent requests than is a non-normalized response. The system may then check whether an entry is cached for the normalized request. If no cached entry is found, the normalized request may be submitted to the requested service, and response received in return. The normalized response may be cached using the normalized request. The response may be denormalized in order to generate a response which is provided to the requestor. When a subsequent request is received, if that subsequent request normalizes to the same normalized request, it may be fulfilled using the response stored in cache, rather than using the requested service.

Abstract: A method and system is provided for maintaining customer data in a data store system utilizing a scalable partitioning framework. More specifically, the data store of a customer service system is partitioned (divided) into multiple partitions by a partitionable key of customer data so that each partition owns a subset of the customer data. By maintaining several partitions that store a subset of the customer data exclusive to each other, blackout or brownout problems can be local to one partition and, thus, the availability for the entire system will be increased. Moreover, a set of partitionable keys, a minimal unit to be moved between partitions, is grouped and associated with a partition. By eliminating direct dependencies between the partitions and the partitionable keys, the system can have great flexibility with regard to migrating customer data between partitions and adding a new partition.