Abstract: Techniques are provided for (2) extending SQL to support direct invocation of frequent itemset operations, (3) improving the performance of frequent itemset operations by clustering itemset combinations to more efficiently use previously produced results, and (4) making on-the-fly selection of the occurrence counting technique to use during each phase of a multiple phase frequent itemset operation. When directly invoked in an SQL statement, a frequent itemset operation may receive input from results of operations specified in the SQL statement, and provide its results directly to other operations specified in the SQL statement. By clustering itemset combinations, resources may be used more efficiently by retaining intermediate information as long as it is useful, and then discarding it to free up volatile memory.

Abstract: An approach is provided for converting a polygon described as an ordered list of perimeter points into a set of connected quadrilaterals suitable for use in an advanced integrated circuit router. Edges are constructed between the points of the polygon. Then, one or more edges are selected as starting locations. Pairs of edges or portions of pairs of edges are matched to form sequences of quadrilaterals. Methods are provided to determine when edges should be split or skipped to ensure that all quadrilaterals are convex or meet other criteria. Other methods are provided to determine when the matching process should be terminated and restarted at another location. Finally, the sequences of quadrilaterals are joined together to form a data structure suitable for use within an integrated circuit router.

Abstract: A method and apparatus for plan-based compliance score computation is provided. Compliance-specific target results are stored. The compliance results include, for each target, a subset of target-specific compliance results for a rule subset of compliance rules. Each target-specific compliance result of the result subset includes a compliance value. The compliance value represents compliance to a compliance rule of the rule subset. An execution plan is generated. The execution plan generates data that measures compliance to a first compliance standard. For each target-specific compliance result, an execution plan step is generated for computing the compliance value of the respective compliance rule of the respective target.

Abstract: Quantized energy values are accessed to initially represent a temporally related group of content elements in a media sequence. The values are accessed over a matrix of regions into which the initial representation is partitioned. The initial representation may be downsampled and/or cropped from the content. A basis vector set is estimated in a dimensional space from the values. The initial representation is transformed into a subsequent representation, which is in another dimensional space. The subsequent representation projects the initial representation, based on the basis vectors. The subsequent representation reliably corresponds to the media content portion over a change in a geometric orientation thereof. Repeated for other media content portions of the group, subsequent representations of the first and other portions are averaged or transformed over time. The averaged/transformed values reliably correspond to the content portion over speed changes.

Abstract: A project management system manages project schedule data using separate current and historical task schedule data structures. In general, current schedule data is stored separately from historical schedule data, so that the current schedule data may be retrieved separately from the historical task schedule data. The project management system may also maintain unscheduled tasks as “to-do lists.” Tasks may be added to a member's schedule without specifying any planned dates and the tasks are added to the database. The tasks have an associated revision number of 0 to indicate that the tasks were added, but not yet scheduled. The tasks are displayed in the member schedule editor and in Web page schedules. The tasks may then be displayed in the member schedule editor and in Web page schedules in a manner that allows a user to readily determine that the tasks are “to-do list” tasks.

Abstract: Methods for transforming a query to remove redundant tables and eliminate superfluous join operations is provided. The methods provided transform queries to remove redundant tables and anti-joins, semi-joins, and outer-joins. Whether a table is redundant is determined based on a set of criteria which, if fulfilled, indicates that the removal of the table and the anti-join, semi-join, or outer-join operation does not impact query results. The removal of a redundant table from a query also results in the elimination of the anti-join, semi-join, or outer-join operation that references the removed table.

Abstract: A method and apparatus for verifying that a user is the owner of a public listing is provided. The user selects an option to claim ownership of the public listing offered by an online service provider. The online service provider uses information regarding the user and the public listing to generate a verification code. The online service provider delivers the verification code to the owner of the public listing via the contact information provided by the public listing. If the user owns the public listing, the user receives the verification code via contact information associated with the public listing. The user verifies ownership by inputting a code to the online service provider. If the inputted code matches the verification code, then the online service provider identifies the user as the owner of the listing. Once verified, the user modifies the listing.

Abstract: A conflict resolution mechanism collects statistical data regarding how much time certain common actions or waits take. For example, the mechanism may collect statistics on disk I/O for each disk device. Statistics may include the average access time, for example. Such statistics may be collected over a sliding window of time. With the statistical data that the mechanism collects, the mechanism can make a more intelligent judgment regarding whether a process is in a “hanging” condition. For example, if the average I/O to a disk is 10 seconds for the past hour, and if a process is doing disk I/O to that disk for 5 seconds, then the mechanism will not yet determine that the process is hanging. In order to determine whether the process is hanging, the mechanism looks at the average time and the longest time for the particular actions that the process is performing.

Abstract: A method and apparatus is provided for efficiently searching and navigating XML data stored in a relational database. When storing a collection of XML documents, certain scalar elements may be shredded and stored in a relational table, whereas unstructured data may be stored as a CLOB or BLOB column. The approach includes identifying a reference address to within an XML tree index entry and storing the address in an xmltable index. The tree index entry allows for navigation in all axes. A path-based expression may be evaluated in the context of the reference address of the LOB. The result of the evaluation identifies another XML tree index entry containing a LOB locator used to retrieve the content from the document. The tree index, node index, and secondary function indexes are used together to enhance the performance of querying the XML data.

Abstract: Techniques for compressing branch nodes in an index are provided. The branch nodes may be part of a main index of a multi-level index that also includes one or more journal indexes. A Bloom filter may be generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node.

Abstract: Systems, methods, and other embodiments associated with processing secure network traffic are described. One example method includes determining whether a device is a preconfigured member of a group key system. If the device is not a preconfigured member then the method selectively establishes membership in the group key system by requesting membership from a group controller. The example method may also include receiving a set of keys from the group controller and being assigned a role by the group controller. The method may further include processing secure network traffic as an inspection point, a rewriting point, and/or a validation point based on the received set of keys and the assigned role(s).

Abstract: A compact binary encoding technique for information that is logically hierarchically structured, such as XML data, maintains all of the features of XML data in a useable form, such as the hierarchical structure underlying the data. Hence, data encoded in this format can undergo XML-based processing on-the-fly as it is being received or fetched, as if the data was being processed linearly in its textual character-based format. Processing of data encoded in this format can begin without having to wait for and decode the entire data set. The overhead due to XML tags is significantly minimized. The encoded data can be processed more efficiently because the data is pre-parsed. Values may be stored in their native type formats and, therefore, processing of the encoded data avoids costly type conversions. Further, any available structural constraint information can be effectively exploited.

Abstract: XML schema evolutions can be performed on an XML-type database using partial data copy techniques. The partial data copy techniques provide mechanisms to identify a minimal set of data in the database that needs be copied out in order for schema evolution operations to occur. Identifying the minimal set of data involves comparing an existing XML schema to a new XML schema and determining the differences between the two schemas. Based on those differences, a minimal set of data can be determined. That data can then be copied to a temporary storage location, while the XML schema and its associated database structure are updated to conform to the new XML schema. Then, the minimal set of data is copied back into the modified database structure.

Abstract: A method comprises receiving one or more digital visual media items; receiving one or more digital audio media items; automatically selecting and arranging one or more design modules based upon analysis of information obtained from the digital visual media items and the digital audio media items; and automatically creating an audiovisual work by arranging the selected and arranged design modules. Audiovisual works can be automatically created based upon inferred and implicit metadata including music genre, image captions, song structure, image focal points, as well as user-supplied data such as text tags, emphasis flags, groupings, and preferred video style.

Abstract: A data storage management and scheduling system schedules the recording, storing, and deleting of television and Web page program material on a client system storage medium. A schedule of time versus available storage space is generated that is optimal for the viewer's scheduled program recordings. The programs include television broadcast programs and Universal Resource Locators (URLs). A program is recorded if at all times between when the recording would be initiated and when it expires, sufficient space is available to hold it. All scheduling conflicts are resolved as early as possible.

Abstract: A forward interpolation approach is disclosed for enabling a second version of an image to be constructed from a first version of the image. According to one implementation, pixels from the first version of the image are mapped to pixels in the second version of the image, and pixel values are determined for the corresponding pixels in the second version of the image. In one implementation, the pixel mapping is performed using a lookup table and linear approximation. Performing the pixel mapping in this manner enables computations to be simplified and cost and gate count to be reduced.

Abstract: Data storage and message processing using an encoded hash message authentication code is described. In one embodiment, a data processing apparatus comprises one or more processors; logic coupled to the one or more processors for execution and which, when executed by the one or more processors, causes receiving a data set at the one or more processors; creating and storing a hash output value by applying the data set to a collision-resistant hash operation that provides the hash output value as output; encoding the hash output value using a uniquely invertible keyed pseudo-random permutation operation based on a first shared key, to result in creating an encoded authentication code; and associating the encoded authentication code with the data set.

Abstract: A search engine stores different taxonomies that each specifies categories and relationships between the categories. When the search engine receives a request having a search query, the search engine determines which taxonomy, if any, it should use to generate a search engine results page. The search engine bases this determination upon information provided to it in the request, in one embodiment. For example, the search engine might select a taxonomy based on the particular environment from which the search query originated. However, the search engine can select the taxonomy based on other information, such as a role of the user. Thus, a medical researcher and a financial analyst for a particular corporation could receive search engine results pages that were generated with appropriate taxonomies for each of them.

Abstract: Techniques are provided for analyzing performance differences for a set of database query language statements on two different database systems. The performance analysis is based on quantitative measurements and estimates of the execution of the set of database query language statements on the two different database systems. This performance analysis process may be used by database administrators to predict impacts to performance due to a change in a database system.

Abstract: A method for validating the layout of webpages comprises receiving a webpage, transforming the webpage into a color-coded page, and determining based at least in part on detecting a color on the color-coded page that a layout of the webpage contains an error. The transforming can comprise identifying a block of content in the webpage, identifying a size and a location of the block, creating a new block with the size and the location of the block, and assigning a new color to the new block. The determining can comprise storing an image snapshot of the color-coded page and comparing the image snapshot to a reference image.