Abstract: A system and method allows for dynamic, parameterized linking of database views or tables. The database tables are related in a parent-dependent relationship, with dependent tables being linked to parent tables through a parameter. When a new record in the parent table is scrolled to, dependent tables automatically run queries and return records with matching parameters. The parameters include field values. Several table views may be combined in a single database table set. Multiple dependent tables may be linked to an individual parent table in a parallel manner. Dependent tables may also be cascaded through intermediate parent tables, each table in the cascade acting as a dependent to its parent and acting as a parent table to its dependent table(s). Database table sets may be saved and may be transmitted, for example via email.

Abstract: Methods and systems for incrementally selecting and providing relevant search engines in response to a user query. A method of incrementally selecting and providing relevant search engines is based in part on identifying a set of search engines associated with corresponding metadata, receiving a partial search query entered by the user of a device, inferring after each user keypress a set of potential full queries intended by the user, using the potential full queries and the search engine metadata to identify a set of relevant search engines, and for each of these search engines, providing a direct link to launch a relevant query in the search engine. The user input may be either ambiguous, or erroneous, and may be entered using an input-constrained device.

Abstract: A system and method for extracting content from unstructured sources is disclosed. The method includes analyzing web pages of a website, storing text and image data for each web page of the website, extracting a plurality of entities from the web page data, scoring each entity of the plurality of entities to provide an overall score for each entity, and defining a product based on the plurality of entities and the overall score for each entity.

Abstract: Within a document collaboration system, such as a wiki application, a logging component operates in association with a server. The logging component automatically creates and maintains a log of interactions between the server and users of the document collaboration system. The content of the log has a predictable format. In one embodiment, an analysis component identifies, from the log, entries associated with a failed search for a document in the collaboration system database. The terms not represented in the database are identified from the failed search entry. In this manner, statistics related to frequently unsuccessful search terms are generated and utilized as a basis for identifying opportunities for effective expansion of the content of the collaboration application.

Abstract: A method and system for utilizing a column function for a relational database in a structure query language (SQL) environment is disclosed. The column function is capable of performing an operation on an indeterminate number of entries. The relational database utilizes data including a plurality of entries capable of being organized into at least one column and at least one row. The method and system include allowing a user to specify the at least one row as an argument for a generalized scalar function and simulating a column environment for the at least one row using the generalized scalar function to allow the at least one row to be provided to the column function as though the at least one row was a column. The method and system also include performing the column function on the at least one row to provide at least one output.

Abstract: Systems and methods are provided for automated employee resource delivery in a variety of situations that may commonly arise in modern large company settings. Employee identification data may be identified, and a subset of such data that is required for release of a particular resource may be identified. An automatic notification may be generated for the resource owner, where the automatic notification comprises the required subset of employee identification data. This approach is combined with one or more techniques for ascertaining the resources an employee will require and updating information regarding the resources employees are using.

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 system and method to facilitate optimization of targeted advertisements based on user profile information are described. A set of event keywords associated with an event or action performed by the user or an agent of the user is identified in a data storage module. User profile information, if available, is further retrieved from the data storage module. A set of profile keywords is further identified from the retrieved user profile information and the set of profile keywords is compared to the set of event keywords based on predetermined business rules to determine a set of resulting keywords. Advertising information related to the set of resulting keywords is further retrieved from an advertising storage module.

Abstract: In general, the invention relates to supporting multiple different character encodings in the same file system. In one embodiment, a method is provided for filename lookup that supports multiple character encodings. The method comprises storing filename data in a first character encoding into an indexed data structure. The method further comprises receiving filename data in a second encoding. The method also comprises looking up filename data in the indexed data structure using the second encoding.

Abstract: Systems and methods for performing a data search through a search query is disclosed. The method includes receiving the search query and parsing the search query to retrieve a search term. The search term includes a plurality of words. In the search term, a first combination of two or more of the plurality of words and a second combination of two or more of the plurality of words are indentified. The first combination and the second combination include a common term. The first combination ends with the common term and the second combination begins with the common term. The method further includes retrieving synonyms for the first combination and the second combination exist in a synonym storage and the search query is then modified to include the first combination in a logical OR relationship with the synonyms of the first combination and the second combination in a logical OR relationship with the synonyms of the second combination. The modified search query is executed against a data store.

Abstract: A system and method is disclosed for determining intervals of a space filling curve in a query box. The method includes the operation of providing a range query-box contained within a data set, wherein the data set has a plurality of elements in N dimensions. A space filling curve is applied to the data set. The space filling curve contacts each of the elements in the N dimensions. The space filling curve is also applied to a range-query box contained within the data set. An entry point of the space filling curve into the query box is determined. A first endpoint box is formed to cover an hquad of the space filling curve at the entry point that includes P×P elements, with a first value of P selected as one. The value of P is increased to expand the endpoint box around a next larger hquad of the space filling curve, until a size of the endpoint box is maximized without exiting the range-query box. The interval of the space filling curve in the endpoint box can then be determined.

Abstract: A system determines whether a received search query includes an entity name, determines whether to rewrite the received search query based on information relating to prior searches involving the entity name, and rewrites the received search query when it is determined that the received search query should be rewritten. The system further determines whether to provide a suggestion of rewriting the received search query, as a rewriting suggestion, based on information relating to prior searches involving the entity name when it is determined that the received search query should not be rewritten. The system also generates the rewriting suggestion when it is determined that the rewriting suggestion should be provided. The system performs a search based on one of the received search query and the rewritten search query to obtain search results, presents the search results, and presents the rewriting suggestion when it is determined that the rewriting suggestion should be provided.

Abstract: This invention is directed at providing a technique for implementing higher-speed search processing for a binary structured document. A search query conversion means converts a search query for a structured document by converting each node building the search query into a corresponding index by using a vocabulary list. A document analysis means specifies an index corresponding to each node building the structured document by using the vocabulary list. A search query evaluation means searches for part of the structured document that corresponds to the converted search query, by using each index described in the converted search query and the index corresponding to each node that is specified by the document analysis means.

Abstract: Systems, methods, and other embodiments associated with graph query adaptation are described. One example method includes generating an adapted topological query from a base topological query. The adapted topological query may be generated upon detecting a pre-specified sub-graph in the base topological query. The example method may also include executing the adapted topological query on a stored graph to generate a query result.

Abstract: Systems and methods are described that calculate the interestingness of a set of one or more records in a database, either absolutely (i.e., compared to an overall collection of records) or relative to some other set of records. In one embodiment, the measure is a relative entropy value that has been normalized. Various applications of the measure are described in the context of an information retrieval system. These applications include, for example, guiding query interpretation, guiding view selection and summarization, intelligent ranges, event detection, concept triggers and interpreting user actions, hierarchy discovery, and adaptive data mining.

Abstract: A data search and retrieval system that, in response to a search query, applies a model to search results to generate information to be returned to a user. A user may modify the model via a set of controls displayed to the user. The modified model may then be applied to search results to generate information in compliance with the modified model. Modified models may be stored locally on a client system or stored in the search system and made available to other users so that the modified models can be applied to subsequent requests for information. The modified models and the results of a search may be stored on a client machine such that, as the model is modified, new information may be generated based on the original search, reducing communication bandwidth, which can improve the speed and cost of providing user interaction with data in a mobile environment.

Abstract: Methods, systems, and computer program products are provided for performing structured parallel data intensive computations. A SQL-FCF framework that defines a SQL construct based interface for performing the computations is provided. The computations within an application are coded as table valued functions (TVFs). Data for the application is partitioned into data partitions to co-locate and load balance the data partitions and corresponding computations. The TVFs are invoked and applied to corresponding ones of the data partitions in a structured order defined by function control forms (FCF).

Abstract: An improved system and method for classifying tags of content using a hyperlinked corpus of classified web pages is provided. An anchor text index may be searched to find anchor texts that may match text of the tag, documents referenced by the matching anchor texts may be found, and the documents referenced by the matching anchor texts may be grouped to disambiguate multiple classifications that result from matching the anchor texts with the categories of the reference documents. To resolve ambiguity between multiple classifications, weighted classifications may be used where each document may be assigned a positive weight for a mapping to a category to indicate the confidence of the classification of the document to the category. The classification for the grouping of the documents referenced by the matching anchor texts with greatest frequency may be selected and output as the classification for the tag.

Abstract: A user query has values for attributes that specify features of a desired item is received and processed in a computer system in a network. A database is searched for an item having attribute values that satisfy at least a subset of the values for attributes from the user query. Once an item is found in the database, a location where the item will be supplied along with a set of suppliers for the item in proximity to the location is determined.

Abstract: A database intrusion detection system (DIDS) automatically trains itself to account for changes to the database. The DIDS monitors upstream queries sent to the database and downstream data provided in response to the queries. The DIDS classifies an upstream query as legitimate or anomalous. If the query is anomalous, the DIDS determines whether the anomaly resulted from a change in the database by performing one or more tests. One test determines whether the query references new fields or tables. Another test determines the frequency at which the query is received, and/or whether the query is received from multiple sources. A third test determines whether the query accesses sensitive information. Together, the results of these tests describe whether the query should be classified as anomalous or legitimate.

Abstract: A word is split into one or more first substrings. A morpheme is applied to the one or more first substrings to create one or more second substrings. The one or more first and second substrings are selected as one or more splittings, and a score is generated for each of the one or more splittings. One of the one or more splittings with a score higher than the other one or more splittings is selected as a keyword.

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 usable program product for applying a security policy as a query predicate. A query is received. The query is a request for data directed to a data repository executing in a data processing system. The security policy is identified, the security policy being a security policy applicable to the query. A predicate that corresponds to the security policy is determined. The query is modified to include the predicate. The modified query is sent to the data repository.

Abstract: A method and system for expanding attribute profiles are presented in which primary attributes from one or more attribute profiles are used to derive secondary attributes which are added to the respective attribute profiles to generate expanded attribute profiles. The expanded attribute profiles are generated to increase the strength of association of a query attribute with one or more attribute profiles associated with query-attribute-positive individuals.

Abstract: The present inventor devised, among other things, an exemplary information retrieval system that promises to reduce the execution of overly broad queries. One exemplary system detects overly broad queries and presents users one or more potentially relevant portions of a hierarchical subject matter classification system, instead of executing the query against the targeted database. The system also presents users the option of accessing one or more relevant documents to the query via an interface for the classification system.

Abstract: A method and system are provided for dynamically relating tables in a federated database based upon a data manipulation language in a query transaction. After the start of a transaction has been detected, a data manipulation language from the transaction is extracted and evaluated to determine the table(s) and column(s) referenced by the transaction language. The data relation output unit determines the relationship(s) between the extracted table(s) and column(s) in real-time and conveys this information through a visual display.

Abstract: A rendering engine dynamically renders content that includes query expressions. The query expressions are resolved by extracting data from a data source. The resolutions to the queries are rendered with the content, according to rules associated with the content.

Abstract: A stemming framework for combining stemming algorithms together in a multilingual environment to obtain improved stemming behavior over any individual stemming algorithm, together with a new language independent stemming algorithm based on shortest path techniques. The stemmer essentially treats the stemming problem as a simple instance of the shortest path problem where the cost for each path can be computed from its word component and its number of characters. The goal of the stemmer is to find the shortest path to construct the entire word. The stemmer uses dynamic dictionaries constructed as lexical analyzer state transition tables to recognize the various allowable word parts for any given language in order to obtain maximum speed. The stemming framework provides the necessary logic to combine multiple stemmers in parallel and to merge their results to obtain the best behavior. Mapping dictionaries handle irregular plurals, tense, phrase mapping and proper name recognition.

Abstract: Aspects of the invention relate to creating a snapshot of a file system on an OAS system. A snapshot of a file system is an image of a file system at a particular point in time. A snapshot of a file system may be used to restore the file system to its state at the time of creation of the snapshot in, for example, situations where the file system has become corrupted.

Abstract: A method for normalizing query words in web search includes populating a dictionary with join and split candidates and corresponding joined and split words from an aggregate of query logs; determining a confidence score for join and split candidates, a highest confidence score for each being characterized in the dictionary as must-join and must-split, respectively; accepting queries with words amenable to being split or joined, or amenable to an addition or deletion of a hyphen or an apostrophe; generating, based on the accepted queries, split candidates obtained from the dictionary, and candidates of join, hyphen, or apostrophe algorithmically; and submitting to a search engine the generated possible candidates characterized as must-join or must-split in the dictionary, to improve search results returned in response to the queries; applying a language dictionary to generated candidates not characterized as must-split or must-join, to rank them, and submitting those highest-ranked to the search engine.

Abstract: The system includes a computing device, a receiving module, a storage device, a build-out module and a leveraging module. The computing device includes a processor. The receiving module is communicably connected to the processor and is configured to receive personal information. The storage device is communicably connected to the processor and is configured to store the received personal information. The build out module is communicably connected to the processor and is configured to automatically retrieve additional personal information based on the received personal information. The leverage module is communicably connected to the processor and is configured to utilize the stored information to automatically perform an organizational task historically performed by a person.

Abstract: A diagnostic device receives a first set of search criteria related to a problem with a vehicle, and the diagnostic device stores the first set of search criteria. In response to receiving a second set of search criteria, the diagnostic device can compare it with the first set of search criteria in order to identify a pattern between the two sets of search criteria. The diagnostic device can then alter the second set of search criteria based on the pattern between the two sets of search criteria.

Abstract: A computer readable storage medium comprises executable instructions to receive a query referencing a set of members of an OLAP hierarchy. The query is parsed into a syntax tree. Changes to the OLAP hierarchy metadata are received. The syntax tree is refined in response to the changes. The query is evaluated to return results that are independent of the changes to the OLAP hierarchy metadata.

Abstract: Systems and methods for injecting noise into secure function evaluation to protect the privacy of the participants and for computing a collective noisy result by combining results and noise generated based on input from the participants. When implemented using distributed computing devices, each device may have access to a subset of data. A query may be distributed to the devices, and each device applies the query to its own subset of data to obtain a subset result. Each device then divides its subset result into one or more shares, and the shares are combined to form a collective result. The devices may also generate random bits. The random bits may be combined and used to generate noise. The collective result can be combined with the noise to obtain a collective noisy result.

Abstract: Systems and methods are presented for retrieving records from a database and presenting them to a user through a timely and efficient query restricting process. The query request is then modified through the use of a determined partitioning field and a modified query which partitions the field relative to a partitioning value. Records are retrieved from the database. A small set of records is presented to the user, as is a prompt to retrieve more records. An application which receives query requests determines: restricting fields, partition size and whether or not the partition is within a predetermined range. The application returns a data set and receives requests for more records. These systems and methods provide a storage efficient solution that is particularly useful for maintaining a time efficient user response for a dynamic database.

Abstract: A community search system may utilize the results of previous queries from community members and user feedback associated with those results to provide results for subsequent, similar queries from within the same community. Thus, by modifying and combining query results based, in part, on user feedback regarding previous results for similar queries, the trial and error of the many may improve the results for an individual. Users may be grouped into communities whose members are associated by common interests or characteristics. Feedback from one community member may be used to modify the query results for other community members. By analyzing user feedback with the community regarding query results, negative, incorrect or unnecessary results may be omitted or removed from subsequent results for similar queries.

Abstract: Instead of adding resources into a folder by specifying a list of identifiers, client applications add resources to a folder by specifying a search query that matches the resources to be added. The virtual folder is, therefore, a collection of search queries rather than a collection of resource identifiers. This allows the data archive systems to easily store folder information in a database. A client application can then search by specifying the folder as its search criteria to list all content associated with the folder. Additionally, to ensure that the list of results associated with a particular query does not change after the query is added into a folder, the data archive system also captures generation information associated with the particular query (i.e., the iteration of the search indexes at the time the query is received) and stores the generation information with the query as part of the folder.

Abstract: Techniques for object relational mapping in database technologies are described herein. According to one embodiment, in response to a query statement for accessing a relational database, a syntax tree is generated to represent semantic information of the query statement, where the query statement includes a wildcard parameter and is implemented as an object of a SQL. A data type of the wildcard parameter is predicted based on the semantic information obtained from the syntax tree in view of a structure representing the syntax tree. The predicted data type of the wildcard parameter is used to access the corresponding entry of the relational database. Other methods and apparatuses are also described.

Abstract: A facility for ranking in a result set is described. The facility establishes a system of ratings for combinations of a web page with the query term that reflect the level of relevance of the web page to the query term. In response to each of a number of content interactions performed by users, each with respect to a result corresponding to a web page included in a result set that was generated in response to a query comprising a set of one or more query terms, the facility adjusts a rating score for each combination of the web page and a query term among the set of query terms.

Abstract: A method, performed in a character entry system involves computing contextual associations between multiple character strings based upon occurrence of character strings relative to each other in documents present in the system, wherein the computing contextual associations involves i) identifying pertinent documents present in the system, ii) creating a list of character strings contained within documents in the system; and iii) creating an interrelationship between the character strings to contents of the system; in response to the user inputting a specified threshold of individual characters, identifying at least one selectable character string from among the character strings used in creating the computed contextual associations that can complete the incomplete input character string in context; providing the identified at least one selectable character string to a user for selection; and receiving, in the system, the user's selection and completing the incomplete input character string based upon the sele

Abstract: An apparatus, system, and method are disclosed for supporting storage functions using an embedded database management system. The apparatus includes a disk controller configured to receive input/output (I/O) requests from a host, an embedded database management system module, and a conversion module configured to translate the input/output requests into database requests and communicate the database requests with the embedded database management system module. The system may include the apparatus, a network, and a plurality of storage devices coupled to the network and configured to store data. The method includes receiving input/output (I/O) requests from a host, translating the input/output requests into database requests, communicating the database requests with an embedded database management system module, and executing the database requests.

Abstract: A method and apparatus is disclosed herein for constructing a complex database query. In one embodiment, the method comprises receiving a selection of meta data indicative of searchable data values stored in two or more database tables. The method also includes constructing a complex database query to search the two or more database tables based on the received selection of meta data.

Abstract: A system and method for enabling a second database instance to more quickly process a request to execute a database statement that has previously been executed by a first database instance is described. In one embodiment, the method involves sending the database statement from the first database instance to the second database instance, and generating by the second database instance one or more structures needed to prepare the statement for execution, such as a parse tree and an execution plan for the statement. If at some point in the future, the second database instance receives a request to execute the same statement, the above structures can be used for execution, thereby eliminating the need for one or more potentially time-consuming operations, such as generation of a parse tree or execution plan for the statement.

Abstract: The present invention provides a computer method and system for querying or searching for at least one data file corresponding to a query definition. A first query is received which may provide a query definition that may be used as a scope of search for a second query. Modifications of the scope of search based on modification of the first query may be automatically reflected in the scope of search for the second query. The scope of search for the second query may further be a combination of a plurality of scopes based on a plurality of user-defined queries.

Abstract: A method includes receiving first parameters and second parameters for a comparison of a first multilevel bill of material and a second multilevel bill of material. Internal items based on the first parameters are compared to determine differences between the internal items in the first multilevel bill of material and the second multilevel bill of material. If an internal item matches in the first multilevel bill of material and the second multilevel bill of material, associations for the matched internal item are compared based on the second parameters to determine differences between the associations in the first multilevel bill of material and the second multilevel bill of material. A report is generated showing a result of the comparing of the internal items and the comparing of the associations, wherein the report shows unmatched internal items and unmatched associations for matched first items. The report can then be displayed.

Abstract: In an embodiment of the invention, analytical data may be extracted from a business intelligence (BI) system on criteria specified in metadata of a business intelligence query. Once the data is extracted from the BI system, the extracted content may be provided in the context of semantic identifiers. In an embodiment, the semantic identifiers may provide a description of the extracted content associated with the identifier. In one embodiment, the semantic identifiers may be obtained from the criteria specified in the query. In another embodiment, the semantic identifiers may be defined in and obtained from a separate enterprise service repository. In an embodiment, a proposed mapping between query elements and semantic identifiers may be suggested by a processor.

Abstract: Reusing assets for packaged software application configurations may include defining one or more query criteria based on information associated with a project, querying an asset repository stored in a storage device using the one or more query criteria, receiving a list of one or more assets from the asset repository in response to the querying, and using the one or more assets on the list to compose a document defining deployment procedures associated with deploying a packaged software application.

Abstract: A system, method, and computer program product are provided for invoking an operation to change a current data row of a table in a local database. As a result, a pending change data row is inserted in the table, distinguished by a primary key comprising a common key value and a pending change indicator. The pending change is then submitted for synchronization.

Abstract: Aspects of the present disclosure are directed to methods and systems for protecting sensitive data in a hosted service system. The system includes a host system and the host system includes a key management system (KMS) and a metadata service system (MSS). The KMS and the MSS are communicatively coupled to each other. The system further includes a database management system (DBMS) having a database, a query pre-parser, and a results handler. The query pre-parser and the results handler are communicatively coupled to the KMS and the MSS, and the system also includes a processing application adapted to process at least some data received from a tenant system.

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.