Abstract: A computer implemented method, apparatus, and computer usable program code for managing a table space for a database. The table space is searched to find available free space in a set of partitions in the table space in response to receiving a request to insert a record into a database table in the database. A new partition is created for the table space based on a size for the new partition in response to determining free space is unavailable for the record in the set of partitions. The record is inserted into the new partition.

Abstract: A system, method, and apparatus are directed towards identifying adaptive length segments of redundant data for encoding a data structure. Initial boundaries are identified for an input matching segment within input data and for a candidate store matching segment in a synchronized store. The data prior to and after the boundaries are compared to identify matching data. As matching data is identified, at least one of the boundaries of the matching segments is revised. An encoded representation of the resulting input matching segment is then generated based in part on pointers and offsets into the synchronized store. A data structure is generated based on the encoded representation and unmatched portion, which is sent to a receiver. The receiver uses the data structure to extract matching data from the synchronized store, and together with the unmatched input data in the data structure, reconstruct the input data.

Abstract: Disclosed are a method of and system for managing plural files registries, for use with a computer operating system having a user/group management operation. The method comprises the steps of creating a plurality of files registries, and providing an administrator with access to each of said plurality of files registries independent of all of the others of said plurality of file registries. Preferably, this is done by inserting, for each of said plurality of files registries, a respective one instruction into the user/group management operation specifying a base directory path to said each of said plurality of files registries.

Abstract: Techniques for propagating product information from a central database to one or more remote systems using disparate formats and protocols. In an embodiment, the central database is polled at predetermined intervals to determine whether a change has been made to information pertaining to a product. If a change is identified, a data management server extracts, formats, and transmits the changed data from the central database to an appropriate remote system. An application adapter communicatively coupled with the remote system receives the changed data from the data management server and formats the changed data according to the remote system platform.

Abstract: A system and method of making unstructured data available to structured data analysis tools. The system includes middleware software that can be used in combination with structured data tools to perform analysis on both structured and unstructured data. Data can be read from a wide variety of unstructured sources. The data may then be transformed with commercial data transformation products that may, for example, extract individual pieces of data and determine relationships between the extracted data. The transformed data and relationships may then be passed through an extraction/transform/load (ETL) layer and placed in a structured schema. The structured schema may then be made available to commercial or proprietary structured data analysis tools.

Abstract: A system and method of making unstructured data available to structured data analysis tools. The system includes middleware software that can be used in combination with structured data tools to perform analysis on both structured and unstructured data. Data can be read from a wide variety of unstructured sources. The data may then be transformed with commercial data transformation products that may, for example, extract individual pieces of data and determine relationships between the extracted data. The transformed data and relationships may then be passed through an extraction/transform/load (ETL) layer and placed in a structured schema. The structured schema may then be made available to commercial or proprietary structured data analysis tools.

Abstract: Building a database from stored backup data images. In one aspect, an identification of a target image is received, the target image including a copy of a logical storage unit of data from a previous database and description information that describes the previous database. The target image holds a copy of a subset of the data of the previous database. A received list has at least one desired logical storage unit of data from the previous database to be included in a built database. The desired logical storage unit is restored from at least one stored data image to the built database using the description information in the target image. Other aspects include the target image being a database image, and the desired logical storage units of data being a subset of database data.

Abstract: A system(s) and/or method(s) that facilitate improving the relevance of search results through utilization of a query log. The relevance of the search results for a target query can be judged based on one or more queries in the log that are related to the target query temporally and/or lexically. The diversity of the top-ranked search results can be increased and/or decreased based on an iterative re-ranking process of the search result set.

Abstract: A method for allowing an information seeker to utilize affiliate group searching involving human searchers who are members of particular information affiliate groups. Each affiliate group has an area of expertise in which they are particularly skilled. In at least one embodiment, the method includes accepting designation of an affiliate group for providing information searching and presenting search results produced by a member of the affiliate group to an information seeker.

Abstract: A host computer system obtains a request for an aggregated view of content in a computer network corresponding to a criterion. The host computer system queries networked computer systems to identify data objects according to the criterion. Each responding computer system provides an identification set of specified data objects that are stored at the responding computer to the host computer systems. The host computer system merges the identification sets to form the aggregated view of content to a user. If a specified data object is replicated to networked computers, the host computer system provides one instance of the specified data object in the query result. Consequently, concurrent utilization of file synchronization and the aggregated view of data objects are facilitated. If a specified data object is stored at the host computer system, the host computer system blocks querying of networked computers about the specified data object.

Abstract: Techniques manage the presence of repeated constructs within a complex type at the time of schema registration. At registration, techniques detect repeated elements in the XML schema and analyze whether the repeated elements are from the same complex type. If so, techniques perform additional analysis to determine a minimal common ancestor. Within the context of a minimal common ancestor, techniques determine the maximum number of times an element may occur in the schema. In a choice content model, the largest maximum occurrence value is selected. In other content models, the maximum occurrence value is determined by adding together the occurrence values for the repeated elements. Then, when an object relational table is generated for the XML schema, the maximum number of times that an element appears in the schema is this value. Techniques retain the advantages of object relational storage, even after a schema evolution.

Abstract: Systems and methods are disclosed for managing a lock on an object dependent upon a nested LUW. The disclosed systems and methods may include registering a lock manager with an LUW manager responsible for managing a nested LUW on a buffer. The nested LUW may comprise an inner LUW and an outer LUW. The systems and method may further include locking an object affected by the inner LUW of the nested LUW. The LUW manager may transmit to the lock manager any events pertaining to the inner LUW. The lock manager may be operative to determine, based on the events pertaining to the LUW received from the LUW manager, whether the lock should be retained or released such that the status of the lock is consistent with the state of the nested LUW.

Abstract: A storage system for providing a preferable data access performance by performing controls considering database management system (DBMS) execution information or database process priorities, by acquiring static configurational information of a DBMS by means of a DBMS information acquisition and communication program, a DBMS information communication section, and a host information setting program; acquiring DBMS execution information by means of a query plan acquisition program, the DBMS information communication section, and a process performance management program; acquiring information on priorities of database processes given by the process performance management program; and storing them in disk I/O management information with process priorities, DBMS execution information, and DBMS data information, in which cache control section in a storage system control program controls a data cache by referring to the above information.

Abstract: Systems and methods that create persistence for an execution state via employing a logless component with persistent stateful functionality. The logless component is introduced as part of a runtime service that supplies transparent state persistence and automatic recovery for component based applications. Such logless component can avoid logging at a middle tier, and exploit logging that is already performed at a client side and/or various end point servers. The execution state can be re-created entirely via replay of the component execution, without the need to replicate the execution state or save the component's interactions in the middle tier.

Abstract: If content having an attribute different from that of content usually used by a user is selected, the present invention allows proper content recommendation in accordance with the selection. When notified from a control block of a selected piece of music, a short-term preference vector generation block gets music vector of that piece of music from a music vector storage block and stores obtained music vector into a short-term preference vector storage block as short-term preference vector. A recommendation block computes a difference between short-term preference vector and long-term preference vector and, by use of a weight based on the computed difference, determines a piece of music to be recommended to a user, thereby recommending the determined piece of music to the user.

Abstract: A method and system for projecting queries and images into a similarity space where queries are close to their relevant images is provided. A similarity space projection (“SSP”) system learns a query projection function and an image projection function based on training data. The query projection function projects the relevance of the most relevant words of a query into a similarity space and the image projection function projects the relevance to an image of the most relevant words of a query into the same similarity space so that queries and their relevant images are close in the similarity space. The SSP system can then identify images that are relevant to a target query and queries that are relevant to a target image using the projection functions.

Abstract: Systems, methods, and computer program products are provided for performing an authorization check for a user. In one implementation, a data processing system is provided that includes means for storing first data descriptive of at least one directed acyclic graph and for storing second data descriptive of an assignment of a user to a first node of the graph. The data processing system also includes means for receiving an access request of the user, the access request specifying a second node of the graph. Furthermore, the data processing system includes means for determining a least common ancestor of the first and second nodes of the graph and means for performing an authorization check adapted to grant authorization for the access request if the least common ancestor of the first and second nodes is the first node.

Abstract: A data read apparatus which, when reading data in a data region sequentially, consults information pieces indicative of positions of information pieces concerning files to identify a position of an information piece concerning a file corresponding to a data piece at a reading position, consults an information piece concerning the file at the identified position to calculate an output position in a temporary memory region to which the data is to be outputted, delivers the data read out of an area in the data region to the output position, decides whether files corresponding to outputted data are all present in the temporary memory region and delivers the files to a backup region in a unit of file when the presence of all files is determined.

Abstract: The present invention is directed to a system and method for the secure and correct deletion of data files from a data storage that bypasses the file system of an operating system. A secure erase service receives a secure erase request from a system interceptor component, which has intercepted a system call from an application. The system call interceptor component communicates with the secure erase service via an interprocess communication module. The secure erase service receives the secure erase request from the interprocess communication module and communicates the secure erase request to a secure erase library. Using the file information contained in the secure erase request, the secure erase library queries the file system of the data storage device to determine the location of data blocks containing the to be deleted data.

Abstract: Systems and methods are disclosed for recovering data. The disclosed systems and methods may include locating a central directory in a file archive. Furthermore, the disclosed systems and methods may include determining that a local header located in the file archive is authentic if at least one of a plurality of records in the local header match at least one of a corresponding record in the central directory. The local header may be located in the file archive using an offset specified in the central directory. Moreover, the disclosed systems and methods may include determining that the local header is valid and recovering item data associated with the local header if the local header is authentic and valid.