Abstract: Techniques are provided for searching within a collection of XML documents. A relational table in an XML index stores an entry for each node of a set of nodes in the collection. Each entry of the relational table stores an order key and a path identifier along with the atomized value of the node. An index on the atomized value provides a mechanism to perform a node-aware full-text search. Instead of storing the atomized value in the table, a virtual column may be created to represent, for each node, the atomized value of the node. Alternately, each entry of the relational table stores an order key and a path identifier along with, for simple nodes, the atomized value, and for complex nodes, a null value. For a complex node with a descendant text node, a separate entry is stored for the descendant text node in the relational table.

Abstract: Computational methods and systems are described which accept input, identify one or more CYP450-family enzymes, identify one or more modulators of the CYP450-family enzymes, and communicate treatments to at least one system user, wherein the treatments include one or more of the identified at least one modulator.

Abstract: A navigation system and various methods of using the system are described herein. Search query results generated by the system are listed and prioritized based upon travel related information and contextual information. Intermediary locations can be accessed based upon prioritizing search queries.

Abstract: Data is combined from multiple independent data stores, and is then queried using a data correlation engine. Contemplated engines preferably keep track of previously run correlations, and then makes those correlations available to clinicians for their own use. For example, a preferred system might provide a listing of correlations run by other clinicians in a particular medical specialty, or a particular community, whether geographic or otherwise. In another example, a preferred system might provide a listing of correlations sorted by popularity, so that the most frequently accessed correlations appear near the top of the list. In any case a clinician could simply view the list, and check off which correlations he/she would like to have run for his/her practice, or practice community.

Abstract: Described is a technology in which documents associated with a query are ranked by a ranking model that depends on the query. When a query is processed, a ranking model for the query is selected/determined based upon nearest neighbors to the query in query feature space. In one aspect, the ranking model is trained online, based on a training set obtained from a number of nearest neighbors to the query. In an alternative aspect, ranking models are trained offline using training sets; the query is used to find a most similar training set based on nearest neighbors of the query, with the ranking model that corresponds to the most similar training set being selected for ranking. In another alternative aspect, the ranking models are trained offline, with the nearest neighbor to the query determined and used to select its associated ranking model.

Abstract: A method and apparatus for processing top-k queries are disclosed. For example, the method receives a top-k query with a value for a number of samples and a value of a confidence parameter. The method samples in accordance to the number of samples, and determines a top-k weight of a sample top-k set. The method bounds the top-k weight in an interval having an upper bound and a lower bound such that the top-k weight is in the interval with a probability equal to one minus the value of the confidence parameter, and provides a response to the top-k query in accordance with the upper and lower bounds.

Abstract: An apparatus for polynomial based data transformation may include a processor. The processor may be configured to identify data that is relevant to a set of one or more queries and generate an information source vector that indicates information sources associated with the data. The processor may also be configured to generate a cyclotomic polynomial based on the information source vector and factor the cyclotomic polynomial to generate a plurality of orthogonal data signatures. Associated methods and computer program products may also be provided.

Abstract: A controller sets, out of a data range that is specified in a read request from a host device, a predetermined size of a first data range that follows a top portion of the data range and a predetermined size of a second data range that follows the first data range, and after transfer, to the host device, of data corresponding to the first data range from a second storage unit or a third storage unit having smaller data output latency than the first storage unit in which read/write of data is performed is started, the controller searches for data corresponding to the second data range in the second storage unit or the third storage unit.

Abstract: The present invention provides a system, architecture and process to support new interaction paradigms in customer support. Specifically, the approach of the present invention will unify through a new process and innovative system architecture the two basic methods of in house support and online support. To accomplish this unification, the present invention enables customers to work together as peers in problem resolution by exploiting the customer expertise (they work with the products on a daily basis and often have deep understanding what works/does not work). Among other things, the present invention provides: incentives for customers to participate in this new support; a rating infrastructure in which multiple good ratings helps to become “THE EXPERT” by increasing the score; incentives upon receipt of good ratings and or certain score levels; a problem routing mechanism; Master Data Management (MDM) for insights in customers and products.

Abstract: Embodiments of the present invention provide a method, system and computer program product for displaying search results for weighted, multi-term content searches. In an embodiment of the invention, a method for displaying search results for weighted, multi-term content searches is provided. The method includes specifying different weighted search terms for a content search and performing the content search for both content and content meta-data in a search engine. The method also includes retrieving search results for the content search and computing a relevance for each of the weighted search terms. Finally, the method includes presenting both the search results and also a relevance indicator for each computed relevance for each of the weighted search terms found in connection with each of the search results in a user interface to the search engine.

Abstract: Systems, methods, and other embodiments associated with an artifact type neutral container are described. This artifact type neutral container is achieved through an artifact type neutral architecture that is managed using a central type neutral registration mechanism. Queries are executed on type neutral registration tables to return data stores that store the artifacts found within a given artifact type neutral container. The data stores are queried to return the artifacts in the artifact type neutral container. The artifact type neutral container can be used in systems in which the artifact type neutral container and artifact data are stored in the same database as well as in systems in which the artifact type neutral container and artifact data are stored in different databases.

Abstract: In various exemplary embodiments, a system and associated method to predict search results in an electronic environment is disclosed. The system architecture comprises a communications module to receive a query from a remote end-user where the query includes one or more characters contained within a first single communications packet. A query engine is coupled to the communications module. The query engine uses the one or more characters from the query to predictively match keywords contained within a data structure (e.g., a database) and forms a response from the one or more characters. The response is transmitted back to the end-user within a second single TCP communications packet.

Abstract: Search Query Concept Based Recommendations. A method includes electronically receiving, in a computer system, a title as an input. One or more subsets of the title are generated. A list of key phrases associated with the title is obtained. Further, one or more key phrases from the list corresponding to the one or more subsets is electronically identified. Contents are selected based on the one or more key phrases identified. The contents can be ranked. The contents are then provided to the user.

Abstract: The invention pertains to methods, systems, and apparatus for enabling advertisers to identify and purchase advertising as a function of subject matter, particularly, although not necessarily, at the sub-asset level and according to an ontology particularly adapted to the interests of advertisers in media. In accordance with certain aspects of the invention, advertising may be sold at the sub-asset level, rather than at the asset level. In accordance with other aspects of the invention, a system is provided that permits advertisers to search media items for advertising opportunities, including the ability to browse through an ontology specifically adapted to the purpose of identification of advertising opportunities within media. Even further, in accordance with other aspects of the invention, a search engine is provided to facilitate searching for advertising opportunities within multimedia content using keyword searching and faceted searching of the ontology and the like.

Abstract: Apparatuses, methods, and systems directed to deriving optimal parameters of a learning algorithm to maximize an objective function of online keyword auctions for bidded terms. Some embodiments of the invention simulate online keyword auctions based on historical data for the bidded terms, wherein the parameters of the simulated auctions such as market reserve prices of the bidded terms are determined by an adaptive learning algorithm. The values of the parameters of the learning algorithm are optimized by a stochastic optimization method to maximize an objective function for the auctions of the bidded terms.

Abstract: Resolving an issue raised by at least one user includes establishing a contact session over a communication channel for servicing the issue. The Internet is searched for content related to providing a resolution for the issue using a customized query, when a search of a database does not return results. Content obtained from at least one Internet source as a result of searching the Internet using the customized query is restructured to prepare the resolution for the issue. The at least one Internet source from which the content was obtained is updated with the resolution.

Abstract: A system and method for conducting a computerized search, including: receiving a user query, a perspective, and a term associated with the perspective; conducting a first search based on the user query; expanding the term to a list; analyzing the first search results based on the list; modifying the user query based on the analysis of the first search results; and conducting a second search based on the modified user query. Alternatively, a system and method for conducting a computerized search, including: receiving a user query; conducting a computerized search based on the user query to obtain first results; analyzing a knowledge base; generating a weighted context term vector based on the knowledge base, wherein the weighted context term vector includes context words; matching the first results with the weighted context term vector; and listing second results based on the match.

Abstract: A system, method, and computer program product are provided for generating a graphical representation of a query optimization process. The method comprises the steps of parsing a search space log, presenting one or more evaluated access plans on an axis of a timeline, identifying a best access plan on the timeline, and outputting a graphical representation of the timeline. An additional system, method, and computer program product are provided for recording a query optimization process of a query optimizer.

Abstract: Methods, apparatus, and systems directed to receiving search queries, retrieving documents, computing the number of categories to present for a given query, computing the number of results to show in each category, computing an ordering of categories, and for all the result pages beyond the first page employing user interface elements that optionally allow the user to quickly zoom in on a specific category and get more results belonging to that category.

Abstract: A system and method is provided that permits a conventional search function to use information from a social bookmarking system to provide search results, as the results from social bookmarking systems are generally very relevant. According to one example, a blended search result is determined using results from a conventional search engine and results found by a social bookmarking system. In one example, these results are blended and presented to a user within a single interface. In another example, search results and results from a social bookmarking system are normalized so that they can be combined within the same interface. Generally, a method is provided for blending search results from two or more different corpora having different search engines.

Abstract: Methods and systems for estimate derivation are described. In one embodiment, a query may be received with a predicate for sets over a collection of items. Associated samples associated with the query may be accessed. Items of an associated sample may be accessed from the collection of items. A determination of whether the predicate is an attribute-based selection from a union of at least some sets may be made. Available items of the particular associated sample may be selected from the items. Identified items may be identified among the available items in the associated sample that satisfy the predicate. An adjusted weight may be assigned to an item based on a weight of the item and a distribution of the associated samples. An estimate may be generated based on the adjusted weight of the identified items of the associated samples that satisfy the predicate. Additional methods and systems are disclosed.

Abstract: Provided are an apparatus and method for recovering a cursor position without degrading performance of a display apparatus. The apparatus includes: a cursor information storage unit that stores cursor information, which includes position information of a first cursor, in response to a cursor information storage message; and a cursor position recovery unit that recovers a position of a second cursor, which corresponds to the first cursor, by using the stored cursor information in response to a cursor information recovery message.

Abstract: A model based on a generalization of the Examination Hypothesis is disclosed that states that for a given query, the user click probability on a document in a given position is proportional to the relevance of the document and a query specific position bias. Based on this model the relevance and position bias parameters are learned for different queries and documents. This is done by translating the model into a system of linear equations that can be solved to obtain the best fit relevance and position bias values. A cumulative analysis of the position bias curves may be performed for different queries to understand the nature of these curves for navigational and informational queries. In particular, the position bias parameter values may be computed for a large number of queries. Such an exercise reveals whether the query is informational or navigational.

Abstract: A user is provided a report based on data collected from multimedia content or channels that are most scheduled for recording by users. User defined criteria specify a period used for filtering qualifying recording events for inclusion in the report. The report may be provided on an information channel accessible from a multimedia content distribution network.

Abstract: Disclosed is an indexing weight assigned to a potential search term in a document, the indexing weight is based on both textual and acoustic aspects of the term. In one embodiment, a traditional text-based weight is assigned to a potential search term. This weight can be TF-IDF (“term frequency-inverse document frequency”), TF-DV (“term frequency discrimination value”), or any other text-based weight. Then, a pronunciation prominence weight is calculated for the same term. The text-based weight and the pronunciation prominence weight are mathematically combined into the final indexing weight for that term. When a speech-based search string is entered, the combined indexing weight is used to determine the importance of each search term in each document. Several possibilities for calculating the pronunciation prominence are contemplated. In some embodiments, for pairs of terms in a document, an inter-term pronunciation distance is calculated based on inter-phoneme distances.

Abstract: An operation management program collects a query status table of a migration-source agent processing program and creates a server status table. The operation management program, based on the server status table, computes a migration cost for each query, and selects the query with the smallest migration cost as a migration query. Then, the operation management program migrates the selected query, using the optimum migration method.

Abstract: A method for conducting automated persistent searches with notifications includes receiving user inputted topic search criteria; receiving user inputted notification criteria; receiving user inputted search preferences; determining information content sources and collaborative environments to search in response to the user inputted topic search criteria; determining user context information from an event with a defined time of occurrence in response to user input or from a user's calendar and scheduling application; wherein user context information defines a period of relevancy for retrieved information content from a persistent search; performing a persistent search until an exit criteria is met by repeatedly interrogating the determined information content sources and the collaborative environments while taking into account the user's context information; and sending one or more notifications to one or more users upon meeting the exit criteria.

Abstract: A system, method, and computer-readable medium for optimized processing of queries that feature maximum or minimum equality conditions are provided. A table on which the query is applied is scanned a single time. Rows of the table distributed to respective processing modules are scanned by the processing modules. Each processing module maintains identification of any rows distributed to the respective processing module that have attribute values that equal the maximum or minimum attribute value locally identified by the processing module. Subsequently, a global aggregation mechanism is invoked to compute the query result without requiring an additional rescan of the table. Further, the disclosed mechanisms may be extended to compute top N queries featuring maximum or minimum equality conditions.

Abstract: A software-implemented method is disclosed that can provide an accurate count of the number of syllables in each word of a body of text to be analyzed by readability software. If the software finds the word in a database, the syllable count is obtained from the database. If the software does not find the word in the database, the software asks a user to specify the number of syllables in the word. In preferred embodiments, the user can direct the software to add the target word and the associated syllable count to the database for future reference. As the software is used, the dictionary thereby grows and adapts to a specific user environment without need for a programmer to customize the software.

Abstract: A topic map based indexing apparatus analyzes community Q/A lists to acquire Q/A analysis information, removes redundant answers depending on the Q/A analysis information, removes insignificant answers based on the degree of reliability, ranks answer lists, and extracts the highest ranking answer as a best answer, to thereby store, in a community Q/A topic map, index information containing the community Q/A lists and the Q/A analysis information. A topic map based searching apparatus analyzes a user question to acquire question analysis information, searches similar questions from community Q/A lists belonging to a specific topic node of a pre-stored community Q/A topic map, ranks the searched similar questions depending on the question analysis information, removes redundant answers among answers to the ranked similar questions, ranks the answers, and extracts the highest ranking answer as a best answer.

Abstract: A travel planning system that implements seat availability determinations is described. The planning system includes a scheduling process for determining a set of instances of transportation that satisfy a user query and a faring process that determines fares valid for at least some of the instances in the set of instances of transportation. The travel planning system also includes an availability process that uses results from a single source of seat availability for a mode of transportation to determine a set of available instances of transportation and determines whether the results from the single source are reliable.

Abstract: A computer-implemented method, apparatus and article of manufacture for optimizing a database query. A query execution plan for the database query is generated using estimated cost information; one or more steps of the query execution plan are executed to retrieve data from a database stored on the computer system. Actual cost information is generated for each of the executed steps, and the estimated cost information is re-calculated using the actual cost information. One or more resource allocation rules defined on one or more steps of the query execution plan are executed, based on the estimated cost information, wherein the resource allocation rules include one or more defined actions. The estimated cost information may be re-calculated using the actual cost information when confidence in the estimated cost information is low, but the estimated cost information may not be re-calculated when confidence in the estimated cost information is high.

Abstract: Techniques are disclosed for bridging terminology differences between at least two subject areas. By way of example, a computer-implemented method includes executing the following steps on a computer. A first affinity measure is computed between a first term in a first corpus, corresponding to a first subject area, and a bridge term. A second affinity measure is computed between a second term in a second corpus, corresponding to a second subject area, and the bridge term. A third affinity measure is computed between the first term and the second term based on the first affinity measure and the second affinity measure. The bridge term is a term that appears in both the first corpus and the second corpus.

Abstract: Searching for a subset of the keywords in a search-engine query is described herein. The search-engine query is parsed into keywords. The keywords are checked against an inverted index to determine whether any web documents include the subset of keywords. Documents containing the subset of keywords are listed in a search-results list and transmitted back to the user.

Abstract: A method and structure for storing information for one or more semantic objects derived from raw data. A semantic object extracted from the raw data and classified to comprise the semantic object is received, the received semantic object having one or more attributes. A summary of attributes of the semantic object by calculating one or more statistics of one or more of the one or more attributes of the received semantic object, a confidence level of the received semantic object that quantifies a degree of certainty that the received semantic object has been correctly classified and/or labeled; and a compact representation of raw data of the received semantic object are generated. Indexing information for one or more of the summary of attributes and the compact representation of the semantic object is generated.

Abstract: A computerized system and method of constructing and expanding search queries for conducting searches through information sources. The system enables retrieving a category options tree, allowing a user to define a category route by selecting a category-node, which defines a search-category. The system may further enable retrieving a query scenario tree, having a hierarchal structure comprising query nodes, where the retrieved query scenario tree is associated with an initial input query, inputted by a user. Each query node defines a query route enabling to construct the content and structure of an expanded search query. The system enables selecting a query node of the retrieved query scenario tree, according to an online decision making process, which analyses the search-category in relation to available query routes in to allow selecting a query node from the retrieved scenario tree that is most compatible with the search-category.

Abstract: Contextual information is received, and a chosen event is identified based at least upon an analysis of the contextual information. A set of media assets is then identified based at least upon an analysis of the identified event. At least some of the contextual information is associated in a processor-accessible memory system with the chosen event, at least one asset in the set of media assets, or both the chosen event and at least one asset in the set of media assets. By using an event to identify media assets to which contextual information is associated, fewer and more relevant media assets may be retrieved and annotated as compared to conventional techniques.

Abstract: Search results and associated search-result details are provided in response to user queries. Embodiments include identifying a number of search-result details for different indexed search results, identifying one or more detail-attributes for each search-result detail, and identifying one or more user-attributes for a particular user. These search results, associated search-result details, and associated detail-attributes may be stored in a database. Upon receiving a search query from the user, search results may be generated. Search-result details specific to each search result and specific to the end-user may also be generated by identifying the detail-attributes associated with each search-result detail and the user-attributes associated with the end-user. These search results may then be presented to the end-user. Upon receiving an indication of interest in a particular search result, the search result details may then be presented to the end user.

Abstract: An apparatus and method for outdoor advertising are disclosed. The apparatus for outdoor advertising includes an input unit receiving data related to desired advertising, a search unit searching for an advertisement, which is highly associated with the data, and a display unit displaying the searched advertisement. The method for outdoor advertising includes receiving data related to desired advertising, searching for an advertisement, which is highly associated with the data, and displaying the searched advertisement.

Abstract: An image forming apparatus (1) is provided with a mass storage (10d) that stores a file (5) of an image read with a scanner in association with a file name for distinguishing the file 5 from other files (5), a file search portion (104) that carries out a search for files 5 of images containing a keyword specified by a user, and a file name updating portion (106) that updates a file name of a file (5) selected, by the user, from among files (5) found out by the search to the keyword.

Abstract: A confidentiality preserving system and method for performing a rank-ordered search and retrieval of contents of a data collection. The system includes at least one computer system including a search and retrieval algorithm using term frequency and/or similar features for rank-ordering selective contents of the data collection, and enabling secure retrieval of the selective contents based on the rank-order. The search and retrieval algorithm includes a baseline algorithm, a partially server oriented algorithm, and/or a fully server oriented algorithm. The partially and/or fully server oriented algorithms use homomorphic and/or order preserving encryption for enabling search capability from a user other than an owner of the contents of the data collection. The confidentiality preserving method includes using term frequency for rank-ordering selective contents of the data collection, and retrieving the selective contents based on the rank-order.

Abstract: A method and apparatus for extracting a windows executable file that can search for a pattern related to windows executable files among a large quantity of network packets using a hardware-based session tracking and pattern matching technology and that can extract all packets included in the corresponding session are provided. The method of extracting a windows executable file includes: collecting incoming packets having a payload according to a session of a reference packet having an MZ pattern; performing a portable executable (PE) pattern matching for the collected incoming packets; and forming a PE file based on at least one incoming packet satisfying the PE pattern matching.

Abstract: An apparatus and method to optimize a query access plan in a computer database system. In preferred embodiments, the query optimizer determines the query can be optimized and generates for the query an optimized access plan that eliminates records defined by a Where clause and one or more ordering criteria prior to ordering the records (sorting or grouping) and then returning a first n rows.

Abstract: A method for showing objects of geographic information by seriation of distance is disclosed. A central point on an electronic map provided by a website is appointed by an user. In a specific range around the central point, at least one target object required by an user is being searched. Every individual distance between the central point and the at least one searched target object is arranged in an order in accordance with seriation of distance. Finally, the arranged results are displayed in orders on a screen for a user to easily choose a best destination.

Abstract: Illustrative embodiments provide a computer-implemented method for hybrid push/pull of continuous structured query language queries. The computer-implemented method receives stream input, wherein the stream input comprises events of interest, builds and a state machine and stream plans, based on an original query, and replicates the stream input. Responsive to a push sub-query trigger, the computer-implemented method submits a pull sub-query to the database to produce a result, and sends the result to a requester.

Abstract: Histograms formed based on samples of a population, such as histograms created from random page-level samples of a data store, are intelligently scaled to histograms estimating distribution of the entire population of the data store. As an optional optimization, where a threshold number of duplicate samples are observed during page-level sampling, the number of distinct values in the overall population data is presumed to be the number of distinct values in the sample data. Also, during estimation of distinct values of an overall population, a “Chao” estimator can optionally be utilized as a lower bound of the estimate. The resulting estimate is then used when scaling, which can take domain knowledge of the data being scaled into account in order to prevent scaled estimates from exceeding the limits of the domain.

Abstract: A method and system for improving utilization of human searcher(s) in a search system including utilizing a processing such as Natural Language Processing to improve the ability of the search system to recognize an intent of a user request, provide information to an expeditor to respond to queries, and automatically route a query to a relevant and qualified searcher. Using NLP, a request is processed to allow improved use of automated responses, more effective use of the expeditor, and more effective use of search specialists.

Abstract: A mechanism for associating a remote document with an email based on user behaviors is described herein. According to one embodiment, an email context is extracted from a current email being accessed by a user, the email context including one or more attributes representing certain characteristics of the current email. A related context having a list of one or more documents is automatically presented that are related to the current email based on at least one attribute of the email context. The one or more documents are associated with a prior email having certain characteristics that are similar to those represented by at least one attribute of the email context. Other methods and apparatuses are also described.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for modular query optimizer. In one aspect, a method includes selecting one or more projections from a set of projections for each table in a database query wherein each of the selected projections for the table has leads to an estimated lower execution cost for the query as compared to non-selected projections; generating join orders for the query based on data distribution of one or more of the selected projections among sites in a computer network wherein the join orders reflect different combinations of data distribution operations applied to the output of one or more of the query's joins; and selecting a join order from the join orders based on evaluation of the join orders using a cost model.

Abstract: Some aspects include determination of a data structure including a plurality of query language configuration parameters and at least two values associated with each of the plurality of query language configuration parameters, and generation, based on the data structure, of a first structured language query associated with a first value associated with one of the plurality of query language configuration parameters, and a second structured language query associated with a second value associated with the one of the plurality of query language configuration parameters.