Abstract: A system and method for operating the same includes a language processing module generating a search request text signal and determining identified data from the search request text signal. A search module generates search results in response to the search request text signal. A dialog manager classifies the search request text signal into a response classification associated with a plurality of templates, selects a first template from the plurality of templates in response to the response classification and corrects search results in response to the identified data and the template to form a corrected response signal. A device receives and displays the corrected response signal.

Abstract: Methods and apparatus to search datasets are disclosed. An example disclosed method includes receiving a search request having at least two criteria and assigning the criteria to a first group according to a logical relationship between the criteria. The example method further includes determining which of the criteria in the first group is satisfied by a least amount of records in a database based on a plurality of counts, the counts respectively indicative of a number of corresponding records in the database satisfying a respective one of criteria exhibited by the database, and identifying a reduced set of records in the database to be searched, the reduced set of records corresponding to the first or second criteria that is satisfied by the least amount of records in the database, and reducing a search time associated with the search request by searching the reduced set of records from the database.

Abstract: Methodologies, systems, and computer-readable media are provided for dynamic virtual data analysis. A first subset of performance metric data relating to a number of facilities is compared between at least two of the facilities to generate a first level comparison. A second subset of the performance metric data associated with two or more sections of at least one facility is compared to generate a second level comparison. A processor generates a graphical representation of the first level comparison and the second level comparison. A user electronic device can receive input from a user to dynamically navigate between a rendering of the graphical representation of the first level comparison and a rendering of the graphical representation of the second level comparison. The user can also modify the first subset of data or the second subset of data to update the first level comparison or the second level comparison.

Abstract: A computer implemented method of generating a user-personalization interest parameter is disclosed. The method comprises receiving, navigational history data associated with a browser application; generating, one or more navigational session transition patterns; for each navigational session transition pattern: truncating, each of the one or more URLs included within the navigational session transition pattern, to obtain a respective URL segment; generating, a respective vector value representative for each of the URL segments; assigning a weight value for each URL segments; determining a navigational profile value for the user, based on at least one vector value and the associated weight value; generating, the user-personalization interest parameter associated with the user based on the navigational profile value.

Abstract: Methods and apparatus to search datasets are disclosed. An example disclosed apparatus includes a grouper to reference statistics associated with a database to identify which criterion of a group of logically related criteria of a search request satisfies fewer ones of records in the database, an identifier to select the identified criterion of the group of logically related criteria as a driving criterion for the group of logically related criteria, a reduced set generator to form a subset of the records of the database based on the driving criterion, and an analyzer to reduce a search time associated with the search request by searching the subset of the records for a non-driving criterion of the group of logically related criteria.

Abstract: A method is provided for performing a content search through comparisons, where a user is presented with two candidate objects and reveals which is closer to the user's intended target object. The disclosed principles provide active strategies for finding the user's target with few comparisons. The so-called rank-net strategy for noiseless user feedback is described. For target distributions with a bounded doubling constant, rank-net finds the target in a number of steps close to the entropy of the target distribution and hence of the optimum. The case of noisy user feedback is also considered. In that context a variant of rank-nets is also described, for which performance bounds within a slowly growing function (doubly logarithmic) of the optimum are found. Numerical evaluations on movie datasets show that rank-net matches the search efficiency of generalized binary search while incurring a smaller computational cost.

Abstract: Disclosed is an improved approach for implementing an on-demand scheduler in a mobile device and the structures to support realtime on-demand schedulers. A lightweight word-based structure is disclosed for storing scheduling-related data on the mobile device. Using this lightweight word-based structure enables on-demand and real-time scheduling. This type of lightweight structure also permits scheduling activities to be performed in a disconnected mode, which can then be later synchronized with the server to confirm the booking In addition to appointment scheduling, this technique can also be implemented for scheduling of any type of resource.

Abstract: Methods and apparatus to search datasets are disclosed. Example methods include in response to a search request including first and second logically related criteria, determining a first number of records in a database satisfying the first criterion and a second number of records in the database satisfying the second criterion; when the first number is less than the second number, selecting the first criterion as a basis for generating a subset of the records of the database; when the second number is less than the first number, selecting the second criterion as the basis for the identification of the subset of the records of the database; and searching the subset of the records.

Abstract: A search system configured to predict further search intents of a user and to perform exploratory further searches and produce a number of search features and associated relevances and divergence quantifiers for displaying by user equipment at least two-dimensional so as to allow the user to identify relationship of various diverging search terms and to rapidly direct the searching towards information the existence of which may have been previously unknown to the user. Some of the search features can be concealed and shown to the user only if the user magnifies the corresponding area on a display showing the search features returned by the search engine. Files matching to varying degree with the present and predicted further searches are shown to the user with respective lists of search features.

Abstract: A method is described of dynamically searching a search domain. A first result set of data objects is presented. The first result set is obtained from a first search of a search domain having active and inactive data objects for first search features obtained from a source data object. An update is detected in the search domain. Key features are extracted from the source data object to be included in second search features when the update in the search domain is in the source data object. A second search of the updated search domain is performed for data objects having the second search features.

Abstract: Presenting data from different data providers in a correlated fashion. The method includes performing a first query on a first data set controlled by a first entity to capture a first set of data results. The method further includes performing a second query on a second data set controlled by a second entity to capture a second set of data results. The method includes receiving a selection of one or more results from the first data set. The method further includes using the one or more selected results, consulting a relationship ontology that correlates data stored in different data stores controlled by different entities, to identify one or more relationships between data in the selected results set and the second data set.

Abstract: Systems and methods for identifying which video segment is being displayed on a screen of a television system. The video segment is identified by deriving data from the television signals, the derived data being indicative of the video segment being displayed on the screen. This feature can be used to extract a viewer's reaction (such as changing the channel) to a specific video segment (such as an advertisement) and reporting the extracted information as metrics. The systems and methods may further provide contextually targeted content to the television system. The contextual targeting is based on not only identification of the video segment being displayed, but also a determination concerning the playing time or offset time of the particular portion of the video segment being currently displayed.

Abstract: Systems and methods are disclosed for processing a search request received from a user. A method includes providing access to content items associated with metadata. The method includes providing information about at least one search previously performed for a user, and providing access to information describing relationships between at least one of the content items and the metadata. The method includes receiving a present input from the user intended to identify a desired content item. Upon determining that results from the previous search did not satisfy the search request from the user, the method includes determining an intent shared by the previous search and the present input based on comparing (i) the relationship information, (ii) the previous search, and (iii) the present input. The method also includes selecting and presenting a subset of content items based on comparing the shared intent and the metadata.

Abstract: A method, apparatus and system of method and system of directory sharing and management in a group communication environment is disclosed. In one embodiment, a method of a fast-search server includes processing a character of a query of music data, referencing the character with a reverse index of a music database, determining that the character matches a data record of the music database using the reverse index and returning the data record of the music database prior to receiving all characters of the query of music data from a user. The reverse index may be created from a combination of letters appearing as a string in a data field of the music database. The method may include preforking the character of the query of music data along with other processes in the fast-search server to minimize concurrency issues and to minimize threading locks.

Abstract: Methods and apparatus to search datasets are disclosed. Example methods include in response to a search request including first and second logically related criteria, determining a first number of records in a database satisfying the first criterion and a second number of records in the database satisfying the second criterion; when the first number is less than the second number, selecting the first criterion as a basis for generating a subset of the records of the database; when the second number is less than the first number, selecting the second criterion as the basis for the identification of the subset of the records of the database; and searching the subset of the records.

Abstract: Mechanisms are provided for answering questions about at least one previous execution of a question answering (QA) system on a previous input question. An input question is received that is directed to a previous execution of a QA system with regard to a previous input question. The input question is processed to generate at least one query for application to a corpus of information, which comprises information about the QA system and the previous execution of the QA system on the previous input question. The at least one query is applied to the corpus of information to generate candidate answers to the input question which are ranked according to confidence measure values associated with the candidate answers. A final answer for the input question is output based on the ranking of the candidate answers.

Abstract: Methods, computer systems, and computer-storage media are provided for generating offers. Offers may be generated upon being associated with one or more of a keyword, a search query input, a search query history for a user, a current trend, a social trend (either user-specific or not user-specific social trends), a user location, and the like. Upon determining the association between one or more offers and at least one of the above-listed factors, the one or more relevant offers may be displayed in a variety of ways including, but not limited to, in conjunction with search results, on an offers portal dedicated to presentation of offers, in a mapping application of a mobile device, and the like.

Abstract: A system and method for operating the same includes a conversation manager that receives a receiving a first search request and, after receiving the first search request, receives a second search request. The system also includes a classifier module within the conversation manager classifying the first search request relative to the second search request as related or not related. A context merger module within the classifier module combines the first search request and the second search request to form a merged search request. A search module performs a second search based on the merged search request.

Abstract: The current application discloses a database management system that provides multiple-input, multiple-output-per-input user-defined-function-based operations. The database management system comprises at least one processor and electronic memory, a database-query processor, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that makes multiple calls to a multiple-input, multiple-output-per-input user-defined-function, in each call transmitting a next input to the multiple-input, multiple-output-per-input user-defined-function, and the multiple-input, multiple-output-per-input user-defined-function, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that uses three different memory buffers, the contents of which are maintained for three different time periods, to compute and return to the database-query processor multiple outputs in response to at least one of the multiple inputs.

Abstract: The disclosure relates to identifying a solution to a problem wherein the problem and solution are in different disciplines. An exemplary embodiment concerns a system for identifying a solution comprising a bridging component for generating a bridged ontology from data elements of prime and secondary ontologies if the number the data elements common to the ontologies meets a threshold value. The system may comprise an inference engine for identifying, from the bridged ontology, data elements related to the problem and the solution. The inference engine may further determine relationships between the data elements associated with the problem and those associated with a solution to confirm the correctness of a solution. The problem and solution may be represented as RDF data objects.

Abstract: According to an example, a search request is received, and the search request comprises a search keyword and information of a current user; interpersonal relationship chain data of the current user are obtained according to the information of the current user; person information corresponding to the interpersonal relationship chain data of the current user is searched for a person matching the search keyword; and the person matching the search keyword is taken as a search result.

Abstract: A computer implemented method of analyzing and graphically representing the correlation of a plurality of transaction items, the method comprising the steps of: retrieving data associated with groups of the transaction items, correlating a plurality of groups of transaction items in a dimensionally reduced manner, creating a tree hierarchy which classifies the groups of transaction items in a hierarchy according to a defined user understandable factor, wherein the tree hierarchy is linked to the groups of transaction items, and graphically representing the correlated groups of transaction items and tree hierarchy to enable interaction between the correlated groups of transaction items and the linked tree hierarchy.

Abstract: A computer-implemented method and system for enabling communication between networked users based on search queries and common characteristics is disclosed. Particular embodiments relate to receiving a search query from a first user and establishing a communication link between the first user and a second user based on the first user's search query. Particular embodiments relate to receiving a first search query from a first user, receiving a second search query from a second user, determining if the first user and the second user fit within match criteria, and establishing a communication link between the first user and the second user if the first user and the second user fit within match criteria.

Abstract: A distributed file system enables the intelligent storing and retrieval of files among a plurality of storage units. The distributed file system utilizes a metadata data structure to track and manage detailed information about each file, including, for example, the device and block locations of the file's data blocks, to permit different levels of replication and/or redundancy. The distributed file system includes a switch to receive a read request for a file and to send the read request to one of the storage units. Each of the plurality of storage units is operable to monitor access to the file, such that a block cache module is operable to perform a scalable number of packet read aheads, wherein the scalable number is based on at least a current read rate and a current latency of a link to access the at least one file.

Abstract: Provided are techniques for transmitting a first query from a query agent in a client computing device to an answering agent in a server computing device; receiving, at the query agent from the answering agent, a first response to the first query; saving the first query in conjunction with the first response in a computer readable storage medium; intercepting, by a query service agent, a second query from the query agent to the answering agent; correlating the second query to the first query; and transmitting to the query agent from the query service agent the first response in response to the second query.

Abstract: A search method includes the step of creating a list of candidate probe words. For each candidate probe word, the number of item descriptions that contain the candidate probe word is counted. Q probe words are chosen whose word count most equally divides the number of remaining item descriptions into q+1 subgroups. The q probe words are presented for selection. Based on the selection, the list of probe words is pruned to eliminate items that that were not selected. The counting step, choosing step, presenting step and pruning step are repeated until a final list of items remain.

Abstract: A method and system for managing searches of a data set that is partitioned based on a plurality of events. A structure of a search query may be analyzed to determine if logical computational actions performed on the data set is reducible. Data in each partition is analyzed to determine if at least a portion of the data in the partition is reducible. In response to a subsequent or reoccurring search request, intermediate summaries of reducible data and reducible search computations may be aggregated for each partition. Next, a search result may be generated based on at least one of the aggregated intermediate summaries, the aggregated reducible search computations, and a query of adhoc non-reducible data arranged in at least one of the plurality of partitions for the data set.

Abstract: A content management system detects 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: A method and an apparatus for word quality mining and evaluating are disclosed. The method includes: calculating a Document Frequency (DF) of a word in mass categorized data; evaluating the word in multiple single-aspects according to the DF of the word; and evaluating the word in multiple aspects according to the multiple single aspect evaluations to obtain an importance weight of the word. According to the solution of the present invention, the importance of the word in the mass categorized data may be evaluated, and words with high quality may be obtained through an integrated evaluation.

Abstract: The present subject matter provides a system and a method for generating report on a materialized view. The method includes generation of a first query based on selection of at least one attribute from a plurality of attributes of a resource associated with a metadata driven framework. The plurality of attributes is associated with a particular instance of the resource. The method further includes storing the first query in a table schema. The table schema is associated with a first trigger. The method also includes invoking the first trigger upon storage of the first query in the table schema. The first trigger is configured to execute the first query to generate a materialized view based on an output of the first query. The method may include executing a second query on the materialized view for generating the report. The second query may be created based on materialized view data.

Abstract: Systems and methods for identifying which video segment is being displayed on a screen of a television system. The video segment is identified by deriving data from the television signals, the derived data being indicative of the video segment being displayed on the screen. This feature can be used to extract a viewer's reaction (such as changing the channel) to a specific video segment (such as an advertisement) and reporting the extracted information as metrics. The systems and methods may further provide contextually targeted content to the television system. The contextual targeting is based on not only identification of the video segment being displayed, but also a determination concerning the playing time or offset time of the particular portion of the video segment being currently displayed.

Abstract: Data flow in a database statement for a database management system having memory storing a database is simplified. The statement has at least two sequenced subexpressions, evaluation of which is driven by a sequencing operation. A reference to a first sequenced subexpression in a second sequenced subexpression subsequent to the first sequenced subexpression is determined. The reference affirming evaluation of the first sequenced subexpression is determined. A first evaluation order for conflicting table accesses between the first sequenced subexpression and other table accesses in the statement is determined. A second evaluation order between the other table accesses and the determined reference is also determined. The sequencing operation for the first sequenced subexpression is modified based on a sequential arrangement of the determined reference and the first sequenced subexpression according to the first evaluation order and the second evaluation order.

Abstract: In an electronic presentation of information, search is made easier and more personal by identifying words, symbols or images (collectively called terms) in text and allowing users to select any of those terms to refine their search. The technology is called “cherry picking” because it allows each user to select what they judge to be the best terms among many available terms in the text, and use those terms to their own advantage. Terms in text are identified by a visual indicator such as a change in the shape of the cursor. “Stop words,” words that do not change the outcome of the search, and words that meet other specific criteria are not selectable.

Abstract: The present disclosure includes a system and method for determining proximity to topics of content items (e.g., an advertisement or “ad”). In some implementations, a method includes identifying search criteria associated with keywords of a content item. The keywords used in determining whether or not to embed the content item in Web pages including search results. Numerical scores for the search criteria is determined based, at least in part, on a topic of the content item, the numerical score indicative of proximity to the topic of the content item.

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: 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: The invention provides a method of processing data including, receiving a URL at a server computer system, utilizing the URL at the server computer system to extract a plurality of server search results from a data store, and transmitting the server search results from the server computer system to the user computer system.

Abstract: Methods, and systems, including computer programs encoded on computer-readable storage mediums, including a method for determining a relevance of search keywords to an advertisement. The method includes accessing ad keyword data specifying an ad keyword associated with an advertisement; identifying a keyword cluster specifying terms related to a topic of the advertisement; determining whether the ad keyword occurs in the at least one keyword cluster; identifying one or more search keywords to which the advertisement is responsive; determining whether the one or more search keywords occur in the at least one keyword cluster; and determining, by one or more data processors, a relevance of the one or more search keywords to the advertisement based on the determination of whether the ad keyword occurs in the at least one keyword cluster and the determination of whether the one or more search keywords occur in the at least one keyword cluster.

Abstract: Technology is described herein for creating new, inferred queries that are suitable for use as query suggestions. The technology includes mapping different past queries that represent different information requests, but that share a number of terms having the same or similar form. An inferred query is created by replacing unshared terms in one mapped query with the unshared terms in another mapped query, based on the similarity between the unshared terms in the two mapped queries. The inferred query thus represents a new information request that is derived from the information requests of the past queries used to form it. The inferred query can then be provided as a query suggestion, which increases the likelihood of providing query suggestions that will assist users in finding the information they seek. In doing so, meaningful query suggestions can be provided to users seeking information outside the coverage of the past queries.

Abstract: In a first aspect, a method is provided that includes the steps of (1) pre-computing a query result for each of a plurality of whole segments of data included in a database; (2) receiving a query specifying a defined range of data in the database; (3) determining if any of the whole segments are within the defined range; (4) performing the query on any partial segments of data within the defined range; and (5) determining the result of the query based on the pre-computed query results for any whole segments determined to be within the defined range and the result of the query on any partial segments within the defined range. Numerous other aspects are provided.

Abstract: Systems and methods for managing data, such as metadata. In one exemplary method, metadata from files created by several different software applications are captured, and the captured metadata is searched. The type of information in metadata for one type of file differs from the type of information in metadata for another type of file. Other methods are described and data processing systems and machine readable media are also described.

Abstract: A method for processing queries is provided. A database server receives and executes a query to generate a relation. The query comprises first one or more clauses and a model clause. The model clause comprises a rule that has a left-side expression and a right-side expression. In one embodiment, the right-side expression of the rule includes a window function, which specifies one or more partition columns. In an embodiment, the left-side expression comprises a for-loop predicate. The for-loop predicate is unfolded after the database server compiles the query. In one embodiment, the left-side expression of the rule comprises one or more existential predicates, where each existential predicate evaluates to a Boolean value.

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: A method analyzes event patterns in multi-dimensional data and based on this analysis of the event patterns computes a hierarchical event pattern query from another hierarchical event pattern query. The method executes the hierarchical event pattern query on the multi-dimensional data.

Abstract: A structured file includes information to bind a web data source to a web data query system. Code is embedded within the structured file and is in a code language understood by the web data query system. The code is unrestricted in function. Code language objects are exposed within the web data query system for use by the code to interface with the web data query system and the web data source. A URL is associated with the structured file to enable access of the structured file through the Internet. A unit-based quota method is implemented to manage execution of code in the structured file. The unit-based quota method collapses multiple dimensions of computing resource control into a single unit value, tracks a number of units expended by the code, and stops execution of the code when the number of units expended by the code reaches a set limit.

Abstract: In general, the subject matter described in this specification can be embodied in methods, systems, and program products for discovering information that is related to a unique object identifier from a decentralized collection of computing systems. A unique object identifier is identified. A first information request that includes the unique object identifier is forwarded to a first computing system. First information that the first computing system has stored in association with the unique object identifier is received from the first computing system. An identifier for a second computing system is received from the first computing system in response to the first information request. A second information request that includes the unique object identifier is forwarded to the second computing system based on the received identifier. Second information that the second computing system has stored in association with the unique object identifier is received from the second computing system.

Abstract: Methods and systems are provided, for persistent querying in a federated database system. A federated database system has a plurality of connectable database management system nodes, each database node having at least one database. Persistent querying includes: receiving a query at a first database node and propagating the query from the first database node to other database nodes in the federated database system. A responding database node satisfying the query: obtains a query results set; defines a topic identifier for the query; and publishes subsequent messages relating to the topic identifier when data updates are available. The first database node receives query results sets from one or more responding nodes and the first database node subscribes to topic identifiers for publications of subsequent messages from the responding database nodes. Subsequent messages are published relating to the query along the connection through which the query is returned.

Abstract: Methods, systems and articles of manufacture are disclosed for providing secure access to data. Public UDTFs, private UDTFs and a metadata processor are utilized to facilitate secure access to data residing in a variety of data repositories. User security attributes and UDTF attributes are gathered. A table is queried based on the gathered attributes.

Abstract: A computer program product is provided and includes a tangible storage medium readable by a processing circuit and on which instructions are stored for execution by the processing circuit for initially verifying a presence of parameters passed to a parameter database and that a selected group of the parameters are greater than or equal to zero, parsing optional block data to validate the optional block data, determine a length thereof and a number of optional blocks contained therein and proceeding with one of a secondary info-parsing and a secondary data-parsing operation with respect to the optional block data in accordance with content of the parameters passed to the parameter database

Abstract: A system and method for displaying publication information for search results. User input is received to perform a search of a communications network. Search results are generated in response to the user input. A content date is determined for content included in each of the search results. The search results and the content date associated with each of the search results is displayed.