Abstract: Method to order query results, by processing a received query at least in part using a composite key index, wherein the composite key index comprises at least two key columns, wherein the at least two key columns comprise at least one pre-ordering column and an ordering column, wherein the query specifies ordering criteria to order a result set based on values of the ordering column, wherein the processing comprises receiving, from the composite key index, an ordering column value for each unique pre-ordering column value in the composite key index, identifying a first ordering column value as being ordered first according to the ordering criteria, and returning the first ordering column value as being responsive to the query.

Abstract: An embodiment of the invention comprises a method associated with a Web API ecosystem and API users includes identifying specified events over a period of time that respectively affect the ecosystem. Events can comprise an interaction between the ecosystem and a Web API user or a specified Web API. The embodiment further includes constructing a data structure that contains a data element representing each identified event. An interface is used to translate respective data elements between the data structure and a data store, wherein the data store represents translated data elements in a form different from that used to represent the data elements in the data structure.

Abstract: A method and system for generating summary details is provided. The method includes retrieving event data of associated with a user. Attributes are extracted from the event data and the event data is segmented into logical groups of related activities performed by the user. Key information and associated attributes of each logical group are identified and in response the user is evaluated. The logical groups of related activities are ranked and presented to the user. In response, an engagement summary associated with the user and the logical groups is generated.

Abstract: A method includes receiving information about a plurality of data chunks and determining if one or more of a plurality of back-end nodes already stores more than a threshold amount of the plurality of data chunks where one of the plurality of back-end nodes is designated as a sticky node. The method further includes, responsive to determining that none of the plurality of back-end nodes already stores more than a threshold amount of the plurality of data chunks, deduplicating the plurality of data chunks against the back-end node designated as the sticky node. Finally, the method includes, responsive to an amount of data being processed, designating a different back-end node as the sticky node.

Abstract: A method, executed by a processor, for generating a transaction classification rule that can be applied to unclassified transactions. The method includes receiving an identification of an existing unclassified transaction upon which the classification rule will be based; generating identification rules to identify subsequent unclassified transactions as similar to the existing unclassified transaction; generating the classification rule using the identified transaction; and storing the classification rule for application to the subsequent unclassified transactions. Application of the generated classification rule to the subsequent unclassified transactions produces transactions classified according to the classification rule.

Abstract: A delta store giving row-level versioning semantics to a non-row-level versioning underlying store is described. An example method includes establishing a column-based in-memory database including a main store and a delta store, where the main store does not allow concurrent transactions on a same table and the delta store has a plurality of row-visibility bitmaps implementing a row-level versioning mechanism that allows concurrent transactions on the same table. A transaction associated with the column-based in-memory database is received. For each table read by the transaction, a version of the table in the delta store that represents a transaction-consistent snapshot of the database visible to the transaction is determined. Each table is represented in the main store and the delta store; and each version of the table is represented by one or more bitmaps.

Abstract: A video search system provides a user with a list of videos that are similar to a reference video selected by the user. A client device operated by the user may receive the reference video and transmit it to the video search system. The video search system generates a reference textual representation of actions depicted in the reference video based on an analysis of the contents of the reference video. The video search system further compares the reference textual representation with a plurality of textual representations generated based on videos stored in a library of videos. Based at least partly on the comparison, the video search system generates video search results that are provided to the client device. In certain functions, the client device may generate the reference textual representation and transmit the reference textual representation to the video search system for comparison.

Abstract: Save set indexing outside of backup windows is described. A system creates a snapshot of a save set without creating an index of the save set. The system creates the index of the save set in response to creating the snapshot of the save set.

Abstract: Techniques for performing database operations using vectorized instructions are provided. In one technique, data compaction is performed using vectorized instructions to identify a shuffle mask based on matching bits and update an output array based on the shuffle mask and an input array. In a related technique, a hash table probe involves using vectorized instructions to determine whether each key in one or more hash buckets matches a particular input key.

Abstract: Multiple clients can be enabled to perform operations relative to data items in a shard system asynchronously to each other without the use by those clients of exclusive locks. A rebalancing event, in which data items are redistributed automatically among a set of shards due to a modification of the quantity of shards in the system, can be performed without the use of exclusive locks by clients. Clients can continue to perform operations relative to at least some of the data items in the shard system even while rebalancing processes are redistributing at least some of the data items asynchronously during a system-wide rebalancing event. All of these benefits can be obtained without sacrificing data consistency within the shard system.

Abstract: Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator. The method includes receiving a plurality of key values by the hardware accelerator, storing each the plurality of keys into a location on a memory of the hardware accelerator, and creating a pointer to each of the locations of the plurality of keys. The method also includes storing the pointer to each of the plurality of keys into a first array stored by the hardware accelerator, sorting the plurality of keys by ordering the pointers in the first array and by using a second array for storing the pointers, wherein the sorting identifies a winning key from the plurality of keys in the memory, and outputting the winning key.

Abstract: Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator. The method includes receiving a plurality of key values by the hardware accelerator, storing each the plurality of keys into a location on a memory of the hardware accelerator, and creating a pointer to each of the locations of the plurality of keys. The method also includes storing the pointer to each of the plurality of keys into a first array stored by the hardware accelerator, sorting the plurality of keys by ordering the pointers in the first array and by using a second array for storing the pointers, wherein the sorting identifies a winning key from the plurality of keys in the memory, and outputting the winning key.

Abstract: Providing efficient data replication for a transaction processing server is provided. A notification is received from the transaction processing server which completes a transaction of a message. The notification includes a message digest and a message identifier. The message identifier in the received notification is compared with a stored message identifier. In response to a match of the comparing of the message identifier, the message digest in the received notification is compared with a stored message digest. In response to a match of the comparing of the message digest, a stored input message is directly stored in a physical storage.

Abstract: Various technologies described herein pertain to predicting intrinsically diverse sessions and retrieving information for such intrinsically diverse sessions. Search results retrieved by a search engine responsive to executing a query are received. A query classifier can be employed to determine whether the query is intrinsically diverse or not intrinsically diverse based on one or more features of the query and session interaction properties. The query is intrinsically diverse when included in an intrinsically diverse session directed towards a task, where the query and disparate queries included in the intrinsically diverse session are directed towards respective subtasks of the task. An objective function can be evaluated based at least upon the query to compute an optimized value when the query is determined to be intrinsically diverse. The search results can be presented on a display screen according to the optimized value when the query is determined to be intrinsically diverse.

Abstract: A determination is made that each of at least two social network contacts involved in a social messaging interaction initiate a separate web search associated with the social messaging interaction. A separate set of web search results returned to each of the at least two social network contacts is captured in association with each initiated separate web search. A combined live search results view that includes each captured separate set of web search results is provided to each of the at least two social network contacts. The combined live search results view provides navigation to web content returned to other social network contacts.

Abstract: A transaction model for data stores using a distributed file system is disclosed. In various embodiments, a transaction-related metadata is sent to each of a plurality of segments to which a corresponding assigned portion of a query plan is assigned. A metadata modification record is received from zero or more of the segments, reflecting changes, if any, to system metadata required to be made to reflect changes to data made by that segment in processing the portion of the query plan assigned to that segment. It is determined whether a metadata modification record has been received from each of the segments in the plurality of segments. In the event a metadata modification record is determined to have been received from each of the segments in the plurality of segments, a system metadata store is updated to reflect the respective metadata modification records received from the plurality of segments.

Abstract: A determination is made that each of at least two social network contacts involved in a social messaging interaction initiate a separate web search associated with the social messaging interaction. A separate set of web search results returned to each of the at least two social network contacts is captured in association with each initiated separate web search. A combined live search results view that includes each captured separate set of web search results is provided to each of the at least two social network contacts. The combined live search results view provides navigation to web content returned to other social network contacts.

Abstract: Disclosed herein are technologies related to database calculation that utilizes parallel-computation of tasks in a directed acyclic graph. In accordance with one aspect, dependency of tasks is converted into a directed acyclic graph that topologically orders the tasks into layers of tasks. A database calculation may be performed, wherein the database calculation computes in parallel the tasks in each layer of the layers of tasks.

Abstract: Non-existent domain (NXD) queries may be monitored to determine if a keyword is included in NXD queries for a brand top level domain (TLD). When a predetermined number of NXD queries have been received for a brand domain that include the keyword, an action may be initiated. The action may be related to the registration of a new domain for the brand domain including the keyword.

Abstract: A system and method of accessing web or network sites interfacing through a walled garden web server by dynamically expanding the reach of the walled garden on a user-by-user basis, based on the content that is returned to the user. The system includes a traffic analyzer and filter, a traffic forwarder, a traffic tagger, and a traffic redirector. A plurality of databases interface with the traffic analyzer and filter for appropriately manipulating web traffic from users by matching URL requests from a user with seed URLs in one or more of the databases. A depth parameter may be associated with a URL, indicating the number of times a particular domain has been traversed by a particular user. A depth rating database may be used to specify the number of times a particular URL may be accessed.