Abstract: Improved access of a multidimensional database can be implemented using a space-filling curve, such as a z-order curve, and a tree structure. A state engine is configured to track the state of the dimensions of the database as the tree structure is traversed. Different states allow optimizations such as avoidance of analyzing a dimension for further nodes of the tree and removal of multiple nodes in a sub-tree.

Abstract: Aspects of the present disclosure include a system comprising a machine-readable storage medium storing instructions and computer-implemented methods for consistency mitigation in real-time streams. Consistent with some embodiments, the method includes reading a message object from a message queue and adding the message object to an aggregating cache. The aggregating cache includes a linked list of ordered message objects. The method further includes applying an aggregating function to the message objects in the linked list and persisting the aggregated message objects to a database. The method further includes clearing the message objects from the aggregating cache based on the message objects being persisted to the database.

Abstract: Improved access of a multidimensional database can be implemented using a space-filling curve, such as a z-order curve, and a tree structure. A state engine is configured to track the state of the dimensions of the database as the tree structure is traversed. Different states allow optimizations such as avoidance of analyzing a dimension for further nodes of the tree and removal of multiple nodes in a sub-tree.

Abstract: Improved access of a multidimensional database can be implemented using a space-filling curve, such as a z-order curve, and a tree structure. A state engine is configured to track the state of the dimensions of the database as the tree structure is traversed. Different states allow optimizations such as avoidance of analyzing a dimension for further nodes of the tree and removal of multiple nodes in a sub-tree.

Abstract: Aspects of the present disclosure include a system comprising a machine-readable storage medium storing instructions and computer-implemented methods for consistency mitigation in real-time streams. Consistent with some embodiments, the method includes reading a message object from a message queue and adding the message object to an aggregating cache. The aggregating cache includes a linked list of ordered message objects. The method further includes applying an aggregating function to the message objects in the linked list and persisting the aggregated message objects to a database. The method further includes clearing the message objects from the aggregating cache based on the message objects being persisted to the database.

Abstract: Disclosed are systems, methods, and non-transitory computer-readable media for an availability oriented durability technique for distributed server systems. A server that is an entry point for a message processing stream receives a message from a client device, and in response, generating a unique identifier for the message, and adds an entry in a transaction log that including the message and the unique identifier for the message. The server appends the unique identifier to the message, and transmits the message to a second server positioned downstream from the server in the message processing stream. If the server determines that the message has not been processed through the message processing stream, the server accesses the message from the transaction log, appends the unique identifier to the first message, and re-transmitting the message to the second server positioned downstream from the server in the message processing stream.

Abstract: Disclosed are systems, methods, and non-transitory computer-readable media for an availability oriented durability technique for distributed server systems. A server that is an entry point for a message processing stream receives a message from a client device, and in response, generating a unique identifier for the message, and adds an entry in a transaction log that including the message and the unique identifier for the message. The server appends the unique identifier to the message, and transmits the message to a second server positioned downstream from the server in the message processing stream. If the server determines that the message has not been processed through the message processing stream, the server accesses the message from the transaction log, appends the unique identifier to the first message, and re-transmitting the message to the second server positioned downstream from the server in the message processing stream.

Abstract: Improved access of a multidimensional database can be implemented using a space-filling curve, such as a z-order curve, and a tree structure. A state engine is configured to track the state of the dimensions of the database as the tree structure is traversed. Different states allow optimizations such as avoidance of analyzing a dimension for further nodes of the tree and removal of multiple nodes in a sub-tree.

Abstract: Disclosed are various embodiments for navigating a taxonomy using search queries. A search query is parsed in order to identify one or more item categories. A confidence score for each item categories is generated. When the confidence score meets a threshold, a pool of items associated with a respective category is selected. When the confidence score fails to meets the threshold, the pool of items is selected from the collection of items.

Abstract: Disclosed are various embodiments for navigating a taxonomy using search queries. An unstructured search query is parsed in order to identify one or more categories of a taxonomy of a collection of items. Each one of the one or more categories is associated with a confidence score. When the confidence score meets a threshold, a pool of items is selected from a respective one of the one or more categories. When no confidence score meets the threshold, the pool of items is selected from the collection of items.

Abstract: Disclosed are various embodiments for generating search results when a search string fails to return results as entered. In a representative example, a failure of a first query generated from a search string to identify at least a predefined threshold number of items from among a plurality of items in a data store is detected in a computing device. A plurality of altered versions of the search string is generated in the computing device. A submission of a plurality of second queries to the data store is implemented, where each of the second queries corresponds to one of the altered versions of the search string. A presentation is generated to be rendered of at least two separate groups of items resulting from corresponding ones of the second queries.

Abstract: A collection of items may be categorized according to a category hierarchy. A search of the items may be explicitly associated with a particular category in the hierarchy or else unassociated. A set of refinements may be available, for example, to help narrow the search. Refinements may be applicable to items in linked categories. Refinements may be surfaced based at least in part on linked categories associated with the search. Refinements may be surfaced when the search is unassociated with a particular category. For example, a possibly relevant set of categories may be determined. Refinements may be surfaced according to a variety of ordering criteria.

Abstract: Disclosed are various embodiments providing navigational aids within item search results. A pool of items is generated in a computing resource in response to a search query and a search context. At least one network page is encoded for rendering by a client. The at least one network page includes a ranked list of at least a portion of the items. The ranked list includes a navigational aid when a relevance score associated with the navigational aid meets a threshold. The relevance score is computed relative to respective relevance scores associated with items in the ranked list. The navigational aid has at least a same prominence within the ranked list as an item.