Abstract: Techniques are described herein for using user-defined aggregate functions for updating inverted index tables. A user-defined aggregate function is registered in a database system for updating an index table based on changes stored in a staging table. A query specifying the user-defined aggregate function may be executed in parallel to parallelize the updating of the index table.

Abstract: Disclosed are various embodiments for optimizing location searches using geohash codes. A common prefix for a plurality of geohash codes associated with a respective one of a plurality of bounding boxes is identified, wherein each of the plurality of bounding boxes represents a geographic area. A location identifier from another computing device is received. A geohash code based at least in part on the location identifier is identified. The geohash code is then compared with the common prefix for each of the plurality of bounding boxes. Next, a list of common prefixes that match the geohash code. A list of respective geographic areas is returned to the other computing device based at least in part on the list of common prefixes.

Abstract: Provided is a voice search technology that can efficiently find and check a problematic call. To this end, a voice search system of the present invention includes a call search database that stores, for each of a reception channel and a transmission channel of each of a plurality of pieces of recorded call voice data, voice section sequences in association with predetermined keywords and time information. The call search database is searched based on an input search keyword, so that a voice section sequence that contains the search keyword is obtained.

Abstract: Applications may be tagged with location data when they are used. Mobile device may anonymously submit application usage data. Aggregated application usage data from many mobile devices may be analyzed to determine applications that are particularly relevant to a given location (i.e., exhibiting a high degree of localization). Analysis may include determining the application usage intensity, whether hotspots exist or not at a given location, the spatial entropy of a particular application, the device populations in a particular area, etc. Based on the localized application analysis, applications may be ranked according to local relevance, and, based on this ranking, application recommendations may be provided to a user.

Abstract: A system for generating an effective test data set for testing big data applications includes a data collector, a data analyzer, an input domain modeler, a self-adaptive input domain modeler, and a test data set generator. The data collector collects a high volume of data from an original data set and initial constraints, the data analyzer analyzes the data and the initial constraints to generate analytical results, the input domain modeler automatically generates an input domain model based on the analytical results, the self-adaptive input domain modeler generates a self-adaptive input domain model by combining the input domain model and analytical results, and the test data set generator generates an initial test data set based on the self-adaptive input domain model. A method for generating an effective test data set for testing big data applications is also described.

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: According to some embodiments, a business intelligence language expansion and compilation platform may receive a business intelligence language expression, containing at least one macro sub-expression from a user. Information may then be accessed in a business and data models data store to perform expansion and compilation operations on the received business intelligence language expression. As a result of these operations, the system may provide a native query to a data source database. A business intelligence language result set manager may retrieve data from a data source database responsive to the native query and output a business intelligence language result set to the user in response to the business intelligence language expression.

Abstract: Techniques and mechanisms are disclosed that enable a data intake and query system to generate and cause display of circular timelines of timestamped event data. As used herein, a circular timeline generally refers to a graphical display of timestamped events stored by a data intake and query system, wherein the timestamped events may be displayed as arcs of one or more concentric circles and located in a circular timeline area according to a chronological ordering associated with the events. One or more display attributes of each arc may further depend on other data associated with the corresponding events. For example, each arc of a circular time may be displayed at a particular radial distance, with a particular thickness, using a particular shading and/or color, etc., depending on various data values associated with the one or more events represented by the arc.

Abstract: An information processing device assists generation of social communication, based on user communication information exchanged through a network. The information processing device includes: a communication information collection unit that collects the communication information; a life log information extraction unit that extracts life log information included in the collected communication information; a life log information storage unit that stores the extracted life log information in a configuration capable of being searched at least on an individual user unit basis, the life log information storage unit memorizing scores of a plurality of indexes while associating the scores with the life log information, the indexes indicating degrees of contribution of the life log information to new social communication generation; and a life log information management unit that manages the life log information stored in the life log information storage unit, based on a combination of the scores of the indexes.

Abstract: A software and hardware facility persistently maintains metrics on directories at different levels within a tree of a filesystem. The facility hierarchically aggregates attributes of files contained by directories and stores them as metric values in each directory within a tree. The stored values represent summed or otherwise aggregated data from the descendant directories and files. The metric values represent aggregated attributes such as total space consumed by a directory and all the descendant directories and files, total number of files within a directory, total data blocks used by a directory and its descendant directories and data files, etc.

Abstract: A technique for atomically moving a linked data element may include providing an atomic-move wrapper around the data element, along with an existence header whose status may be permanent, outgoing or incoming to indicate whether the data element is not in transition, or if in transition is either outgoing or incoming. The existence header may reference an existence group having a state field that changes state using a single store operation. A first state may indicate that the data element exists if its existence header is outgoing, and does not exist if its existence header is incoming. A second state may indicate that the data element exists if its existence header is incoming, and does not exist if its existence header is outgoing. Following the state change, the existence group and any atomic-move wrapper containing an outgoing existence header and data element may be freed following an RCU grace period.

Abstract: A method and apparatus for adding information to a graph database. A computer system receives initial records from a legacy database. The computer system converts the initial records from a source format for the legacy database into nodes and relationships for the graph database. The computer system also stores the nodes and the relationships in the graph database. The graph database stores the information about employees in an organization. Further, the computer system receives a group of records after the initial records have been converted into the nodes and the relationships for the graph database. Still further, the computer system changes at least one of a group of nodes or a group of relationships in the graph database based on the group of records. A synchronization between the legacy database and the graph database occurs.

Abstract: The user feedback module receives from a user device a selection of a seed media item. The seed media item includes a seed label. The user feedback module further generates a list, the list includes the seed label and a set of related labels based on the seed label. The seed label and each related label include a separate label weight. The user feedback module also identifies multiple media items associated with an associate label. The associate label includes at least one of the seed label or a related label of the first set of related labels. The user feedback module also transmits to the user device a first media item from the multiple media items. The user feedback module adjusts the label weight of the associate label based on a user feedback on the first media item.

Abstract: A network lookup engine in a network switch is configured to generate multiple lookup queries for each incoming packet in parallel to a remote search engine. The number and type of the lookup queries depend on the protocols supported by the network switch. The responses from the search engine arriving at the lookup engine are not in the same order as the order of the packets. The network lookup engine is configured to collect the responses for the parallel lookup queries in two modes: 1) in-order mode in which the first packet having its lookup queries sent to the search engine has its responses collected first regardless of the order of the responses received from the search engine; 2) out-of-order mode in which the first packet having complete responses to its lookup queries from the search engine has its responses collected first regardless of the order of incoming packets.

Abstract: One or more techniques and/or computing devices are provided for implementing synchronous replication. For example, a synchronous replication relationship may be established between a local storage controller hosting local storage and a remote storage controller hosting remote storage (e.g., replication may be specified at a file, logical unit number (LUN), or any other level of granularity). Data file operations may be implemented in parallel upon the local storage and the remote storage. Independent metadata file operations may be independently implemented from data file operations upon the local storage, and upon local completion may be remotely implemented upon the remote storage. In-flight data file operations may be drained before dependent metadata file operations are locally implemented upon the local storage, and upon local completion may be remotely implemented upon the remote storage.

Abstract: Provided herein are mixed-media modules with functional layers that can be used to provided additional information to targeted audience. Systems and methods are disclosed for performing processing involved with search, such as processing search information to return search results. In one exemplary implementation, there is provided a method for processing information to return search results including mixed-media media presentation(s) selectable by a user. Moreover, such method may involve user interaction to manipulate the presentation, display various media and/or effect other functionality. Further implementations may involve generation of interactive, visually rich mixed-media content of high information density providing improved user experience and/or improved value to various participants.

Abstract: Key values can be defined at design time (e.g. in a DTTI object) using character strings that include wildcard characters that define multi-dimensional key ranges. Wildcard characters can designate that a single variable character is to be inserted or that a range from zero to multiple characters can be inserted. The use of wildcards can make checks for key intersection non-trivial. During run time, the key values to be accessed from one or more tables are evaluated, and the operation proceeds. An error can occur if the presence of one or more wildcards in two key value strings used in an aggregation operation result in an overlap such that a same record is included more than once.

Abstract: Systems and methods are disclosed for defining content presentation interfaces based on identified similarities between received and stored media content items. In one implementation, a processing device receives a first media content item from a content creator. The processing device processes the first media content item in relation to one or more media content items associated with a content owner to identify one or more similarities between the first media content item and the one or more media content items. The processing device defines, based on an identification of one or more similarities between the first media content item and the one or more media content items and in relation to the content owner, one or more aspects of a content presentation interface within which the first media content item is presented.

Abstract: A method and apparatus for processing service requests. A computer system creates a preliminary compendium comprising building blocks. A building block is a word entity extracted from a text source in a plurality of text sources that are related to a domain of interest. At least a portion of the text sources comprises past service requests. The computer system filters the building blocks in the preliminary compendium based on relevance with respect to the domain of interest to create similarity indicators that form a refined compendium. The computer system analyzes text within a new service request using the past service requests and the refined compendium to generate a ranking of past service requests that ranks the past service requests based on similarity to the new service request. The ranking of past service requests enables the computer system to identify a set of possible resolutions for the new service request.

Abstract: An image search is executed. The search results are presented as a collection of thumbnail images organized according to an initial ranking. As the user browses the thumbnail images, he/she encounters a thumbnail image of interest. Selecting this thumbnail causes an enlarged preview image to be displayed. The user can manipulate the enlarged preview image with panning and zooming operations, thereby enabling the user to more closely inspect portions of the preview image which attract the user's interest. These interactions with the search results, which include the initial selection of the thumbnail image and the subsequent manipulation of the enlarged preview image, provide insight into the user's interest. Once the user has interacted with a threshold quantity of search results, the collection of thumbnail images is filtered and reorganized to more prominently position those search results that correspond to the user's interest, as gleaned from analyzing the aforementioned user interactions.