15933results about "Relational databases" patented technology

An information retrieval system in accordance with the principles of the present invention maintains a database that defines a relational association between a plurality of informational items in the system. The relational association is based on historical navigational behavior of users of the information retrieval system, and includes a relationship type, which is based on the characteristic similarities between the informational items, and relationship strength, which is based on the historical frequency of any related informational items being selected by a user within the same information retrieval session. When a navigation from one informational item to another information item is detected, the relationship type and the relationship strength of the two informational items are determined and stored in the database. During a subsequent selection of an informational item, any related informational items related to the selected informational item are sorted based on the respective relationship types and relationship strengths, and are provided in a sorted list from which the user can select.

Embodiments of the invention relate to systems and methods for providing an anonymization engine. One embodiment of the present invention relates to a method comprising receiving a message directed at a recipient computer located outside a secure area by a privacy computer located within a secure area. The privacy computer may identify private information using a plurality of privacy rules and anonymize the message according to the plurality of privacy rules. Another embodiment may be directed to a method comprising receiving a request for sensitive data from a requesting computer. An anonymization computer may determine a sensitive data record associated with the request and may anonymize the sensitive data record by performing at least two of: removing unnecessary sensitive data entries from the sensitive data record, masking the sensitive data entries to maintain format, separating the sensitive data entries into associated data groupings, and de-contexting the data.

A data structure visualization tool visualizes a data structure such as a decision table classifier. A data file based on a data set of relational data is stored as a relational table, where each row represents an aggregate of all the records for each combination of values of the attributes used. Once loaded into memory, an inducer is used to construct a hierarchy of levels, called a decision table classifier, where each successive level in the hierarchy has two fewer attributes. Besides a column for each attribute, there is a column for the record count (or more generally, sum of record weights), and a column containing a vector of probabilities (each probability gives the proportion of records in each class). Finally, at the top-most level, a single row represents all the data. The decision table classifier is then passed to the visualization tool for display and the decision table classifier is visualized. By building a representative scene graph adaptively, the visualization application never loads the whole data set into memory. Interactive techniques, such as drill-down and drill-through are used view further levels of detail or to retrieve some subset of the original data. The decision table visualizer helps a user understand the importance of specific attribute values for classification.

A computer-implemented matching service matches users to other users, and / or to user communities, based at least in part on a computer analysis of event data reflective of user behaviors. The event data may, for example, evidence user affinities for particular items represented in an electronic catalog, such as book titles, music titles, movie titles, and / or other types of items that tend to reflect the traits of users. Event data reflective of other types of user actions, such as item-detail-page viewing events, browse node visits, search query submissions, and / or web browsing patterns may additionally or alternatively be considered. By taking such event data into consideration, the matching service reduces the burden on users to explicitly supply personal profile information, and reduces poor results caused by exaggerations and other inaccuracies in such profile information.

A system for ranking geospatial entities is described. In one embodiment, the system comprises an interface for receiving ranking data about a plurality of geospatial entities and an entity ranking module. The module uses a ranking mechanism to generate place ranks for the geospatial entities based on the ranking data. Ranked entity data generated by the entity ranking module is stored in a database. The entity ranking module may be configured to evaluate a plurality of diverse attributes to determine a total score for a geospatial entity. The entity ranking module may be configured to organize ranked entity data into placemark layers.

Techniques are described for effecting data aggregation in a network. Event notifications are received from a plurality of content sites on the network. Each event notification indicates occurrence of an event associated with a corresponding one of the content sites. Each event corresponds to a change to content associated with the corresponding content site. In response to each event notification, event metadata are generated. The event metadata include a time stamp for the event and change data corresponding to the change to the content. The event metadata are indexed in a plurality of databases with reference to a plurality of index metrics including the time stamp. The indexing of the event metadata for each event occurs within days, hours, or even minutes of receipt of the corresponding event notification thereby enabling retrieving of the changes to the content from the plurality of databases using any of the index metrics in near real time.

The method comprises processing plural product information records from the product information sources into one or more groups based on which product information records are likely to correspond to the same product, correlating a unique product ID corresponding to the product associated with each of said groups to identify the product, comparing each identified product to categories of a taxonomy to determine a category for the identified products in the taxonomy, and determining attributes for each categorized product based on the product information records corresponding to each group, creating product specifications based on the determined attributes and storing the product specification in the corresponding determined categories of the taxonomy.

A system and a method for synchronizing and updating a relational database with supplemental data in which the relational database has a set of tables defined by a relational schema. The supplemental data preferably comprises data in a tagged format having a document-type definition representative of the relational schema and is represented in a document object. The system and method preferably ensure record-by-record updating and synchronization of the relational database with the at least one proposed data update by receiving at least one proposed data update from a source external to the relational database; and propagating the received at least one proposed data update into the relational database. In this matter, the compliance with both the relational database relational schema and the tagged data document type definition is ensured without requiring reloading existing data in the relational database.

The present invention provides computer-based systems and methods directed to maintaining a database of user profiles based, respectively, on user interaction with third-party systems. The invention includes the processes of: accessing a unique user profile associated with a unique user; automatically collecting, by an agent module executing on a processor associated with a first system, data associated with the unique user based at least in part on the unique user's interaction with a system unassociated with the first system; evaluating by the processor the collected data and searching available databases to identify potential items of interest to the unique user based at least in part on the unique user profile and the collected data; determining a set of predicted items of interest to the unique user from the identified potential items of interest; and presenting at a display associated with the unique user data representing the set of predicted items of interest. In one implementation, the invention provides an intelligent agent possessing a level of “awareness” concerning individual users associated with user profiles or accounts and is adapted to access private and public databases, websites, resources, and other systems to efficiently collect, filter and deliver / present content and resources of interest to the individual user in a predictive fashion.

A computer-implemented system and method for creating topic neighborhoods and a visualization for related topic neighborhoods in a networked system are disclosed. The apparatus in an example embodiment includes a neighborhood generator configured to receive an explicit identification of a topic for association with a neighborhood; create a neighborhood in association with the explicitly identified topic; gather neighborhood information related to the neighborhood from sources related to the topic; and provide access to the neighborhood via a neighborhood visualization on a webpage.

A hierarchical / relational translation system is provided for enabling information from unrelated heterogeneous relational computing systems to be accessed, navigated, searched, browsed, and shared over a hierarchical computing system. In one embodiment, the hierarchical / relational translation system includes a virtual directory server for capturing information in the nature of relational database schema and metadata. The captured schema and metadata are then translated into virtual directories that are universally compatible with standard communication protocols used with hierarchical computing systems. A virtual directory of information organizes an index of data records and a standard addressing schema is provided to enable customizable access to relevant views of relational computing systems. Several embodiments for presenting the virtual directory information tree are included. In one embodiment, the virtual directory is displayed using browser format. In another embodiment, the virtual directory is presented in electronic mail format. Still, in another embodiment the virtual directory is presented over a wireless medium and through portable devices.

An indexing system and linking method for an assembly of electronic-based informational items stored in and ordered by a plurality of records uniquely identified over a plurality of relational data tables making up a data set wherein each table is assigned a unique domain of unique alphanumeric indicia for assignment and storage in the records. The records are ordered by the alphanumeric indicia whereby each data table acts as its own primary key. The records are bi-directionally linked to each other via a plurality of separate, central linking table indexes wherein each index record is structured with a plurality of linking fields defined to store sets of two or more alphanumeric indicia belonging to a plurality of records in the data set. Each record is further structured to include an internal set of unique indicum for each data field whereby the combination of the unique record indicum and the unique field indicum uniquely identify each record-field over the plurality of relational data tables making up the data set such that each record field may be linked to a plurality of other record-fields or records via the plurality of separate, central linking table indexes. Each central linking table indexes is further generalized to provide multiple arrays of linking indicia in a plurality of indexing fields such that a plurality of the records from a plurality of the data tables may be linked together as a data cluster. The linking values stored in the central linking table indexes may be predefined to automatically structure and link a plurality of unspecified data and changes in the data may alter the linking structure to provide further capabilities.

A method for mapping data schemas into an ontology model, including providing an ontology model including classes and properties of classes, providing a data schema, identifying a primary data construct within the data schema, identifying a secondary data construct within the primary data construct, mapping the primary data construct to a corresponding class of the ontology model, and mapping the secondary data construct to a property of the corresponding class of the ontology model. A system and a computer readable storage medium are also described and claimed.

The present invention relates to methods, systems and apparatus for capturing, integrating, organizing, navigating and querying large-scale data from high-throughput biological and chemical assay platforms. It provides a highly efficient meta-analysis infrastructure for performing research queries across a large number of studies and experiments from different biological and chemical assays, data types and organisms, as well as systems to build and add to such an infrastructure. According to various embodiments, methods, systems and interfaces for associating experimental data, features and groups of data related by structure and / or function with chemical, medical and / or biological terms in an ontology or taxonomy are provided. According to various embodiments, methods, systems and interfaces for filtering data by data source information are provided, allowing dynamic navigation through large amounts of data to find the most relevant results for a particular query.

A search system associates contextual metadata with search terms and / or stored terms to facilitate identification of relevant information. In one implementation, a search term is identified (4304) from a received search request. The search term is then rewritten (4306) in standard form and the standard form term is then set (4308) as the current search parameter. A source database is then searched (4310) using the current search parameter. If any results are obtained (4312) these results may be output (4320) to the user. If no results are obtained, a parent classification of the search term is set (4316) as the current search parameter and the process is repeated. The invention thereby provides the ease of use of term searching with the comprehensiveness of category searching.

A computer-implemented matching service matches users to other users, and / or to user communities, based at least in part on a computer analysis of event data reflective of user behaviors. The event data may, for example, evidence user affinities for particular items represented in an electronic catalog, such as book titles, music titles, movie titles, and / or other types of items that tend to reflect the traits of users. Event data reflective of other types of user actions, such as item-detail-page viewing events, browse node visits, search query submissions, and / or web browsing patterns may additionally or alternatively be considered. By taking such event data into consideration, the matching service reduces the burden on users to explicitly supply personal profile information, and reduces poor results caused by exaggerations and other inaccuracies in such profile information.

This invention relates to a computer-based method and system for facilitating the retrieval, classification, and distribution of information. In one embodiment, a method for providing information comprises providing a plurality of entities, each having an entity type, providing a plurality of relationships among the entities, each relationship having a relationship type and direction, and constructing an entity-relationship network comprising the entities and relationships. The method further includes receiving a plurality of information items, facilitating the association of the information items with at least one corresponding entity, receiving a request for information items associated with a selected one of the entities, determining a subset of the entities based on the selected entity, the relationships, the relationship types and the relationship directions, and providing the information items associated with the subset of the entities.

Methods are presented for generating a natural language model. The method may comprise: ingesting training data representative of documents to be analyzed by the natural language model, generating a hierarchical data structure comprising at least two topical nodes within which the training data is to be subdivided into by the natural language model, selecting a plurality of documents among the training data to be annotated, generating an annotation prompt for each document configured to elicit an annotation about said document indicating which node among the at least two topical nodes said document is to be classified into, receiving the annotation based on the annotation prompt; and generating the natural language model using an adaptive machine learning process configured to determine patterns among the annotations for how the documents in the training data are to be subdivided according to the at least two topical nodes of the hierarchical data structure.

Systems and methods for managing electronic data are disclosed. Various data management operations can be performed based on a metabase formed from metadata. Such metadata can be identified from an index of data interactions generated by a journaling module, and obtained from their associated data objects stored in one or more storage devices. In various embodiments, such processing of the index and storing of the metadata can facilitate, for example, enhanced data management operations, enhanced data identification operations, enhanced storage operations, data classification for organizing and storing the metadata, cataloging of metadata for the stored metadata, and / or user interfaces for managing data. In various embodiments, the metabase can be configured in different ways. For example, the metabase can be stored separately from the data objects so as to allow obtaining of information about the data objects without accessing the data objects or a data structure used by a file system.

The present technology enables identification, visualization, and analysis of data flows via network components in complex enterprise IT environments including but not limited to servers, workstations, switches, routers, wireless access points, traffic shapers, firewalls, storage systems and SAN systems. The technology is based on a combination of information collection, information filtering, mapping, grouping, marking, report generation, and verification.

A method for clustering together network clients for guiding of placement of network servers is disclosed. A number of routing table prefix / netmask entries are aggregated and unified into a tubular format. The routing table entries may be converted into a singular format. A network server log is used to extract a number of client IP addresses which are compared to the entries within the unified routing table. A common prefix shared by a number of the client IP addresses and an entry in the unified routing table is determined and used to cluster the clients together in a client cluster. Network servers, such as proxy server, cache servers, content distribution servers and mirror server may be placed in the network according to the client clusters.

Systems and methods are provided for matching snippets of search results to clusters of objects. A system adds a data snippet of a search result to a cluster of objects. The system calculates a confidence score for the add based on the recency, a job title, an email address, and / or a phone number associated with the data snippet. The system stores the add in the customer accessible database if the confidence score is sufficiently high for the add to be stored in the customer accessible database. The system generates a notice for review if the confidence score is not sufficiently high for the add to be stored in the customer accessible database.