Abstract: A method includes analyzing a plurality of electronic documents available via a network service, selecting content of the documents encountered during the analysis to generate signatures for the documents based on the content of the documents, generating an index comprising the signatures, and updating the index by performing additional analysis. The index is updated to include documents having the same signatures.

Abstract: Systems, software, and computer-implemented methods can be used to present search results and search refinement suggestions identified in response to a search query using a search refinement wheel. In response to receiving a search query, a set of suggested query refinements are obtained. A spoke graph structure processable to present a visual representation of the search query and at least a portion of the set of the at least one search query refinements is generated, where the search query is represented by a first node in the visual representation and each of the portion of the set of the search query refinements is represented by an individual spoke in the visual representation that can be activated to generate a corresponding new search query. The generated graph can be provided in response to the search query, e.g., to a client device from which the search query is received.

Abstract: A system provides a user interface through which users can flexibly tag individual items represented in an electronic catalog with user-defined tags, such as text strings, and obtain recommendations that are specific to particular tags. The tags and tag-item assignments created by each user are stored persistently in association with the user, and may be kept private to the user or exposed to others. Once a user has assigned a tag to a number of items, the user (or another user in some embodiments) can request and obtain recommendations that are specific to this tag. These recommendations may be generated in real time by a recommendation service that identifies items that are collectively similar or related to the items associated with the tag.

Abstract: A textual search index is used to identify data objects that have numerical properties that satisfy search queries. As described herein, a search index contains search index entries, each of which specifies a reference string and a set of data object identifiers. When an original search query is received, the search query is transformed into a transformed search query such that numerical comparison query elements in the original search query are transformed into equivalent textual comparison query elements. The search index is then used to identify ones of the data objects that satisfy the transformed search query. A list of the identified data objects may then be provided in response to the original search query.

Abstract: A powerful set of features can assist software developers in searching source code. Source code can be queried to find occurrences of source code elements mapped to domain concepts appearing in an ontology. Queries can specify a search for occurrences of particular operations performed on domain concepts within the source code. Query expansion can be used to locate related domain concepts as indicated in the ontology. Query keyword weighting can be used to emphasize one domain concept over another. Tools can be provided to create the ontology and associate the ontology with the elements appearing in the source code. Results can include user interface features assisting in navigation to a location within the source code associated with the query results.

Abstract: To provide a technique for accurately and efficiently generating Boolean search formulas that serve as a basis of similarity search. A Boolean search formula generation apparatus according to the present invention establishes Boolean search formulas expressed in a standard sum of products form connecting products of search terms by a sum and evaluates the Boolean search formulas based on a recall and a precision. The Boolean search formula generation apparatus repeats connecting the products of the search terms with maximum evaluation values by a sum to establish a Boolean search formula.

Abstract: A content management system provides a way to detect a change to one part of a document, and to generate a corresponding change in a different part of the same document. Dynamic inclusion rules define conditions that, when satisfied, allow automatically changing a link in a document to a new link when corresponding data in the document is added or changed. If a change corresponds to a defined dynamic inclusion rule, a corresponding query in the rule is evaluated according to the changes in the document. When there is enough information to run the query, the query is automatically executed in a background process. If there is a single link that satisfies the query, the document may be updated with the new link. If multiple links satisfy the query, the top ranked query result may be automatically selected, or the user may select which link should be included in the document.

Abstract: Systems and methods are provided for improved web searching. In one implementation, suggested search queries are provided based on previous search queries and click data. A weighted bi-partite graph or index may be used to identify related search queries based on overlapping clicked URLs. According to a method, query-click log data of a search engine is processed to generate sets of suggested search queries, data corresponding to each suggested search query, and a set of clicked URLs related to each suggested search query. Additionally, or independently, methods may be provided for contextually correcting spelling errors within sets of suggested search queries using a contextual algorithm, and/or identifying and discarding sets of suggested search queries and URLs that lead to restricted material, such as restricted content and related URLs.

Abstract: Methods for classifying computer objects. The methods may comprise receiving a tag for a first computer object. The tag may comprise at least two nested categories describing the first computer object. The methods may also comprise updating a hierarchy of categories for computer objects to include the at least two nested categories describing the computer object. In addition, the methods may comprise displaying a graphical representation of the hierarchy of categories, and displaying an indication of computer objects having tags comprising a first category when an indication of the first category is received.

Abstract: A graphical user interface is disclosed for management and easy reorganization of graphical objects displayed over the graphical user interface. The graphical user interface may relate to prioritizing and organizing the results of a database search. The graphical user interface may alternatively relate to prioritizing and organizing graphic objects such as personalized topics on a homepage and formatting icons in a productivity application program, such as a word processing application program, a spreadsheet application program, a presentation application program and a drawing application program.

Abstract: Embodiments relate to a system, computer program product and method for database query optimization. An aspect includes a method that extracts complex predicates from a query statement, the query statement having at least two complex predicates. The method then executes a query associated with the query statement and obtains at least a respective execution structure cost (?Ti) for each of the complex predicates. The method also calculates an overall execution structure cost corresponding to each of the complex predicates, the complex predicates being arranged according to result of the query and the execution structure costs (?Ti); and optimizes a database query by selecting the arrangement of complex predicates having a lowest overall execution structure cost.

Abstract: Methods and systems for providing related web pages are disclosed. One method includes identifying a plurality of web pages, wherein the plurality of web pages each have a relationship with the first file, wherein the world wide web provides a platform for sharing web pages, and wherein each web page includes a document or information resource that is suitable for the world wide web and is accessible through a web browser. The method further includes generating a list of inquiries based on the plurality of web pages, providing, the list of inquiries to at least one author of the first file, receiving from the at least one author at least one response to the list of inquiries, selecting a subset of the plurality of web pages based on the at least one response, and storing information related to the selected subset of the plurality of web pages.

Abstract: Methods and systems are provided for creating an adaptive thesaurus. A term pair including an index term and an expansion term is received. A recall gain, an expansion independence, and a semantic similarity of the term pair are calculated using a processor. Whether to store the term pair is determined based on the recall gain, the expansion independence, and the semantic similarity. The term pair is stored based on the determination. Methods and systems are provided for searching using an adaptive thesaurus. A search query including a query term is received. An expansion term stored in association with an index term matching the query term in the adaptive thesaurus is retrieved. Using a processor, the search query is expanded using the expansion term based on a recall gain, an expansion independence, and a semantic similarity.

Abstract: In embodiments, methods and systems for improving a query in a database system are provided. These method and system embodiments can enable greater contextual knowledge about the types and use of data in tables underlying a relational database to be employed to improve query efficiency. By employing contextual information, embodiments can provide improved queries and/or make recommendations to a query optimizer of a database system to improve its operation based upon knowledge of the data and/or application gathered. Embodiments can be useful in improving query performance in multi-tenant database systems.

Abstract: A system and method for responding to a query. An original query is received. A first semantic query and a second semantic query are extracted from the information of the original query. The first semantic query is transformed, based upon semantic analysis, into a numeric model query. The second semantic query is submitted to a semantic analyzer and the numeric model query is submitted to a numeric model analyzer. A response for the second semantic query and a response for the numeric model query are integrated into an answer for the original query.

Abstract: Tagging of content items and entities identified therein may include a matching process, a classification process and a disambiguation process. Matching may include the identification of potential matching candidate entities in a content item whereas the classification process may categorize or group identified candidate entities according to known entities to which they are likely a match. In some instances, a candidate entity may be categorized with multiple known entities. Accordingly, a disambiguation process may be used to reduce the potential matches to a single known entity. In one example, the disambiguation process may include ranking potentially matching known entities according to a hierarchy of criteria.

Abstract: A system and method for enabling information providers using a computer network such as the Internet to influence a position for a search listing within a search result list generated by an Internet search engine. The system and method of the present invention provides a database having accounts for the network information providers. Each account contains at least one search listing having at least three components: a description, a search term comprising one or more keywords, and a bid amount. The network information provider may add, delete, or modify a search listing after logging into his or her account via an authentication process. The network information provider influences the position for a search listing through a continuous online competitive bidding process. The bidding process occurs when the network information provider enters a new bid amount, which is preferably a money amount, for a search listing.

Abstract: An approach is provided that visually distinguishes between entity types in a communication system. A Data store with entities is queried, with entities connected to one another as senders and receivers, resulting in a query result. A node data structure corresponding to each of the entities is created and an edge data structure corresponding to each of the connections between the entities is also created. Nodes corresponding to the node data structures are displayed, along with edges (e.g., connection lines) corresponding to the edge data structures. A user selects one of the nodes that is displayed, and the selected node is visually highlighted. Different types of non-selected nodes are identified based on the selected node. Types of nodes may include sender type nodes, receiver type nodes, and sender/receiver type nodes. The types of identified nodes are highlighted in a manner that visually distinguishes each type from the other types.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining a generalized edit distance for queries. In one aspect, a method includes selecting query pairs of consecutive queries, each query pair being a first query and a second query consecutively submitted as separate queries, each first and second query including at least one term. For each query pair, the method includes selecting term pairs from the query pair, each term pair being a first term in the first query and a second term in the second query; and determining a co-occurrence value for each term pair. The method also includes determining transition costs based on the co-occurrence values for term pairs, each transition cost indicative of a cost of transitioning from a first term in a first query to a second term in a second query consecutive to the first query.

Abstract: In a method for generating a business process model project, a computer receives a data file comprising text, descriptive of a business process. The computer searches a sentence in the text for a keyword indicative of existence of a corresponding business artifact stated elsewhere in the sentence. In response, the computer identifies an indicator in the sentence, the indicator designating a name of the corresponding business artifact. The computer identifies a business artifact based on the keyword and the indicator. The computer generates a business process model project based in part on the business artifact.

Abstract: Embodiments are directed to implementing custom operators in a query for a parallel query engine and to generating a partitioned representation of a sequence of query operators in a parallel query engine. A computer system receives a portion of partitioned input data at a parallel query engine, where the parallel query engine is configured to process data queries in parallel, and where the queries include a sequence of built-in operators. The computer system incorporates a custom operator into the sequence of built-in operators for a query and accesses the sequence of operators to determine how the partitioned input data is to be processed. The custom operator is accessed in the same manner as the built-in operators. The computer system also processes the sequence of operators including both the built-in operators and at least one custom operator according to the determination indicating how the data is to be processed.

Abstract: Techniques for optimizing a search are disclosed. In one embodiment, a method for optimizing search on a Web site comprises: retrieving first search results corresponding to a first search request from a remote data store, causing the first search results to be stored in a local data store, receiving an indication that a portion of the second search results that are to be returned in response to a second search request overlaps with the first search results, causing an overlapped portion of the second search results to be retrieved from the local data store, and retrieving a remaining portion of the second search results from the remote data store. The local data store comprises a database associated with a browser, a trusted frame associated with the Web site, or a trusted script associated with the site and configured to determine the overlap of the first and second search results.

Abstract: A search term suggestion engine of a computing device receives characters of user data as the characters are input. The user data is at least part of a search term to be provided to one of multiple applications to search for the search term. An indication of multiple suggestion sources is received from the one application, and one or more suggested search terms are obtained, from the multiple suggestion sources, based on the received characters. One or more suggested search terms can also be obtained from the multiple suggestion sources based on one or more linguistic alternatives for the received characters. The one or more suggested search terms are combined into a combined set of suggested search terms, and the combined set of suggested search terms is returned to a search user interface for presentation to the user.

Abstract: Provided is a method for grouping identity records to generate candidate lists to use in an entity and relationship resolution process. A plurality of identity records provide attributes of entities. The received identity records are grouped into a group of identity records. A composite query on values for selected attributes of the identity records in the group is generated and applied to an entity database to obtain composite results of entity records in the entity database matching the attribute values of the composite query. For the identity records in the group, an individual query on attributes of one of the identity records is performed against the composite results of the entity records to determine a candidate list of entity records from the entity database for the identity record.

Abstract: In the realm of managing relational databases, a system that uses both the data in a relational database and domain knowledge in ontologies to return semantically relevant results to a user's query. Broadly contemplated herein, in essence, is a system that bridges a semantic gap between queries users want to express and queries that can be answered by the database using domain knowledge contained in ontologies. In accordance with a preferred embodiment of the present invention, such a system extends relational databases with the ability to answer semantic queries that are represented in SPARQL, an emerging Semantic Web query language. Particularly, users may express their queries in SPARQL, based on a semantic model of the data, and they get back semantically relevant results. Also broadly contemplated herein is the definition of different categories of results that are semantically relevant to a user's query and an effective retrieval of such results.

Abstract: A search environment of an embodiment includes name mining and matching features used in part to identify people-centric queries and provide an enriched search experience, but is not so limited. A method of an embodiment operates to provide an expanded query based in part on a geometric similarity measure, an edit distance measure, a string similarity measure, and a cumulative similarity measure. A search system of an embodiment includes a mined candidate generator component and a name matcher component used in part to identify name queries and provide an expanded query that includes original query terms and one or more valid mined names. Other embodiments are also disclosed.

Abstract: A system and methods for unit of measurement conversion and search query expansion are described. The search query expansion may include identifying an initial unit of measurement associated with a property and an initial numeric value for the initial unit of measurement within a search query, automatically forming an expanded search query by expanding the search query to include at least one related unit of measurement associated with the property, and sending the expanded search query to a search engine to search a database. Other embodiments are described and claimed.

Abstract: Methods and systems are disclosed that allow a linked-to web page to be provided using information about a linked-from web page. The linked-to web page, for example, may be provided with enhanced content, additional content, suggestion features, or searching features. Certain of the methods are useful in the context of a user using a search engine web page to search for and link to other web pages. An exemplary method can be performed by a server that provides such a linked-to web page. The server receives a request to provide the linked-to web page and parses the request to identify information, such as, search terms that were entered on the search engine web page. The server can use the search terms or other information associated with the linked-from web page to determine what content should be provided or how it should be provided for the linked-to web page.

Abstract: Provided are a method, system, and computer program product for grouping identity records to generate candidate lists to use in an entity and relationship resolution process. Identity records provide attributes of entities and are grouped into a group of identity records. A composite query on values for selected attributes of the identity records in the group is generated and applied to an entity database to obtain composite results of entity records in the entity database. For the identity records in the group, an individual query on attributes of one of the identity records is performed against the composite results of the entity records to determine a candidate list of entity records. Resolution rules are applied to determine entity records in the determined candidate list related to one of the identity records in the group according to the resolution rules.

Abstract: Techniques described herein generally relate to real time inference based systems. Example embodiments may set forth devices, methods, and computer programs related to search engine inference based virtual assistance. One example method may include a computing device adapted to receive text as input and a computer processor arranged to determine at least one inference regarding subject matter of the text based on one or more web searches of one or more terms within the text. The inference(s) may then be automatically displayed upon the inference(s) being determined. The text may be automatically received as input from a voice-to-text converter as voice-to-text conversion producing the text is occurring.

Abstract: Methods, computer readable media, and apparatuses for font matching are presented. A glyph may be received and processed. The processing of the received glyph may include reducing the glyph, computing bounds associated with the glyph, and normalizing the glyph. The processed glyph may be compared to a repository of image prototypes. The comparison may include determining a distance of the processed glyph from one or more the image prototypes, sorting the determined distances, and selecting one or more of the image prototypes based on the determined distances. Additional techniques may be used to enhance the resolution or accuracy associated with the various methods and algorithms.

Abstract: A computer-implemented method is disclosed. The method includes receiving from a remote device a search query, generating a local result set and one or more non-local result sets for the search query, determining a display location for the local result set relative to the non-local result set based on a position of the search query in a local relevance indicium.

Abstract: A search engine for generating an improved search query, the engine comprising: input means for receiving a search request, the search request comprising N search terms; processing means arranged to formulate a search query from the received search request; output means arranged to output the search query wherein the processing means is arranged to formulate the search query by generating a plurality of search strings, each search string comprising a different combination of a subset of the N search terms.

Abstract: An image search method includes receiving a first query, the first query providing a first image constraint. A first search of a plurality of images is performed, responsive to the first query, to identify a first set of images satisfying the first constraint. A first search result, which includes the first set of images identified as satisfying the first constraint, is presented. A second query is received, the second query providing a second image constraint with reference to a first image of the first set of images. A second search of the plurality of images is performed, responsive to the second query, to identify a second set of images that satisfy the second constraint. A second search result, which includes the second set of images identified as satisfying the second constraint, is presented.

Abstract: A computer-implemented method includes receiving a search request at a central information provider, generating a query containing media-related terms relating to the search request, and submitting the query to a search engine having access to media-related search results, wherein the query is broader than the received search request, and transmitting media-related search results generated in response to the query by the search engine, to a remote device.

Abstract: Systems, methods, and computer program products are provided for query clarification. In general, one aspect of the subject matter described in this specification can be embodied in computer-implemented methods that include the actions of receiving in a search interface a user input associated with a search query; determining whether the associated search query is a trigger query, the trigger query being a query identified for clarification; when the search query is a trigger query, prompting the user for additional information to form a clarified search query, the clarified search query including the additional information, the prompting occurring prior to submission of the search query to a search system; and submitting the clarified search query to the search system.

Abstract: In one example, a method includes receiving information on a user role of a user account associated with a business intelligence system. The method further includes gathering information on interactions of the user account with the business intelligence system. The method further includes generating an initial business intelligence output based on data from one or more data sources. The method further includes generating a customized business intelligence output for the user account based on the initial business intelligence output, the user role, and the interactions of the user account with the business intelligence system. The method further includes providing the customized business intelligence output to the user account.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for interpreting search queries. In one aspect, a method includes receiving a search query. The method also selects a disambiguated interpretation of the search query based on analysis of stored search queries and analysis of stored responses of users having a similar characteristic as the user that initiated the search query. The method also provides a set of the search results. The set is selected based on the disambiguated interpretation of the search query.

Abstract: A computer-implemented method includes receiving, in a computer system, a user query comprising at least a first term, parsing the user query to at least determine whether the user query assigns a field to the first term, the parsing resulting in a parsed query that conforms to a predefined format, performing a search in a metadata repository using the parsed query, the metadata repository embodied in a computer readable medium and including triplets generated based on multiple modes of metadata for video content, the search identifying a set of candidate scenes from the video content, ranking the set of candidate scenes according to a scoring metric into a ranked scene list, and generating an output from the computer system that includes at least part of the ranked scene list, the output generated in response to the user query.

Abstract: A system and method for providing a user interface with search query broadening is described. A query defining a search executable on potentially retrievable information is accepted. The query is parsed. A broadened query is provided. At least one of the broadened query and results of a search executed on the broadened query is presented.

Abstract: Embodiments of the present invention further provide systems and methods for automatically identifying and extracting topics from questions posted by users to a consultation system, for creating a new consultation category or creating new keywords for of promotion of a new category serving an underserved or unserved topic.

Abstract: Mapping product identification data to product information. Generating classifiers operative to classify products referred to in product identification data. Receiving client product identification data. Applying at least one generated classifier on the received product identification data. Using at least one classification determined by the applied classifier(s) and a subset of the client product identification data to query the product database. Qualifying the results of the query using at least one classification.

Abstract: A business intelligence (BI) server and repository are described which support a set of customized and/or calculated data members. In accordance with an embodiment, the BI server maintains a connection to a plurality of data sources which may store a set of dimension members. The data source can be relational, file storage based, multidimensional and other types. In accordance with an embodiment, the BI server can accept queries from the user that contain calculated members as a parameter. The calculated member is defined by an expression including multiple dimension members and one or more arithmetic operators. The BI server can parse and validate the query and rewrite the query for the data source. After the query is rewritten and optimized, it is executed against the data source and a set of results is received.

Abstract: A system is provided for augmenting a privacy policy. During operation, the system obtains a set of training documents and at least one seed keyword associated with the privacy policy. The system extracts a number of candidate keywords from the training documents and formulates at least one query based on the candidate keywords. The system then issues the query to a corpus. In response to the query, the system receives a set of result documents. The system further determines whether a respective keyword extracted from the result documents matches at least one seed keyword. The system then augments the privacy policy by associating the candidate keyword corresponding to the respective keyword with the privacy policy based on the determination. In addition, the system applies the augmented privacy policy to a subject document and produces a result to indicate whether the subject document is in violation of the privacy policy.

Abstract: Described are systems and methods relating to database query optimization and query cost estimation. The approach is described in the context of searching balanced and semi-balanced tree indexes such as B-trees, B+ trees, and R-B trees. The described approach may be used for both simple and composite queries, and the described approach may be used for relational queries, i.e., where a variable is less than or greater than a certain value and the database is being used to find the set of records that satisfy the relation. Further, the described approach may be used for generalized N-ary tree queries and cost estimations.

Abstract: Information may be presented to a user by using a first application to receive a character stream of one or more noncompletion characters. The noncompletion characters indicate that additional characters may be received. The character stream is exchanged with a host that analyzes the character stream to generate results that are responsive to the user's predicted interest. Results are received and displayed so that the user may select one of the results to launch a code segment related to the selected result.

Abstract: Methods, systems, and apparatus, including computer programs stored on computer storage media, for retrieval and display of information from an electronic document collection. In one aspect, a machine-implemented method includes the actions of receiving description data describing a preexisting structured presentation, comparing characteristics of the preexisting structured presentation with content of electronic documents in an unstructured collection of electronic documents to locate electronic documents that identify a new instance that is relevant to the preexisting structured presentation, adding an identifier of the new instance to the preexisting structured presentation to form an expanded structured presentation, and outputting instructions for presenting the expanded structured presentation.

Abstract: A system receives a search query, determines whether the received search query includes an entity name, and determines whether the entity name is associated with a common word or phrase. When the entity name is associated with a common word or phrase, the system generates a link to a rewritten query, performs a search based on the received search query to obtain first search results, and provides the first search results and the link to the rewritten query. When the entity name is not associated with a common word or phrase, the system rewrites the received search query to include a restrict identifier associated with the entity name, generates a link to the received search query, performs a search based on the rewritten search query to obtain second search results, and provides the second search results and the link to the received search query.

Abstract: Techniques for defocusing queries over big datasets and dynamic datasets are provided to broaden search results and incorporate all potentially relevant data and avoid overly narrowing queries. An analytic component can receive queries directed at one region of a dataset and analyze the queries to generate inferences about the queries. The queries can then be defocused by a defocusing component and incorporate a larger dataset than originally searched to broaden the queries. The larger dataset can incorporate all, or a part of the original dataset and can also be disparate from the original dataset. Clusters of queries can also be merged and unified to deal with ‘local minima’ issues and broaden the understanding of the dataset. In other embodiments, dynamic data can be monitored and changes tracked, to ensure that all portions of the dataset are being searched by the queries.

Abstract: Database query analysis technology, in which an input query is received that relates to multiple attribute classes of data records. An index that is descriptive of the data records in data storage is accessed and relative positions in the accessed index for the multiple attribute classes are identified. The accessed index is processed based on more than one of the multiple attribute classes and the identified relative positions, and the processed index is used to identify groups of data records that are included in the data records in the data storage and that share common values for the multiple attribute classes in the input query. Metrics corresponding to the data records included in each of the identified groups of data records are accessed, computations are performed on the accessed metrics, and a report is generated that reflects results of the computations.