Abstract: A deterministic UDF processing mechanism processes user-defined functions (UDFs) using multiple hash tables. Data access patterns for a UDF are collected, and an appropriate hash table set is then determined for the UDF from the data access patterns. If a UDF accesses some similar columns and some disjoint columns, the similar columns are grouped together, and one or more hash tables are allocated to the similar columns. Disjoint columns are allocated their own hash tables. In addition, the allocation of hash tables may be adjusted based on historical access patterns collected over time. By dynamically allocating and adjusting sets of hash tables to a deterministic UDF, the performance of the UDF is greatly increased.

Abstract: An XML schema is compiled into an annotated automaton encoding, which includes a parsing table for structural information and annotation for type information. The representation is extended to include a mapping from schema types to states in a parsing table. To validate a fragment against a schema type, it is necessary simply to determine the state corresponding to the schema type, and start the validation process from that state. When the process returns to the state, fragment validation has reached successful completion. This approach is more efficient than a general tree representation. Only the data representation of the schema information is handled, making it much easier than manipulating validation parser code generated by a parser generator. In addition, only one representation is needed for schema information for both document and fragment validation. This approach also provides a basis for incremental validation after update.

Abstract: An apparatus and program product monitors performance of a computer system via a result size including a result set size of accesses to a database and a page size. Preferred embodiments are directed to a performance monitor that correlates data from existing tools that report data concerning access to the database and the use of system resources. Other embodiments are directed to a performance monitor that is included in an application server associated with the database.

Abstract: There is described a method for operating an automation system, in which automation-specific data is filed in a database, an access to the data taking place using a database interface, all access to the data taking place via one and the same database interface and when an access to the database takes place, a datum to which the access relates is identified by a unique reference, in which on the datum identified via the reference a buffer is formed or used and a status of the datum is backed up in the buffer.

Abstract: An apparatus and program product monitor performance of a computer system via a result size including a result set size of accesses to a database and a page size. Preferred embodiments are directed to a performance monitor that correlates data from existing tools that report data concerning access to the database and the use of system resources. Other embodiments are directed to a performance monitor that is included in an application server associated with the database.

Abstract: A system analysis program which can accurately analyze the operational status of a system without modifying functions of the system for providing services. A message analysis unit analyzes the contents of collected messages, and determines the times of occurrence of the messages, the process types requested by the messages, and whether or not each of the messages is a request message or a response message. In response to an instruction for model generation, a model generation unit generates a transaction model satisfying at least one limiting condition related to caller-called relationships between processes, based on a set of messages selected in accordance with a selection criterion based on the certainty of existence of caller-called relationships. Then, in response to an instruction for analysis, an analysis unit analyzes the processing status of a transaction based on a protocol log conforming to the transaction model.

Abstract: A system and method facilitating asset composition based, at least in part, upon metadata (e.g., asset specification) describing compositional property(ies) of the asset(s) is provided. Asset specification(s) (e.g., metadata) that describe asset(s) to efficiently search and/or match asset(s) are employed. The system can facilitate matching (e.g., automatically) the particular software component to available server(s). Thus, the system can provide a flexible manner of describing asset(s) and an efficient way of locating matching description(s).

Abstract: A method, system, and computer program product are provided for identifying data objects related to temporal characteristics. A first data object that has been previously stored is identified. The first data object has one or more associated temporal characteristics. At least one associated temporal characteristic is extracted from the first data object, thus, forming at least one extracted temporal characteristic. The at least one associated temporal characteristic is extracted in order to perform a search for at least one second data object. A search is performed for at least one second data object based on the at least one extracted temporal characteristic. The results of the search are presented in a graphical user interface.

Abstract: Methods and apparatus, including computer program products, implementing techniques for retrieving a first version copy of a first stock content item from a first content hosting server storing a plurality of stock content items, each item having one or more stock content versions, each item having a content identifier that uniquely identifies the item at the first content hosting server; adding identifier metadata to the first version copy, the identifier metadata including the content identifier of the first stock content item, and storing the first version copy with the added metadata as a first designer copy in a designer storage for later use in a designer system; and in connection with a user interaction with the designer system involving the first designer copy, using the identifier metadata from the first designer copy to retrieve a second version copy of the first item from the first content hosting server.

Abstract: An apparatus and method for monitoring the performance of a computer system via an result size including a result set size of accesses to a database and a page size. Preferred embodiments are directed to a performance monitor that correlates data from existing tools that report data concerning access to the database and the use of system resources. Other embodiments are directed to a performance monitor that is included in an application server associated with the database.

Abstract: Methods and systems for efficient file replication are provided. In some embodiments, one or more coarse signatures for blocks in a base file are compared with those coarse signatures for blocks of a revised file, until a match is found. A fine signature is then generated for the matching block of the revised file and compared to a fine signature of the base file. Thus, fine signatures are not computed unless a coarse signature match has been found, thereby minimizing unneeded time-consuming fine signature calculations. Methods are also provided for determining whether to initiate a delta file generation algorithm, or whether to utilize a more efficient replication method, based upon system and/or file parameters. In accordance with additional embodiments, the lengths of valid data on physical blocks are obtained from physical block mappings for the files, and these lengths and mappings are utilized for delta file generation, to minimize unnecessary signature computations.

Abstract: An electronic device provide a database application that enables a user to access personal data organized as a plurality of entries in a database, where each of the plurality of entries is associated with a different person and has one or more alphanumeric text fields and an image field. According to one embodiment, a camera control application is arranged to enable the user to control the device using a user input device to capture an image via a digital camera and to present a user selectable option, after capturing an image, for using the captured image as an image field of an entry of the database. According to another embodiment, a messaging application is arranged to display a received message including an image and to present a user selectable option for using the image as an image field of an entry of the database.

Abstract: An initial distribution list is dynamically modified using criteria determined from the current entries in the list. After an originator generates a distribution list and prior to submission of the message to entries on the generated list, the method of the present invention examines the entries in the created distribution list. From this list, the invention identifies features of the entries. From these features, the method generates criteria that can be used to generate additional entries that may be included in the list. In one approach, the generated criteria are presented to the user for review and approval. If the originator approves the criteria, the generated list is modified to add additional entries to the distribution based on the generated criteria. If the originator rejects the criteria, the initially generated list is submitted and the message is sent to the entries on the initial list.

Abstract: A method of accessing a shareable computer file includes receiving a request to access the shareable computer file, retrieving a file ID from a stub file corresponding to the shareable computer file, retrieving a file name from a database corresponding to the file ID, accessing the shareable computer file if a user has not modified the shareable computer file, and accessing a modified copy of the shareable file stored in the stub file if the user has modified the shareable computer file. A database is generated in operating system space or accessed using the operating system, and includes file IDs and their corresponding file names for shareable computer files. The stub file is generated locally to correspond to the shareable computer file, and includes a modified copy of the shareable computer file if the shareable computer file has been modified, and a link to the shareable computer file if the shareable computer file has not been modified.

Abstract: Techniques are provided for responding to the termination of a node by selecting another node, and assigning to the selected node the affinity relationships that existed between the terminated node and one or more objects. The resources that belong to the objects involved in the affinity relationships are remastered to the selected node. The selected node then performs recovery of the resources that had been opened by the terminated node and/or serves as a failover node to execute the transactions that had been executing on the terminated node.

Abstract: A method and computer-readable medium are provided for formula-based document retention. According to the method, a retention formula and a retention action are defined for one or more items. The retention formula is utilized to calculate a retention date for each item. The retention action specifies the action that should be taken on or after the retention date. The retention date for one or more items is initially calculated using the retention formula for the items. A retention service may be periodically executed to identify any items having a retention date earlier than the current date. If any items are identified that have a retention date earlier than the current date, the retention service recalculates the retention date for these items utilizing the corresponding retention formula. If the recalculated retention date for any item is still prior to the current date, the retention action for the item is executed.

Abstract: The present system aggregates information from a plurality of different context sources. The present system also makes that aggregated information available to requesting components by abstracting it into a generalized form. Thus, the developer of a context-aware application need only know how to interact with the context service of the present invention, rather than knowing how to interact with each and every one of the context sources.

Abstract: Systems and methods for category-based search are described. In one described system, a computer program identifies an article having an attribute, determines a category associated with the article based at least in part on the article attribute, and stores in a data store a data record comprising a category-article pair identifier associated with the category and the article. A search query is received and executed on a data store comprising the association data record. In response, the association data record is received from the data store. Search results may be constructed and displayed using the association data record.

Abstract: A query phrase may be automatically classified to one or more topics of interest (e.g., categories) to assist in routing the query phrase to one or more appropriate backend databases. A selectional preference query classification technique may be used to classify the query phrase based on a comparison between the query phrase and patterns of query phrases. Additionally, or alternatively, a combination of query classification techniques may be used to classify the query phrase. Topical classification of a query phrase also may be used to assist a search system in delivering auxiliary information to a user who entered the query phrase. Advertisements, for instance, may be tailored based on classification rather than query keywords.

Abstract: The described systems, methods and data structures are directed to ranking Web pages with hierarchical considerations. The hierarchical structures and the linking relationships of the World Wide Web are used to provide a page importance ranking for Web searches. The linking relationships are aggregated to a high level node at each of the hierarchical structures. A link graph analysis is performed on the aggregated linking relationships to determine the importance of each node. The importance of each node may be propagated to pages associated with that node. For each page, the importance of that page and the importance of the node associated with the page are used to calculate the page importance ranking.