Abstract: Disclosed are various embodiments for reducing locking in a distributed data store that includes a primary data store and one or more secondary data stores. An update to a data item that is to be applied to the distributed data store is obtained in one or more computing devices. The update is applied to a cached version of the data item when a lock is held. The update is replicated to the one or more data stores after the lock is released. It is determined that the update is durably persisted in the distributed data store after obtaining a replication confirmation from each of at least a predetermined number of the secondary data stores.

Abstract: A computer-implemented method for processing a plurality of data items includes defining a set of one or more categories having a corresponding set of conditions that associate the data items with the categories. A sub-categorization request, requesting to divide a category from among the categories into lower-level categories, is accepted from a user. The data items associated with the category are processed responsively to the sub-categorization request, so as to automatically suggest the lower-level categories. The automatically-suggested lower-level categories are presented to the user, and direction with respect to the automatically-suggested lower-level categories is accepted from the user. A hierarchical structure representing the categories is constructed responsively to the direction, by dividing the category into the lower-level categories. Output based on the hierarchical structure is presented to the user.

Abstract: Systems and methods are disclosed for forming deduplicated images of a data object that changes over time using difference information between temporal states of the data object. The method includes organizing the content of the data object for a first temporal state as a plurality of content segments and storing the content segments in a data store; creating an organized arrangement of hash structures to represent the data object in its first temporal state; receiving difference information for the data object; forming at least one hash signature for the changed content; and storing the changed content that is unique in the data store as content segments. The method also includes determining, subsequent to receiving the changed content at the deduplicating content store, whether the changed content should be stored by searching for the hash signature for the changed higher-level hash structure in the global cache of the deduplicating content store.

Abstract: A secure windowing service is disclosed. When the windowing service receives an indication that a second client (executing in a second container) wishes to be given access to a set of windowing information provided by a first client (executing in a first container), the windowing service determines, based upon sensitivity labels associated with the first and second containers, whether the second client should be given access to the windowing information provided by the first client. By making this determination, the windowing service in effect implements information access control. This information access control helps to ensure that windowing information is not improperly passed from container to container.

Abstract: Improved user interface features to manage a large number of files and their application to management of a large number of test scripts. Various features related to selection of files of interest, locating files matching (or not containing) search strings potentially of several lines, highlighting the occurrences of desired strings in the content of a file, finding and replacing strings of interest potentially of several lines, are disclosed.

Abstract: According to one aspect of the invention, in response to one or more terms to be indexed, each of the terms is indexed in a regular index. In addition, for each of the terms having multiple characters, at least one prefix portion of the term is indexed in a prefix index, where the regular index is used for regular searches and the prefix index is used for prefix searches without having to combine a plurality of postings lists of the regular index at the point in time.

Abstract: To access data, a distributed balanced tree having nodes distributed across plural servers is accessed. Version information is associated with the nodes of the distributed balanced tree. During an operation that accesses the distributed balanced tree, the version information is checked to determine whether content of one or more nodes of the distributed balanced tree has changed during the operation.

Abstract: A method and apparatus is disclosed herein for synchronizing distributed work. In one embodiment, the method comprises receiving first and second metadata entries, adding the first and second metadata entries to a set corresponding to a digital object, and providing access to first and second unique identifiers used for referencing the first and second metadata entries respectively, where the first and second unique identifiers are based on contents of the first and second metadata entries respectively.

Abstract: Provided are techniques for generating order statistics and error bounds. For each of multiple, distributed data sources, a finite number of data bins are created for each field in that data source. Data values in each of the multiple, distributed data sources are processed to generate basic summaries for each of the data bins in a single pass of the data values. The data bins from each of the multiple, distributed data sources are sorted. One or more approximate order statistics are computed for a data set by accumulating counts from a number of the sorted data bins. Lower and upper error bounds are provided for each of the computed one or more approximate order statistics, wherein the lower and upper error bounds are values delimiting an interval containing a true value of an order statistic.

Abstract: An embodiment of the invention is directed to a method associated with a data processing system disposed to receive and process enterprise data. Responsive to receiving a specified data element, the method determines a data type to be used for the specified data element. The method selectively determines a confidence level of the specified data element, and selects a plurality of subject matter experts (SMEs), wherein the data type of the specified data element is used in selecting each SME. A request is dispatched to each of the SMEs to selectively revise and validate the specified data element. The specified data element is then updated in accordance with each revision provided by an SME in response to one of the requests.

Abstract: This application describes methods for searching digital information such as digital documents (e.g., web pages) and computer databases, and specific search techniques such as authority ranking and information retrieval (IR) relevance ranking in keyword searches. In some implementations, the technique includes analyzing digital information viewed as a labeled graph, including nodes and edges, based on a flow of authority among the nodes along the edges, the flow of authority being derived at least in part from different authority transfer rates assigned to the edges based on edge type schema information. In some implementations, the system includes an object rank module configured to generate multiple initial rankings corresponding to multiple query keywords, each of the multiple initial rankings indicating authority of nodes in a graph with respect to each respective query keyword individually; and a query module configured to combine the multiple initial rankings in response to a query.

Abstract: Systems and methods are disclosed for managing deduplicated images of data objects that change over time. The method includes: organizing unique content of each data object as a plurality of content segments and storing the content segments in a data store; for each data object, creating an organized arrangement of hash structures, wherein each structure, for a subset of the hash structures, includes a hash signature for a corresponding content segment and is associated with a reference to the corresponding content segment, and for each data object, maintaining an organized arrangement of temporal structures to represent a corresponding data object over time, wherein each structure is associated with a temporal state of the data object, and wherein each temporal state is associated with the hash structures representing the content of the data object during that temporal state.

Abstract: Systems and techniques to provide distributed document version control. In general, in one implementation, the technique includes: receiving information, in a distributed document control system, specifying a locally saved copy of a first electronic document; determining, in response to the received information, whether the first electronic document should supersede a second electronic document in the distributed document control system; and storing, based on an outcome of the determining, information in the distributed document control system that links the first electronic document with the second electronic document in a superior-subordinate relationship such that when an action is requested with respect to the second, subordinate electronic document, the distributed document control system forces an action to be taken with respect to the first, superior electronic document. Various implementations include those in computer program products and client-server systems.

Abstract: Data for deduplication is received. The received data is deduplicated if selected conditions corresponding to the deduplication are satisfied, wherein the selected conditions include a deduplication ratio, a data deduplication threshold, and a data quiescence measure. Deduplication of the received data is discontinued if the selected conditions corresponding to the deduplication are not satisfied.

Abstract: A method for maintaining a hierarchy bridge table consistent with a corresponding hierarchy table includes listening for a transaction, having a start boundary and an end boundary, on the hierarchy table; and upon detecting and identifying the transaction, directing execution of an update method on the bridge table, where the update method is completed within the boundaries of the transaction using the identity of the transaction and a state of the bridge table at the start boundary of the transaction.

Abstract: Techniques are disclosed for backing up and/or restoring data. In one embodiment, a request is received to back up at least a first unit of data stored in a database. Upon determining that the first unit of data is at least partially derived from a second unit of data stored in the database, a backup may be generated that includes less than all of the first unit of data. Subsequently, the first unit of data may be fully restored from the backup.

Abstract: Provided is a system and method for providing a browser functionality to determine the existence of a table, identify data therein and manipulate the data according to a user's input. Thus, a method for manipulating data tables in a client machine includes determining at the client machine, existence of a table via a loaded graphical user interface operable with a markup language; extracting data from the table; storing the data from the table in a local cache; manipulating the data in the local cache; and displaying the data in a user-defined table by applying a function within the graphical user interface. The table on the client computer can be generated by the graphical user interface loading a Web page from a server machine, a Web browser or can be operable with a Web browser. Alternatively, the function within the graphical user interface is a preset set of functions.

Abstract: A dependency graph of rule predicates without strongly connected sub-graph is obtained. The dependency graph indicates the dependency among the rule predicates. An update frequency of node in the dependency graph is calculated, and a query frequency of node in the dependency graph is also calculated. Furthermore, a runtime query cost value and a materialization cost value of the node are calculated based on the query frequency and update frequency. Node to be materialized are determined based on the runtime query cost value and the materialization cost value. A rule predicate corresponding to the node to be materialized is the rule predicate to be materialized. In at least some instances, an exemplary technical effect is that the return time of result of runtime query is saved and the affect by the data update is reduced when a query is performed in relation data reasoning system constructed with rule predicates.

Abstract: Techniques are provided for evaluating base events, compound events, and logical update events in an event processing system. In one embodiment, the base events, compound events, and logical update events are definitions in a particular syntax language that specify conditions for evaluating input event data. In this embodiment, base event definitions are evaluated over the input event data; logical update event definitions are evaluated by determining whether the effect of any earlier event is changed by the arrival of a new event; and compound event definitions are evaluated over records representing events that have been selected by evaluating the base event definitions over the input event data.

Abstract: Algorithms are provided to determine a final sequence of objects based on separating the objects from a base sequence and two derived sequences into common objects appearing in all three sequences and non-common objects missing from at least one of the sequences, then determining the final order of the common objects, and using the positioning of the non-common objects relative to the common objects in the original sequences. The final sequence represents changes made by the two derived sequences to the base sequence.