Abstract: The present disclosure pertains to systems and methods for providing search results. A database server may include both a database and a search engine. The database server can receive a search request from an application of a remote computer. The search request can include one or more search terms and permission information. The database server can determine adapting information using the permission information. The database server can provide a search call based on the search request and the adapting information to the search engine. The search engine can determine one or more search statements for the search call. The search engine can execute the one or more search statements on one or more stored search models to obtain database results reflecting the permission information. The database server can provide search results based on the database results to the application of the remote computer.

Abstract: The present disclosure pertains to systems and methods for providing search results. A database server can include both a database and a search engine. The database server can receive, from a software service server, storage metadata indicating a plurality of tables of the database and fields of each of the plurality of tables. The database can generate a metadata search index, including tables and fields populated based on the storage metadata, and store it on the database. The database server may receive a search request including one or more search terms from a query-building application of a remote computer. The search engine can determine search statements based on the search request and execute the search statements on a view of the stored metadata search index to obtain index search results. Metadata search results based on the index search results can be provided to the query-building application.

Abstract: The present disclosure pertains to systems and methods for providing search results. A database server may include both a database and a search engine. The database server can receive a search request from an application of a remote computer. The search request can include one or more search terms and permission information. The database server can determine adapting information using the permission information. The database server can provide a search call based on the search request and the adapting information to the search engine. The search engine can determine one or more search statements for the search call. The search engine can execute the one or more search statements on one or more stored search models to obtain database results reflecting the permission information. The database server can provide search results based on the database results to the application of the remote computer.

Abstract: The present disclosure pertains to systems and methods for providing search results. A database server can include both a database and a search engine. The database server can receive, from a software service server, storage metadata indicating a plurality of tables of the database and fields of each of the plurality of tables. The database can generate a metadata search index, including tables and fields populated based on the storage metadata, and store it on the database. The database server may receive a search request including one or more search terms from a query-building application of a remote computer. The search engine can determine search statements based on the search request and execute the search statements on a view of the stored metadata search index to obtain index search results. Metadata search results based on the index search results can be provided to the query-building application.

Abstract: A system includes receiving a substring to be searched and determining one or more N-grams associated with the received substring. A lookup of each of the one or more N-grams is performed using an N-gram index. A set of tokens associated with each of the one or more N-grams is calculated and a determination is made if the substring exits in the calculated set of tokens. The results of the determination if the substring exits in the set of tokens are outputted.

Abstract: A system includes receiving a substring to be searched and determining one or more N-grams associated with the received substring. A lookup of each of the one or more N-grams is performed using an N-gram index. A set of tokens associated with each of the one or more N-grams is calculated and a determination is made if the substring exits in the calculated set of tokens. The results of the determination if the substring exits in the set of tokens are outputted.

Abstract: A system includes reception of an instruction to access a column of a database table, determination that the column is not associated with the schema of the database table, determination of whether the schema of the database table is flexible or static, returning, if it is determined that the schema of the database table is static, of an error in response to the instruction, and, if it is determined that the schema of the database table is flexible, not returning an error in response to the instruction.

Abstract: An object matching system comprises a plurality of disparate databases comprising data objects and a master data server. The master data server comprises a computer programmed to provide a plurality of adapters configured to connect to said plurality of disparate databases, a matching module configured to compare data objects provided by said plurality of adapters through use of an object matching rule to determine at least two matching data objects, and a data integrator configured to merge said at least two matching data objects to produce a master data object.

Abstract: A system includes reception of an instruction to access a column of a database table, determination that the column is not associated with the schema of the database table, determination of whether the schema of the database table is flexible or static, returning, if it is determined that the schema of the database table is static, of an error in response to the instruction, and, if it is determined that the schema of the database table is flexible, not returning an error in response to the instruction.

Abstract: Determining the association between data objects may be accomplished using any of a variety of systems and techniques. In particular implementations, a system and technique may have the ability to receive a group of data objects and execute a matching algorithm to determine duplicate data object propositions between the data objects. The system and technique also may have the ability determine whether a data object is a potential duplicate data object and, if a data object is a potential duplicate data object, determine whether the data object is a duplicate data object by examining duplicate data object propositions of a plurality of data objects that are associated with the data object through duplicate data object propositions.

Abstract: Example systems and methods of integrating text analysis and search functionality are presented. In one example, a plurality of documents, as well as search information comprising search terms for a search category, are accessed. Each of the documents that include at least one of the search terms is identified. The identified documents are analyzed to determine those of the identified documents that are logically associated with the search category. Each of the documents determined to be logically associated with the search category are tagged with the search category.

Abstract: Example systems and methods of integrating data tags with their associated object data are presented. In one implementation, a data object employed in a first computer application is accessed. Examples of the data object include, but are not limited to, structured data and unstructured data. Tagging data that is descriptive of the first data object is also accessed. The tagging data is stored in at least one of the first data object and a separate data object linked with the first data object. The tagging data and the first data object are processed using a second computer application.

Abstract: A system and method for establishing cross-relationships between objects is presented. A primary search is executed on a first object. A set of tagger identifiers is then determined based on the primary search. Each tagger identifier includes an internal instance key and one or more attributes of a match with the first object related to the primary search, and each tagger identifier of the set of tagger identifiers provides data for a secondary search. The secondary search is then executed on each of a secondary object that is tagged by the first object scanned by the primary search, the secondary search using the internal instance key and one or more attributes of the match with the first object.

Abstract: A system and method for establishing cross-relationships between objects is presented. A primary search is executed on a first object. A set of tagger identifiers is then determined based on the primary search. Each tagger identifier includes an internal instance key and one or more attributes of a match with the first object related to the primary search, and each tagger identifier of the set of tagger identifiers provides data for a secondary search. The secondary search is then executed on each of a secondary object that is tagged by the first object scanned by the primary search, the secondary search using the internal instance key and one or more attributes of the match with the first object.

Abstract: Systems and techniques for mapping compound keys. In one aspect, a method includes receiving a first compound key, mapping the first compound key to a first surrogate key, mapping the first surrogate key to a second surrogate key, mapping the second surrogate key to a second compound key, and making the second compound key available for data processing activities.

Abstract: A method of sharing data includes storing a central data object in the central computer system, the data object including an attribute and a plurality of values for the attribute and creating a first mapping between the values of the attribute stored in the central data object and values of an attribute for a first client data object stored in a client computer system. The first mapping is stored, and the first mapping is used to selectively extract first data from the central data object for distribution to the first client data object. The extracted data is distributed from the central computer system to one or more client systems.

Abstract: Methods and apparatus, including computer program products, for authorization controlled searching. In general, a search request is received, a database data structure is searched where the data structure is populated with records that include data and criteria for authorization to access the data, and a set of results is presented to a user, where the set of results includes data from the data structure for which a user is authorized the criteria is used to determine which results to include in the set of results. The criteria for authorization to access the data may be simple or complex, and may be based on a formation of associations from multiple layers of associations.

Abstract: Performing a negative key mapping process includes determining whether objects contain substantially the same information, and storing a negative key mapping for the objects if the objects do not contain substantially the same information. In this context, the negative key mapping includes data indicating that the objects are different, at least in part.

Abstract: An object matching system comprises a plurality of disparate databases comprising data objects and a master data server. The master data server comprises a computer programmed to provide a plurality of adapters configured to connect to said plurality of disparate databases, a matching module configured to compare data objects provided by said plurality of adapters through use of an object matching rule to determine at least two matching data objects, and a data integrator configured to merge said at least two matching data objects to produce a master data object.

Abstract: Rule based data object matching to determine if two or more objects are similar to allow the objects to be merged into one master data object. The rules explicitly state what conditions are required to consider two or more objects equal. The certainty of the rule may be specified. Examples for the certainty are automatic, manual high, medium and low probability. For example, the certainty “automatic” specifies that the objects can be considered matches and no additional manual verification is needed. The certainty “manual low probability” specifies that there is a low probability that the objects are matches and that a manual verification is needed. Matching rules may be grouped by priority. If matches are not found, the next highest priority group of rules is processed. Hierarchical matching rules may be specified that are able to express similarity of objects considering structured objects containing sub-objects in a hierarchical manner.