Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for index-side synonym expansion. One method includes indexing a token from a resource, including determining that the token comprises a numeric portion and storing data associating the resource with both the particular token and the numeric portion in a search engine index. Another method includes indexing a token from a resource, including normalizing the token by removing a prefix matching a stopword prefix and storing data associating the resource with both the token and the normalized form of the token in a search engine index. Another method includes creating a token blacklist.

Abstract: An XQuery access API is described, for providing access to XML data from a data source, using the XQuery language. A requestor can request, from a server, performance of an operation on XML data, wherein request messages and response messages conform to the Simple Object Access Protocol (SOAP). Request and response messages can be transmitted using Hypertext Transfer Protocol (HTTP) or Hypertext Transfer Protocol over Secure Socket Layer (HTTPS). The format of the request and response messages is specified in a definition of a Web service, where the definition conforms to the Web Service Description Language (WSDL).

Abstract: The invention includes a computer readable medium with executable instructions to receive a query based on nested semantic abstractions for corresponding data sources. Data source specific queries are constructed based on the query by executing the query against the nested semantic abstractions. Each data source specific query is associated with an underlying data source described by a nested semantic abstraction. The data source specific queries are executed to produce results and the results are returned.

Abstract: Systems and methods are disclosed that allow for indexing, processing, or both of information from physical media or electronic media, which may be received from a plurality of sources. In embodiments, a document file may be matched using pattern matching methods and may include comparisons with a comparison reference database to improve or accelerate the indexing process. In embodiments, information may be presented to a user as potential matches thereby improving manual indexing processes. In embodiments, one or more additional actions may occur as part of the processing, including without limitation, association additional data with a document file, making observations from the document file, notifying individuals, creating composite messages, and billing events. In an embodiment, data from a document file may be associated with a key word, key phrase, or word frequency value that enables adaptive learning so that unindexed data may be automatically indexed based on user interaction history.

Abstract: A method, apparatus, and article of manufacture for processing a database query. Database queries are submitted with an indication of a selected output format, To process the query, data records are retrieved and formatted according to the selected output format, as well as formatted for additional output formats supported by a given a query application. Once returned, query results may be presented in the selected format. A user may switch the presentation of the query result from the selected format to others, without having to re-execute the database query.

Abstract: A method for identifying multi-media assets from a multi-media collection, and the method implemented at least in part by a data processing system and comprising the steps of: receiving a search query, the search query, or a derivative thereof, including a possessive phrase, wherein the possessive phrase includes a possessor and a possession category; identifying a denoted object referred to by the possessive phrase using a predefined relationship database that establishes social relationships between objects; identifying one or more additional possessors of the denoted object using the predefined relationship database; generating one or more additional possessive phrases for the denoted objects relating the identified additional possessors to the denoted object; and identifying one or more multi-media assets from the multi-media collection containing the denoted object responsive to the one or more additional possessive phrases.

Abstract: A computer program product comprises a computer useable medium. The computer useable medium has a computer readable program such that when the computer readable medium is executed on a computer, the computer is caused to receive a request from a database driver that is compatible with a software application. The request is in a database language format. Further, the computer is caused to parse the request. In addition, the computer is caused to convert the request into an intermediary data format. The computer is also caused to provide the request in the intermediary data format to a common client interface builder that reformats the request into a format that is compatible with a system resource adapter and invokes the system resource adapter with the reformatted request.

Abstract: Methods, systems, and apparatus, including computer program products, in which a first search query in a session is compared to a second search query within the session to determine whether any terms included in the second search query differ from terms in the first search query. If differing search terms are identified in the second search query, the differing search terms can be excluded from bigram analysis with other search terms included in the second query.

Abstract: Techniques are described for processing a query to produce query results, the query specifying at least a first timestamp value. Embodiments receive the query for processing and access a database index containing a plurality of database keys. The database index contains one or more database index keys, each of which includes at least a timestamp value and a time zone value. Embodiments compare the first timestamp value specified in the query with a portion of one the database index keys to locate at least a portion of the query results. More specifically, the compared portion of the database index key excludes the time zone value. The located portion of the query results is then retrieved.

Abstract: Methods for transforming a query to remove redundant tables and eliminate superfluous join operations is provided. The methods provided transform queries to remove redundant tables and anti-joins, semi-joins, and outer-joins. Whether a table is redundant is determined based on a set of criteria which, if fulfilled, indicates that the removal of the table and the anti-join, semi-join, or outer-join operation does not impact query results. The removal of a redundant table from a query also results in the elimination of the anti-join, semi-join, or outer-join operation that references the removed table.

Abstract: Techniques are disclosed for matching an inbound identity record to existing entities. Entity resolution (ER) candidate-building keys are determined for a received identity record. A query is generated from the ER candidate-building keys. When executing the query, a generic key is identified. Execution of the query is aborted upon a condition involving the generic key being satisfied.

Abstract: The different advantageous embodiments provide an apparatus that comprises a number of data storage units, a data extraction tool, a data warehouse, and a data processing system. The data extraction tool is configured to extract data from the number of data storage units. The data warehouse has a number of data files comprising the data extracted from the number of data storage units. The data processing system is configured to process selected data for a number of selected systems from the number of data files.

Abstract: Systems and methods are provided for providing a user with efficient and effective intelligent control of media assets distributed to the user's media devices. The user may control distributed media assets by sending captured images to the media delivery system. Features identified in the captured images are used to select media assets that are likely to be of interest to the user. The selected relevant media assets are distributed to one or more media devices for presentation to the user. The distributed media assets may be intelligently selected from the media assets available through the user's primary media delivery system, or may be supplementary media assets not available through the user's primary media delivery system.

Abstract: In an illustrative embodiment, an apparatus, computer-readable medium, or method may be configured to suggest correct identifiers. Expected identifiers may be created and their frequencies of occurrence may be calculated. Unrecognized identifiers may be detected. First numerical scores indicating that the unrecognized identifiers were provided in place of one or more expected identifiers may be calculated. Second numerical scores indicating that the unrecognized identifiers were intended to include expected identifiers may also be calculated. The second numerical scores may be calculated using the first numerical scores and the frequencies of occurrence of the expected identifiers. The system may select one or more expected identifiers based on the second set of numerical scores.

Abstract: In one exemplary embodiment, a storage medium embodying a program of instructions for performing operations including: storing raw information for primary properties of primary nodes within a primary network; in response to receiving a query, transforming the raw information into transformed information using key(s) and based on the query, the query is in relation to a queried property, the transformed information is transformed data for the queried property, the transformed information represents a surrogate network having surrogate nodes corresponding to a portion of the primary nodes, the transformed information enables performance of operation(s) without specific knowledge of and without revealing the entirety, the transformed information further enables one having the key(s) to relate an output of the operation to the raw information; and generating a solution that relates a transformed query to the transformed information, the transformed query is a transformed representation of the query obtained by us

Abstract: Methods, systems, and apparatus, including computer program products, for generating synthetic queries using seed queries and structural similarity between documents are described. In one aspect, a method includes identifying embedded coding fragments (e.g., HTML tag) from a structured document and a seed query; generating one or more query templates, each query template corresponding to at least one coding fragment, the query template including a generative rule to be used in generating candidate synthetic queries; generating the candidate synthetic queries by applying the query templates to other documents that are hosted on the same web site as the document; identifying terms that match structure of the query templates as candidate synthetic queries; measuring a performance for each of the candidate synthetic queries; and designating as synthetic queries the candidate synthetic queries that have performance measurements exceeding a performance threshold.

Abstract: Methods, systems, and apparatus, including computer program products, for generating or using augmentation queries. In one aspect, augmentation queries are identified from user interactions or are machine generated. The augmentation queries can be stored in an augmentation query data store. When a user submits a search query to a search engine, the terms of the query, and optionally additional information, such as the geographic location from which the query is received or the language of the query, can be used to identify stored augmentation queries and select one or more similar augmentation queries. The selected augmentation queries, in turn, can be used by the search engine perform an augmented search operation.

Abstract: In accordance with the teachings described herein, systems and methods are provided for performing index joins. A database management application may receive an instruction to perform an index join operation between columns in a first table and a second table, wherein the database management application does not have direct access to an index of the first table or the second table for performing the index join operation. A query may be automatically generated by the database management application, wherein the query includes a where clause equality expression that equates an indexed column of the second table with a parameter or updatable constant. The database management application may substitute a value from a row of the first table may for the parameter or updatable constant, and cause the query to be executed on the index of the second table to fetch any one or more rows of the second table that satisfy the where clause by having an index value that matches the substituted value.

Abstract: Some embodiments relate to performing a search for content via the Internet, wherein user input specifying a search query is supplied to a mobile communications device, such as, for example, a smartphone. The mobile communications device separately issues the search query to a plurality of search engines and can receive the results from each search engine and display the results to the user. Thus, the user does not have to separately issue the query to each of the plurality of search engines.

Abstract: A computer-implemented method, computer-implemented system, and a computer program product for answering a database-based query of a computerized database system. The method includes: generating a canonical individual ind? with respect to a role and a concept, for an existential restriction in an ontology used in the computerized database system; converting implicit data in original data into explicit data using the canonical individual ind? and the ontology; and retrieving an answer meeting all query conditions in a query from the original data and the converted explicit data. The computer-implemented system includes: a canonical individual generation unit; a data conversion engine; and a query unit.

Abstract: Data is accessed and updated in a data store at a field granularity. A user query specifies one or more non-unique fields of a record. The query is sent to a data store to retrieve the fields of the record at a field granularity, in satisfaction of the query. The fields of the record can also be modified by transmitting a record ID along with original content, while omitting some of the record data, and by also including the modification to be made.

Abstract: A universal data management interface (UDMI) system includes a processing system generates a visual interface through which a user can access, manage, and manipulate data on plural different types of remote databases. The UDMI connects to multiple standard database management systems and to allow multiple users to access, manage, and manipulate data within each of the multiple standard database management systems. The UDMI also allows multiple virtual databases that reside in a single database to be available as a network service.

Abstract: One embodiment of the present invention is a wizard (e.g., software) for configuring database access middleware for optimal performance. The wizard asks a set of questions. The questions are presented to the user with a navigable UI, and are designed such that the user does not need database expertise to answer them. Based on the user's answers, the wizard generates a set of connect options and values to be used to optimize performance of the user's middleware. Users can use the wizard to determine whether currently selected options or values of a deployed application are optimal, and to determine if other options/values should be used that may improve the performance of the existing application. Also, a prospective customer that is evaluating middleware can use this wizard to tune the middleware for the intended application, thereby allowing that user to better assess how the middleware will perform.

Abstract: A system, method, and computer program product for efficient bulk database queries. A method includes receiving a closure rule and at least one input object, where the closure rule having at least one closure rule clause. The method also includes identifying a first closure rule clause to be evaluated for the input object, and constructing a recursive database query corresponding to the first closure rule clause. The method includes querying a database using the recursive database query, and receiving and storing results from the recursive database query in the data processing system.

Abstract: A module provides an interface between a multi-tenant database and a non-tenant-specific application instance such that the application instance sends data access commands to the module as if it is communicating with a single-tenant database. The module translates the non-tenant-specific data access command from the non-tenant-aware application into a multi-tenant data access command, as needed, without needing to alter the non-tenant specific application instance in any way. In this manner, a single-tenant application could be used by multiple tenants in a multi-tenant environment.

Abstract: A system and method for abstracting objects in a virtual universe (VU) deployment is provided. The system and method abstracts VU objects for editing in a common abstraction utility and for deploying to one or more VU grids containing one or more VU architectures and/or platforms (servers). The method can be implemented in a computer infrastructure having programming instructions operable to: obtain an object associated with a first virtual universe server; translate the object with syntax specific to at least a second virtual universe server, the syntax being different than that used with the first virtual universe server; and deploy the translated object to the second virtual universe server.

Abstract: One embodiment of the present invention provides a system that that uses geographic data to identify correlated geographic synonyms in search queries. A correlated geographic synonym occurs when two terms that are possible synonyms should not be considered synonyms because they are associated with related geographic context. During operation, the system receives a term and a possible synonym for the term. The system then determines whether the term and the possible synonym are both present in a geographic data set. If so, the system uses the geographic data set to determine whether the possible synonym is a correlated geographic synonym for the term.

Abstract: A method, system, and computer program product for implementing automated worklists are provided. The method includes generating a worklist, which further includes retrieving a worklist template corresponding to the worklist and, via a first query, selecting a listing of members and attributes to be populated in the worklist, the attributes include a status indicator of an action item specified for each of the members of the worklist. The worklist generation also includes building a worklist member table with results of the first query and, via a second query, and using attributes of the worklist member table, identifying up-to-date values of one or more worklist member attributes, and outputting results of the second query to the worklist. The method also includes presenting the worklist to a corresponding assignee. For each of the members in the worklist, the status indicator is editable to update a status of the member.

Abstract: A method and system for coping with slice and dice operations in data warehouses is disclosed. An external approach may be utilized, creating queries using structured query language on a computer. An algorithm may be used to rewrite the queries. The resulting predicates may be joined to dimension tables corresponding to fact tables. An internal approach may be utilized, using aggregation functions with early aggregation for creating the queries. The results of the slice and dice operations may be outputted to a user on a computer monitor.

Abstract: Embodiments of the invention provide techniques for temporarily disabling conditions in abstract queries. In one embodiment, a query interface is configured to present an abstract query, and to allow a user to select conditions of the abstract query to be temporarily disabled. By executing an abstract query having disabled conditions, the user may be able to determine the effect of individual changes to the abstract query without having to re-compose the abstract query after each change. The conditions to be disabled may be selected individually, by field, or by value. Each disabled element may be displayed with a visual indicator communicating that it is disabled. The user may then select specific disabled conditions to be re-enabled.

Abstract: Various techniques are disclosed to permit searching several locations with one query. Locations may include web search sites, subscription-only sites, line of business applications, or other searchable data repositories. The query may be modified to provide the required format or other information for each location to perform a search.

Abstract: In some implementations, a computer-implemented method includes receiving a search query, at an information provider, from a mobile device; generating a plurality of search results that are responsive to the search query and directed to corresponding content providers that are external to the information provider; identifying one or more search results from the plurality of search results that are directed to partners of the information provider; and providing, to the mobile device, the plurality of search results, wherein the one or more search results directed to partners of the information provider include location information that is stored in a profile maintained by the information provider and associated with the mobile device, wherein the location information is passed to the corresponding partners upon selection of the one or more search results.

Abstract: A programmable search engine system is programmable by a variety of different entities, such as client devices and vertical content sites to customize search results for users. Context files store instructions for controlling the operations of the programmable search engine. The context files are processed by various context processors, which use the instructions therein to provide various pre-processing, post-processing, and search engine control operations.

Abstract: A value is computed for a feature in an instance of query content and compared to a threshold value. Based on the comparison, first and second bits in a hash value, which is derived from the query content feature, are determined. Conditional probability values are computed for the likelihood that quantized values of the first and the second bits equal corresponding quantized bit values of a target or reference feature value. The conditional probabilities are compared and a relative strength determined for the first and second bits, which directly corresponds to the conditional probability. The bit with the lowest bit strength is selected as the weakbit. The value of the weakbit is toggled to generate a variation of the query hash value. The query may be extended using the query hash value variation.

Abstract: Conceptually related term identification technique embodiments are presented that involve identifying in the results of a search query, terms that are conceptually related to the search query terms. In one general embodiment, this is accomplished by first inputting the terms employed in a search query and the results of the search. Word tokens found in the search query terms are then identified, as are potential phrases that can be made from the identified word tokens. Conceptually related words and phrases are then identified in the search query results. These words and phrases correspond to the previously identified word tokens and potential phrases. The search query results are presented to a user on a display device in such a manner as to visually distinguish the conceptually related words and phrases from other words and phrases in the search query results.

Abstract: Computer-readable media, computer systems, and computing methods are provided for implicitly discovering applications that have a corresponding location. Initially, an application manifest is constructed that maintains a mapping between apps and their respective geographic boundaries. In operation, upon detecting a location signal being transmitted from a mobile device, the location signal is employed to identify a set of valid applications. Generally, the location signal represents location-based information entered to or received from the mobile device. Identifying the set of valid applications involves comparing the location signal against the application manifest and, based on the comparison, designating those apps that are mapped to geographic boundaries that meet the location signal as the set of valid applications.

Abstract: Infrastructure for capturing and correlating application context and database context for tuning, profiling and debugging tasks. The application context can include events such as data access events, and the database context can include events such as database server events. The events can be obtained from server tracing, data access layer tracing, and/or application tracing and written into respective log files. A data access event can indicate that an application consumed a row from a result set returned from a DBMS query. A post-processing step can correlate the application and database contexts by tokenizing strings and computing intersections between the tokenized strings. A tool inside a development environment may also suggest a query hint for the database or a data access API for the application based on the correlated context.

Abstract: Name retrieval methods and name retrieval apparatuses that detect retrieval-target names that are representable as character strings including a ligature taking arbitrary property of a ligature into consideration in both a case where the ligature is input, and a case where the series of characters corresponding to the ligature is input, are provided so that convenience and reliability of name retrieval are improved. When a specific ligature is input, the specific ligature is converted into the series of characters corresponding to the specific ligature in accordance with the corresponding relationship TB stored in a storage device M, and specific retrieval-target names that include the series of characters obtained by the conversion in an input position of the specific ligature and an arrangement position of the series of characters corresponding to the number of coupled characters are retrieved from a database DB by character-string matching.

Abstract: An apparatus comprises data storage coupled to one or more processors and a plurality of data elements contained in a database structure and organized in a hierarchical data tree, and instructions that perform receiving a network location identifier from a client computer, wherein the network location identifier comprises at least a portion that specifies a first view of the data tree; creating, using the portion of the network location identifier, a relational database query and submitting the query to a relational database; receiving from the relational database a set of data elements that is associated with the first view; generating a first electronic document comprising the set of data elements, including generating transformative links to other network location identifiers corresponding to performing actions on nodes in the data tree; and providing the first electronic document to the client computer.

Abstract: The present invention relates to systems and methods for customizing search engine (CSE) behavior. In an embodiment of the present invention, a system customizes a query search of a plurality of search engines. The system includes a search executor configured to receive a search specification having a query modification description, a results modification description, and a specification of sections. The specification of sections includes a first section identifying a first search engine in the plurality of search engines and a second section identifying a second search engine different from the first search engine in the plurality of search engines. The specification of sections also includes a connecting section coupled to the first section and the second section. The connecting section has an associated condition controlling results combined from the first and second sections.

Abstract: A search middleware may be used to receive search requests regarding a software incident associated with a software application. The search requests may be populated with attribute values determined based on context data associated with the software application and collected in association with the software incident. The search requests may be dispatched to a subset of a plurality of solution repositories, even if the solution repositories have different interfaces and/or search technologies. The resulting solution documents retrieved from the solution repositories may be compiled for presentation on a solution search interface.

Abstract: A keyword may be expanded into related words, such as for use in information retrieval. The terms comprising words and/or phrases of a large number of documents (e.g., web pages) are processed into a graph data structure, in which the terms are represented as nodes and edges represent the relationships between the nodes, with weights for each edge representing the relevance of the relationship. The graph may be built by selecting each term of a document and considering the terms within a certain number of words to be associated with the selected term; for each such association the weight indicative of the relevance is increased. When the graph is accessed with a keyword, the edges from that keyword's node and their respective weights indicate which other nodes are most relevant to the keyword, thereby providing the corresponding expanded terms.

Abstract: Techniques are disclosed for optimizing queries to hierarchically structured data. For example, a method for processing a query directed to data having a hierarchical structure with a plurality of data nodes comprises the following steps. One or more structural attributes describing the hierarchical structure of the data are identified. The query is partitioned into two or more query partitions using at least one of the one or more identified structural attributes. A parallel execution plan is determined for the query by splitting into components one or more of: the query into at least two of the query partitions; and the hierarchical structure of the data. The split components are executed in parallel on different computer processes according to the parallel execution plan.

Abstract: Embodiments of the invention provide techniques for temporarily disabling conditions in abstract queries. In one embodiment, a query interface is configured to present an abstract query, and to allow a user to select conditions of the abstract query to be temporarily disabled. By executing an abstract query having disabled conditions, the user may be able to determine the effect of individual changes to the abstract query without having to re-compose the abstract query after each change. The conditions to be disabled may be selected individually, by field, or by value. Each disabled element may be displayed with a visual indicator communicating that it is disabled. The user may then select specific disabled conditions to be re-enabled.

Abstract: A high precision search system and method receives a full-text search request from a user and processes the full-text search request to determine the meanings of key words within the search request. The high precision search system creates a graphical representation of the search request based on the key words in the search request and the frequency with which they appear. The high precision search system accepts direct user input for modifying the graphical profile. The high precision search system also provides suggestions for adding new concepts and entities to the graphical profile and improving the search results. The system offers an extreme precision option wherein paragraphs are extracted from selected documents that match the search profile.

Abstract: An XML representation of the metadata for objects in a database system. The XML representation is called SXML. The SXML representations of two objects that belong to the same class of objects may be compared to produce a difference representation that shows the differences between the objects. Database commands that will create or alter objects may be produced from the difference representation, as well as an XML representation of the database commands. In addition to being comparable, SXML representations have the characteristics that a given property of the metadata is expressed in only one way in the representation, that SXML does not describe properties that belong only to particular instances of the object described by the metadata, that SXML describes only properties that the user can specify when creating an object, and that SXML is easy for humans to read, understand, and write.

Abstract: A system is disclosed that allows users of computing devices to control the copying of business information between computing systems and various computing environments. The system includes a method for accessing at least one data element from a source database of a source system. The at least one data element may represent a delta change in data existing in a first collection of data stored in the source database. The method includes copying the at least one data element to an export data file and transporting the export data file to a target system. Once transported, the method further includes displaying a user interface on the target system that identifies ones of the at least one data elements that exist in a second collection of data stored in the target database, prompting user selection of desired ones of the at least one data element to be copied in the target database, and copying selected one of the at least one data element to the target database in response to the prompt.

Abstract: A computer-implemented method for collaborative knowledge management, the method comprises the steps of: (a) providing an interface for users to create or edit pages of a collaborative knowledge base, to add semantic annotations to the pages, and to define dynamic data on the pages; wherein ontological statements are created for the semantic annotations to form part of an ontology; and the dynamic data is defined using a query against the ontology and a mathematical operation on a result of the query; and (h) when a page with dynamic data is accessed, dynamically performing the query and the mathematical operation, and presenting the page with a result of the query or a result of the mathematical operation, or both, in graphical form.

Abstract: A questionnaire network in which a mobile device is used by user to create questionnaires and send it to other recipients. The questionnaire is created by user of mobile device using audio inputs for a questionnaire preamble and question preambles. A server in the network incorporates other generic portions of the questionnaire. Thus, a user can make adhoc questionnaires, send them to recipients and receive the results.

Abstract: A computer-implemented method for facilitating placement of health care order entry is provided. The method includes receiving input indicative of a desired healthcare order. The order has certain terms therein that are normalized. The method also finds possible order matches for the normalized terms, and calculates a rough score for the possible order matches. The method refines the rough score with a rough score adjustment, and then ranks the found possible order matches from the most-likely to match the desired order to the least-likely based upon the refined rough score. These possible order matches can then be displayed to the user for selection.