Abstract: It is a purpose of this invention to achieve Scale-Out of the distributed database system that assumes a real-time update to be a requirement and which is achieved by dividing the database system into two or more database domains. This is to achieve handling of even larger scale databases while providing even higher performance. Assuming that the large-scale database system has been distributed to two or more of above-mentioned data base domains, in multi transaction processing with real-time update of the database object across two or more of above-mentioned database domain, this invention is achieved by executing the above-mentioned multi transaction processing to the database meta information storage management part in the database meta information management repository device by applying partition topology technology or replication topology technology for exchange and synchronization of meta information such as status information etc. at even higher speeds.

Abstract: Methods and apparatus, including computer program products, for compression of tables based on occurrence of values. In general, a number representing an amount of occurrences of a frequently occurring value in a group of adjacent rows of a column is generated, a vector representing whether the frequently occurring value exists in a row of the column is generated, and the number and the vector are stored to enable searches of the data represented by the number and the vector. The vector may omit a portion representing the group of adjacent rows. The values may be dictionary-based compression values representing business data such as business objects. The compression may be performed in-memory, in parallel, to improve memory utilization, network bandwidth consumption, and processing performance.

Abstract: Multiple atomic “component” database transactions are combined into a single extended transaction through message passing. The multiple component transactions that comprise a single extended transaction may, in combination, perform a single computation. The component transactions may pass messages to each other by writing and reading records to and from one or more databases. The resulting extended transaction may be distributed and/or long-lived.

Abstract: Some embodiments of zero knowledge attribute storage and retrieval have been presented. In one embodiment, the content of a piece of data is encrypted at a client machine. Further, an identifier of the piece of data is hashed at the client machine. The encrypted content and the hashed identifier may be stored in a database maintained by a server without disclosing the content of the data to the server.

Abstract: The present invention is directed towards systems, methods and computer program products for controlling a user history module. According to one embodiment, a method for controlling a user history module comprises providing a history module to a user, the history module comprising a plurality of search queries and a plurality of selected search results, and monitoring user interaction with the user search history panel. A predetermined operation is performed on the history module in response to a user interaction.

Abstract: Objects, such as documents, are classified according to a taxonomy. The taxonomy includes nodes, corresponding to object classes, arranged in a hierarchy. Class keywords are associated with the nodes. Search strings are formed for the classes by traversing the taxonomic branches and concatenating the keywords associated with the classes. For each object to be classified, a search engine is used to perform searches on the object using the search strings. The searches produce search scores for each search string. Each object is classified by identifying the class(es) corresponding to the highest search score(s) for the object, and classifying the object into the identified class(es).

Abstract: In a method and apparatus for analyzing nodes of a Deterministic Finite Automata (DFA), an accessibility ranking, based on a DFA graph geometrical configuration, may be determined in order to determine cacheable portions of the DFA graph in order to reduce the number of external memory accesses. A walker process may be configured to walk the graph in a graph cache as well as main memory. The graph may be generated in a manner allowing each arc to include information if the node it is pointing to is stored in the graph cache or in main memory. The walker may use this information to determine whether or not to access the next arc in the graph cache or in main memory.

Abstract: A system is provided for specifying arbitrary nodes and identifying a section between them on a system diagram of a distribution system. It comprises a system diagram information management portion for managing information on each of nodes and spans constituting the system diagram and ID information given to each of the nodes, an input portion for receiving an input specifying the nodes, a search portion for creating a search condition using the ID information based on the node specification and searching the span between the specified nodes so as to identify the section constituted by the searched span, and an output portion for display-outputting the system diagram visually indicating the section identified by the search portion.

Abstract: Methods and apparatus, including computer program products, for compression of tables based on occurrence of values. In general, a number representing an amount of occurrences of a frequently occurring value in a group of adjacent rows of a column is generated, a vector representing whether the frequently occurring value exists in a row of the column is generated, and the number and the vector are stored to enable searches of the data represented by the number and the vector. The vector may omit a portion representing the group of adjacent rows. The values may be dictionary-based compression values representing business data such as business objects. The compression may be performed in-memory, in parallel, to improve memory utilization, network bandwidth consumption, and processing performance.

Abstract: To recover deleted files in a data store, candidate blocks of the data store may be identified and, for each of the candidate blocks, a probability that the candidate block contains a directory entry may be determined. Directory entry metadata for candidate blocks that have a determined probability that is greater than a predetermined probability threshold may then be extracted.

Abstract: Embodiments of the disclosure relate generally to file systems. Specifically, certain embodiments include systems and methods for reading objects in a file system. In some embodiments, a first processing thread traverses a portion of a file system and represents file system objects in a data structure. A portion of the data and/or metadata associated with the represented objects may be prefetched to a memory. In some embodiments, a second processing thread consumes the objects represented in the queue. For example, in a file system backup embodiment, the second processing thread may transfer data and/or metadata associated with the objects to an archive target.

Abstract: A retrieval information that is a retrieval target, acquired from an information source, is arranged on a vector space. Data of a usage information and a content specifying manners of usage, used by the user in the past is acquired by a usage-information acquisition unit. A user's preference extraction unit extracts a preference of a user from the data, and notifies a number-of-effective-elements reduction unit of the extracted data. The number-of-effective-elements reduction unit evaluates each element of a vector of retrieval information by using the preference of the user, and reduces the number of effective elements by removing the elements smaller than a certain criteria.

Abstract: An information processing apparatus which may include acquisition means for acquiring meta-data of a content; morphological analyzing means for performing morphological analysis on text information included in the meta-data of the content; comparison means for comparing a morphological analysis result of the morphological analyzing means and a plurality of list patterns of predetermined performer names; and when there is a list pattern of predetermined performer names having matched at least one part or more out of the morphological analysis result on the basis of the comparison result of the comparison means, first extraction means for extracting a performer name with the list pattern of the matched predetermined performer name.

Abstract: The subject disclosure pertains to systems and methods that facilitate monitoring of data collections and related data retrieval systems as well as generating recommendations for enhancing performance and utility of such systems. In aspects, the systems and methods described herein evaluate data retrieval performance by identifying unsuccessful search queries and mapping such queries to appropriate content in a data collection. To facilitate such evaluation, similar queries can be grouped and treated as equivalent. Similarity of queries can be determined based upon search terms. For example, queries whose search terms only vary syntactically can be combined in a group. Such groups can include search information related to multiple users, increasing reliability of recommendations based upon such groups. In further aspects, recommendations for adding content can be generated in conjunction with any mapping recommendations.

Abstract: The invention regards a system (10) and method for managing BLOBs. The system combines a file subsystem (20) and a database subsystem (30), wherein the database subsystem (30) comprises relations between file names of files (40) comprising a BLOB (50) and BLOB names. In the event of modification of a file (40) containing a BLOB (50), a new file, having a new file name, is created, where a relation between the new file name and the BLOB name is created within a database transaction in the database subsystem (30). By thus extending the ACID-properties of database transactions to files, it is ensured that operations on BLOBs in the system (10) meet the ACID-requirements while keeping the efficiency of operations on files.

Abstract: Converting from a database system to another database system. The conversion process including translating a set of queries for the first database to be used in the second database by determining the query types of the parent and child queries and generating the translated queries according to the type of the query. The type of the query judged as the stored-procedure or the dummy type, irrespective of the existence of a parent query, the function type query after conversion other than the same stored-procedure type query after conversion of the function are generated in all cases. As a result problem is not occurred even when there is a parent.

Abstract: Aspects of the subject matter described herein relate enforcing quotas in transactional file systems. In aspects, a filter monitors operations that may affect quota usage/charge of a file system object having a quota allotment. In doing so, the filter determines a quota value outside of any transaction for the object and a quota value associated with at least one transaction affecting the object. The filter receives a request that involves the use of additional quota. The filter then determines whether to allow or fail the request depending on whether enough quota is available to satisfy the request.

Abstract: A method and system of an e-learning authorship based on meta-tagged media specific learning objects are disclosed. In one embodiment, a method includes searching for learning objects in a repository based on a content query data publishing the learning objects to a content management system through applying a meta-data describing a context to the learning objects to such that the learning objects become readily accessible based on a search of the context and generating a set of executable files based on the learning objects and a number of auxiliary files associated with the set of executable files to create an e-learning course of a specific media type. In addition, the method may include comparing a context query data and the meta-data of the each of the learning objects to perform a context search which is used to select a subset of the learning object matching the context query data.

Abstract: Multiple atomic “component” database transactions are combined into a single extended transaction through message passing. The multiple component transactions that comprise a single extended transaction may, in combination, perform a single computation. The component transactions may pass messages to each other by writing and reading records to and from one or more databases. The resulting extended transaction may be distributed and/or long-lived.

Abstract: A snapshot-aware secure delete event identifying a file for snapshot-aware secure deletion on a computer system is received, and the file to be deleted is identified from the snapshot-aware secure delete event. Each file snapshot associated with the file on the computer system is accessed at the volume level and each non-duplicate file extent of the file snapshots is identified. The raw data identified by each non-duplicate file extent is securely overwritten using a secure overwrite technique, and each file snapshot is deleted from the computer system. In this way the raw data of the file and the raw data of all the diff areas of file snapshots associated with the file are securely overwritten and deleted.