Abstract: A technique for representing the structure of hierarchically-organized data in a non-hierarchical data structure, such as a relation. The hierarchically-organized data is represented as a tree, and each node in the tree is assigned a position identifier that represents both the depth level of the node within the hierarchy, and its ancestor/descendant relationship to other nodes. The data represented by each node, as well as its position identifier, is stored in a row of a relational database, thereby capturing the hierarchical structure of the data in such relational database. A technique is provided for the compressed storage of position identifiers in a format that allows an efficient bytewise comparison of position identifiers to determine relative order and ancestry.

Abstract: A privacy-preserving index system addresses the problem of providing a privacy-preserving search over distributed access-controlled content. Indexed documents can be readily reconstructed from inverted indexes used in the search. The privacy-preserving index system builds a centralized privacy-preserving index in conjunction with a distributed access-control enforcing search protocol. The privacy-preserving index utilizes a randomized algorithm for constructing a privacy-preserving index. The privacy-preserving index is strongly resilient to privacy breaches. The privacy-preserving index system allows content providers to maintain complete control in defining access groups and ensuring its compliance, and further allows system implementors to retain tunable knobs to balance privacy and efficiency concerns for their particular domains.

Abstract: The likely relevance of each term of a search-engine query of two or more terms is determined by their deletion probability scores. If the deletion probability scores are significantly different, the deletion probability score can be used to return targeted ads related to the more relevant term or terms along with the search results. Deletion probability scores are determined by first gathering historical records of search queries of two or more terms in which a subsequent query was submitted by the same user after one or more of the terms had been deleted. The deletion probability score for a particular term of a search query is calculated as the ratio of the number of times that particular term was itself deleted prior to a subsequent search by the same user divided by the number of times there were subsequent search queries by the same user in which any term or terms including that given term was deleted by the same user prior to the subsequent search. Terms are not limited to individual alphabetic words.

Abstract: A distributed database system providing data and space management methodology is described. In one embodiment, for example, a method is described for detection of deadlocks in a distributed database system comprising a plurality of servers sharing access to data, the method comprises steps of: in response to a task at a first server waiting to obtain a lock regulating access to data, sending a search request including lock information to a second server holding the lock; at the second server, examining dependencies of the task holding the lock based on the lock information received with the search request and local lock information; if the task holding the lock is waiting to obtain a lock held by an additional server, forwarding the search request and local lock information to the additional server; repeating the examining and forwarding steps until all dependencies are examined; and responding to the search request indicating whether a deadlock was detected and providing lock information found.

Abstract: Described is a storage reports duplicate file detector that operates by receiving file records during a first scan of file system metadata. The detector computes a hash based on attributes in the record, and maintains the hash value in association with information that indicates whether a hash value corresponds to more than one file. In one implementation, the information corresponds to the amount of space wasted by duplication. The information is used to determine which hash values correspond to groups of potentially duplicate files, and eliminate non-duplicates. A second scan locates file information for each of the potentially duplicate files, and the file information is then used to determine which groups of potentially duplicate files are actually duplicate files.

Abstract: A flow-data generation apparatus comprises a first unit extracting first binomial relation data to be a start point, a second unit associating second term of the first binomial relation data as a first child node with the start point as a first parent node, a third unit adding a relation type to an arc of the first binomial relation data, a fourth unit searching for third binomial relation data including first term of the third binomial relation data identical to second term of second binomial relation data, a fifth unit associating second term of the third binomial relation data as a second child node with the first term of the third binomial relation data as a second parent node, a sixth unit adding a relation type to an arc of the third binomial relation data, and an seventh unit repeating the searching, associating, and adding to generate a partial tree.

Abstract: A database engine and a system running a database engine utilize a dynamic bitmap updating routine to avoid the delay associated with building an entire bitmap. When running a query on a table, the database engine can build a bitmap over a column of the table that helps avoid unnecessary I/O operations to retrieve records. The database engine initializes the bitmap so that all elements have a value of “1”, or active, and proceeds to scan and retrieve the records of the table according to the bitmap using a first process. Any retrieved record is further analyzed to determine if it is part of the result set. Concurrently, a second process is initiated which continually updates the values within the bitmap according to a set of selection criteria. As the first process continues to operate, more and more elements of the bitmap are set to “0”, or inactive, so that the first process can avoid unnecessary I/O operations.

Abstract: A technique for representing an information need and employing one or more filters to select documents that satisfy the represented information need, including a technique of creating filters that involves (a) dividing a set of documents into one or more subsets such that each subset can be used as the source of features for creating a filtering profile or used to set or validate the score threshold for the profile and (b) determining whether multiple profiles are required and how to combine them to create an effective filter. Multiple profiles can be incorporated into an individual filter and the individual filters combined to create an ensemble filter. Ensemble filters can then be further combined to create meta filters.

Abstract: Described is the use of query identifiers that provide computer users a method of “bookmarking” (uniquely identifying) any user interface (UI) element in any UI framework. This is useful for testing programs, assistive technologies, and teaching activities. The unique query element identifier is identified for a target UI element to locate within a hierarchy of UI elements. For example, the element's Name, ClassName, Instance, AccessibleName, Role, ControlId and AutomationId may be used to develop the unique query element identifier. From the query elements in the hierarchy of UI elements, a query identifier is generated for the target UI element. The query identifier includes the query element identifier and possibly ancestor query element identifiers, with each ancestor query element identifier corresponding to a higher-level ancestor element relative to the target element in the hierarchy. The query identifier may be used to locate the target element for testing versions of application programs.

Abstract: A method for copying data from a source logical device to a destination logical device. In response to a copy command from a requesting host application identifying the source and destination logical devices, an environment is established. Thereafter a calling system receives an immediate response that the copy operation is complete even though no data has been copied. Application programs may access storage locations in either the source or the destination logical device during the copy phase. A copy program transfers the date on a track-by-track basis to the destination logical device. Procedures assure that any data access to a particular track in either the source or destination logical device by any application prior to the transfer of that track is accommodated to maintain data integrity.

Abstract: Pieces of data are stored among storage devices based on a cycle value, which is computed for each storage device as the total capacity of all storage devices divided by the individual capacity of the storage device. Next, a storage device for a current piece of data is selected to be the storage device with the smallest key value; followed by determination of a new key value based on at least (a) the cycle value and (b) a sequence number of the current piece. After allocation, if the number of storage devices changes, reallocation is done similarly except that selection is first from a preferred set and only if the preferred set is empty then from a remainder set. Storage devices are placed in the preferred set if a piece of data would be outside a shadow (based on cycle value) of another piece pre-existing in the storage device.

Abstract: A rating program on a mobile computing device communicates with other mobile devices regarding collected ratings. A user enters ratings and requests for information; the mobile computing device will then operate in the background, actively scanning for other users with the same type of short-range communications and a ratings program. The devices are able to exchange and save ratings, providing a mobile, socially-relevant means of collecting information.

Abstract: An extensible markup language (XML) expression included in a query is parsed to yield an abstract syntax tree. The abstract syntax tree is then transformed into a unified tree including XML algebra operations. The unified tree is then converted into a relational tree including enhanced relational algebra operations. The relational tree is then forwarded to a query processor for optimization and execution of the query at the query processor.

Abstract: A continuous information gathering and evaluating system uses five highly coupled databases and software for gathering user input (respondent software), for evaluating input (evaluator software), and for administering the system (administrative software). The first database includes the categories of users for an organization. The second database stores information about each user. The third database includes all topics and issues of interest and queries for each combination of topic, issue, and respondent category. Responses to query statements are preferably collected using a 7 point Likert scale. The fourth database is the repository for the responses from users and appropriate statistics based on the responses. The fifth database includes authorization data and rules that determine how the process and system are implemented for a particular organization.

Abstract: A method, as well as a computer program product that implements the method, is provided for user modeling, within a computer system, of a lifecycle of uniquely identified computer data objects that are members of a computer data object family. The method includes receiving a user-defined triggering event occurring in a software application system. The method also includes receiving user-defined permissible states for one or more object attributes that may be present for a uniquely identified computer data object that is a member of the data object family, as well as user-defined permissible transitions between the defined permissible states. The method also includes receiving a user-defined action to be performed on a uniquely identified computer data object that is a member of the computer data object family, when the user-defined triggering event occurs and causes a permissible state transition to occur.

Abstract: Remastering of shared resources among nodes in a cluster, while minimizing the time that such resources are unavailable for access, comprises dividing the shared resources being remastered into multiple “windows” and freezing and remastering one window at a time. The remastering windows are defined over one or more buckets associated with a hash table of resources. In clusters with unequally sized hash tables, an enhancement to the fundamental windowing approach utilizes a functionally specific hashing algorithm and a hash table size constraint to ensure that the set of all resources that hash to a given bucket in a hash table of a given size will hash precisely to the same bucket, plus a set of higher buckets which are well defined, in a node that has a larger hash table.

Abstract: An apparatus for displaying system management information includes a combination storing unit that stores display pattern information that is obtained by combining, in subjective basis, system management information provided by a plurality of system management units; and a combination display unit that combines the system management information based on the display pattern stored in the combination storing unit, and displays the system management information combined.

Abstract: A computer-implemented method is provided for ranking files from an Internet search. In one embodiment, the method comprises assigning a score to each file based on at least one of the following factors: recency, editorial popularity, clickthru popularity, favorites metadata, or favorites collaborative filtering. The files may be organized based on the assigned scores to provide users with more accurate search results.

Abstract: A database system includes an enhanced technique for performing sorts in which removals of duplicate records are performed to compact the size of segments being sorted. To enhance a query plan, the duplicate record removal is performed as early in the query plan as possible. By removing duplicate records early in the query plan, the number of input/output (I/O) operations is reduced, resulting in more efficient usage of database system resources. In example implementations, two type of sorts are performed: a heap sort (to sort successive segments of an input file, with the sorting associated with concurrent removal of duplicate records to compact each segment so that a smaller number of I/O accesses is needed); and a merge sort (in which output files from prior sorting passes are merged and sorted, with the merge sort process also associated with the removal of duplicate records to further compact the data segments and reduce the number of I/O accesses).

Abstract: There is provided a method for displaying data comprising mapping a column set that comprises information stored in a first layer column, mapping a row set that comprises information stored in a second layer column, wherein the second layer column is associated with the first layer column, and rendering a graphic using the column set and the row set, wherein a visual attribute of the graphic corresponds to a data value stored in a data column.