Abstract: Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.

Abstract: A method, system, apparatus, and article of manufacture is configured to expose a database asset as a web service. A relational database management system (RDBMS) that stores information is executed in a computer system. As part of a process and framework, a series of business rules and process workflows are maintained that manage data that resides in RDBMS tables. A rule is created that contains an application programming interface definition with predefined input and output for exposing the database asset as the web service. The rule is exposed as the web service. The web service is used to invoke a database operation based on the database asset, and to output a result.

Abstract: In one embodiment, markup representation of a data set is requested at a relational data store. The data set has a first portion stored at a first table structure of the relational data store and a second portion stored at a second tale structure of the relational data store. The markup representation of the data set is received from the relational data store and an object representation of the data set is generated based on the markup representation of the data set. The object representation of the data set includes a first element having a value of the first portion and a second element having a value of the second portion.

Abstract: A system and method for creating and maintaining a correspondent banking relationship mapping including current illicit designations. The system enables identification of a bank's correspondent relationships and the relationships of their correspondents. Through the system and method users can identify which banks have illicit relationships prior to engaging with banks or can be notified if the status of any banks which they have an existing relationships changes because a correspondent bank has entered into a correspondent relationship with an illicit banking entity.

Abstract: A method, computer program product, and system for partitioning keys for a hash table in order to improve performance of the hash table. A hash function is used to generate a hash table by mapping a set of keys to a corresponding set of hash codes, and a hash failure is detected if the hash function fails to map the entire set of keys. To resolve the hash failure, the set of keys is partitioned to form subsets of keys that can be individually mapped.

Abstract: A system and method is provided for partitioning a global index into multiple index datasets to house indexes and their index values. The index datasets may be stored in initialized physical index areas that are distinct from a standard physical index area.

Abstract: A financial services enterprise may provide for integrating a framework application and a task database. A flat file is extracted from a framework application, wherein the flat file is associated with a task and the task is associated with a financial services project. The flat file is manipulated to form a relational database data structure associated with the task. The relational database data structure is communicated to a management module, and the management module stores the relational database data structure in the task database to facilitate modeling the financial services project associated with a financial services enterprise.

Abstract: A method for distributing a prescription pharmaceutical product includes recording a unique identifier in a database that identifies a medium and a prescription pharmaceutical product associated with the medium. The database is provisioned with criteria that establish different potential values for the medium. Thus, the medium has a variable value that varies according to the criteria provisioned in the database. A holder of the medium then presents the medium to a provider of the prescription pharmaceutical product. Upon receipt the medium, the provider communicates the unique identifier associated with the medium. Based on the unique identifier of the medium and the variable value criteria provisioned in the database, the value of the medium is determined and communicated to the provider. The holder then utilizes the determined value to purchase the prescription pharmaceutical product associated with the medium.

Abstract: A knowledge management platform eliminates the trial and error process for analytical chemists in, for example, identifying appropriate methodologies for separating mixtures of chemical compounds. The platform allows the analytical chemists to perform a variety of searches on data existing from previous experiments, procedures, and/or processes. The platform may be employed to make faster decisions, and ultimately decreases the time taken in selecting an appropriate separation methodology.

Abstract: A data model can be generated by dualizing another data model. In other words, a first data model can be transformed into a second data model, wherein the second data model is a mathematical dual of the first data model. For example, a non-relational data model can be generated by dualizing a relational data model.

Abstract: A content tagging and management capability is provided for enabling automatic tagging of content and management of tagged content. An apparatus includes a content capture mechanism configured for capturing content including an object, and a processor configured for automatically associating an information structure with the object included within the content to form thereby tagged content. A method for using a user device for automatically tagging content includes capturing content including an object, receiving object information associated with the object when a sensor associated with the object is detected, and automatically associating an information structure with the object included within the content to form thereby tagged content, where the information structure includes at least a portion of the object information associated with the object.

Abstract: Techniques for creating and searching a database that stores information about a plurality of individual habitable units (IHUs) are provided. An example of an IHU is a hotel room. Image data that depicts where a plurality of IHUs reside relative to each other is placed on a base image, such as a satellite/map image. The base image is associated with a mapping that maps points on the base image to spatial (e.g., geographical) coordinates. The coordinates of the IHU may be used to generate a computer-rendered view from a window of an IHU. Also, label input is received that labels each IHU reflected in the image data with certain information. Each label indicates a value of an attribute of an IHU, such as its size, price, distance from elevators, etc. A query that targets information about each IHU may be processed and results returned that are ranked based on criteria associated with the query.

Abstract: A computer-implemented method of creating a data mining model in a database management system comprises accepting a database language statement at the database management system, the database language statement indicating a dataset and a data mining model to be created from the dataset, and creating, in the database management system, the indicated data mining model using the indicated dataset, wherein creation and application of the data mining model does not require moving data to a separate data mining engine.

Abstract: A storage device may include a main storage part including memories; and a controller configured to control an overall operation of the main storage part. The controller includes a filter manager configured to store data format information and a filtering condition provided from a host; stream filters configured to search and project data stored in the memories in parallel in response to a control of the filter manager to produce searched and projected data; and a merge filter configured to merge the searched and projected data of the stream filters in response to the control of the filter manager.

Abstract: An interactive electronic picture organization and display system stores pictures that include images of users' relatives and/or friends and enables the user to crop the images from the pictures into portraits of varying intimacy or social closeness values. The cropped portraits are stored with identification information and age indices and with specified preferred social proximities for the various individuals. Family trees are generated showing portraits of family tree members with appropriate age indices and preferred social closeness indices and are modified by simply mouse-clicking on displayed portraits. Collections of portraits of selected individuals exemplarily of different generations with an average generational age difference or the same age index (all as children, all as parents or grandparents, etc.) may be displayed. Life stories can be developed, collated to portraits of different age indices.

Abstract: A system for semantically modeling relationships and dependencies between groups, enclosures, assets, and support entities according to an industry specific manner. An exemplary system includes a user interface device, a relational database and a processor. The processor receives relationship information and receives attributes with associated measurements for the groups, enclosures, assets, and support entities for the corporation from the user interface device. The attributes with associated measurements are formatted according the specific industry of the corporation. The processor generates a three dimensional (3D) visualization of the groups, enclosures, assets, and support entities and allows a virtual walkthrough of the 3D visualization as presented on the display device based on user entered commands from the user input device.

Abstract: A computer-implemented method is provided for managing a plurality of data objects including dimensional attributes. The method includes receiving a plurality of data objects including dimensional attributes and assigning each of a plurality of nodes to one or more of a plurality of keyspace positions of a keyspace, wherein the plurality of nodes define partitions of the keyspace. A space filling curve is applied to the dimensional attributes of each of the plurality of data objects to generate a plurality of key values which correspond to the plurality of keyspace positions, and each of the plurality of data objects is transmitted to one or more of the plurality of nodes assigned to a keyspace position corresponding to the key value of the respective data object. A system for managing a plurality of data objects including dimensional attributes is further provided.

Abstract: A system and method for representing, storing and retrieving real-world knowledge on a computer or network of computers is disclosed. Knowledge is broken down into permanent atomic “facts” which can be stored in a standard relational database and processed very efficiently. It also provides for the efficient querying of a knowledge base, efficient inference of new knowledge and translation into and out of natural language. Queries can also be processed with full natural language explanations of where the answers came from. The method can also be used in a distributed fashion enabling the system to be a large network of computers and the technology can be integrated into a web browser adding to the browser's functionality.

Abstract: An apparatus, system, and method for measuring the similarity of diverse binary objects, such as files, is disclosed. The method comprises determining a plurality of digital signatures in each of a plurality of dissimilar objects, for each digital signature, accessing a location in a store which has object identifiers for each object which also exhibits at least one instance of the digital signature, writing into the store the object identifiers of all the objects which have the corresponding pattern and the number of times the pattern is found, and making a list of all the objects which share a pattern found in each object. Analyzing the list determines the degree of similarity of a particular object with each of a plurality of diverse binary objects.

Abstract: Systems, methods, and computer program products are provided for ensuring coherency between user data in a client and their corresponding state in enterprise information systems (EIS) wherein data migrates and subscriptions change over time. A mobile business object (MBO) identifies an update to a subscription or a change in set membership in order to provide updates to a client device and EIS systems. Cached data is filtered for client device users who synchronize data they are interested in (i.e., subscribed to). In an embodiment, the method keeps track of set membership by remembering on a per remote identifier/business object basis the set membership for a parent business object. When set membership changes, the method sends delete notifications to the device to remove ex-members. The method recognizes common relationship types in a business scenario and handles reference-type relationships as well as containment-type relationships. The methods include key tracking and membership tracking.

Abstract: A system and method is disclosed for contextual processing of data objects in a multi-dimensional information space. The system can be used to increase the efficiency and improve the interactive experience for the user of a GUI-based operating system or application.

Abstract: A computer-implemented system and method for performing distinct operations on multiple tables of shared memory of parallel computing environments are disclosed. A distinct operation is executed on each table of a plurality of tables, each distinct operation eliminating duplicate data from each table, the executing creating a hierarchy of table pairs and distinct results, the distinct results comprising a reduced row set for each table. Duplicates on each reduced row set are detected to complete the distinct operation on the plurality of tables.

Abstract: A method and system for efficiently storing, retrieving, and updating binary large objects (BLOBs) in embedded systems is disclosed. The metadata of the BLOBs is stored in relational tables, while the BLOBs are stored in a flat file. Querying the metadata of the BLOBs (i.e. the starting points of the BLOBs and their length) is performed based on SQL. The corresponding BLOBs are then accessed using file operation commands. To further simplify the querying and storage of BLOBs, virtual tables are created. By using these virtual tables, a user can access a BLOB as if it was stored in a physical table.

Abstract: The disclosed technology involves the use of relational databases in conjunction with declarative language and network-wide, database abstractions to manage and operate networks. The data model creates a logically centralized database abstraction and access point for managing data relevant to network management. Exemplary managed data includes router configurations, network status and provisioning data. This information resides in a single database system which is tightly integrated with the operational network. Transactional write operations are used to change network configurations, and enforce constraints to detect and prevent policy violations during operation. In accordance with one aspect of the disclosed technology, a network operation is implemented by means of a series of database commands—read and/or write—from and to database view tables.

Abstract: A method and apparatus for document and potential evidence management with smart devices is provided. The method includes the steps of authorizing a smart device, verifying a user of the smart device. The smart device is then used to collect a document or piece of potential evidence. As part of the collection process, the user may apply an electronically registerable marking to the electronic record. The electronic record is then uploaded to a record repository. The record repository is a relational database that builds relationships among the documents and potential evidence using the markings applied during the collection process.

Abstract: A global information management system (GIMS) includes a collection of standards and methods that allow information management on a global scale. A GIMS computer network includes a central registration database (CRD) and one or more GIMS computer systems connected over a network. Each GIMS computer system includes a relational database having a set of standardized tables. The CRD may provide a GIMS network-unique system ID to each GIMS computer system. Each GIMS computer system uses the GIMS network-unique system ID as part of a primary key for each record generated by and stored in the set of standardized tables of the GIMS database. The GIMS enables global database normalization through the globally unique identification of database records.

Abstract: A method and system for dividing a tree structure of a structured document based on a tree structure defined by a schema of the structured document. The method includes the following steps: calculating an index value of size of a subtree having each element as a root for at least part of at least one element included in the tree structure defined by the schema, and deciding on a division pattern using the index value, where the division pattern is used to divide the tree structure of the structured document to which the schema is applied so that the size of the subtree, after being divided, meets a predetermined standard.

Abstract: The present embodiments provide a system that processes data. During operation, the system obtains, from a set of technical users, a set of concept definitions comprising filters against data in a data domain. Next, the system provides the concept definitions to a set of end users of the data. Finally, the system facilitates, for the end users, processing of the data by applying the concept definitions to the data.

Abstract: A method and system for entities of a data access layer, the data access layer following an entity-relationship model in which data are depicted in term of entities and relationships between them and the entities are provided with a CRUD interface. The method includes the steps of: defining a meta-entity being a virtual entity, resulting as a composition of parts of one or more entities; describing the virtual entity, via a virtual entity descriptor, as a hierarchical structure in which entities are connected in a parent-child structure via a link; in the virtual entity descriptor, specifying which properties are taken from each entity to form partial entities of the virtual entity; providing a CRUD interface on the virtual entity; and at run time, accessing the virtual entity via its CRUD interface. The accessing is implemented as a set of calls to CRUD methods accessing the entities composing the virtual entity.

Abstract: In a method for storing data in a relational database system using a processor, a collection of values is assigned to a structure dictionary, wherein each of the values represents the value of a row for an attribute and has a unique ordinal number within the collection, and wherein the structure dictionary contains structures defined based on at least one of interaction with a user of the system via an interface, automatic detection of structures occurring in data, and predetermined information about structures relevant to data content that is stored in the system. For each structure in the structure dictionary, a structure match list is formed from ordinal numbers of values matching the structure, and a structure sub-collection from values matching the structure, using the processor.

Abstract: Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.

Abstract: A distributed event system for a relational database is disclosed. An event data model operatively describes a target database. For a subject entity in the target database, the event data model declares and defines triggering events and respective corresponding operations. An event engine monitors database queries and events involving the subject entity and determines from the event data model corresponding operations. Execution of the determined corresponding operations is distributed to network-based agents. Agents may be filtered based on skills and/or credentials injected at runtime. Code binaries of the operations are downloaded to the agents for execution.

Abstract: Systems, methods, and computer-storage media for identifying dominant concepts are provided. The system includes a search engine connected to various sources, an entity extraction component, a metabase, and a ranking component. The search engine receives a contextual query and provides results in response to the contextual query. The entity extraction component parses the results and identifies entities included in the results. The metabase provides a distance between the entities included in the results and the query terms included in the contextual query. The ranking component ranks the entities based on the provided distance and selects dominant concepts within the results based on the ranks assigned to entities.

Abstract: A schema definition generating device includes an item comparison generating unit that compares configuration item information and table information, and generates correspondence information indicating a correspondence between the configuration item information contained in a query formula used to search for configuration item information indicating a configuration item targeted for management and the table information contained in history information of queries made to a relational database; a relationship comparison generating unit that compares relational information and information indicating a relationship between tables contained in the query history information, and generates correspondence information indicating a correspondence between the relational information indicating a relationship between configuration items contained in the query formula and the query history information; and a schema definition generating unit that generates a schema definition of the configuration item information and a sch

Abstract: A computer method, system and apparatus control access to secured data in a plurality of databases. A repository is coupled to the databases and has a security runtime subsystem. The repository intercepts a user query of a subject database in the plurality. The security runtime subsystem determines from the intercepted query a user and corresponding user role. Based on user role, the security runtime subsystem automatically modifies the user query to filter out secure data for which the identified user is unauthorized to access but are part of the user query.

Abstract: In a method, system, and computer-readable medium having instructions for customizing standard formula fields, at least a portion of a formula is received for a standard database field of a standard database entity in a multi-tenant database and the standard database entity is used by a plurality of tenants, a date range is stored for maintaining at least the portion of the formula, information on one or more variables of the formula is received, a value is calculated for the standard database field with at least the portion of the formula and information on the one or more variables of the formula and one or more database entities depend on the value for the standard database field, and the value is stored for the standard database field.

Abstract: Distributed computing using communities is described. In an embodiment computations in a distributed computing system are driven and controlled by a document storing a distributed computing graph, a graph layout view of that graph and visualization elements. For example, the document is replicated and synchronized at each of a plurality of entities in the distributed computing system. In examples a community may be drawn as a rectangle or other shape in the graph layout view and represents one or more computing resources in the distributed computing system. For example by placing graphical elements representing currently executing processes into the community on the graph layout view a user is able to ensure that those processes execute using the computing resources of the community. In examples communities may be nested and may have parameters specifying conditions which are to be met by the computing resources they represent.

Abstract: An aspect of the present invention performs offline validation of data in database system for foreign key constraints. In an embodiment, a foreign key constraint defined for a database system is identified and an SQL script designed to verify whether data values stored in a foreign key column of a detail table is present in a primary key column of a master table (corresponding to the identified foreign key constraint), is generated. The SQL script is executed to determine whether the data stored in the database system satisfies the identified foreign key constraint.

Abstract: A method and apparatus for implementing a relational document-based datastore are disclosed. Embodiments of the method comprise providing an interface for an application, performing relationship definition operations to define a one or more relationships between one or more documents contained within a set of data, interfacing with a datastore, and indexing the one or more documents and the one or more relationships. The apparatus comprises means for providing an interface for an application, means for performing relationship definition operations to define a one or more relationships between one or more documents contained within a set of data, means for interfacing with a datastore, and means for indexing the one or more documents and the one or more relationships.

Abstract: Data is shared between multiple enterprise data sources and mobile clients in a distributed system such that requests from a mobile client for enterprise data are received, the appropriate enterprise data sources that contain the requested data are determined, and the enterprise data is retrieved from the determined enterprise data sources. When the enterprise data is retrieved, it is converted into a relational format that can relate the retrieved data, even if the data comes from multiple enterprise data sources. The converted enterprise data is stored in a relational data store in the mobile client. In this way, mobile applications can be fully integrated with data from multiple enterprise data sources and data updates and configuration changes can be distributed to and from the mobile clients in real-time, without using interim data storage, and thereby avoiding complicated synchronization and data conflict issues between the enterprise data sources and the mobile clients.

Abstract: A system and method for ensuring large and frequent updates to a data warehouse. The process leverages a set of temporary staging tables to track the updates. A set of intermediate steps are performed to accomplish bulk deletions of the outdated changed records, and perform modifications to the map tables for models such as snowflake. Finally, bulk load operations load the updates and insert them into the final dimension tables. The process ensures performance comparable to insertion-only schemes with at most only slight performance degradation. Furthermore, a modified process is applied on the newfact data warehouse dimension model. The process can be readily adapted to handle star schema and other hierarchical data warehouse models.

Abstract: An approach is provided for generating a searchable index including an associated object graph. Data objects of a database are converted into corresponding rows in a set of searchable columns. An object graph corresponding to each row of the searchable columns are determined. An index including the set of searchable columns and the corresponding object graphs are generated.

Abstract: In accordance with one embodiment of the disclosed technology, inconsistencies are detected between various records relating to data that has been associated with an identification tag. Data packages associated with the inconsistencies may then be removed. In accordance with another aspect of the disclosed technology, requests relating to data packages associated with inconsistencies in the various stored records are identified and removed. The disclosed technology may be implemented in data warehouses.

Abstract: One embodiment operates a computer system for storing and retrieving data from a data store. The computer system has a data manager device operable to manage patterns in the stored data along with pointers relating to the patterns in a manner which enables reconstruction of the stored data in original form.

Abstract: A method and system for prompting changes of electronic document content. The method includes the steps of: determining a first relation information from a first document where the first relation information includes: a first named entity, a second named entity, and a first relationship between the first named entity and the second named entity, storing the first relation information in a database, determining a second relation information from a second document, where the second relation information includes: a third named entity, a fourth named entity, and a second relationship between the third named entity and the fourth named entity, retrieving the first relation information from a database, and sending the first relation information to a client, if the first relation information is different from the second relation information, where at least one step is performed using a computer device.

Abstract: A database having data entries with attributes having values that can vary over system time (the time according to a computer clock) and also over valid time (the start time and end time of an interval during which the values of the attributes are true). All logical operations of updates and deletes of values are performed by insert operations that insert new entries into the database, so that all old entries that were present at previous systems still exist and still include their previously-assigned start times and end times for the value of the attribute.

Abstract: A method for creating a relational database schema is provided. The method comprises accessing (110, 210) a reference ontology (101) comprising a first number of concepts and a second number of properties, selecting (120, 220) a first set of concepts from the reference ontology, determining (130, 230) a first set of properties from said second number of properties, associated with the selected first set of concepts, determining (140, 240) a second set of concepts associated with the determined first set of properties, and generating (150, 250) a relational database schema comprising a number of tables, of which at least one table pertains to a concept of said second set of concepts. Further, a module (300) for creating a relational database schema is provided.

Abstract: An approach is provided that receives an alteration request to mark a selected column in a database table as an unused column. A database control table is then updated to indicate that the selected column is unused. After the database control table is updated, when a read request is received for the selected column, the same data is returned for the selected column for each row being read and this data is not stored in the database table.

Abstract: A method of synchronizing a source system that stores its records in a relational database and defines its own application level security with an OLAP cube, in which the structure of the relational database and cube is modelled to an intermediate representation for the purpose of comparing both structures; the differences between the two models are identified and used to modify the structure of the cube; the modified structure of the cube is used to generate a script for retrieving data from the relational database for insertion into the cube, after which the script is run and the data is inserted into the modified cube. A unique identifier is used for each item in the base system and each system is tagged with the same identifier in the cube.

Abstract: Techniques are provided for manifesting a multiple repository system as a single repository to an application that is designed to use a single repository. According to one aspect, a particular container, which is used by the application to store data, is identified. One or more additional containers are created in one or more different repositories. Each of the additional containers is formatted to store the data that the application stores in the particular container. A construct is created. The construct is associated with the particular container's identifier. The construct causes information from the particular container and each of the additional containers to be combined to answer database commands that reference the particular container's identifier. As a result, data stored in a single repository can be distributed among multiple repositories, and the unmodified application can continue to access that data as though the data was stored in the single repository.