Abstract: In an aspect there is provided a method. The method may include providing, at a repository, storage for a plurality of tenants, providing a plurality of layers, and providing a plurality of versions; and separating, based on the plurality of layers and the plurality of versions, data for each of the plurality of tenants, wherein during runtime one of the plurality of tenants corresponds to the plurality of layers and one of the plurality of versions. Related apparatus, systems, techniques and articles are also described.

Abstract: A method for document management includes automatically extracting respective features from each of a set of documents. The features are processed in a computer so as to generate respective vectors for the documents, each vector including elements having respective values that represent properties of a respective document. A similarity between the documents is assessed by computing a measure of distance between the respective vectors. The documents are automatically clustered responsively to the similarity so as to identify a cluster of the documents belonging to a common document type. Similar methods may be used in supervised categorization, wherein documents are compared and categorized based on a training set that is prepared for each document type.

Abstract: In the display of a search result using a virtual space, the display and operation in the space is associated with an addition and change of search instruction to facilitate to grasp the content and to operate a search. A plurality of contents each of which having a keyword is arranged in the virtual space and displayed on a display screen. When one key is set, a content to be a search target is selected from among the plurality of contents based on a position at which the key is set, a search is performed on the selected search target with the set key, and an arrangement of the contents is changed and displayed based on a relationship with the key and the plurality of contents.

Abstract: A system is configured to determine aggregated social media variables that may be used for modeling. The system includes an information identifier module determining keywords and phrases. The system also includes an aggregator receiving information collected from social media applications using the keywords and phrases and determining values for social media variables from the collected information. The aggregator aggregates the social media variables based on the values and weightings of the social media variables.

Abstract: A method for establishing multiple look-up tables and a data acquisition method using multiple look-up tables are provided. In the present method, a plurality of input data is classified into a plurality of groups, and a plurality of input data and a plurality of output data corresponding to the input data are respectively provided to the groups to establish a plurality of corresponding look-up tables. At least one bit is selectively removed from the input data in each of the look-up tables corresponding to at least one of the groups, and the result input data and the corresponding output data are recorded in the look-up table corresponding to the group.

Abstract: Provided are categorizing unit (2) which analyzes whether or not a character string contained in text data matches any of member character strings of a category provided as parameters, and acquires a category character string provided as a parameter for a name scale of the matched member character string; and an integration unit (3) which integrates the acquired category character string to a relational database. A category character string converted from the text data can be arbitrarily changed by a parameter, and a member character string used for assessing the match at the time of converting the text data to the category character string can be also changed arbitrarily by a parameter, and thereby, the text data can be flexibly categorized interactively.

Abstract: A system in accordance with exemplary embodiments may provide a scalable segment-based data de-duplication for incremental backups. In the system, a master device on a secondary-storage node side may receive at least incremental changes, fingerprints, mapping entities, and distribute de-duplication functionality to at least a slave device, and performs data de-duplication on said plurality of segments via a way to cluster a plurality of fingerprints in a data locality unit called container for the incremental changes, varied sampling rates of a plurality of segments by having a fixed sampling rate for stable segments and by assigning a lower sampling rate for a plurality of unstable target files of de-duplication, and a per-segment summary structure to avoid unnecessary I/Os involved in de-duplication.

Abstract: Methods of and systems for dynamically rearranging search results into hierarchically organized concept clusters are provided. A method of searching for and presenting content items as an arrangement of conceptual clusters to facilitate further search and navigation on a display-constrained device includes providing a set of content items and receiving incremental input to incrementally identify search terms for content items. Content items are selected and grouped into sets based on how the incremental input matches various metadata associated with the content items. The selected content items are grouped into explicit conceptual clusters and user-implied conceptual clusters based on metadata in common to the selected content items. The clustered content items are presented according to the conceptual clusters into which they are grouped.

Abstract: The construction of a semantically associated computer search database is disclosed. A text catalog containing the text particulars and contents of a plurality of electronic documents, a term association database which joins text search terms with their semantic meanings or definitions, and a content association database which contains records associating text search terms and their contextual definitions in respect of individual electronic documents are used to in conjunction provide a text index in which it is possible to search based upon the actual definitions or meanings of certain text or terms within the electronic documents, reducing or refining query search result sets. A method of operating a search engine with the index in question, as well as other e-commerce methods employing the index as a refining tool are also disclosed.

Abstract: In particular embodiments, advertising groups may be formed based on keywords. Access a plurality of keywords, each keyword comprising one or more words and describing one or more characteristics or features of particular advertising subject matter. Annotate each of the keywords with one or more labels selected from a plurality of labels, each label comprising one or more words and describing one or more aspects of or one or more categories or concepts represented by the keyword. Group the keywords into one or more keyword groups based on similarities between the labels of the keywords, each keyword group comprising one or more of the keywords. Form one or more advertising groups from the keyword groups, comprising from each of the keyword groups, form one or more of the advertising groups, each of the advertising groups comprising one or more of the keywords in the keyword group.

Abstract: Methods and systems for clustering information items using nonnegative tensor factorization are disclosed. A processing device receives one or more class labels, each corresponding to an information item, a selection for a nonnegative tensor factorization model having an associated objective function and one or more parameter values, each corresponding to one of one or more penalty constraints. The processing device determines a constrained objective function based on the objective function associated with the selected nonnegative tensor factorization model, the one or more parameter values and the one or more class labels and including the one or more penalty constraints. The processing device determines clusters for the plurality of information items by evaluating the constrained objective function. Pairwise constraints may be received in addition to or instead of the class labels.

Abstract: One particular embodiment clusters a plurality of documents using one or more clustering algorithms to obtain one or more first sets of clusters, wherein: each first set of clusters results from clustering the documents using one of the clustering algorithms; and with respect to each first set of clusters, each of the documents belongs to one of the clusters from the first set of clusters; accesses a search query; identifies a search result in response to the search query, wherein the search result comprises two or more of the documents; and clusters the search result to obtain a second set of clusters, wherein each document of the search result belongs to one of the clusters from the second set of clusters.

Abstract: To determine a seasonal effect in temporal data, for each of a plurality of candidate seasons, the following is performed. An interval is defined for the corresponding candidate season. The interval is divided (108) into plural buckets containing respective sets of the temporal data, and statistical measures for corresponding buckets are computed. The computed statistical measures are used to compute (112) a score for the corresponding candidate season. Scores computed for corresponding candidate seasons are used for identifying which of the candidate seasons represents the seasonal effect of the temporal data.

Abstract: According to one embodiment, a latent semantic mapping (LSM) space is generated from a collection of a plurality of documents, where the LSM space includes a plurality of document vectors, each representing one of the documents in the collection. For each of the document vectors considered as a centroid document vector, a group of document vectors is identified in the LSM space that are within a predetermined hypersphere diameter from the centroid document vector. As a result, multiple groups of document vectors are formed. The predetermined hypersphere diameter represents a predetermined closeness measure among the document vectors in the LSM space. Thereafter, a group from the plurality of groups is designated as a cluster of document vectors, where the designated group contains a maximum number of document vectors among the plurality of groups.

Abstract: A database for object recognition is generated by performing at least one of intra-object pruning and inter-object pruning, as well as keypoint clustering and selection. Intra-object pruning removes similar and redundant keypoints within an object and different views of the same object, and may be used to generate and associate a significance value, such as a weight, with respect to remaining keypoint descriptors. Inter-object pruning retains the most informative set of descriptors across different objects, by characterizing the discriminability of the keypoint descriptors for all of the objects and removing keypoint descriptors with a discriminability that is less than a threshold. Additionally, a mobile platform may download a geographically relevant portion of the database and perform object recognition by extracting features from the query image and using determined confidence levels for each query feature during outlier removal.

Abstract: Data analysis is disclosed, including: receiving data to be analyzed, wherein the data includes one or more data identifiers (IDs) and one or more preset key-value pairs, wherein each preset key-value pair includes a preset key and a preset value; acquiring data to be analyzed based at least in part on the data IDs; segmenting the acquired data into one or more data elements; classifying the one or more data elements based at least in part on one preset key of the one or more preset key-value pairs; and analyzing the classified one or more data elements based at least in part on one preset value of the one or more preset key-value pairs.

Abstract: A system and method for updating a system that controls files executed on a workstation. The workstation includes a workstation management module configured to detect the launch of an application. A workstation application server receives data associated with the application from the workstation. This data can include a hash value. The application server module can determine one or more categories to associate with the application by referencing an application inventory database or requesting the category from an application database factory. The application database factory can receive applications from multiple application server modules. The application database factory determines whether the application was previously categorized by the application database factory and provides the category to the application server module. Once the application server module has the category, it forwards a hash/policy table to the workstation management module.

Abstract: A method includes generating, a plurality of sets of pairs of records from a set of records, for each attribute-position pair in the set of records. Each attribute-position pair being indicative of a position of an attribute in a record. Further, the method includes forming, electronically, a plurality of groups, each group comprising two attribute-position pairs having different attributes. Further, the method also includes determining, electronically for each group, number of pairs of records that are common in the two attribute-position pairs of that group. Furthermore, the method includes extracting results based on a first group of the plurality of groups if the number of pairs of records that are common in the two attribute-position pairs of the first group is greater than a second threshold, is highest among the plurality of groups, and no group having three or more attribute-position pairs with different attributes is possible.

Abstract: Techniques are described herein for selecting an advertisement using user search history segmentation. Instances of queries that are provided by a user are referred to collectively as the search history of the user. The search history is segmented into sessions that correspond to respective tasks of the user. Each of the sessions includes a respective subset of the query instances that are included in the user's search history. A weight is assigned to each session based on attribute(s) of the respective session. A session that includes a first subset of the query instances is selected based on the weight that is assigned to that session. Features are extracted from query instances that are included in the first subset. Weights are assigned to the extracted features based on attribute(s) of the first subset. An advertisement is selected to be provided to the user based on the extracted features and corresponding weights.

Abstract: The present invention relates to a method for the automatic identification of at least one informative data filter from a data set that can be used to identify at least one relevant data subset against a target feature for subsequent hypothesis generation, model building and model testing. The present invention describes methods, and an initial implementation, for efficiently linking relevant data both within and across multiple domains and identifying informative statistical relationships across this data that can be integrated into agent-based models. The relationships, encoded by the agents, can then drive emergent behavior across the global system that is described in the integrated data environment.

Abstract: In one embodiment, data relating to usage patterns of the user is stored, wherein the data includes information as to items which were used and the context in which they were used. The data is then clustered into clusters of data points. Then a centroid is determined for each of the clusters. A cluster similar to a current context of the user is selected by comparing a data point representing the current context of the user to one or more of the centroids. For each of one or more items, a threshold based on values for a plurality of the centroids with respect to the corresponding item, wherein a threshold is used to compare with centroid value of an item in a selected cluster to determine whether to recommend the item.

Abstract: A method includes receiving a list of sequential telephone numbers, and iteratively: identifying a first number and a last number of the list, selecting a group size, creating a group of sequential telephone numbers from the list of sequential telephone numbers based on the selected group size, and removing the created group from the list of sequential telephone numbers. Creating the group may include determining whether a first number in the list of sequential telephone numbers ends with a predetermined digit, assigning the first number as a start number of the group, and identifying an end number in the group based on the start number and the selected group size.

Abstract: An information estimation apparatus 1 for estimating a transmission point in time of a document whose transmission point in time is not specified in a document set to be analyzed includes a structure analysis unit 3 configured to specify, from the document set, a document having a document structure in which a link relationship with another document is indicated in a table-of-contents manner, and extract the link relationship of documents included in the document set from the document structure of the specified document, a grouping unit 4 configured to set a group of documents using the specified document and the extracted link relationship, and an estimation unit 5 configured to estimate, based on the set group and a transmission point in time of a document that is included in the group and whose transmission point in time is specified, a transmission point in time of a document that is included in the group and whose transmission point in time is not specified.

Abstract: This patent application relates to interval-based information retrieval (IR) search techniques for efficiently and correctly answering keyword search queries. In some embodiments, a range of information-containing blocks for a search query can be identified. Each of these blocks, and thus the range, can include document identifiers that identify individual corresponding documents that contain a term found in the search query. From the range, a subrange(s) having a smaller number of blocks than the range can be selected. This can be accomplished without decompressing the blocks by partitioning the range into intervals and evaluating the intervals. The smaller number of blocks in the subranges(s) can then be decompressed and processed to identify a doc ID(s) and thus document(s) that satisfies the query.

Abstract: Systems, methods and articles of manufacture are disclosed for extracting a feature of an entity. A data record that includes the feature may be received. The feature may be characterized. Data related to the feature may be retrieved from a data source. The feature may be recharacterized based on the retrieved data. The data source may be updated with an association between the recharacterized feature and the retrieved data.

Abstract: Inferences acquired by applying clustering analysis cannot be reliably assessed before data-originated errors are quantified, an exacting task that is often not performed. This invention presents a clustering method suited for this purpose. Designed for systems with normally distributed error, a common trait to many data systems, and built on a framework of agglomerative hierarchical clustering, this invention treats each observation as a Gaussian distribution function, uses an exact mathematical relation to track error, and gives results from which quantitative statistics are easily extracted.

Abstract: A system and method for grouping similar documents is provided. Frequencies of occurrences are determined for terms and noun phrases within a set of documents. A subset of the documents is selected by removing those documents having terms and noun phrases that fall outside a bounded range of upper and lower conditions for frequency of occurrence. Each of the documents in the subset is mapped to a cluster of documents based on a similarity of the documents to the cluster documents.

Abstract: A method and system for performing a graph search, includes constructing an abstract representation of the graph using state-space abstraction. The abstract representation of the graph includes one or more abstract nodes having duplicate detection scopes and one or more abstract edges having operator groups. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning. The abstract edges include the smaller duplicate detection scopes. Nodes in the current search layer are expanded using the operator groups of outgoing abstract edges of the abstract nodes the nodes map to. The operator groups associated with abstract edges having disjoint duplicate detection scopes are used to expand the nodes in parallel. Once all the operator groups in the current search layer have been used for node expansion the method progresses to the next search layer.

Abstract: A “Real-Time-Ready Analyzer” combines a data stream management system (DSMS) with a map-reduce (M-R) framework to construct a streaming map-reduce framework that is suitable for real-time Behavioral Targeting (BT) (or other temporal queries). The Real-Time-Ready Analyzer allows users to write “dual-intent” temporal analysis queries for BT. These queries are succinct and easy to express, scale well on large-scale offline data, and can also work over real-time data. Further, the Real-Time-Ready Analyzer uses the aforementioned streaming map-reduce framework to provide dual-intent algorithms for end-to-end BT phases. Experiments using real data from an advertisement system show that the Real-Time-Ready Analyzer is very efficient and incurs orders-of-magnitude lower development effort than conventional systems.

Abstract: Disclosed are methods for developing authorized chemical palettes for formulating products with reduced adverse environmental and/or health concerns, and advising the public to a greater extent regarding the ingredients of products formulated using these palettes. Also disclosed are computer systems to implement such methods.

Abstract: One or more techniques and/or systems are disclosed that provide for document retrieval where a user can identify key attributes of potential target documents that are desirable (e.g., have a particular semantic content for the user). Further, relevant documents that comprise the desired semantic content can be retrieved. Additionally, the user can provide feedback on the retrieved documents, for example, based on key semantic concepts found in the documents, and the input can be used to update the classification. For example, this process can be iterated to improve the retrieval and precision of documents found through machine learning techniques.

Abstract: Techniques to manage social connections are described. An apparatus may comprise a processor communicatively coupled to a memory. The memory may be arranged to store a social analysis component that when executed by the processor is operative to receive a list of members in a social network, receive at least one relationship indicator derived from multiple member attributes of a member, and generate a social identifier based on the relationship indicator, the social identifier representing a social connection type for a social connection or potential social connection between two or more members of the list of members in the social network. Other embodiments are described and claimed.

Abstract: The illustrative embodiments provide a method, computer program product, and apparatus for managing collectively sensitive data. Collectively sensitive data is divided into a first partition for reassembly data, a second partition of the collectively sensitive data, and a third partition of the collectively sensitive data. Each of the second partition and the third partition are collectively nonsensitive in isolation. The first partition is stored in a translation table in a secure database. The translation table is configured for use in assembling collectively sensitive data from the second partition and the third partition. The second partition of the collectively sensitive data is stored in a first database associated with a first cloud computing environment. The third partition of collectively sensitive data is stored in a second database associated with a second cloud computing environment.

Abstract: Systems and methods to extract and utilize textual semantics are described. The system receives item information that describes an item for sale on a network-based marketplace and analyzes the item information to generate application information that identifies a plurality of applications. The plurality of applications includes a first application that further includes the item as a first component of the first application. The system stores a listing in a database that includes the application information and the item information and publishes the listing on the network-based marketplace to sell the item via the network-based marketplace.

Abstract: Keyword extraction technique embodiments are presented which extract topically related keywords from a set of topically related documents. In one general embodiment, this keyword extraction involves first accessing a set of topically related documents. A number of candidate keywords are then identified from the set of related documents. A weighted keyword candidate-document matrix is formed using these candidate keywords, and it is partitioned into multiple groups of keyword candidates. Dense clusters of keyword candidates whose density exceeds a prescribed density threshold are then identified in each of the groups of keyword candidates. Finally, the keyword candidates associated with each dense cluster are designated as topically related keywords.

Abstract: A system includes a database instance, a data storage system, and a database management system. The data storage system stores a first data partition and a second data partition. The first data partition includes a first plurality of database pages storing tenant-independent data and a first converter associated with the first partition. The second data partition includes a second plurality of database pages storing tenant-independent data and a second converter associated with the second partition.

Abstract: A system and method for updating a filtering system which controls access to a website/page between a local area network (LAN) and an Internet. The LAN includes an Internet gateway system coupled to a workstation and configured to receive a URL request. The system controls access to the website/page associated with the URL based on one or more categories that are associated with the URL. The Internet gateway system can determine the category that is associated with the URL by referencing a master database or requesting the category from a database factory. The database factory can receive URLs from multiple Internet gateway systems. The database factory determines whether the identifier was previously categorized by the database factory and provides the category to the Internet gateway system. Once the Internet gateway system has the category, it applies rules associated with the category and user to filter access to the requested website/page.

Abstract: A behavior index indicates a development of occurrence of events included in log data by a connection of a plurality of nodes, and includes a branching node connecting to two or more subsequent nodes and an integrating node connected to two or more preceding nodes. When a regular expression converting part inputs a search condition indicating an event appearance order from a client, a search automaton retaining part generates a state transition table in accordance with the search condition. While a node type determining part determines the node types of the respective nodes of the behavior index, a state evaluating part analyzes the respective nodes to determine the states of the respective nodes, and determines whether or not a state transition pattern matches the state transition table. Regarding a branching node, the respective nodes of each of branching routes branching from the branching node are analyzed.

Abstract: In a system and method for order-independent stream query processing, one or more input streams of data are received, and the one or more input streams are analyzed to determine data which is older than an already emitted progress indicator. The data which is older than the already emitted progress indicator is partitioned into one or more partitions, and each of the one or more partitions are independently processed using out-of-order processing techniques. A query is received, rewritten and decomposed into one or more sub-queries that produce partial results for each of the one or more partitions, where each of the one or more sub-queries correspond to a partition. A view is also produced that consolidates the partial results for each partition. The partial results are consolidated at a consolidation time specified by the query to produce final results, and the final results are provided.

Abstract: A computer-implemented method according to one embodiment includes, for each of a plurality of accessories: determining a compatibility of an accessory; determining a type of the accessory; and determining features of the accessory. The accessories are associated into logical groups based on the compatibility, type and features thereof. A computer-implemented method according to one embodiment includes obtaining information about accessories; parsing out individual offers corresponding to the accessories; extracting meaningful phrases from the offers; classifying new offers based on the phrases; and outputting a result of the classification. Additional systems, methods and computer program products are also presented.

Abstract: In a user-activity identification technique, a user's actions are monitored while the user is using a computer. While these user actions are associated with user activities, the user activities are initially unspecified, so the tracked user actions constitute unsupervised data. Then, the tracked user actions are aggregated into subsets (for example, using clustering analysis), and user-activity classifications for the subsets (such as activity labels) are provided by the user, so the subsets constitute supervised data. Subsequently, when additional user actions (which are associated with one or more initially unspecified current user activities) are tracked, they can be associated with one or more of the classified subsets. For example, information about the additional user actions can be mapped in real time (or near real time) to one or more of the subsets using a supervised learning technique. In this way, the one or more current user activities can be identified.

Abstract: A content recommendation device deciding content to be recommended to a user among a plurality of content items includes: a clustering section creating a cluster set including clusters by clustering use statuses of content of users on the basis of a predetermined index; an effectiveness determining section determining effectiveness of the clustering by evaluating a correlation between the content and the cluster in the cluster set; a popular content deciding section selecting the cluster to which the user who becomes a recommendation partner belongs from the cluster set and deciding the popularity degree of each content item in accordance with the use status of each content item by the users in the cluster; and a recommended content deciding section evaluating the popularity degree of each content item in the cluster to which the user who becomes the recommendation partner belongs by taking into account and estimating the effectiveness of the cluster set therein and deciding the relatively popular content ite

Abstract: A method and system for discovering a control event from electronically published documents and received data streams is provided, in which a computer control program identifies electronically published documents and data stored in a plurality of network servers which potentially contain control events relevant to the control of goods and/or services, the control events identified by reference to user interest identifiers. Identified material is analyzed by a classification program to determine whether control events are present. A control event classification is assigned to documents and received data determined to contain at least one discovered control event, the assigned control event classification and information identifying the associated document and data is stored in a classification database, and a report of discovery of documents and data containing control events is be provided to a user. The report may includes a link to the control event classification and/or its associated document or data.

Abstract: Provided is a base sequence cluster generating system, method, and program product for performing cluster generation. The base sequence cluster generating system utilizes a computer system having a database containing base sequences receives a query sequence over. The computer uses spliced base sequences as a query sequence to generate a first cluster including base sequences that are likely to constitute a spliced pair with the query sequence. Spliced alignment is applied to the generated first cluster to generate a second cluster including spliced pairs. The generated second cluster is returned to the requester.

Abstract: Assisted clustering systems and methods are described herein that provide a user interface by which a user can easily create clusters and selectively associate data items with such clusters. Information regarding data item-cluster associations made by the user is processed by a recommendation engine to learn a clustering model. The clustering model is then be used to generate recommendations for the user regarding which unassociated data items should be associated with which clusters. In certain embodiments, after the user has determined that the clustering model is performing at a satisfactory level based on the quality of the recommendations, the user can cause the system to automatically cluster a large quantity of remaining unassociated data items. In accordance with further embodiments, a user can specify arbitrary data item types for clustering as well as features of such data types that should be considered in generating the clustering model.

Abstract: Systems and methods are provided for selecting contexts for new invitational content and invitational content for new contexts. In particular, a performance history of delivered invitational content in known contexts is combined with similarity measures for the delivered invitational content, with respect to a new invitational content, to generate a list of potential contexts for the new invitational content. Similarly, a performance history of in known contexts with delivered invitational content can combined with similarity measures for known contexts, with respect to a new context, to generate a list of potential content for the new context. Further, a combination of these methods can be used to pair new invitational content with new contexts.

Abstract: A system and method for aligning multilingual content and indexing multilingual documents, to a computer readable data storage medium having stored thereon computer code means for indexing multilingual documents, to a system for presenting multilingual content. The method for aligning multilingual content and indexing multilingual documents comprises the steps of generating multiple bilingual terminology databases, wherein each bilingual terminology database associates respective terms in a pivot language with one or more terms in another language; and combining the multiple bilingual terminology databases to form a multilingual terminology database, wherein the multilingual terminology database associates terms in different languages via the pivot language terms.

Abstract: A method and system for automatically refining information extraction (IE) rules. A provenance graph for IE rules on a set of test documents is determined. The provenance graph indicates a sequence of evaluations of the IE rules that generates an output of each operator of the IE rules. Based on the provenance graph, high-level rule changes (HLCs) of the IE rules are determined. Low-level rule changes (LLCs) of the IE rules are determined to specify how to implement the HLCs. Each LLC specifies changing an operator's structure or inserting a new operator in between two operators. Based on how the LLCs affect the IE rules and previously received correct results of applying the rules on the test documents, a ranked list of the LLCs is determined. The IE rules are refined based on the ranked list.

Abstract: Metadata may be stored in, and retrieved from, a scalable, fault-tolerant metadata service. In one example, metadata is divided into partitions, and each partition is served by one or more nodes. For each partition, a first one of the nodes may handle read and write requests, and the other nodes may handle read requests in the event that the first node is down or is experiencing high load. When a request is made with respect to metadata, a metadata server may identify a node, in the partition to which the metadata is assigned, to which the request is to be made. The entity that is making the request then contacts that node, and requests the read or write on the metadata. In a partition, metadata may be replicated between the first node and the other nodes using a log-based replication protocol.

Abstract: This specification describes technologies relating to content presentation. In general, one aspect of the subject matter described in this specification can be embodied in methods that include the actions of receiving data from a plurality of users within a geographic region associated with a location; analyzing the received data to derive a category for the location; annotating the location with the category; and using the category to boost candidate content items for delivery to users in the location in response to future content item requests.