Abstract: A method for specifying a consolidator for consolidating data from a plurality of database systems is disclosed. The method comprises receiving a user action wherein the user action specifies an action that modifies a knowledge base wherein the knowledge base includes schema information and matching information relating to the plurality of database systems. The method further comprises deriving an event from the user action wherein the event triggers a consistency rule that causes a modification of the knowledge base and generating from the knowledge base a registry that comprises the consolidator wherein the registry includes a master database and a consolidator application.

Abstract: A method for providing processed data definition documents (DDDs) or processed document object models (DOMs) for object oriented programming. The use of these processed data definitions simplifies the data structures and streamlines programming to access the data. A standard DDD/DOM has a hierarchical branched structure having a number of levels each with elements/nodes and attributes. The DDD is written in a platform independent markup language. An element/node is selected and its attributes are identified. All ‘children’ of the selected element/node are identified. The attributes of the selected element/node (parent) are then copied to each child for all children in the DDD/DOM. This is repeated for all elements/nodes in the DDD/DOM to result in a processed DDD/processed DOM which is now structured to allow program access to data in a more direct manner.

Abstract: A method of providing information from at least one information resource. A semantic query is received that includes one or more generic constructs referencing an ontology relating to a domain of the information resource(s). A representation of the semantic query in an ontology representation language is inferred from the constructs. The query representation is used to access the information resource(s). This method allows a user to formulate database queries semantically without knowledge as to underlying data structures.

Abstract: An architecture and method is provided that facilitates serialization of a graph of objects into streams of data in an arbitrary format, and deserialization of the streams of data back into the graph of objects. The architecture provides a number of services associated with the basic functionality of serialization and deserialization. The services can be employed to implement transparent remoting, copy items to a clipboard and save data to a file. The present invention provides facilities which support the plugging in of a new serialization encoding by separating the encoding from the reading and reinstantiation of the graph of objects which the encoding describes. Objects in a graph of objects are serialized and deserialized based on a selected rule set for that object. A rule set can be provided by a class author within a class or within a third party file referred to as a surrogate.

Abstract: Systems and methods for accessing a relational database through an object-oriented querying interface are provided. A class of objects that are to be stored in the relational database are defined. One or more relational database tables are created and a mapping is produced that maps each data member of an object to one or more columns in a relational database table. Additionally, object-oriented paradigms like inheritance may be supported and the allocation of storage for array elements may be deferred until necessary.

Abstract: The present invention is directed to a method and apparatus for establishing documents relationship based on user's operation upon search result. When a user uses search engine to search for documents with a query in repository, the search result may be a list of ranked documents, and these documents may contain a lot of relationship in term of the specific query. If the user clicks some search result further, and if the click and open operation meet certain conditions, for example exceed a period of time, the clicked document could be deemed as related to the search query. Furthermore it could be inferred that there is a strong relationship between different documents clicked by the user. The present invention records the relationship between documents and presents it to the user when necessary.

Abstract: A method, computer program product, and system delete a row from a child table. The method, computer program product, and system delete the requested child row from the child table if the query corresponds to each of the plurality of parent tables and each of the plurality of parent tables has a row with a linked parent column that has a same value as a linked child column in the requested child row from the child table. Alternatively, deletion is performed if the query corresponds to only one of the plurality of parent tables having a row with a linked parent column that has a same value as a linked child column in the requested row from the child table and, for each remaining parent table, no row has a linked column that has a same value as a linked column in the requested row from the child table.

Abstract: Systems and methods for facilitating a search for story-based media search criteria for use in searching for story-based works are disclosed. The method may include the steps of: facilitating a search for and receiving input from a user that specifies a first desired character type, a desired type of interaction between a first character and a second character in a work, and/or other story-based search criteria, and searching a work database, and identifying at least one of the plurality of works that has a first work character type, desired type of interaction, and/or other story-based search criteria that is substantially similar to the specified story-based search criteria.

Abstract: A mechanism is disclosed for selecting an authorization filter to apply when executing a database query, based on the focus of the database query. Based on the focus specified for a given of the query, different conditions may be added during query processing to a database query. Doing so provides a flexible approach to managing data access requests where queries may focus on the same underlying data from many different perspectives.

Abstract: An incident managing module aggregates related database intrusion incidents and presents them in a manageable manner. A receiving module receives an anomalous query requesting data from a database and a type-identification module identifies anomaly type for the query received. A conversion module converts the anomalous query into a characteristic representation. In some embodiments, this is done by replacing literal field values in the query with representative values. In other embodiments, this is done by creating a tuple describing anomaly parameters for the anomalous query. In still other embodiments, the query is converted into a characteristic representation that distinguishes between injected and non-injected portions of the query. An aggregation module then aggregates into a group the anomalous queries with substantially similar characteristic representations according to anomaly type and a generation module generates a database intrusion incident report describing the group of anomalous queries.

Abstract: An apparatus and method efficiently delete a first items within a distributed datastore. In particular, an already well defined procedure for insertion of data is used for deletion. Deletion of a first item is effected through the insertion of a second item. The second item can contain a deletion key or be denoted by an appended flag or modified associated meta-data value. The first item can be deleted upon arrival of the second item or subsequent to arrival through an offline garbage collection process.

Abstract: A method and system for replicating a file system organized as a data structure from a source server to a target server. The replication process preserves the order of the inode table entries from the source file system to in the target file system at all stages of the replication process, as well as the internal consistency of the replica of the data structure on the target server. This replication eliminates use and employment of a map as the order of the inode index is preserved during the replication process.

Abstract: A method for secure restoration of data selected based on user-specified search criteria includes maintaining one or more backup versions of a plurality of storage objects and initiating the generation of a plurality of database entries, wherein each database entry corresponds to a backup version of a storage object and includes an encoding of a security descriptor associated with the storage object. The method may further include, in response to a backup version search request from a user, using contents of the search request and encodings of security descriptors stored in the plurality of database entries to identify one or more backup versions of a particular storage object that the user is authorized to access.

Abstract: Methods, systems and computer products provide for applying metadata to documents and/or document objects in local and/or remote file storage systems. Application of metadata (flags) to documents and/or document objects allows a user to easily locate and utilize flagged items. A single metadata type, such as a colored flag, may be applied to documents or document objects of different file types across a file storage system to which data is stored via different software applications. Documents and/or document objects bearing like flags may be surfaced to a user in a flag summary with which documents and/or document objects may be sorted by flag type. Flagged documents or document objects related to a launched document may be listed in an information pane adjacent to the launched document.

Abstract: Backend data is received from a computer program product such as a hard disk or other long term data storage. The backend data is structured using nodes that are associated with a unique identifier such as a GUID. The nodes are addressable using the unique identifier, and backend data items are associated with corresponding addressable nodes such that the backend nodes can be quickly accessed. Front-end data can be received from a computer program product such as a hard disk or other long term data storage. The front-end data is structured using nodes that are associated with a unique identifier such as a GUID. The nodes are addressable using the unique identifier, and front-end data items are associated with corresponding addressable nodes such that the front-end nodes can be quickly accessed.

Abstract: A process of analyzing performance of a computer program including a plurality of components includes steps of: receiving a call tree profile having a plurality of nodes, each node representing an invocation and each node being annotated with a cumulative performance cost for the node; a set of one or more components of interest to a user; and a threshold level of a cumulative performance cost associated with invocations of methods of the component that constitutes an expensive method invocation; analyzing the call tree profile from leaf nodes, the analyzing step comprising selecting a set of one or more components of interest to a user and selecting only invocations that exceed the threshold level, and pruning the set of invocations that are not selected. Finally the process includes a step of presenting to the user a list of costs associated with the selected invocations.

Abstract: Mechanisms for generating an incremental backup of a set of data blocks while excluding certain files that are less desired to be backed up. Examples of such files include temporary Internet files and the recycle bin. This allows the size of the incremental backup to be reduced significantly since such undesired files are often changed between backups. The incremental backup is constructed by first calculating which data blocks should be included in the incremental backup. The calculation is a function of at least the identity of which if any of the data blocks in a prior snapshot have been or would have been altered as a result of potential file alterations in the prior snapshot, and/or which if any of the data blocks in the subsequent snapshot have been or would have been altered as a result of potential file alterations in the subsequent snapshot.

Abstract: An improved system and method for evolutionary clustering of sequential data sets is provided. A snapshot cost may be determined for representing the data set for a particular clustering method used and may determine the cost of clustering the data set independently of a series of clusterings of the data sets in the sequence. A history cost may also be determined for measuring the distance between corresponding clusters of the data set and the previous data set in the sequence of data sets to determine a cost of clustering the data set as part of a series of clusterings of the data sets in the sequence. An overall cost may be determined for clustering the data set by minimizing the combination of the snapshot cost and the history cost. Any clustering method may be used, including flat clustering and hierarchical clustering.

Abstract: An apparatus, system, and method are disclosed for efficiently supporting generic SQL data manipulation statements. The method includes determining whether an SQL statement includes extended indicator parameters such as DEFAULT and UNASSIGNED indicators. The method further includes delaying an authorization check for an operation for an SQL statement using extended indicators, and bypassing an SQL exception where an otherwise unauthorized operation involves an UNASSIGNED variable. The method further includes bypassing a database operation such as a referential integrity check where a data change would induce the database operation, but the data change involves an UNASSIGNED variable. The method further includes modifying the SQL statement when the SQL statement involves an UNASSIGNED variable in a predicate clause, allowing the SQL statement to properly execute.

Abstract: A method for searching for data files stored in a mobile device is provided. The method includes accessing a memory including a plurality of data files, wherein each of the data files includes a file information field containing a character string. The method also includes retrieving, directly from the data files, at least a first part of the file information field associated with the data files. The method also includes presenting the at least first part of the file information field via a display. The method also includes determining a first diverging character position among the character strings in the presented at least first part of the file information field associated with each of the data files. The method also includes receiving, via an input device, an input corresponding to at least one symbol. The method also includes comparing the at least one symbol to each of the characters in the first diverging character position.