Abstract: A method of locating a storage device of a number of storage devices is provided. A request for a data item is received. The request includes a globally unique identifier (GUID) that is associated with a user. A start number is generated based on the GUID, and the storage device that stores the data item is located based on the start number. The data item is then read from the located storage device. Other techniques for locating a storage device are also described.

Abstract: A method for high-speed scheduling and arbitration of events for computing and networking is disclosed. The method includes the software and hardware implementation of a unique data structure, known as a pile, for scheduling and arbitration of events. According to the method, events are stored in loosely sorted order in piles, with the next event to be processed residing in the root node of the pile. The pipelining of the insertion and removal of events from the piles allows for simultaneous event removal and next event calculation. The method's inherent parallelisms thus allow for the automatic rescheduling of removed events for re-execution at a future time, also known as event swapping. The method executes in O(1) time.

Abstract: Described herein are various approaches that allow rules to be used to specify actions, that alleviate the complexity and burden of developing and maintaining rules in a rules-based messaging system, and that provide more efficient ways of evaluating rules. The approaches allow rules to specify user-defined transformation functions for transforming messages, to specify when and how to perform row migration, and to specify other types of actions. Rules are grouped into rule sets. Several types of rule sets, referred to as positive and negative rule sets, allow users to use rules that are less complex to develop and maintain. Rule sets are evaluated more efficiently by attempting to evaluate the rule set with less information than is needed to evaluate all the rules in the rule set. Also, the results of rules evaluations that are based on a set of values are cached for later retrieval.

Abstract: To efficiently retain data online, an instance of a data set may be generated. The instance may have a set of data fields with corresponding data values. The instance also may be searchable in response to a data selection request. Another instance may be generated, which also may have a set of data fields with corresponding data values, and which also may be searchable in response to a data selection request. The two instances may each use its own blueprint to normalize data, to perform searches and to return search results. Both of the instances may be stored online such that they are stored independently but are accessible jointly.

Abstract: In one embodiment, data is exchanged between a modeling application and an external application. A user initiates an export of model data from the modeling application, where the model data is descriptive of a model maintained in the modeling application. An export map is generated that captures an indication of each object in the model at the point in time of export of the model. Model data is passed to the external application. Subsequently, modified model data is received from the external application. The modified model data is compared with the export map to detect external modifications made by the external application. Limited portions of the model in the modeling application are updated to reflect the external modification, while intact portions of the model for which external modifications have not been detected are left intact.

Abstract: A server apparatus (1) includes a deletion information decision section (104) and a management information update section (105). The deletion information decision section (104) decides a file from among files of an AV content already stored in a storage section (202) of a receiving apparatus (2), the file to be decided being so deleted as to be prevented from being used in the receiving apparatus (2) when files constituting an AV content that is to be newly transmitted is stored in the storage section (202). The management information update section (105) transmits, to the receiving apparatus (2), management information including deletion information for specifying the file thus decided. The receiving apparatus (2) includes a deletion section (205) for deleting, from the storage section (202), the file specified by the deletion information of the management information received from the server apparatus (1).

Abstract: A method leverages the file format information used by a target application to convert a source dataset into an encoding usable by the target application without converting the source dataset before migration and without modifying the target application. The source data when on the source system has random portions of various data types that are encoded in a source encoding based on data type. The target application, which typically processes data encoded in a target encoding that is based on data type, is able to process the source data despite the source encoding using file format information and a modified compiler library.

Abstract: A new technique for accelerating the computational speed of a computer algorithm is provided. The inventive technique can be applied to video compression/decompression algorithms, optical character recognition algorithms, and digital camera zooming applications.

Abstract: A method, computer program product, and data processing system for efficiently diagnosing errors and inefficiencies in database application code are disclosed. According to a preferred embodiment, techniques of aspect-oriented programming (AOP) are used to instrument database application code to monitor the usage of database resources. Specifically, pointcuts are defined to intercept accesses of database resources. Advice code associated with these pointcuts is used to collect information about the usage of database resources and to detect certain errors, such as resource leaks, when they occur. In a preferred embodiment, the AspectJ aspect-oriented programming language/system is used to define the pointcuts and advice code.

Abstract: A system and method of selecting a package model are disclosed. A data structure of a plurality of package models and one or more attribute relationships may be stored. Each package model may have a plurality of package model attributes including at least a size and a style. Each attribute relationship may include an indication that one or more supplemental attributes are required if a constraint is satisfied. A user input that is descriptive of a desired package capability may be received. Using a semantic reasoner, the user input may be analyzed to determine one or more desired attributes. The data structure may be accessed to automatically determine whether a desired attribute satisfies a constraint for an attribute relationship. The one or more supplemental attributes required by the attribute relationship may be presented.

Abstract: A system is provided for tracking employee disclosure information and includes an employee database for storing employee status information. Also included is a previous disclosure database for storing any previous disclosures provided by the employee. Finally, a disclosure engine is included for determining disclosure requirements for the employee based on the employee status information. The disclosure engine also receives from the previous disclosure database the any previous disclosures provided by the employee for determining any additional disclosure required by the employee to satisfy the disclosure requirements. The disclosure engine also forwards to the employee a disclosure form for providing the additional disclosure.

Abstract: A method, system and computer program product for providing an integrated environment for processing business object documents (BODs). The integrated environment utilizes an IntelliBod system to employ standard business semantics while adapting modified business terms. Applications requesting integration, or mapping, map to common business semantics of the BODs, and the IntelliBOD system manages the business semantic (and technical) integration of the applications. IntelliBOD systems utilize JAVA environments to process requests, thereby reducing cost and space required to maintain general purpose middleware.

Abstract: Privacy in data mining of sparse high dimensional data records is preserved by transforming the data records into anonymized data records. This transformation involves creating a sketch-based private representation of each data record, each data record containing only a small number of non-zero attribute value in relation to the high dimensionality of the data records.

Abstract: A computer readable storage medium includes executable instructions to receive a relevancy parameter. The relevancy parameter is searched in a category ensemble including a set of categories, where the category ensemble overlies a dataset. A first order of the set of categories is created based on the relevancy of the relevancy parameter to each category in the set of categories, where the relevancy is a degree of match to the relevancy parameter. A second order of the set of categories is created based on the merit of each category to partition the dataset. The first order and the second order are combined into a final order, which is returned. A measure in the category ensemble is searched based on the relevancy parameter. The measure is returned as a selected measure, where the selected measure is a codomain of a visualization depicting a portion of the dataset.

Abstract: A method and system for updating both partition change track tables and non-partition track tables in a materialized view. A log-based incremental refresh is performed on the materialized view and a partition change tracking based refresh is performed on the materialized view. The dependency of the materialized view log for the partition change track base table is removed.

Abstract: A system and method for automatically transforming non-Unicode supporting files into Unicode supporting files via one or more reusable maps. The system comprises a reusable source type tree organized from a schema, wherein the schema is created from a file; and one or more reusable maps, structured to automatically map one or more rules onto the reusable source type tree to transform the reusable source type tree into a reusable target type tree. The method comprises determining a type of data to be supported; defining one or more rules to support the type of data; and applying the one or more rules automatically to a reusable source type tree to transform the reusable source type tree into a reusable target type tree.

Abstract: A method and apparatus for representing and controlling documents including rich text for Web based applications and browsers is provided so that editing of rich text can be facilitated within the browsers. The rich text is represented in a memory structure so that various formats may be flexibly maintained. Text, images, tables, links and the like are represented in the memory structure, which may be maintained in databases for eventual editing. A controller class and subsidiary classes represent the rich text and provide methods to convert html to the memory structure and back, representing the rich text in a relational database, retrieving the rich text from a relational database, and presenting the rich text for editing. A spell checking facility for the rich text is included.

Abstract: Prediction-based compression engines are spoon-fed with sequentially efficiently compressible (SEC) streams of input data that make it possible for the compression engines to more efficiently compress or otherwise compact the incoming data than would be possible with streams of input data accepted on a TV-raster scan basis. Various techniques are disclosed for intentionally forming SEC input data streams. Among these are the tight packing of alike files or fragments into concatenation suitcases and the decomposition of files into substantially predictably consistent (SPC) fragments or segments that are routed to different suitcases according to their type. In a graphics-directed embodiment, image frames are partitioned into segment areas that are internally SPC and multidirectional walks (i.e., U-turning walks) are defined in the segment areas where these defined walks are traced during compression and also during decompression.

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 method for specifying a consolidator for consolidating data from a plurality of database systems is disclosed. The method comprises receiving a user action wherein the user action specifies an action that modifies a knowledge base wherein the knowledge base includes schema information and matching information relating to the plurality of database systems. The method further comprises deriving an event from the user action wherein the event triggers a consistency rule that causes a modification of the knowledge base and generating from the knowledge base a registry that comprises the consolidator wherein the registry includes a master database and a consolidator application.

Abstract: The subject matter of this specification can be embodied in, among other things, a method that includes inferring labels for videos, users, advertisements, groups of users, and other entities included in a social network system. The inferred labels can be used to generate recommendations such as videos or advertisements in which a user may be interested. Inferred labels can be generated based on social or other relationships derived from, for example, profiles or activities of social network users. Inferred labels can be advantageous when explicit information about these entities is not available. For example, a particular user may not have clicked on any online advertisements, so the user is not explicitly linked to any advertisements.

Abstract: Method, system, and program product for configuring and using a federated database and data structure management system with error prone data. The design of the metadata and queries includes the steps of first determining schema and metadata configurations of the data source servers. The next step is enumerating available resources, and enumerating security and confidentiality requirements. These are used for calculating an optimal federated database management system design based on the schema and metadata, the enumerated available resources, and the enumerated security and confidentiality requirements; and designing an optimal federated database management system with provision for exception detection and error handling.

Abstract: A hierarchical software update distribution system and method for distributing software updates is presented. The update distribution system includes a root update service node and at least one update service node. In an update distribution system, each update service node, except the root update service node, has one parent update service node. Each update service node may function as a parent update service node to child update service nodes.

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: 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: 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 program stored in a storage device is read. Partial compression, in the element in an array in a loop nest in the program, is performed by replacing an element local only in the loop nest in the entire program with a scalar variable. Access to an original array is inserted into a program for an non-local element.

Abstract: In an information retrieval method a meta search engine receives a user information query in the form of key words; and submits the query to a search engine, and also submits the query to a snippet database storing previously selected results, indexed by a snippet index of terms included in snippets of the results when they were previously selected. The meta search engine then receives results from the search engine; and receives a response from the snippet database. It merges the results from the search engine with those from the snippet database; and submits re-ranked results to the user. The snippet database processes in parallel with the underlying search engine. The meta search engine also monitors which results of the returned re-ranked results are selected by the user, and updates the snippet index accordingly.

Abstract: The present invention provides a system and method for a user to test and transfer data from a client's database or network to a host's database or network. In accordance with an exemplary embodiment of the present invention, a user acquires data information from a client. The user uses this information to generate a spreadsheet, and to populate the spreadsheet with assumed values based on the information received from the client. The spreadsheet is configured in a fashion such that it is consistent with the host's database or network. The user requests and receives a test file from the client and uses a developed algorithm, generally in the form of a computer program, to reformat the file so that it is consistent with the host's database configuration. The user determines the consistency between the reformatted file and the host's database by comparing the reformatted file to the previously generated spreadsheet.

Abstract: The disclosure describes search systems and methods in which exact token searches, spelling suggestions, and split-token searches are used in conjunction to return search results to the user. Depending on the number and relevancy of results for the search query results from each of the steps the results are either merged or discarded into the final result set. The split-token search is adapted to generate two split-tokens from the token(s) of the search query in anticipation that the search token(s) is misspelled. As the location of the misspelling is unknown, the split-token search widens the scope of the results provided in response to the search. In an embodiment, the split-token search includes performing a prefix search for tokens matching a prefix split-token and a postfix search for tokens matching a postfix split-token. In an embodiment, the index is specially adapted to allow the postfix search to be performed more efficiently.

Abstract: A mechanism is provided for balancing I/O among available paths connected to a device. The mechanism partitions paths so a device can use all or only a subset of available paths to a device, depending on the load of I/O for other devices that are sharing the paths. The partitioning of paths is dynamic, readjusting as I/O loads change for the devices.

Abstract: The present invention discloses a data structure which, given an identifier for a Representational State Transfer (REST) resource, can rapidly yield a configured target and simultaneously yield all configured pattern based rules and constraints for the target. The disclosed data structure is a tree structure including nodes for URL portions. Each node is associated with a hash tree specifically grown in a manner that ensures collision occurrences are non-existent. The tree structure is effectively two or more superimposed trees; one for URL pattern matching to determine a target, another for determining constraints. A single tree traversal, which can be based on a progressive hash, can be used to concurrently determine a target and a set of constraints, which represents improved performance over conventional implementations that require multiple, distinct query/response operations to produce equivalent results.

Abstract: Systems, methods, and software determine whether a field of an input digital representation of information, such as the street name field in an address, is correct by quickly comparing the field to a list of valid choices for that field. The list of valid choices is generated based on information from the input digital representation, such as a character string. If an exact match is not found, a fuzzy match comparison determines the most closely matching valid choice. If a suitable fuzzy match is not found, then the input information is invalid. Otherwise, another field of the input information, such as the building number field of an address, is tested for validity. If the second field passes the validity check, then the fuzzy match (or exact match) for the field is valid. A fuzzy matching field may replace the input field, thereby correcting the input information.

Abstract: A binary tree structure for detecting inventory problems. A first embodiment detects on-hand inventory problems. A second embodiment detects inventory requirements problems. Both embodiments use a binary tree whose nodes store time values and delta values. The delta values represent inventory consumers or producers. The time values of trees used for inventory requirements problems are shifted in accordance with build-ahead times.

Abstract: A method and system are provided for detection of authors across different types of information sources such as across documents on the Web. The method includes obtaining a compression signature for a document, and determining the similarity between compression signatures of two or more documents. If the similarity is greater than a threshold measure, the two or more documents are considered to be by the same author. Scored pairs of documents are clustered to provide a group of documents by the same author. The group of documents by the same author can be used for user profiling, noise reduction, contribution sizing, detecting fraudulent contributions, obtaining other search results by the same author, or mating a document with undisclosed authorship to a document of known author.

Abstract: A binary tree structure for detecting inventory problems. A first embodiment detects on-hand inventory problems. A second embodiment detects inventory requirements problems. Both embodiments use a binary tree whose nodes store time values and delta values. The delta values represent inventory consumers or producers. The time values of trees used for inventory requirements problems are shifted in accordance with build-ahead times.

Abstract: A binary tree structure for detecting inventory problems. A first embodiment detects on-hand inventory problems. A second embodiment detects inventory requirements problems. Both embodiments use a binary tree whose nodes store time values and delta values. The delta values represent inventory consumers or producers. The time values of trees used for inventory requirements problems are shifted in accordance with build-ahead times.

Abstract: A computer-implemented method of creating a schema specific parser for processing Extensible Markup Language (XML) documents can include receiving an XML schema comprising a plurality of components, determining a hierarchy of the plurality of components of the XML schema, and creating an execution plan specifying a hierarchy of XML processing instructions. Each XML processing instruction can be associated with an XML processing function of a virtual machine that performs an XML document processing task. The hierarchy of XML processing instructions can be determined according to the hierarchy of components of the XML schema. An instruction causing the virtual machine to invoke a de-serialization module that extracts at least one item of information from the XML document can be inserted into the execution plan. The execution plan can be compiled into a bytecode version of the execution plan that is interpretable by the virtual machine. The bytecode version of the execution plan can be output.

Abstract: The invention provides a system configured to enable a first entity to query a second entity for a result, the system comprising a language specification component and an interface between the first entity and the second entity. The language specification component defines a communications language by which the first and second entities can communicate with each other. The interface is operable to receive from the second entity an instance of a generic request that is specific to the second entity, the instance of the generic request providing information about at least one query element that is supported in a second-entity specific request; and convert a first query from the first entity to the second entity into a second query, wherein the second query includes the at least one query element that is supported in the second-entity specific request.

Abstract: An enhanced file format to store large quantities of variable-sized data records on a storage medium and to permit efficient access and control over data stored in the enhanced file format. A file format is the structure of a file that defines the way it is stored and laid out on a disk. In a preferred embodiment of the present invention, a file format includes a model directory containing models. Models include element lists comprising element chunks. The element chunks include elements, where elements are variable-sized data records.

Abstract: A system and method maintains mappings from data containers to their parent directories within a file system of a storage system. Each inode is modified to include a primary name data structure comprising a parent directory inode and a parent directory cookie value. The parent directory cookie value identifies a particular directory entry within a specified block of a directory identified by parent directory inode. An alternate name file is utilized to store alternate names, such as those associated with hard links.

Abstract: A system and method for time-multiplexing the display of a plurality of electronic documents are provided. Time-multiplexing criteria for displaying a plurality of selected documents associated with a concept on a time-multiplexed basis is determined. The plurality of selected documents are caused to be displayed at an output device in a predetermined sequence according to the time-multiplexing criteria. The time-multiplexing criteria may be a variety of criteria related to the selected documents, the source of the selected documents, or other factors such as a relevance to a concept and one or more preferences associated with the selected documents.

Abstract: Techniques are described herein that can be used to access entries in a packed table. An unpacked table includes empty and filled elements. Filled elements can be accumulated and included in a packed table. An element in the packed table can be accessed by considering the location the element would have been located in the unpacked table. The location can be used to determine the location of the element in the packed table.

Abstract: A probabilistic clustering system is defined at least in part by probabilistic model parameters indicative of word counts, ratios, or frequencies characterizing classes of the clustering system. An association of one or more documents in the probabilistic clustering system is changed from one or more source classes to one or more destination classes. Probabilistic model parameters characterizing classes affected by the changed association are locally updated without updating probabilistic model parameters characterizing classes not affected by the changed association.

Abstract: A system for providing indications of documents currently opened by members of a group, in which document open and close operations are detected, and conveyed to a server system. The server system receives the document operation messages, and uses them to maintain lists of open documents associated with individual users through records in a user database that also indicate individual users' on-line status. When the server system transmits the on-line status of a user to other users that have an interest in that user (e.g. fellow members of a collaboration team, development project or the like, or user's having entered that user in their buddy list, etc.), an open documents list for that user is included in the message along with his or her on-line status information. The client systems maintain lists of currently accessing users for open documents they have received identifiers of within open documents lists contained in such on-line status messages.

Abstract: A method, system, and apparatus are provided for creating a knowledge interchange (“KI”) profile for a user that identifies the interests of the user, the individuals with which the user has communicated, and the topics on which the communication with the user was made. In order to create the KI profile, items of interest are gathered at the client computer by monitoring the interaction between a user and programs executing on the client computer. Once the items of interest have been identified, the KI profile is created by performing a social network analysis, an interest analysis, and a noun phrase analysis. Once the KI profile has been created, it may be uploaded to a server computer where it is aggregated with KI profiles created for other users.

Abstract: A system and method for determining hierarchical information is described. Aspects include using the Collins model for parsing non-textual information into hierarchical content. The system and process assign labels to lines that indicate how the lines relate to one another.

Abstract: The subject invention pertains to transaction processing systems and methodologies that allows update transactions to read stale data copies and update a data store therewith. Each transactional operation, including a read, can carry or be associated with one or more freshness constraints or tests that specify how fresh a data copy must be in order to be read. More specifically, the subject invention provides systems and methods that extend transactions and serializability to account for out-of-date reads that are justified by freshness requirements.

Abstract: An object data manipulation system is provided. The system includes a definition object model that includes a set of dynamic group definitions over a data hierarchy. A cursor component points to a subset of the data hierarchy, where the subset is loaded into memory for further processing.

Abstract: The present invention relates to a method for synchronizing databases in a network environment. Specifically, the present invention pertains to a method of using a set of hierarchical rules to enable an efficient and speedy synchronization between multiple copies of a database. The present invention enables an “n-way” synchronization of databases where “n”, the number of databases synchronized, is essentially any number more than two. In one embodiment, the present invention provides rule-based, n-way, synchronization by selecting a focus copy of the database, comparing the data records of the focus copy against the same records in other copies of the database to identify those deleted and modified; removing all the records indicated to be deleted, modifying those to be modified, and adding new record identifiers in the case of multiple modifications to the same record.