Abstract: Embodiments are directed towards generating data models that may give semantic meaning for unstructured data or structured data that may include data generated and/or received by search engines, including a time series engine. Data models also may be generated to provide semantic meaning to structured data. A data model may be composed of a hierarchical data model objects analogous to an object-oriented programming class hierarchy. Users may employ a data modeling application to produce reports using search objects that may be part of, or associated with the data model. The data modeling application may employ the search object and the data model to generate a query string for searching a data repository to produce a result set. A data modeling application may map the result set data to data model objects that may be used to generate reports.

Abstract: A first word is acquired (S1), a plurality of relevant words associated with the acquired first word and containing a character string of the first word are generated (S3, S4), search results using the generated relevant words as search keywords are acquired (S5, S6), and search result information 40 is generated so as to display a search result 42 on a screen of a displaying means in accordance with each of the relevant words (S7, S8).

Abstract: Information is stored in a data pattern. The data pattern includes an identity table, a version table that includes at least one reference to the identity table, and an audit table that includes at least one reference to the version table. The identity table stores information identifying the information. The version table stores version information identifying one or more versions of the information identified in the identity table. The audit table stores audit information identifying when each of the one or more versions of the information was modified. The audit table may also store effectiveness information identifying when each of the one or more versions of the information is in effect.

Abstract: A system and related techniques accept user-inputted search terms, for example to perform a search for files or other data or objects. Corresponding matches to those terms may be presented to the user in a “word-wheel”-type breakout list generated on the fly for groupings of hits by attributes or other criteria, as the system searches through the file system at the current level or point in the file system hierarchy. Search results may be continuously or dynamically updated as the user, for example, enters more characters or other data.

Abstract: Methods, systems, apparatus, including computer program products, for providing fresh related search suggestions in response to a user submitted query are presented. In one implementation, a plurality of prior queries are selected wherein each of the prior queries was submitted as a search query a number of times during a recent time period and satisfies a criterion. For each of the prior queries, the prior is selected as a candidate query based on one or more of: a determination that search results responsive to the prior query include a number of news results that satisfy a second threshold, and relevance data indicative of user behavior relative to the search results responsive to the prior query. In response to receiving a user query, one or more candidate queries are selected that match the user query.

Abstract: A system for searching digital works for comments includes search software capable of searching web pages for comments about a referenced work. In one embodiment, the software searches a web page for delimiters such as quotes that are in proximity to a link to another web page. The software stores any comments in proximity to the quoted content for use in a comment display system where it may be displayed as comment marginalia.

Abstract: A system, method, and computer program product are provided for grouping linearly ordered primitives. In operation, a plurality of primitives are linearly ordered. Additionally, the primitives are grouped. Furthermore, at least one intersection query is performed, utilizing the grouping.

Abstract: Methods, systems, and apparatus for allocating advertising budgets. In one aspect, a method includes receiving a set of candidate keywords specifying targeting keywords for content items. Each targeting keyword can be a phrase to be matched for a content item to be eligible to be provided in response to a content item request. For each of the targeting keywords, a probability distribution specifying likelihoods of specified user actions occurring in response to a content item is received. Based on the probability distributions, a set of final keywords with which distribution of the content items will be controlled is selected, the set of final keywords being one or more keywords for which a likelihood of a specified outcome occurring exceeds a threshold likelihood. The set of final keywords is a set which a total cost of distributing the content items is below a specified value.

Abstract: Techniques for using contextual information relating to content presented by a television as part of a search query for an information search are presented. A search management component, at a given moment in time during presentation of television-related content by a communication device in or associated with a television, identifies contextual information associated with a section of the television-related content and generates a content identifier timestamp associated with the contextual information and the section of television-related content. A search component augments a search query using the contextual information to facilitate customization of a subset of search results based on the contextual information. The contextual information in the search query can facilitate disambiguating the search query or promoting a search result over another search result in the subset of search results, based on the contextual information, to facilitate customization of the subset of search results.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for using scientific papers in web search are described. A web search system can rank scientific content highly in search results of a query, when the scientific content has been popular in the past but is obscure at query time. The web search system can augment a search query by providing additional search terms when terms in the search query and the additional search terms appeared together in news stories frequently in the past but appear together infrequently at query time.

Abstract: Techniques for ordering predicates in column partitioned databases for query optimization. Predicates on a single CP table within a query are organized to predicate-CP nodes with various sets of column partitions. The predicates within each predicate-CP node and the predicate-CP nodes as a whole are ordered in ascending order of cost which is determined by CPU/IO cost and predicate selectivity. The reorganized query is then executed.

Abstract: A methodology is disclosed for improving searches of a distributed Internet network. A distributed Internet network is searched for a particular information type, searching for a field identified using a predetermined identifier indicating that the field comprises information of the particular information type. When the field identified using the predetermined identifier is found, an association of the contents of the field with the search results is made, and repeated using the same predetermined identifier. Information of a particular information type may then be served in a field identified using a predetermined identifier that identifies the field as containing information of the particular information type.

Abstract: In various embodiments, systems and methods are provided for query expansion using add-on terms with classifications. A query is received. An add-on term is identified for the query. A classification is determined for the add-on term. The classification is a designation associated with the add-on term that is used to distinguish the add-on term from the query. An appended query is generated based on the add-on term. The appended query is generated by concatenating the query with the add-on term. The appended query is executed on a resource stack as a single reformulated query to identify one or more resources. Upon execution, the classification of the add-on term distinguishes the one or more resources identified for the add-on term based on tagging the one or more resources with the classification of the add-on term. The appended query is used to generate content items.

Abstract: Query suggestions are generated based on a Breadth-First-Search having a configurable decaying radius. A computer system receives an initial set of semantically similar queries. The computer system expands the set to include related terms. The set of related terms is included in the initial set. The expansion process is repeated for each query or related term in the set. The radius may be reduced for each subsequent related term added to the query. The process may stop when the radius reaches a specified threshold, e.g., a predetermined number of queries or terms for the set is reached. The set includes the related terms and search queries. The set may be used for, among other things, suggesting related terms to a researcher, improving search engine performance, or selecting appropriate advertisements.

Abstract: Metadata based enhanced search capabilities are provided in conjunction with e-reader experience. Metadata associated with content and objects within displayed content is created based on default and/or custom rules. The metadata such as attributes, tags, etc. is indexed and used to augment search queries based on selected portions of the displayed content. Additional search augmentation is performed based on user-defined metadata or processing of objects such as image recognition of image objects and similar processes.

Abstract: Systems and methods to identify synonyms are described. The system generates demand information based on a first plurality of queries, identifies a first synonym set based on an association map that comprises a first plurality of constraints identified from the first cluster of queries, stores the first synonym set in a synonym dictionary, receives a query, over a network, from a client machine, retrieves the first synonym from the synonym dictionary, and expands a constraint in the query received from the client machine based on the first synonym.

Abstract: An apparatus includes a designation unit, a search unit, and an output unit. The designation unit designates a page number and a search key as a search condition. The search unit automatically searches paginated documents stored in a storage containing the designated search key within the designated page number. The output unit outputs an image of the designated page number of the searched document as a search result.

Abstract: A set of search requests may be analyzed to detect fixed phrases suitable for inclusion in a search index. Sets of candidate phrases may be identified among the search requests. Fixed phrases may be detected among the candidate phrases using statistical techniques, for example, by identifying phrases having a relatively high pointwise mutual information (PMI) with respect to component keywords. Fixed phrase detection may include keyword and/or phrase clustering. Clusters may correspond to topics defined using a latent Dirichlet allocation (LDA) procedure. Fixed phrase detection may include identifying phrases having relatively high PMI within particular clusters.

Abstract: News search and browse experience is personalized based on user preferences. User attributes like a geographic location are obtained and news sources preferred by other users with attributes similar to those of a requesting user are identified. News sources that are popular across different user groups are eliminated and relevant news items from the remaining news sources are retrieved and presented to the requesting user.

Abstract: A method for performing file search using a control computer receives an initial query expression from a client computer, divides the initial query expression into one or more keywords, determines related terms corresponding to each keyword, merges the keywords and the related terms to obtain an updated query expression, and generates search results according to the updated query expression. The method further calculates relevance scores among a plurality of documents in the search results and the updated query expression, ranks the documents in the search results according to the relevance scores, and displays the documents in the search results with the ranked order.

Abstract: Target word recognition includes: obtaining a candidate word set and corresponding characteristic computation data, the candidate word set comprising text data, and characteristic computation data being associated with the candidate word set; performing segmentation of the characteristic computation data to generate a plurality of text segments; combining the plurality of text segments to form a text data combination set; determining an intersection of the candidate word set and the text data combination set, the intersection comprising a plurality of text data combinations; determining a plurality of designated characteristic values for the plurality of text data combinations; based at least in part on the plurality of designated characteristic values and according to at least a criterion, recognizing among the plurality of text data combinations target words whose characteristic values fulfill the criterion.

Abstract: A method and system for identifying a candidate subset of a data set comprises comparing suffixes of query field values to data field values of records in the data set. Sufficiently similar records are included in the candidate subset. Query field value suffixes may range in length from the query field value itself down to a minimum suffix length. The longest suffix may be processed first, and then successively shorter suffixes may be processed until a satisfactory number of candidates are identified. Entries in an index data structure derived from the data set may associate various suffixes found in the data set with individual records. The data structure entries may include record keys identifying records with data field values identical to the suffix and may also include suffix pointers identifying related data structure entries with suffixes similar to the entry's suffix.

Abstract: Embodiments of the invention provide systems and methods for searching a repository of information such as a database using a keyword search and/or an attribute search in near real time. According to one embodiment, a method of searching a repository of information can comprise receiving a set of search criteria for performing the search and selectively performing one or more of an attribute search and a keyword search of the information in the repository based on the received search criteria.

Abstract: A system and method for providing search query refinements are presented. A stored query and a stored document are associated as a logical pairing. A weight is assigned to the logical pairing. The search query is issued and a set of search documents is produced. At least one search document is matched to at least one stored document. The stored query and the assigned weight associated with the matching at least one stored document are retrieved. At least one cluster is formed based on the stored query and the assigned weight associated with the matching at least one stored document. The stored query associated with the matching at least one stored document are scored for the at least one cluster relative to at least one other cluster. At least one such scored search query is suggested as a set of query refinements.

Abstract: Methods, systems and program products for identifying user intent from query patterns including, in one implementation, a method including identifying a current query including a query term, and obtaining search results responsive to the current query. Each search result identifying a document associated with a score indicating relevance. The method includes associating an intent with the session based on submission of a query containing a refining term, where each refining term was previously submitted with different unique queries. The method includes identifying prior sessions, where each prior session includes a query that matches the current query, and each prior session includes a query that contains the refining term. The method includes identifying a document selected more frequently in the prior sessions than by a general population and modifying the scores of the document in the search results. The method also includes ranking the search results based on the scores.

Abstract: In various exemplary embodiments, a system and associated method for prioritizing search results in an electronic environment is disclosed. The system comprises a communications module to receive a search query from an end-user. The search query includes one or more characters contained within a single TCP packet. A query engine coupled to the communications module matched the one or more characters from the search query against a plurality of selected keywords contained within a database against the search query. Each keyword is then ranked within the plurality of selected keywords thus forming a subset of selected keywords. A response including the subset of selected keywords is returned to the end-user.

Abstract: Among other disclosed subject matter, a computer-implemented method relating to selecting content for publication includes receiving a term to be used in selecting content for publication. The method includes obtaining information from a record using the received term, the information reflecting a correspondence between contents in a repository and the received term. The method includes determining, using at least the obtained information, a query to be performed on the repository for selecting at least part of the content.

Abstract: A system determines ranking scores for objects based on “virtual” links defined for the objects. A link-based ranking score may then be calculated for the objects based on the virtual links. In one implementation, the virtual links are determined based on a metric of content-based similarity between the objects.

Abstract: Detection and use of relationships in tabular data is enhanced. A foreign-key-based relationship between two tables in memory is automatically discovered by a module. A view over table data is computationally augmented by adding an expandable hierarchical column. The expandable hierarchical column includes second table data that is related to rows of a first table by the discovered foreign-key-based relationship. A naming scheme for the added column is described. Sometimes the augmentation places an AddJoinColumn operator in a query expression tree; sometimes the tree is rewritten by moving a query operator or replacing a specified pattern of operators by a flat Join operation between two tables. Column expansion may be followed by reshaping data into a flat table, by getting a homogeneous query, by performing a join, or other operations.

Abstract: Methods and apparatus include presenting an initial set of names to a user. The user selects a set of names from those presented. An Interactive Evolutionary Algorithm (IEA) extracts features of each selected name from a database of names and features to form a feature set. The IEA forms a set of match features that are chosen from the feature set according to a priority function and/or weighting of the features, either of which may vary in succeeding iterations. The IEA searches the database to obtain a candidate set of names, where each name has features matching the match features. One or more names is chosen from the candidate set and added into a presentation set of names. The IEA may repeat the formation of the match features, candidate set, and selection of one or more names from the candidate set until the new presentation set is complete.

Abstract: An information management system comprising a data comparison module, a local data storage, a remote data storage, a user interface for requesting information, optionally a communications module and optionally a criterion analyser to analyse one or more criteria and thereby enable creation of one or more suitable templates wherein: the data comparison module enables re-finement of information queries without the need to undertake one or more of rebuilding, re-categorizing or re-indexing the information; the communications module facilitates communication between participants in the system; one or more methodologies may be used to access the information depending on the context; and transfer of information between the remote data storage and local data storage is proactively managed according to one or more criteria.

Abstract: A method storing information that indicates similarity between contents based on content metadata associated with each content, wherein a degree of similarity between contents is based on a semantic interpretation of plot metadata included in content metadata and pertaining to each plot associated with each content; receiving a search query from a user; retrieving one or more content metadata pertaining to one or more contents based on the search query; retrieving one or more recommended content metadata pertaining to one or more recommended contents that are similar to the one or more content metadata pertaining to the one or more contents based on the stored information; and providing a search result that includes the one or more content metadata and the one or more recommended content metadata via a user interface.

Abstract: In one embodiment, a method for increasing query traffic to a web site includes providing initial information pertaining to an initial object for presentation to a user, and providing connection information identifying a logical connection between the initial object and one or more additional objects for presentation to the user. The connection information contains data prompting the user to submit a new query concerning one of the additional objects. The method may further include receiving the new query concerning one of the additional objects, and providing a result of the new query to the user.

Abstract: Systems and related methods of user-guided searching using preference feedback from user searching to arrive at user-preferred ordered results from a large collection of objects.

Abstract: The system and method in one aspect provide a set of extended Boolean operators and a tree visual paradigm that enable business users to modularize the construction of a rule and visualize it as the rules is being built.

Abstract: Methods, systems, and apparatus for processing data, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query. The local queries may not include all the fields of the abstract query.

Abstract: Methods and apparatus for processing autocomplete suggestions. Some implementations are directed to methods and apparatus for generating additional suggestions for provided multiple term autocomplete suggestions and determining additional suggestion scores for the additional suggestions. Like entries among the additional suggestions and the autocomplete suggestions may be identified and each similar grouping of the like entries combined into a consolidated entry. A combined consolidated score for each consolidated entry may be determined based on one or more of the additional suggestion scores and any of the autocomplete scores of the like entries combined into the consolidated entry.

Abstract: Methods for using task-related information to enhance digital searching are provided. A task-oriented user activity system maintains task-related information about resources accessed by a user and current user task. This task-related information is used to enhance search queries to include task-related search criteria that improve relevance of search results. The task-related information can also be used to include task-related metadata in search engine index, e.g., by storing the metadata in the index or by storing it in resources which are subsequently indexed. Task-related information can also be used to enhance search results by filtering and ranking results to increase relevance with respect to a user's current task.

Abstract: According to the present invention, a method for searching for information using the Web and a method for voice conversation using same involve generating a basic word vector for at least one of a provided user query and a language analysis result; using the basic word vector, searching a vector space database for a vector space corresponding to the basic word vector; searching, if a similarity between the basic word vector and the found vector space is lower than a preset reference, a vector space database for a vector space corresponding to an expanded word vector using the expanded word vector generated from the result of the Web search performed using at least one of the user query and the language analysis result; and searching for knowledge information on the basis of the vector space found in the basic searching step or the expanded searching step. Thus, improved research results may be provided in response to the user query.

Abstract: Systems and methods to identify synonyms are described. The system generates demand information based on a first plurality of queries. Further, the system identifies a second plurality of queries as a first cluster of queries from the first plurality of queries based on the demand information, and identifies a first synonym set based on an association map that comprises a first plurality of constraints identified from the second plurality of queries. Finally, the system stores the first synonym set in a synonym dictionary.

Abstract: A computer-implemented method includes providing location factors for first phrases in a collection of phrases, where each location factor for a first phrase is associated with a likelihood that a second phrase of a search query is associated with a location when the first phrase and the second phrase are used in the search query. A search query is received, where the received search query includes a first phrase from the collection of phrases and a second phrase. Whether the second phrase of the received search query refers to a location is determined based, at least in part, on the location factor for the first phrase of the search query.

Abstract: A graphical user interface includes tabs representative of different classes of search results. The tabs are derived in response to the processing of a query. The different classes of search results group content by meaning, such that a query term with different meanings produces different classes of search results with different meanings.

Abstract: A search system and method for searching for electronic documents, and providing a search result in response to a search query. In one embodiment, the search system includes a processor, a user interface module adapted to receive a search query from a user that includes a search query term, a search engine that electronically searches for electronic documents that satisfy the search query term, and a query processing module that identifies at least one alternative term for the search query term, and provides the alternative term to the user interface module for display to the user, and also provides the alternative term to the search engine to search for electronic documents that satisfy the alternative term.

Abstract: Embodiments of the present invention provide a method, system and computer program product for query generation from a previous result set. In an embodiment of the invention, a method for query generation from a previous result set is provided. The method includes identifying commonalities in a selection of records of a result set produced by a previously issued query against a database in a database management system executing in memory by at least one processor of a host server. The method further includes deriving a query from the identified commonalities that when executed against the database management system would produce the selection of records as the result set. Finally, the method includes storing the derived query for subsequent use in querying the database.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for automatic text suggestion are described. In general, one aspect of the subject matter described in this specification can be embodied in a method that includes, from an authoring environment, receiving a request to supplement a text segment; submitting a query to a search engine, the query being generated from the text segment; receiving multiple search results from the search engine in response to the query, each search result including an information snippet; generating one or more suggestions for supplementing the text segment based on the information snippets; and providing the one or more suggestions for supplementing the text segment for display in the authoring environment.

Abstract: A text string may be captured when a user initiates a selection event in a web browser. In response to the selection event, the text string is derived from the selected element(s) in a rendered web page. The text string is automatically placed in a web-search text-entry field of the web browser without further instructions from the user. The user can modify the text string before querying a web-search engine.

Abstract: Methods and apparatuses for searching metadata are described herein. In one embodiment, an example of a process for search metadata includes, but is not limited to, in response to a search query for metadata stored in one or more of metadata stores, the search query is partitioned into multiple search query segments. Thereafter, searches corresponding to the search query segments are performed, where each search is performed independently within the one or more metadata stores. Other methods and apparatuses are also described.

Abstract: A method for accessing information in a replicated database includes receiving a request for information in a database. The request is associated with a table in the database. The table includes a plurality of identifiers each identifying a portion of the information in the table. The method also includes executing a logical structure associated with the table to produce a logical view of the table. The logical view contains at least a portion of the information from the table without containing the identifiers. The method further includes identifying the requested information in the logical view, and communicating the identified requested information in the logical view.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for evaluating substitute terms. One of the methods includes selecting a first term and a second term. A first co-occurrence frequency is determined for co-occurring terms in search queries that include the first term. A first vector is generated for the first term using the first co-occurrence frequencies. A second co-occurrence frequency is determined for the co-occurring terms in the search queries that include the first term adjacent to the second term. A second vector is generated for the second term using the second co-occurrence frequencies. A score for the second term as a context for a substitution rule based on the first term is computed, wherein the score is based on a comparison between the first vector and the second vector.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for adjusting a data query. These mechanisms and methods for adjusting a data query can enable more relevant query results, increased efficiency and revenue, optimized customer interaction, etc.