Abstract: The present invention provides a method and system for automatic objects classification. The method comprises: acquiring a set of objects; classifying the objects based on query log to generate a first classification result; classifying the objects based on ontological information to generate a second classification result; and semantically fusing the first and second classification results to generate a final classification result. According to the present invention, compared with the prior arts, by semantically fusing the query log-based classification result and the ontology-based classification result, the accuracy and user-friendness of the object classification can be improved.

Abstract: Techniques disclosed herein include systems and methods for indexing data events from a stream of data for seeking through recorded data streams. Techniques disclosed herein can enable a faster and more efficient process by which a processor can seek from one point of time in a data stream to another point of time in that data stream to bring a played-back application to a desired point in time. A playback manager analyzes data events within a series of data events, which are recorded in a linear data structure. The playback manager creates a hierarchical data structure for storing the data events to provide logically grouped storage of data events in addition to the linear data structure. The playback manager stores the data events in the hierarchical data structure based on type of data event and based on timestamps associated with each respective data event.

Abstract: A user preference information structure having a multiple hierarchical structure in which an information is provided to a user according to a user preference in a multi-media environment consisting of an information provider and an information user, comprising user use information by using information desired by the user; user preference information of information desired by the user; and individual user preference information that is differently set depending on situations in which the user is put and positioned in a sub-tree of the user preference information. The hierarchical data structure is able to provide the user preference for providing information desired by the user is provided depending on the environment, based on which various information can be provided.

Abstract: Various technologies and techniques are disclosed that improve data searching on mobile devices. A facet-based search application is provided that has a filter region, a results region, a facet navigation region, and a menu region. A user applies a facet-based filter to a set of data by selecting a number on a keypad or other area that correlates spatially to a filter option in the facet navigation region. A set of data in the results region is updated based on the applied facet-based filter. The user can also apply a freeform text filter to the data by selecting one or more characters for which to search. The data displayed in the results region is updated based on the applied freeform text filter. When input is received from the user to save the applied filter, an attribute label is displayed as a query term in the filter region.

Abstract: A method of visually representing pedigree data is provided. A root individual in a genealogical dataset is identified. A first parent and a second parent of the identified root individual are identified from the genealogical dataset. A third parent and a fourth parent of the identified first parent are identified from the genealogical dataset. A pedigree visualization relative to the identified root individual is presented which includes a root indicator, a first parent indicator, a second parent indicator, a third parent indicator, and a fourth parent indicator.

Abstract: The present invention provides a technique for supporting accurate and smooth creation of a report. Information in which elements belonging to items included in a plurality of items of elements constructing a report are associated with each other between the items is stored in an input support database. Partial information corresponding to an extraction condition designated by an input from an input client by the user is extracted from the input support database and visually output (displayed) in a view in a report creating area.

Abstract: Systems, methods, and other embodiments associated with graph query adaptation are described. One example method includes generating an adapted topological query from a base topological query. The adapted topological query may be generated upon detecting a pre-specified sub-graph in the base topological query. The example method may also include executing the adapted topological query on a stored graph to generate a query result.

Abstract: A storage system comprises a plurality of vdisks, with each vdisk containing a plurality of storage segments, and each segment providing a specific class of service (CoS). Each vdisk stores files with data and meta data distributed among its storage segments. A storage system comprises a memory having multiple classes of service. The system comprises an interface for storing a file as blocks of data associated with a class of service in the memory. The interface chooses the class of service for a block on a block by block basis. A file system for storing a file comprises a plurality of vdisks, with each vdisk having a plurality of inodes. Each inode of each vdisk stores data on one or more segments, with each segment having a different class of service. The system comprises a controller which stores data of a file in an inode of a vdisk, in one or more segments of that vdisk. A file system for storing a file comprises a plurality of vdisks, and each vdisk having a plurality of inodes.

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: Some embodiments provide a system for processing relationship data that expresses relationship between various entities. In some embodiments, the entities are entities associated directly with an enterprise. The entities in some embodiments described below also include entities associated indirectly with the enterprise through other entities. In some embodiments, the system consolidates disparate relationship data sets that relate to the same set of entities. For instance, in some embodiments, the system includes several data storages that store relationship data. For at least two entities, at least two different data storages store two different relationship data sets that differently express the relationship between the two entities. The system includes a hierarchy manager that receives the two different relationship data sets and consolidates the two different relationship data sets into one relationship data set that best expresses the relationship between the two entities.

Abstract: A method, system, method and computer program product for retrieving data. Records are retrieved from a hierarchical database. The records are categorized into a plurality of record types. Each record comprises a unique identifier field. A record map contains zero or more entries. Each entry comprises an identifying value, data from at least one record and a set of Boolean flags. Each flag corresponds to a record type. A computer iterates over the retrieved records. Data from each record is stored at an entry in the record map having an identifying value equal to the value included in the unique identifier field of the record. Moreover, the flag in this entry which corresponds to the record type of the record is set. Inner joins and outer joins are then performed using the contents of the record map.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for providing an interface for using a web service on an external server device. A first tree structure used for using the web service is stored. A request message calling up a web service is generated in response to having received access to a request node in the first tree structure. The request node is used for accessing the web service corresponding to the request node. The request message is sent to the server device providing the web service. A response message, including a result of having executed the web service from the server device, is received. The result of the web service execution is reflected in a response node in the first tree structure for storing the result of the web service.

Abstract: A metadata file can be automatically generated based on a database instance and a user defined maximum depth. The relationships between data objects that constitute a business object may be visualized in a tree. The maximum depth limits the number of levels in the tree to traverse. A metadata file describes the structure of a business object and relationships between sets of data objects that constitute the business object. The structure defined in the metadata file can be used to export instances of the business object from the database. The exported business object instances can be imported to another database.

Abstract: An attribute presenter of object attributes from at least one object includes an attribute controller for determining which attributes to select; an attribute collector for collecting and normalizing the determined attributes from the at least one object; an attribute organizer for organizing the collected and normalized attributes for display; and an attribute viewer for displaying the organized object attributes. A method for presenting object attributes using an attribute presenter includes the steps of determining which object attributes to select using an attribute controller; collecting and normalizing the determined object attributes from at least one object using an attribute collector; organizing the collected and normalized object attributes for display by an attribute organizer; and displaying the organized object attributes by an attribute viewer.

Abstract: An interface unit adapted for connecting at least one database to at least one of a plurality of high availability cluster servers (HA cluster servers), wherein each database is adapted to execute a set of database-specific commands and wherein each HA cluster server is adapted to output a set of HA cluster server-specific commands. The interface unit may comprise a first interface layer adapted for receiving each of the set of HA cluster server-specific commands outputted by the HA cluster servers; and a second interface layer adapted for sending each of the set of database-specific commands to the respective databases. The interface unit may be further adapted to map each of the HA cluster server-specific commands to at least one of the database-specific commands.

Abstract: A method and a device transport a postal object to an incompletely specified destination address. The object has at least one information item relating to a destination address to which the object is to be transported. A set of address components is predetermined. An address database is used which in each case contains a computer-available record per destination address for a set of possible destination addresses. Each record contains in each case one entry for each predetermined address component. At least one destination address information item on the object is detected. A screen form is used which contains in each case one input field for each address component. The detected destination address information is compared with the records of the address database. When exactly one record is consistent with all detected destination address information items, a transportation of the object to the destination address of the record is triggered.

Abstract: The present invention aims to facilitate integration of databases by classifying a plurality of tables in databases into a group of similar tables. A table classification device 1 includes a semantic classifying unit 20 carrying out classification with considering meanings of columns which form a database and a statistical classifying unit 30 carrying out classification based on statistical information of the columns. The tables are classified hierarchically by combining a classification method of the semantic classifying unit 20 and a classification method of the statistical classifying unit 30.

Abstract: A serverless distributed file system manages the storage of files and directories using one or more directory groups. The directories may be managed using Byzantine-fault-tolerant groups, whereas files are managed without using Byzantine-fault-tolerant groups. Additionally, the file system may employ a hierarchical namespace to store files. Furthermore, the directory group may employ a plurality of locks to control access to objects (e.g., files and directories) in each directory.

Abstract: A system and method of identifying relational patterns across a plurality of databases using a data structure and the data structure itself. The data structure including one or more data node branches, each of the one or more data node branches including one or more data nodes, each of the one or more data nodes representing a data item of interest and corresponding data item support values for the data item across the plurality of databases in relation to other data items represented in the data node branch. The data structure can be used to mine one or more relational patterns considering pattern support data across the plurality of databases at the same time.

Abstract: A system for retrieving information units from a data structure. The system includes a search engine and an on-screen user interface. The data structure includes a dictionary file having keywords related to each other by a hierarchy, wherein each information unit is associated with a keyword. The user interface provides a text input zone to define a search and a user control to order the search engine to perform the search depending on the contents of the text input zone. The user interface also provides a first on-screen list display zone for showing results of the search performed by the search engine and a second list display zone for showing the results from the hierarchy related to the results shown in the first display zone.

Abstract: A method and system for correlating input data that includes configuration data. The configuration data describes at least one hierarchy including a first hierarchy. Each hierarchy includes at least two nodes. Each node includes a value and is designated as an ontology end point consisting of a unique positive integer. For each hierarchy, a unique relationship number RN is stored in a medium for each pair of parent-child nodes of each hierarchy. RN is a function of X and Y which respectively denote the ontology end point of the parent and child node of each pair of parent-child nodes. Responsive to a query that identifies a measure of correlation between the first hierarchy and other information, the measure of correlation is computed by retrieving and utilizing each stored relationship number of the first hierarchy. Information relating to the measure of correlation is outputted.

Abstract: A method for encoding XML tree data that includes the step of encoding the semi-structured data into strings of arbitrary length in a way that maintains non-structural and structural information about the XML data, and enables indexing the encoded XML data in a way that facilitates efficient search and browsing.

Abstract: A system and method for classifying and defining relationships between product information data is provided. The method classifies the product information data to two different data types. Each data type includes a plurality of items. The items of each of the two types are arranged in a product information tree. The items of all the product information trees are associated to construct a new tree for showing the relationships of the product information data.

Abstract: Systems and methods that create and edit a network of interconnected concepts are disclosed. In one embodiment, a semantic engine implements a method comprising receiving a primary term representing a first concept to be added to a network of interrelated concepts, receiving at least one related term related to the primary term, receiving at least one relationship between the first concept and a second concept, receiving a strength value associated with the relationship, and adding the first concept to the network.

Abstract: A computer based method for the preservation of a digital information in a data set includes receiving a data set to be preserved, the data set including a plurality of preservation objects; creating a fixity table, the fixity table including one or more data types corresponding to preservation data types contained in the preservation objects, each data type being assigned an importance rank and one or more fixity function; for each preservation object, creating a Merkle tree corresponding to the preservation object and based on the fixity table.

Abstract: A system and method are disclosed for merging manual parameters with predefined parameters. The system includes a parse module configured to receive a command string having multiple nested manual parameters and a build module configured to generate a parameter tree having manual parameter nodes and predefined parameter nodes. The system may also include a search module configured to compare manual parameter nodes to predefined parameter nodes to identify matching parameter contexts, and a command module configured to generate a command string. The method includes receiving a command string having multiple nested manual parameters, identifying manual parameters within the command string, and generating a parameter tree having manual parameter nodes and predefined parameter nodes. The method also includes comparing manual parameter nodes to predefined parameter nodes to identify parameter nodes having a matching parameter context, and generating a command string.

Abstract: In one embodiment, a system and method is provided for reverse lookups using a reverse lookup hint stored in metadata associated with a file or directory. The reverse lookup hint is used to retrieve an entry, comprising a name of the file or directory, which is stored in a map structure related to a parent directory of the file or directory. In an embodiment, the reverse lookup hint comprises a hash value generated from the name of the file or directory.

Abstract: A method, system and program product are disclosed for enabling a user to construct a conceptual hierarchical framework representing a virtual or physical environment. The framework may then be populated with a collection of items. Users may graphically and intuitively view and manipulate various subsets of the environment's space as well as items placed within the modeled environment.

Abstract: This disclosure describes, generally, tools for navigation of tree structures. For example, a software application comprising a user interface for allowing a user to navigate a tree structure is described. The user interface comprises a graphical element including the tree structure. The tree structure comprises multiple nodes which represent a hierarchical view of data within the structure. One of the nodes is set as the active node. The computer software application also includes a storage element to store a list of previous active nodes. The graphical element is in conjunction with a first navigational element configured to step backward through the list of previous active nodes, and to set the stepped to node as the active node. The graphical element is further in conjunction with a second navigational element configured to step forward through the list of previous active nodes, and to set the stepped to node as the active node.

Abstract: This invention provides a system and method for managing backup and restore operations on a storage system, typically between source storage system and destination storage system using a backup management client that employs a version of the Network Data Management Protocol to interface with the destination file server and generate an “index” of data structures (such as directories and files) from directly from scanning the trees of PCPIs stored on the destination. The management client includes a command line interface for entry of instructions by a user or application and a web-based user interface and allows the index to be displayed as a series of web pages on a graphical user interface. The index can be browsed and selected data structures can be restored to a source filer/file server as desired. All back-ups/PCPIs can be contemporaneously browsed, allowing greater flexibility in selecting a best backup image to restore.

Abstract: Configuration spaces facilitate the useful presentation of data, particularly configuration data used for representing configured products. Products include features and common features can be grouped by families. For example, an automobile can include a transmission family. The transmission family could include features such as automatic transmission and 4-speed manual transmission. Configuration spaces can be achieved by consolidating selected data without loosing useful information. The degree of consolidation achieved can be significant enough to permit display of data using conventional display technology. Configuration spaces break down the “universe” of possible configurations into constituent spaces defined by groups of rules for a selected feature. Common dependencies between the selected feature and related features can be consolidated to produce a more minimal form of the data used for representing the selected features and related features.

Abstract: A data retrieving apparatus having: an input apparatus for inputting the hierarchical structure data showing the hierarchical structure and operation instruction data; a data storing apparatus for storing the inputted hierarchical structure data; a retrieving apparatus for retrieving data which satisfies conditions from the hierarchical structure data stored in the data storing apparatus on the basis of the operation instruction data which is inputted by the input apparatus; and an output apparatus for outputting the retrieved data. Each data which is stored in the data storing apparatus has items regarding an efficient date and items regarding a data change date. The retrieving apparatus has an apparatus for retrieving the data on the basis of the efficient date and the data change date.

Abstract: Embodiments include methods and systems for processing XML documents. One embodiment is a system that includes a method of efficiently processing XML documents received concurrently from a plurality of network connections in the form of streams of data. Other embodiments include systems configured to perform such processing of streamed XML documents. Other embodiments include systems and methods of efficiently performing document processing using digests for identifying XML document structure.

Abstract: The location of a drawing of an activity, a property of an element in the drawing and the structural relationship of elements in the drawing are stored in a database. The database is accessed to form a user interface that provides a hierarchical representation of activities and the elements within activities.

Abstract: A database management system has a plurality of database servers and data can be transferred between them by partitioning a data area into small areas and altering allocation of the small areas to the database servers. After altering the configuration, there occurs degradation in processing speed that accompanies re-creation of the index. If this problem is solved by using conventional techniques, noticeable degradation in processing speed will occur to a specific query at the time of a steady state operation. Accordingly, an index created for each of the small areas and an index to all of the small areas are allocated to the database server and used in combination.

Abstract: A method and system for determining the contribution of a document within a hierarchy of documents based on the contribution of descendant documents is provided. The contribution system provides a hierarchy of documents that specifies the ancestor/descendant relations between documents. For each document of a hierarchy, the contribution system determines the contribution of each document factoring in the contribution of descendant documents. The contribution may be the relevance of a document to a topic, a feature of a document, and so on.

Abstract: A computer system including a processor and a memory unit containing instructions that when executed by the processor implement 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, resulting in a processed DDD/processed DOM which is structured to allow program access to data in a more direct manner.

Abstract: A method and system of computer-assisted business resource automation that is applicable to a variety of business enterprise requirements including, but not limited to customer relationship management and sales force automation. The system provides improved an apparatus and method for automating the production of business resources such as documents and presentations. The system further provides an apparatus and method for analyzing the associated processes of the enterprise and providing business intelligence such as sales analytics. In particular, aspects of the invention include, but are not limited to: a hierarchical architecture that simplifies customization and maintenance of enterprise software, the encapsulation of data within reusable intelligent advisor objects, and the flexible integration of a variety of expert systems functionality and other apparatus and means of artificial intelligence therein.

Abstract: A computer program product comprising computer readable program configured to implement 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 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 computer program product and associated algorithm for sorting S sequences of binary bits. The S sequences may be integers, floating point numbers, or character strings. The algorithm is executed by a processor of a computer system. Each sequence includes contiguous fields of bits. The algorithm executes program code at nodes of a linked execution structure in a sequential order with respect to the nodes. The algorithm executes a masking of the contiguous fields of the S sequences in accordance with a mask whose content is keyed to the field being masked. The sequential order of execution of the nodes is a function of an ordering of masking results of the masking. Each sequence, or a pointer to each sequence, is outputted to an array in the memory device whenever the masking places the sequence in a leaf node of the nodal linked execution structure.

Abstract: A method and system for analyzing and categorizing unstructured information and for tracking trends and exceptions by using a user's selection of a key concept, wherein the key concept is one or more words or phrases present in the content of an unstructured object that represent an unstructured object.

Abstract: A method to convert data between a relational format and an XML document, by creating a set of XML Mapping Definition from metadata; selecting relational data from a relational application database, and converting the relational data to the XML document using the set of XML Mapping Definition.

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: A set of programs is disclosed comprising a web display interface program (WIP), a Display Configuration Program (DCP) and a Sequence Logging Program (SLP). Responsive to user actions, the set of programs provide instructions to a server connected to storage containing a facet tree database and a rules database. The WIP comprises a user interface and a set of servlets that read the facet element to be displayed from the facet tree database, and based upon the user characteristics, acquire the appropriate display rules for the user from the rules database. The DCP allows an administrator to select or configure rules that will establish views for different end users that are tailored to those particular end users. The SLP allows end users to navigate through a set of facets using a standard faceted search, or using a previously constructed sequence of facets, and logs the user choices for later use.

Abstract: Methods and apparatus, including computer program products, for providing a data structure, embodied in a computer-readable medium, implementing a tree of nodes having inner nodes and leaf nodes, and performing a scan of the data structure to identify an entry that satisfies a search criterion. Each leaf node includes a key having a first value representing a starting point of an interval, a second value representing an ending point of an interval, and a third value representing a duration of an interval. Each inner node is a root node of a subtree. Each inner node includes a key having a first value representing a minimum of the starting points of intervals in the corresponding subtree, a second value representing a maximum of the ending points of the intervals in the corresponding subtree, and a third value representing a maximum duration of the intervals in the corresponding subtree.

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: Disclosed herein is an apparatus for processing information about a network including a plurality of nodes, wherein m attributes (m represents an integer of 2 or more) assignable to each of the nodes are defined depending on the relationship to another node which can be connected to the each of the nodes, the apparatus including: identifier generating means for converting attributes assigned to each of n nodes (n represents an integer of 3 or more) per relationship to the other node connected thereto into numerical values with respect to motifs extracted from the network as predetermined patterns of the connected relationship of the n nodes, and generating identifiers identifying the motifs using the numerical values.

Abstract: Methods, systems, and computer readable medium for displaying results of a search query. In one implementation, the method includes receiving a query, obtaining documents that satisfy the query, constructing a facet hierarchy based on documents that satisfy the query, creating a cube structure based on the facet hierarchy, and displaying a multi-dimensional search interface based on the cube structure.

Abstract: A system and method are disclosed for Common Information Model (CIM) management clients to predetermine a data provider's support for localization, select an available locale implementation, and receive the provider's indications and responses in the selected locale. A registered locale class is added to the CIM schema for instantiating predetermined locales within an Interop namespace and a referenced locale class is added to associate registered locale class instances to a registered profile class. Instances of the registered locale class are created by a CIM data provider in the Interop namespace for each supported locale. Element Conforms To Profile (ECTP) association classes are then implemented to create associations between registered locale classes with top level scoping classes and their corresponding locale namespace. The top level scoping class comprising its associated locale namespace is then established as the locale implemented by the data provider.