Abstract: A method and system are described for generating consolidation groups. An example method includes obtaining a plurality of data type indicators of data types, wherein each data type indicator is associated with a hierarchical subtype of the data type; generating a first subtype indicator of a first hierarchical subtype associated with a first data type indicator in a first hierarchical subtype relationship; generating a first parent list including one or more representations of one or more of the data types associated with the first hierarchical subtype; generating a second subtype indicator of a second hierarchical subtype associated with a second data type indicator in a second hierarchical subtype relationship; generating a second parent list including a representation of one of the plurality of data types associated with the second hierarchical subtype; and generating a first consolidation group based on combining the first subtype indicator with the second subtype indicator.

Abstract: An information processing apparatus that has an identification unit for identifying categories to which contents belong among predetermined categories based on metadata indicating the details of the contents. The processing apparatus also includes a clustering unit for classifying a group of contents into clusters by performing clustering processing with respect to the group of contents belonging to the categories based on the metadata.

Abstract: Techniques for partitioning nested tables are provided. A parent table includes a column for collection items. A nested table is created for storing items that belong to the collection items. The nested table is partitioned to create a plurality of nested table partitions. Each nested table partition is a distinct, separately stored structure within a database. How the nested table is partitioned may, or may not, be based on how the parent table is partitioned. For example, a nested table may be partitioned based on the same criteria in which the parent table is partitioned. As another example, a nested table may be partitioned, whereas the parent table is not partitioned.

Abstract: A method, article of manufacture, and apparatus for tracking a plurality of objects being stored are disclosed. In an embodiment, this comprises determining an application associated with the objects being stored, selecting a hint or longest pathname containing the plurality of objects, and storing the selection in the index. The hint may be generated by concatenating at least a portion of a name of each object being stored into the hint, concatenating hash values of the names of the objects, or producing a bitmap of hash values of the names of the objects, depending on available space. In an embodiment, each hint generation may be tried in succession based on determining whether the previous hint fits into the space available for storing the hint.

Abstract: The present invention is directed to a system, method and computer program for automatically extracting and mining relations and related entities from unstructured text. A method in accordance with an embodiment of the invention includes: extracting relations and related entities from unstructured text data, representing the extracted information into a graph, and manipulating the resulting graph to gain more insight into the information it contains. The extraction of relations and related entities is performed first by automatically inducting pattern and second by applying these induced patterns to unstructured text data. For each relation and entity, several features are extracted in order to build a graph whose nodes are entities and edges are relations.

Abstract: There is disclosed a method, apparatus and computer program product for generating a queriable text. User role map information is applied to the source hierarchical text. The role mapped text is separated into a structure component and a content component. The content component is compressed. A method for processing intermediate and original form query also is disclosed.

Abstract: A method of answering a query includes deconstructing documents into path segments. Identical path segments from different documents are arranged contiguously to form a set of partitions, where each partition has identical path segments. The structure of a query is then analyzed to find a match with a document. Based upon the analysis, a sub-set of partitions is selected for searching. Content from the query is compared to content within the sub-set of partitions to identify matched content. The matched content has associated structural attributes. The matched content structural attributes are compared to the structure of the query to identify an answer to the query.

Abstract: Systems, methods, computer program code, and means are provided for processing retrieve requests received in a business software system. Pursuant to some embodiments, a retrieve request is processed by identifying that the requested node is a retrieve transformation node, determining that the node relates to one of a currently selected business object and a secondary business object, and retrieving the node data from one of a persistence buffer and a secondary buffer based on the determining.

Abstract: A method in a data processing system of searching a plurality of electronic files identified by filenames in a first hierarchical file structure that is on a recordable medium of the data processing system. A user-defined metalabel is assigned to each of the electronic files. The electronic files are organized as a function of the metalabels into a second hierarchical file structure existing simultaneously with the first hierarchical file structure on the recordable medium of the data processing system. A search query is received from a user and the metalabels of the second hierarchical file structure are searched as a function of the query. Each electronic file having a metalabel matching the query is returned to the user as a search result.

Abstract: A visualization graph is provided on a computer by storing data corresponding to a plurality of entities having a particular type, wherein a semantic net includes the entities and wherein the entities are linked to each other by a plurality of relations. The visualization graph is provided in response to a query with respect to an entity selected from the plurality of entities, wherein the visualization graph includes a plurality of sectors representing the results of the query. Entities are allocated to a predetermined sector of the graph depending on their entity type.

Abstract: The subject invention relates to systems and methods that augment node-based programming languages to facilitate efficient data manipulation of hierarchical data structures. In one aspect, a query or general purpose language system is provided. The system includes a query component to interact with hierarchical node-based data collections and a language extension component to augment the query component to facilitate interactions with the node-based data collections. The language extension component supplies various functions to filter the data collections at a granular level, re-shape the data collections, sort the data collections, or extend the data collections with computed nodes.

Abstract: A computer-readable storage medium having a data structure for representing a plurality of objects. The data structure includes a first data field storing data associated with a taxonomy type. The data structure also includes a second data field storing data associated with a reference to a model instance of an object classified by the taxonomy type. The model instance identifies an entity represented by the classified object. A third data field stores a first data set having data stored in the second data field. The first data set identifies a set of one or more objects related to the classified object positioned higher in a hierarchical structure than the classified object. A fourth data field stores a second data set having data stored in the second data field. The second data set identifies a set of one or more objects related to the classified object positioned lower than classified object.

Abstract: A semiconductor package with a heat dissipating structure is provided. The heat dissipating structure includes a flat portion, and a plurality of support portions formed at edge corners of the flat portion for supporting the flat portion above a chip mounted on a substrate. The support portions are mounted at predetermined area on the substrate without interfering with arrangement of the chip and bonding wires that electrically connect the chip to the substrate. The support portions are arranged to form a space embraced by adjacent supports and the flat portion, so as to allow the bonding wires to pass through the space to reach area on the substrate outside coverage of the heat dissipating structure; besides, passive components or other electronic components can be mounted on the substrate at area within or outside the coverage of the heat dissipating structure, thereby improving flexibility in component arrangement in the semiconductor package.