Abstract: Constraints that restrict how corresponding identifiable groups of files are stored in a database, are enforced on corresponding file data. In response to a query on any data from an identifiable group of files, the effect of the constraint on how the corresponding data is stored is determined. The original query is rewritten, based on the effect of the constraint, so that the rewritten query is directed to a particular subset of the data stored in the database. Consequently, the search space is restricted to an identifiable subset of the database and execution of the rewritten query is more efficient than execution of the original query.

Abstract: A method and apparatus for automatically detecting and extracting information from dynamically generated web pages are disclosed. For example, the present method stores user provided information that is entered into a form interface of a web page for a first query. Responsive to the first query, a first response web page is received and stored. The present method then automatically generates a second query to acquire a second response web page that is responsive to the second query. Finally, the present method compares the first response web page and the second response web page. In one embodiment, the present invention extracts information that is dissimilar between the first response web page and the second response web page. This extracted information is deemed to be the pertinent information requested by the user.

Abstract: A search expression is automatically generated for designating a target element for a Web page whose contents change according to a system state or the number of elements to be displayed.

Abstract: A system and method for method for performing a web search by a search engine for content including: providing a first search results page to a user in response to a search query; providing an interface for submission of an input action representing a search command, wherein the interface is associated with the search results page; receiving the input action; reformulating the search query to incorporate the search command represented by the input action; and providing a second search results page to the user in response to the reformulated search query.

Abstract: A task management system may be configured to select and/or perform one or more tasks. The task management system may be configured to create weighted groups of tasks to be performed in response to various triggering conditions. The task management system may include a value generation module, which may be configured to generate values used to select tasks from two or more of the weighted groups of tasks.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for storing a formula having first and second object fields. These mechanisms and methods for storing a formula having first and second object fields can allow access to data from related object types other than the object type being currently accessed. The ability of embodiments to provide such access may allow access to additional contents of a database for performing validations, calculations, etc.

Abstract: Methods for transforming queries that contain EXISTS and NOT EXISTS subqueries are provided. The methods provided transform original queries that contain EXISTS and/or NOT EXISTS subqueries in conjunctive or disjunctive combinations into transformed queries that coalesce the original EXISTS and/or NOT EXISTS subqueries into a reduced number of EXISTS and/or NOT EXISTS subqueries, thereby eliminating duplicative table accesses and join operations.

Abstract: A computer-readable, non-transitory medium storing a character string comparison program is provided. The program causes, when executed by a computer, the computer to perform a process including splitting a first character string and a second character string into words; acquiring information including a semantic attribute that represents a semantic nature of each of the words and a conceptual code that semantically identifies said each of the words, from a storage device; identifying a pair of the words having a common semantic attribute between the first character string and the second character string; comparing the conceptual codes of the specified pair of the words between the first character string and the second character string; and generating a comparison result between the first character string and the second character string based upon a comparison result of the conceptual codes.

Abstract: One embodiment disclosed relates to a method of providing a real-time communications enhanced search service. When a search request from a client application, a search is obtained based on the search request. In addition, information as to relevant real-time communications channels, if any, is determined based on the search request. The results of the search and the information as to the relevant real-time communications channels may be combined and returned to the client application. Upon receiving a request from the client application to initiate opening of a relevant real-time communications channel, the relevant real-time communications channel may be established by communications with a second client application of a third party. Other embodiments are also disclosed.

Abstract: Provided are a method, system, and article of manufacture for generating information on database queries in source code into object code compiled from the source code. Source code including query statements to perform operations with respect to a database is translated into executable object code. A statement descriptor for at least one query statement is generated into the object code, wherein the statement descriptor for the at least one query statement includes information on the query statement including the query statement in the source code. The statement descriptors in the object code are processed to output information on the query statements indicated in the statement descriptors.

Abstract: A query over one or more push-based data sources is transformed into a data representation of the query. The data representation can subsequently be analyzed, optimized, and remoted, among other things. For example, the data representation can be utilized to generate code for an out-of-process execution engine. Additionally, the data representation can be employed with respect to conversions to and from various types and representations of data.

Abstract: Techniques for simplifying querying of ontologies. In one embodiment, one or more queries for querying an ontology are automatically generated in a language suitable for querying the ontology. A user may enter a query in a simple language such as a natural language query. In response, one or more queries capable of querying the ontology are automatically generated in a second language. The automatically generated queries may, for example, be in SPARQL or PL/SQL. The one or more automatically generated queries may then be used to query one or more ontologies.

Abstract: A database query is partitioned into an initial partition including a plurality of parallel groups, and is executed, via an execution plan, based on the initial partition. A sampling subset of data is identified from the plurality of parallel groups. Substantially in parallel with the executing of the query, the execution plan is executed on the sampling subset of data as a sampling thread. The execution plan is modified based on feedback from the execution of the execution plan on the sampling subset of data.

Abstract: In various example embodiments, systems and methods to mine product recommendations from query reformulation is provided. In example embodiments, a search query is mapped to a particular product. Transition data for the particular product is accessed. The transition data includes values reflecting a number of search transitions between the particular product and other products in session sets of previous queries. One or more recommendations based on the transition data is determined and provided to the user.

Abstract: Extraction analysis techniques biased, in part, by query frequency information from a query log file and/or search engine cache are employed along with machine learning processes to determine candidate keywords and/or phrases of web documents. Web oriented features associated with the candidate keywords and/or phrases are also utilized to analyze the web documents. A keyword and/or phrase extraction mechanism can be utilized to score keywords and/or phrases in a web document and estimate a likelihood that the keywords and/or phrases are relevant, for example, in an advertising system and the like.

Abstract: An apparatus and method for a multi-partition query governor in a partitioned computer database system. In preferred embodiments a query governor uses data of a query governor file that is associated with multiple partitions to determine how the query governor manages access to the database across multiple partitions. Also, in preferred embodiments, the query governor in a local partition that receives a query request communicates with a query governor in a target partition to accumulate the total resource demands of the query on the local and target partitions. In preferred embodiments, a query governor estimates whether resources to execute a query will exceed a threshold over all or a combination of database partitions.

Abstract: Methods and systems for processing data, including metadata and an index database. In one exemplary method, a first folder, representing a first search query, is stored, and a second folder, representing a second search query wherein the second folder has a predetermined hierarchical relationship to the first folder, is stored, and the search queries are used to search one or both of an index database and a metadata database. In the metadata database, the type of metadata for one file type differs from the type of metadata for another file type.

Abstract: Computer-readable media, computer systems, and computing devices facilitate providing entity-specific content to a user in response to a search request. A search request is received from a user and determined to be related to an entity. Domains associated with the entity are also identified. The search service identifies a set of potential answers and uses the potential answers to generate a set of reformulation queries, which are used to query answer services. Answers returned by the answer services are ranked and bound to an entity card, which is subjected to a quorum checking process that facilitates optimization of the use of allocated screen real estate associated with the entity card. A representation of the entity card is presented on a search-results page.

Abstract: Methods and systems for extending keyword searching techniques to syntactically and semantically annotated data are provided. Example embodiments provide a Syntactic Query Engine (“SQE”) that parses, indexes, and stores a data set as an enhanced document index with document terms as well as information pertaining to the grammatical roles of the terms and ontological and other semantic information. In one embodiment, the enhanced document index is a form of term-clause index, that indexes terms and syntactic and semantic annotations at the clause level. The enhanced document index permits the use of a traditional keyword search engine to process relationship queries as well as to process standard document level keyword searches. In one embodiment, the SQE comprises a Query Processor, a Data Set Preprocessor, a Keyword Search Engine, a Data Set Indexer, an Enhanced Natural Language Parser (“ENLP”), a data set repository, and, in some embodiments, a user interface or an application programming interface.

Abstract: Embodiments of the invention provide techniques for searching for virtual objects of an immersive virtual environment based on user interactions within the virtual environment. Generally, embodiments provide an attribute index storing data describing attributes of virtual objects, and an interaction index storing data describing user interactions with virtual objects. Search queries may be evaluated using both the attribute index and interactions index. Thus, virtual objects may be searched in terms of object attributes as well as user interactions with the virtual objects.

Abstract: The method of object searching in a data storage system includes receiving, by an object search machine, a search criteria, the search criteria including a plurality of parameters and storing, by the object search machine, the search criteria as a persistence query having a first query format. The method also includes creating, by the object search machine, a protocol query based upon the persistence query, the protocol query having a second query format, the second query format distinct from the first query format. The method additionally includes utilizing, by the object search machine, the protocol query to request at least one object associated with the protocol query from the data storage system.

Abstract: Systems and methods are described for intelligent default selection of characters to be entered via an on-screen keyboard. Based on one to several criteria, a character most likely to be selected for entry via the on-screen keyboard during a search request is determined and a selector is positioned at that particular character. If that character is indeed the character the user wishes to enter, the user does not have to execute any navigation steps to enter the character, but can—with a single actuation—enter that character. In many instances, the user will only have to enter the selection without first having to navigate to the selection. As a result, the number of times buttons need to be actuated by the user to enter a character string can be significantly reduced.

Abstract: A method of transforming relational queries of a database into on a data processing system includes receiving a series of relational queries, transforming first parts of the queries into a continuous query embodied as a streaming application, sending parameters in second parts of the queries in the series to the streaming application as a data stream, and executing the continuous query based on the received data stream to generate query results for the series of relational queries. Each query in the series includes a first part and a second part. The first parts are a pattern common to all the queries in the series and the second parts each have one or more parameters that are not common to all of the queries in the series.

Abstract: There is provided a computer-implemented method of modifying a query executing in a database management system. The method comprises sending a no-wait message for the query to a control broker. The method also comprises receiving a reply to the no-wait message from the control broker. The reply to the no-wait message specifies a modification to the query. Additionally, the method comprises performing the modification.

Abstract: Concepts and technologies are described herein for reducing locking during database transactions without using a cache. In accordance with the concepts and technologies disclosed herein, a server application generates a changeset in response to receiving an operation for modifying base data stored in a database. The changeset is stored as a set of tables that are stored at the database with the base data, and include a first table reflecting records in the base data that have been created and/or modified by the operations. The changeset further can include a second table reflecting records in the base data that have been deleted by the operations.

Abstract: An improved method, system, and computer program product is disclosed that provides a hybrid approach to optimization which allows different subsets of data accessed by a query to be optimized with different access paths and execution approaches. Transformations may be performed to re-write the query, which restructures the query in a way that facilitates the hybrid optimization process. Multiple transformations may be interleaved to produce an efficient re-written query.

Abstract: In a method for a direct answer for search, a search query is received over a network, one or more answer entities are determined from one or more answer candidate snippets, with an answer candidate snippet having at least a portion of content available over the network for an answer candidate, a content identifier is determined for an answer candidate, a title is tokenized for the content identifier, a comparison is performed between a vector of tokens for the title and a vector of the one or more answer entities, an indicator of the relevance is adjusted for the content identifier in accordance with the comparison, and at least one answer candidate snippet is sent for a response to the search query.

Abstract: A method for bi-directional data replication between a Web Service application and a relational database are provided. Techniques of Enterprise Application Integration (EAI) and Extract Transform Load (ETL) technology are employed to create a relational database schema, load the schema, synchronize the structure and the content of the schema, and replicate changes in the content of the schema to the web services application. Optional advanced techniques to support reporting, legacy data migration, and integration with other applications are also provided.

Abstract: Sharing of search histories is facilitated with a computer based system and method that allow a searcher to share search results generated without prior authentication of an identity with a search engine. Sharing and collaboration are further facilitated by allowing search history items to be shared with a minimum of additional searcher input. Context for the search history items is provided by associating a search query with an accessed document link without requiring separate tagging of the link by the searcher.

Abstract: Transactions with respect to database operations are fingerprinted by associating transaction identifiers with logged information about those database operations. An SQL query is obtained prior to its evaluation by a database engine. A transaction identifier to be associated with the SQL query is also obtained. The SQL query is then modified to generate a modified SQL query, wherein the modified SQL query includes a WHERE clause that contains an expression that always evaluates to a logical true value, and wherein the expression contains the transaction identifier. The modified SQL query is then sent to the database engine for evaluation within the data processing system. When the processing of the modified SQL query is logged with a copy of the modified SQL query, the logged information contains a copy of the transaction identifier.

Abstract: A system and method for using an exemplar document or search query to retrieve relevant documents from an inverted index of a large corpus of documents. The system and method groups words by synonym and calculates term frequency (TF) and inverse document frequency (IDF) scores for the respective word groups. A composite term frequency-inverse document frequency (TF-IDF) score is calculated for each word group and the documents of the corpus are ranked based on the TF-IDF scores, utilizing a vector space model incorporating a cosine similarity function.

Abstract: A system and method for providing conditional background music for user-generated content and broadcast videos. The method includes: detecting that a particular song is specified to serve as background music for a particular media content; searching for the particular song to serve as background music for the particular media content; and checking whether an end user of the particular media content has rights to the particular song and that the particular song is available. When the particular song is available, the particular song is returned for playback as the background music to the particular media content. When the particular song is not available, searching is conducted for another song as a substitute song based upon preferences of both an author and the end user of the particular media content. Other embodiments are disclosed.

Abstract: An information retrieval system uses phrases to index, retrieve, organize and describe documents, analyzing documents and storing the results of the analysis as phrase data. Phrases are identified that predict the presence of other phrases in documents. Documents are the indexed according to their included phrases. Related phrases and phrase extensions are also identified. Changes to existing phrase data about a document collection submitted by a user is captured and analyzed, and the existing phrase data is updated to reflect the additional knowledge gained through the analysis.

Abstract: A system, method and program product for evaluating search algorithms. A method is provided that includes: defining a population of searches and database records from a search history database; applying a sampling method and direct sampling rates to each search/record pair in the population using a computing system, wherein search/record pairs having a higher variability relative to the population are assigned a relatively higher probability; randomly sampling a direct sample of search/record pairs with the computing system using the direct sampling rates to increase a likelihood of obtaining search/record pairs having the higher variability; running a search algorithm and measuring errors for the direct sample and/or for an associated indirect sample; and calculating an estimated error rate for the search algorithm using inverse probability weighting.

Abstract: A question search system provides a collection of questions having words for use in evaluating the utility of the questions based on a language model. The question search system calculates n-gram probabilities for words within the questions of the collection. The n-gram probability of a word for a sequence of n?1 words indicates the probability of that word being next after that sequence in the collection of questions. The n-gram probabilities for the words of the collection represent the language model of the collection. The question search system calculates a language model utility score for each question within a collection that indicates the likelihood that a question is repeatedly asked by users. The question search system derives the language model utility score for a question from the n-gram probabilities of the words within that question.

Abstract: A more efficient search algorithm introduces a variety of new tools and strategies to more efficiently search and retrieve desired records from an electronic database. Among these are a strategy that utilizes the first and last positional characters, or phonemes, to exploit the fact that often last positional character is nearly as important as a first positional character in distinguishing database records from one another. In addition, virtual search parameters, that are not a portion of the database records, can also be utilized in distinguishing database records, such as by identifying a number of characters in a search field for a requested database record as a way of distinguishing that record from all others with a different number of characters. The invention finds potential application in any database search application, but is particularly useful in delivering directory assistance services.

Abstract: Techniques are provided for improving efficiency of database systems, and in particular, to refreshing materialized views maintained by database systems and rewriting queries to access the materialized views. According to the approaches, a ranked materialized view is incrementally refreshed, and during the incremental refresh operation, rows in the partitions of the materialized view are ranked within the partitions.

Abstract: A system and method may include a processor that normalizes dynamic URLs by sorting URL parameters and removing duplicative URL parameters. The processor may additionally or alternatively provide redirects from one URL to another, where the two URLs are associated with duplicative content. The processor may additionally or alternatively insert a canonical tag into content associated with a URL, where the canonical tag points to another URL whose content is a near duplicate of the content associated with the first URL. The processor may additionally or alternatively apply transformation rules to content of a webpage based on the matching of portions of the URL of the webpage to various character strings.

Abstract: A method and system is presented which provides a TDM framework for managing self-describing measurement data. The TDM framework provides applications with a central platform for accessing measurement data across an entire enterprise system. By means of individual plug-ins, which may be specific to a given data file format, meta-data for each data store in the enterprise may be indexed in a unified manner. The unified indexing, in turn, provides the ability to browse and query the indexed measurement data without requiring the opening or reading from a source data file.

Abstract: A method, software, database and system for determining an optimal treatment for an illness in an individual and for determining the impact (e.g., side effects and intended benefits) of the treatment in the individual are presented in which an attribute profile of the individual containing genetic and non-genetic attributes is compared against a database containing combinations of genetic and non-genetic attributes that are statistically associated with successful treatment of the illness in other individuals.

Abstract: The present invention generally provides methods, systems and articles of manufacture that provide a database query application that allows user to compose an abstract query that includes a sequence operator. In one embodiment, sequence operators are used to specify which data elements, from a sequence of data elements, should be retrieved for an abstract query. In another embodiment, a sequence operator may be used to specify that a condition included in an abstract query should be evaluated against particular data elements of the sequence.

Abstract: Systems, methods, and other embodiments associated with processing regular expressions are described. One example method includes analyzing a rule for a regular expression and deleting the regular expression.

Abstract: A system is provided for locating data in a distributed data environment, in which at least two users share a common data requirement. The environment comprises a plurality of network-connected data terminals. The system comprises at least one of the network-connected data terminals, which includes means for each of the at least two users to submit a data locating query, means for each of the at least two users to receive a query result, means for each of the at least two users to input respective relevance feedback data in response to the received query result, means for combining the respective relevance feedback data in real time, and means for processing data locating queries with the combined respective relevance feedback data. A method is also provided for locating data in the distributed data environment.

Abstract: Provided are techniques for generating a result set. A statement that includes at least one statement pattern is received, wherein each statement pattern is a template that indicates how a statement is to be modified for execution against a data store and wherein each statement pattern modifies program logic and control flow. Each statement pattern is expanded to generate one or more new statements, wherein each statement pattern is capable of being expanded to zero or more statement patterns. The one or more new statements are executed against a data store to obtain a result set. It is determined whether to modify the result set based on the at least one statement pattern. In response to determining that the result set is to be modified, modifying the result set.

Abstract: Many contemporary computing scenarios involve the submission by a user of a search query to be applied to a data set (such as a set of web pages indexed by a web search engine.) Additionally, many users participate in social networking and have generated a social profile, including demographic information, interests, and associations with other users who also have social profiles. It may be advantageous to improve the presentation of search results from search queries by adjusting the search queries according to a prediction of user interest of the user in the topics associated with respective search results, based on the information in the social profile of the user. For example, search results relating to topics in which the user or the user's friends have expressed an interest within the social network may be presented before other search results, thereby improving the relevance of the search results to the user.

Abstract: Articles of manufacture and systems for searching collections of data using context sensitive expanded term searching are provided. The collection of data may be a relational database, text document, or any other type of searchable collection of data. In either case, a query including a search condition based on a specified search term may be modified to include additional conditions based on a set of expanded (e.g., conceptually-related) search terms. For some embodiments, a user may be given the ability to control the level of expansion and the context in which the terms may be expanded.

Abstract: A computerized system for and method of creating applications that access information from multiple data sources into a common, role-based distribution model are described. The computerized system includes a server having one or more dynamic object libraries, one or more template libraries, and a dynamically allocated area in the computer memory where data is stored, referenced, and manipulated. The system also includes one or more adapters, each allowing the server to access one of the data sources.

Abstract: The present invention provides methods and computer program products for identifying a set of related videos for a first video. An embodiment of the method comprises a video hosting website creating an ordered list containing a plurality of words from the metadata associated with the first video. The video hosting website uses a select number of words from the ordered list to form a search query. The search query is processed by the videos hosting website to obtain search results that contain a number of related videos. If the number of related videos in the search results is not within a set range, the search query is modified and the modified search query is processed. If the number of related videos in the search results is within a set range, the search results are provided as the set of related videos for the first video.

Abstract: Methods for factoring search and browse policies and content preferences into Web search results are provided. Such search and browse policies and/or content preferences generally are provided by a parent, an employer, or other company representative and specify to whom they apply. Upon receiving a search query from a particular user, it is determined whether one or more search and browse policies and/or content preferences apply to the received search query. Upon determining that one or more search and browse policies and/or content preferences apply to the received search query, at least one of the received search query and any search results determined as satisfying the search query are analyzed in accordance with the one or more applicable search and browse policies and/or content preferences applying to the user. Any necessary modifications are made to the search results before the results are presented to the user.

Abstract: Disclosed are methods and apparatus for performing named entity recognition. A set of candidates and corresponding contexts are obtained, each of the set of candidates being a potential seed example of an entity. The contexts of at least a portion of the set of candidates are compared with contexts of a set of seed examples of the entity such that a subset of the set of candidates are added to the set of the seed examples. A set of rules are created from the set of seed examples obtained in the comparing step. A final set of seed examples of the entity is generated by executing the set of rules against the set of candidates.