Abstract: Implementations of various technologies and techniques for method for selecting an interesting attribute combination aggregation. In one implementation, an attribute combination aggregation may be generated. One or more values in the attribute combination aggregation may be statistically analyzed. The attribute combination aggregation may be determined as interesting based on the statistical analysis. The interesting attribute combination aggregation may then be stored.

Abstract: A system includes storage configured to store file system entities, including directories and files, residing in segments of a distributed, segmented single file system, file servers configured to implement the single file system with separate ones of the file servers controlling metadata of separate ones of the segments, and a controller configured to control storage of files in the file system such that for a master file stored in a first segment, a first replica of the master file will be stored in a second segment that is physically separate from the first segment, the controller being further configured to control storage of directories in the file system such that a single directory will include identifiers for the master file and the first replica.

Abstract: Embodiments of the present inversion relate to a two-pass compression scheme that achieves compression performance on par with existing methods while admitting individual message decompression. These methods provide both storage savings and lower end-user latency. They preserve the advantages of standard text compression in exploiting short-range similarities in data, while introducing a second step to take advantage of long-range similarities often present in certain types of structured data, e.g. email archival files.

Abstract: Techniques for partitioning indexes are provided. A predefined data type associated with a column of a database table is acquired. Column value statistics for the column are acquired. The values are analyzed to produce multiple partitions for the values. Each partition includes each of the values and each partition includes multiple groupings of the values. Also, each grouping of a particular partition includes a subset or range of the values. Furthermore, each grouping of a partition includes a same distribution for the values as other groupings of that partition. Each partition represents a potential partitioning index for the column and its values.

Abstract: The invention relates to a method for automatically comparing search profiles. According to the method, a search profile is compared with one or several offered profiles that are stored in a database. The individual profiles are subdivided in to data fields, in which the information to be compared is saved. Different types of data fields are provided within each profile and the individual profiles have the same structure. During the comparison of a search profile with an offered profile, at least two different types of data fields comprising different comparison functions are compared. A final comparison value is calculated from the interim comparison values that are obtained in this way. According to the inventive method, different comparison functions are thus used for the different types of data fields. This allows a substantially more individual comparison of information than can be obtained using conventional method.

Abstract: Methods, systems and articles of manufacture are provided for migrating entity relationship data residing in an object oriented program environment to a relational database schema. Further, functionality is provided to facilitate more efficient searching and reconstruction of the entity relationship data in the relational database.

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: Systems and methods may manage webpages in a set of webpages. The set of webpages may include webpages in an intranet and/or an extranet of an enterprise. Queries may be performed on the webpages and a list of results determined based at least in part on query terms and webpage scores. Webpage scores may be based on ratings of webpages and/or metrics of change. A metric of change of a webpage may be based at least in part on changes in text, images, and/or ratings of the webpage.

Abstract: A method and apparatus is disclosed that receives an input narrative in a particular media format, and produces therefrom a multimedia enriched version of the input narrative. In one embodiment, a method is provided for enriching an input narrative with multimedia content, wherein the method includes the step of selectively segmenting the input narrative to form queries pertaining to different portions or elements of the input narrative. The method further comprises retrieving multimedia artifacts from one or more multimedia repositories, wherein each retrieved multimedia artifact is associated with one of the queries, and selecting a subset of the retrieved multimedia artifacts, wherein the subset includes artifacts comprising different types of multimedia content. The input narrative is then combined with respective multimedia artifacts of the subset, in order to provide an enriched and enhanced narrative.

Abstract: Described herein are processes and devices that control and use virtual universe wish lists. One of the devices described is a virtual wish list device. The virtual wish list device determines an item in a virtual universe that is a desired by an avatar. The virtual wish list device designates the item as a desired item in a wish list. The wish list may be stored in the avatar's virtual universe inventory. The wish list device determines details about the desired item, such as whether the item is desired in the virtual universe or in the real world. The wish list device stores the details about the desired item in the wish list. The virtual wish list device may use the details to conduct transactions related to the desired item.

Abstract: A method and system is provided for automatically displaying a search-refinement user interface based on structure identified in search results in response to unstructured search queries. A list of search results obtained by a search engine is analyzed to determined whether a structure threshold is satisfied. If the threshold is met, then search-refinement options are displayed on a common display with the search results to allow the user to filter the search results according to the structure identified in the results. The user interface can receive filter and sort requests from the user to further refine the search results based on overlapping schema attributes or other shared-structure elements identified in the search results.

Abstract: A partitioning system that provides a fast, simple and flexible method for partitioning a dataset. The process, executed within a computer system, retrieves product and sales data from a data store. Data items are selected and sorted by a data attribute of interest to a user and a distribution curve is determined for the selected data and data attribute. The total length of the distribution curve is calculated, and then the curve is divided into k equal pieces, where k is the number of the partitions. The selected data is thereafter partitioned into k groups corresponding to the curve divisions.

Abstract: The concept of portioning is expanded with a variety of techniques. In particular, one technique involves partitioning an object at multiple levels, where at least one of the levels uses list-based partitioning. Further, a partitioning technique is provided which involves storing a data item in a default partition when the item does not map to any one of the list-based partitions for which a key value group has been defined. Techniques are also provided for efficiently splitting a partition.

Abstract: A method for forming a visual plot using a hierarchical structure of a dataset. The dataset comprises a measure and a dimension. The dimension consists of a plurality of levels. The plurality of levels form a dimension hierarchy. The visual plot is constructed based on a specification. A first level from the plurality of levels is represented by a first component of the visual plot. A second level from the plurality of levels is represented by a second component of the visual plot. The dataset is queried to retrieve data in accordance with the specification. The data includes all or a portion of the dimension and all or a portion of the measure. The visual plot is populated with the retrieved data in accordance with the specification.

Abstract: The present invention generally is directed to a system, method and article of manufacture for generating a reusable query component. The reusable query component may include one or more query conditions and may be used to facilitate building a database query including the one or more query conditions. Reusable query components may also include reusable query subcomponents, each including one or more query conditions. The query subcomponents may be statically or dynamically linked to the reusable query component.

Abstract: A method for embedding metadata into a media file (100) comprises providing (204) a metadata schema file (204) and a metadata instance file (206). Providing a media file having a binary capable user field. Then compressing (208) the metadata schema by a first compression method; and assembling (210) the compressed metadata schema fragments. Also, compressing (212) the metadata instance file and assembling (210) the compressed metadata instance fragments. Setting a media file header (214) or footer to indicate binary data payload. The method further comprises appending (216) a data start label to the assembled metadata schema and the assembled metadata instance and inserting (218) the assembled metadata schema and the metadata instance into the binary capable user field of the media file.

Abstract: A database management protocol exchanges update tokens between a client and a server on which the database resides. When a client requests data to be read from a database, an update manager either reads an update token stored therein or generates one dynamically. The update token represents a current state of the data object being read. Sometime thereafter, if the client requests new data to be stored in the object, the client may furnish the update token back to the update manager. The update manager compares the client's update token to a local update token representing a current state of the database and, if they match, determines that the state has not changed. If they do not match, an error results.

Abstract: Methods, systems, and data structures for communicating object metadata are provided. A generic metadata container is presented that allows object metadata to be described in an extensible manner using protocol-neutral and platform-independent methodologies. A metadata scope refers to a dynamic universe of targets to which the included metadata statements correspond. Metadata properties provide a mechanism to describe the metadata itself, and metadata security can be used to ensure authentic metadata is sent and received. Mechanisms are also provided to allow refinement and replacement of metadata statements. The generic metadata container can be adapted to dynamically define access control rights to a range of objects by a range of users, including granted and denied access rights.

Abstract: A distributed search system including a group of nodes assigned to different partitions, each partition storing a partial index for a group of documents. At least one of the nodes receives a search request from a user, sends the search request to a set of nodes, receives partial results from the set of nodes and creates a combined result from the partial results. The combined result includes results from a node in each partition.

Abstract: A system and method for effectively implementing a personal channel for interactive television comprises a personal channel manager that may include a configuration module, a search module, and a content packaging module. A system user may utilize the configuration module to perform a personal channel configuration procedure to specify personal channel configuration data for performing a content record search procedure. The search module may manage the content record search procedure according to one or more search parameters that may be defined during the personal channel configuration procedure. The search module may selectively locate and access one or more content records from one or more remote content databases during the foregoing content record search procedure.