Abstract: A method and system for automatically defining and provisioning organizational data in a unified messaging (UM) platform are disclosed. An adapter in a unified messaging platform connects to at least one client human resources database. Human resources information that is organized in an organizational hierarchy is retrieved from the human resources database, and hierarchical organizational data is automatically generated in the UM platform based on the organizational hierarchy of the human resources information retrieved from the human resources database. UM mailboxes are provisioned to messaging centers in the UM platform based on the hierarchical organizational data.

Abstract: Embodiments herein include systems, methods, software, and data structures to generate and render visualizations of configuration items (CIs) represented in a Configuration Management Database (CMDB). One embodiment includes receiving a request for a CI graph from a client including a focus CI identifier represented in a CMDB. The focus CI may be used to retrieve data of related CIs, the data including CI identifiers. A process is then executed for each retrieved CI identifier to retrieve CI data as a function of the received CI identifier and to build a node XML and an edge XML representation of relations between the CIs. This method also includes aggregating the node and edge XML representations into a single XML document and then translating the document into a markup language document capable of being rendered in a graphical user interface. The markup language document is then transmitted to the requestor.

Abstract: Linking data objects, such as video objects, image objects, and audio objects, and displaying data associated with the data objects based upon the strength of the relationship between the data objects. Navigating a data collection of data objects by linking groups of data objects based upon related metadata is also disclosed. A user interface including the data associated with the grouped data objects facilitates browsing the data collection of data objects.

Abstract: Embodiments of the invention provide methods, systems, and articles of manufacture improving the process of query composition, query processing, and presenting query results to users of an abstract database. Embodiments of the present invention organize and view data using abstract records. Specifically, users compose a query according to the logical relationships present in the data. Rather than evaluate conditions against a set of rows from a relational table, conditions included in abstract query are evaluated against instances of an abstract record. Instances that satisfy the conditions specified by an abstract query are returned as query results. In a specific case abstract records are used to evaluate a “never exists conditions, that determine the absence of data in an abstract records that satisfy a particular condition.

Abstract: A system and a method for the deferral and incremental performance of integrity processing for data rolled into a table of a data warehouse and for the deferral and incremental performance of maintenance on data rolled out of a table of the data warehouse while permitting general users online access to other data contained in the table. The rolled in and rolled out data are contained within specific data partitions of the table. Each data partition in the table has an associated distinguishable partition ID. Each data partition can also have associated attributes corresponding to containing rolled-in and rolled-out data respectively. Table operation mechanisms are arranged such that general users of the table do not access rolled in data in a partition for which integrity processing has not yet been performed and do not access rolled out data.

Abstract: Implementing application specific management policies on a content addressed storage device is disclosed. In one embodiment, each data object stored on the content addressed storage device is associated with one of a plurality of data sets. A corresponding data set specific management policy is associated with at least each of a subset of said plurality of data sets. The applicable data set specific management policy is applied to the data objects of each data set with which a corresponding data set specific management policy has been associated.

Abstract: A new sub-document versioning method for record storages of XML documents which uses virtual cutting points to ensure that a search tree is able to support multiple versions of sub-documents and provide efficient mechanisms for XML updating. Record boundaries and virtual cut points divide the two-dimensional space, the horizontal axis representing node identifiers in document order and vertical axis representing version numbers, into rectangles. The bottom corner of the rectangle is used to represent the rectangles and the corresponding information of the corner is added to the search tree index.

Abstract: A provider of content may provide access to portions of content from a source, but not the source content in its entirety. In some embodiments, one or more access rules or criteria may be implemented that enable users to access portions of the source content up to an allowed limit or threshold (e.g., number or percentage of pages), after which access is prevented to the remaining content that has not previously been accessed. In other embodiments, one or more access rules or criteria may be implemented that enable users to access portions of content of only a certain type (e.g., index, bibliography, introduction, certain chapters, etc.). Unauthorized portions are suppressed or access to them is denied. The content source may be a textual work, an audio work, or a video work of any form. For example, the content may be in electronic form, such as images of pages of content.

Abstract: Systems, methods and computer products for generating calculation context classes from a relationship between structured data and a calculation procedure, the context classes having parent-child relationships. Exemplary embodiments include a method including searching the calculation procedure for a first data definition, generating a first context from a first scope applied to the first data definition, tracing back the calculation procedure to obtain a second data definition for calculating the first data definition and to which the first scope is applied, copying the calculation procedure into the first context until the second data definition is obtained, obtaining a second scope applied to the second data definition, obtaining a second context generated from the second scope, determining an existence of an order comparison of the first scope with the second scope and obtaining order from the structured data.

Abstract: A method and apparatus for the on-demand allocation of segments and creation of metadata for previously-created data storage spaces and partitions are provided. A space is created in a database. As part of this creation process, no segment is allocated for the space. Rather, metadata describing the space sufficiently to allocate the segment in the future is created and maintained by the database. Data is received indicating a new item. Based on the metadata, it is determined that the new item pertains to the space. In response to the determination, a segment is allocated for the space. Additional metadata necessary for normal database operations in relation to the space and newly-allocated segment may also be created at this time. The new item can then be stored in the space.

Abstract: Methods for using task-related information to enhance digital searching are provided. A task-oriented user activity system maintains task-related information about resources accessed by a user and current user task. This task-related information is used to enhance search results by filtering and ranking results to increase relevance with respect to a user's current task. The task-related information can also be used to include task-related metadata in search engine index, e.g., by storing the metadata in the index or by storing it in resources which are subsequently indexed. Task-related information can also be used to enhance search results by enhancing search queries to include task-related search criteria.

Abstract: A method and apparatus for fast similarity-based query, self-join, and join for massive, high-dimension datasets have been disclosed.

Abstract: Methods for using task-related information to enhance digital searching are provided. A task-oriented user activity system maintains task-related information about resources accessed by a user and current user task. This task-related information is used to include task-related metadata in search engine index, e.g., by storing the metadata in the index or by storing it in resources which are subsequently indexed. Task-related information can also be used to enhance search results by filtering and ranking results to increase relevance with respect to a user's current task and/or to enhance search queries to include task-related search criteria.

Abstract: Embodiments of the invention relate to manipulating the original content of at least one original read-only computer file in a file-system of a computer system, where the computer system includes an operating system including a framework for in-line monitoring of accesses to the file-system. An exemplary embodiment, includes transforming the original content via a non-length-preserving data transformation algorithm, thereby resulting in transformed content, storing the transformed content in a transformed computer file, splitting the transformed computer tile into a first file and a second file, and associating the first file with the second file in the file-system. The non-length-preserving data transformation algorithm includes a length-increasing data transformation algorithm.

Abstract: A method and apparatus for preserving optimization hints in a transformed query is provided. In one embodiment, the methodology is implemented by query optimization logic. Upon receiving a first query to access values in a column of a table protected by an access control policy, the query optimization logic creates a second query that is equivalent to the first query as subject to the access control policy. Furthermore, the second query contains a new predicate that conjunctively joins a clone of a first expression in a predicate of the first query with a second expression that is derived, based on the access control policy, from the first expression. In one embodiment, the query optimization logic submits the second query for execution.

Abstract: Data having express or implied relationships may be displayed by selecting a starting entity in a data structure, building a relationship tree, and building and optimizing a relationship matrix based on the relationship tree. The optimized relationship matrix may be used to layout and render a graphical image that positions various elements with respect to the starting entity based on the relationships. The distance matrix may be optimized by creating a first distance matrix based on the relationship tree, developing a dissimilarity matrix based on expressed or implied relationships, and multiplying the dissimilarity matrix by a weighting factor to determine a distance matrix that may be optimized by multi-dimensional scaling. An optimized weighting factor may be determined and used to select an optimized distance matrix.

Abstract: Continuous data protection is performed as two parallel processes: copying a data block from the storage device into the backup storage device (creating initial backup) and copying the data block to be written to the data storage into the incremental backup. When a write command is directed to a data storage block, it's intercepted and redirected to the backup storage, and data, which is to be written in accord to the write request, is written to the incremental backup on the backup storage. If write command is also directed to a data storage block identified for backup that has not yet been backed up, the identified data storage block is copied from the storage device to the intermediate storage device, the write command is executed on the identified data storage block from the storage device, and the data storage block is copied from the intermediate storage device to the backup storage device. In case of an error accessing a block on the storage device, the block is marked as invalid.

Abstract: A method for non-text-based identification of a selected item of stored music. The first broad portion of the method focuses on building a music identification database. That process requires capturing a tag of the selected musical item, and processing the tag to develop reference key to the same. Then the tag is stored, together with the reference key and an association to the stored music. The database is built by collecting a multiplicity of tags. The second broad portion of the method is retrieving a desired item of stored music from the database. That process calls for capturing a query tag from a user, and processing the query tag to develop a query key to the same. The query tag is compared to reference keys stored in the database to identify the desired item of stored music.

Abstract: A technique discriminates important contents and less important contents and prevents a situation where folders are occupied by less important contents to make it impossible to register important contents from taking place. A mobile printing server comprises a personal important folder 2 that stores data, a personal non-important folder 3 that stores data, a data allocation section 5 that stores received data either in the personal important folder 2 or in the personal non-important folder 3 according to an allocation rule and a management section 7 that manages the data stored in the personal important holder 2 and the data stored in the personal non-important folder 3 according to the management rules provided for the respective folders.

Abstract: A mechanism is disclosed for enabling new task types to be added to a management server without changing the source code of the management server. To add a new task type, a descriptor file is provided. This descriptor file specifies all of the particulars of the new task type. Any mechanisms referred to in the descriptor file are also provided. At startup time, the management server processes the descriptor file and forms associations between the various aspects of the task type with the mechanisms that are responsible for implementing those various aspects. At runtime, these associations are used to manage the definition and execution of tasks of that task type. By doing so, the management server enables new task types to be added, and enables task instances of the new task types to be defined and executed, without changing the source code of the management server.