Abstract: There is disclosed a method and a system for generating a search query completion suggestion. The method comprises receiving at least a portion of a search query and determining a first query component therein. A suggested second query component related to the first query component is generated, the search query completion suggestion containing the first query component and the suggested second query component. A list of potentially banned words is accessed to determine if the first query component matches any of the potentially banned words maintained therein. It is then determined if the potentially banned word is associated with a ban marker or an unban marker. A list of ban or unban markers respectively is accessed to determine if the suggested second query component matches any of the ban or unban markers maintained therein, the search query completion suggestion being generated or not generated accordingly.

Abstract: A process for serializing and deserializing instance data from a schema is disclosed. A schema can be used to automatically and dynamically generate classes and methods. First, the raw schema may be parsed into an intermediate data structure consisting of <key,value> pairs representing object properties and attributes of the properties. Then, an exemplary process generates new parser classes and methods by iterating over the intermediate data structure's keys and generating classes or class variables based on the property type. Accessors and mutators are generated for each class variable. Additionally, a serialization method and a constructor method are generated for each class. These classes and methods are stored in memory and can be used by a host programming language to transmit, receive, and manipulate data to or from an API.

Abstract: A computer-implemented method includes receiving, by a first computing device, an identification of a video and an identification of a distribution channel of the video. The method includes retrieving, by the first computing device, from a video sharing network, metadata associated with a video. The method includes retrieving, by the first computing device, from a second computing device in a second network, data having at least one characteristic in common with the metadata. The method includes generating, by the first computing device, a profile of the video based on the retrieved data and the metadata. The method includes generating, by the first computing device, a profile of the distribution channel based on the retrieved data and metadata. The first computing device generates a recommendation for a method to increase a level of distribution of the video. The first computing device provides, to a user, the recommendation.

Abstract: A table creation request pertaining to a table in a database maintained on a multi-node data partitioning landscape that comprises a plurality of processing nodes can specify a number of partitions to be generated. At run time, a currently available number of processing nodes in the multi-node data partitioning landscape can be queried, and this currently available number of processing nodes can be compared with the specified number of partitions to be generated for the created table. The table can be generated with the specified number of partitions such that the generated partitions are located across the plurality of partitions according to a load balancing approach if the number of processing nodes equals the number of partitions to be generated or according to other information in the table request if the number of processing nodes does not equal the specified number of partitions.

Abstract: A planning indication directed to a declaratively-described operation and a target MPP database is received where the operation includes multiple mid-operation states and the operation includes, for each state in the plurality of states, those types of devices in a MPP database which would be affected by that state if the operation were performed, including a first set of affected device types and a first mid-operation state. In response to receiving the planning indication, affected device(s) in the target MPP database which would be affected by the first mid-operation state if the operation were performed are determined without performing the operation on the target MPP database. This determination is based at least in part on the first set of affected device types included in the operation. The first mid-operation state and the affected devices are indicated in a display.

Abstract: This invention relates to the creation of a software application to: facilitate the creation, representation and publication of digital objects; in particular, methods and apparatus that improve digital resource retrieval on the part of end users and to provide a new system for the web based marketing of digital assets and online distribution of metadata enriched advertising.

Abstract: Systems and method of the present invention provide for one or more server computers configured to register a domain name; receive a request to: generate a file folder linked to an online storage account owned by a user; and map a URL, comprising a sub domain concatenated to the registered domain name, to the file folder. The server(s) may be further configured to determine whether an alias for the URL, comprising the subdomain, is located in a DNS record for the domain name. The server(s) may automatically generate the file folder and map the URL to the file folder. Any HTTP requests comprising the URL received by the server(s) may be resolved to the file folder.

Abstract: A method for assisting query comprises acquiring a record that includes a unique identification and at least one piece of dimension information associated with the unique identification, wherein each piece of dimension information includes a sequence of attributes, each attribute being ordered in the sequence in accordance with a hierarchically progressive relation; calculating a hash value for an attribute pair comprising attributes of every two neighboring levels; and storing, in association with the hash value, the unique identification in at least one storage device. A method for querying comprises receiving a query; calculating one or more hash values; in response to the one or more hash values matching stored hash values in at least one storage device; deriving an intersection of unique identifications that are stored in association with the matched stored hash values; and returning at least one unique identification included in the intersection as a query result.

Abstract: A method at a server system includes: detecting presentation of a media content item, identifying the media content item and one or more entities related to the media content item, determining respective levels of interest in the identified entities based on one or more signals, selecting a subset of the entities based on the determined levels of interest, and sending to a client device of a user, for presenting at the client device, the selected subset of the entities.

Abstract: A system comprising an associative memory, an input module, a query module, and a display module. The input module is configured to receive a value within a first perspective of the associative memory. The query module is configured to perform an open query of the associative memory using the value, perform the open query within at least one of an insert perspective and a second perspective of the associative memory. The at least one of the insert perspective and the second perspective has as many or more category associations for the value relative to the first perspective. The display module is configured to display a result of the query and to display a list of one or more potential ambiguities that result from the open query.

Abstract: A data normalization system that normalizes data that includes user names is disclosed herein. The data normalization system converts, using a metaphone algorithm, a first string into a first metaphone string, and a second string into a second metaphone string. The data normalization system searches, based on the first metaphone string and the second metaphone string, a name index including a listing of metaphone strings representing common names and probabilities that the common names are either a given name or a surname. The data normalization system determines, based on searching the name index, a confidence score indicating a confidence level that the first string represents the given name and the second string represents the surname. The data normalization system determines that the confidence score meets or exceeds a threshold confidence score, and in response, determines that the first string represents the given name and the second string represents the surname.

Abstract: Provided is a process, including: obtaining reviews of a reviewed category of businesses in a reviewed geographic area by reviewers; determining that reviews from more than a threshold number of reviewers have been obtained and, in response, identifying at least some of the reviewers as being experts in the reviewed category of businesses in the reviewed geographic area; receiving a query from a user; identifying a geographic area and a category of businesses for the query; ranking, with a processor, local search results responsive to the query based on the reviews of the experts in the reviewed geographic area and reviewed business category; and sending ranked search results to the user.

Abstract: Systems and methods for performing multi-index searches are described in which a search string may be received, and processed by first running the query through a general search index, such as an Internet or e-commerce search. The results of the general search may then be analyzed to determine an appropriate context for the search query, e.g. clothing, sports, games, etc. The search query may then be processed using a second search index that is tuned to the specific context of the search query. After obtaining the results to the second search, the second search index and/or ranking algorithms may be modified to improve future search results having a similar context.

Abstract: A recipient node of a multi-node data partitioning landscape can receive, directly from a requesting machine without being handled by a master node, a first data request related to a table. A target node of a plurality of processing nodes can be identified to handle the data request. The determining can include the recipient node applying partitioning information to determine a target data partition of the plurality of data partitions to which the data request should be directed and mapping information associating each data partition of the plurality of data partitions with an assigned node of the plurality of processing nodes. The recipient node can redirect the data request to the target node so that the target node can act on the target data partition in response to the data request.

Abstract: Example embodiments of the present invention leverage the punch command and thin LUNs in order to create a fully dynamic journal which can shrink and grow on demand. The journal may be assigned a maximum allowed size, as well as a journal protection window defining a period for which the journal should retain journal information. A set of currently used blocks will be used and, if protection window is large enough, the oldest data blocks from an undo stream will be punched out from the stream. A manager may monitor how much free space there is in the storage pool and regulate the journal growth if the pool is nearly empty. Additionally, the journal capacity may also depend on the actual usage of the replicated LUNs if the replicated LUNs are thin (i.e., maintain the journal at a particular percentage of the used storage capacity).

Abstract: A computer system receives a plurality of files having respective file sizes. The computer system categorizes the files into different categories according to their respective file sizes. For a file in the first category, the computer system identifies first and second versions of the file and generates a difference between the two versions based on a view of the first version and a view of the second version. For files in the second category, the computer system identifies a file aggregation of the files by combining them into one file such that the combined file have a file size within the first file size range. The computer system identifies first and second versions of the file aggregation and generates a difference between the first and second versions based on a view of the first version and a view of the second version of the file aggregation.

Abstract: A mechanism is provided in a computing system for interpreting and distinguishing a lack of an answer to an input question. The mechanism receives an input question from a user. The mechanism generates one or more hypotheses based on a corpus of source information. The mechanism injects a no-answer response into the one or more hypotheses to form a plurality of candidate answers. The mechanism ranks the plurality of candidate answers based on evidence scoring and confidence scoring to form a candidate answer ranking. Responsive to determining the no-answer response is the top candidate answer in the candidate answer ranking, the mechanism presents the no-answer response to the user.

Abstract: Disclosed are various embodiments for saving search results. In one embodiment, each search result is rendered in association with a corresponding toggle control. A search result becomes selected when the corresponding toggle control is activated and the search result is in an initial state. A search result becomes deselected when the corresponding toggle control is activated and the search result is in a saved state.

Abstract: According to an aspect, a question answering computer system determines a set of search terms for a given question. A plurality of passages that each includes at least one search term in the set of search terms is identified in response to a search of a document for search terms in the set of search terms. A passage from the plurality of passages is selected. A context based score of the selected passage that indicates the likelihood that the selected passage contains an answer to the question is generated based on criteria that specify a relationship among the set of search terms, content of the passage, and content of at least one other passage in the plurality of passages.

Abstract: Calculation of aggregated values in a history database table can be optimized using an approach in which an ordered history table is accessed. The ordered history table can include a sequential listing of commit identifiers associated with updates, insertions, and/or deletions to values in the database table. The ordered history table can be traversed in a single pass to calculate an aggregation function using an optimized algorithm. The optimized algorithm can enable calculation of an aggregated metric of the values based on a selected method for tracking invalidated values to their corresponding commit identifiers. The calculated metric is generated for a current version of the database table; and promoted.