Abstract: A process may utilize multiple garbage collector threads, each having the capability to steal partially-marked object references from an accessible mark stack having additional work that has yet to be processed. A partially-marked object reference may be represented as a pair of entries on a mark stack. A garbage collector thread may utilize an atomic operation to access the pair of entries in a prescribed manner to steal an unprocessed partially-marked object reference. In this manner, the workload of an overloaded garbage collector thread is offloaded to another garbage collector thread that may be idle thereby balancing the workload more evenly among multiple garbage collector threads.

Abstract: In column domain dictionary compression, column values in one or more columns are tokenized by a single dictionary. The domain of the dictionary is the entire set of columns. A dictionary may not only map a token to a tokenized value, but also to a count (“token count”) of the number of occurrences of the token and corresponding tokenized value in the dictionary's domain. Such information may be used to compute queries on the base table.

Abstract: Techniques and systems are described to control a determination of document similarity. In one example, dimensionality of the documents is reduced through computation of a signature, e.g., via a hashing technique such as “minhashing” which is also known as min-wise independent permutations locality sensitive hashing. From these signatures, another hashing technique (e.g., locality sensitive hashing) is used to determine similarity of the signatures to each other. Identification of disjoint sets is then used as a basis to partition the documents for determination of document similarity by respective nodes of a plurality of computing devices. In this way, an amount of data shuffling between the nodes as part of the determination of document similarity may be reduced. In another example, a weighting is applied to attributes of documents as part of the determination of document similarity.

Abstract: In an embodiment, a system can determine geocoded data from a database of geographic coordinates and metadata. The system correlates metadata, such as invoice data, to geolocation data, such as GPS or cellular data to determine geocoded data. The system further identifies one or more geographic coordinates for one or more location names, which may not have a corresponding metadata entry, by generating clusters of geographic coordinates. The clusters are then matched to one or location names using a matching algorithm. Accordingly, improved geocoded data may be determined.

Abstract: Provided is a database system wherein a first node, in accordance with a data transmission request from a second node, transmits, to the second node, specific identification information indicating a transaction log at a predetermined time point, and a transaction log and identification information from after the predetermined time point, and transmits the requested data to the second node from the predetermined time point onwards, and the second node transmits a transmission request for data to the first node in accordance with a search request, and when data received from the first node has been loaded into a memory, the second node executes, on the loaded data, a command relating to a transaction log that is newer than the transaction log indicated by the specific identification information, responds to the search request on the basis of data on which the command has been executed, and deletes the data on which the command has been executed, in accordance with a predetermined condition.

Abstract: Provided is a database system, wherein a first node holds a transaction log of a database together with identification information enabling identification of a sequence of commands, transmits specific identification information indicating a transaction log at a predetermined time point, and the transaction log and identification information from after the predetermined time point, to a second node, and transmits data in the database to the second node from the predetermined time point onwards, and when the data received from the first node has been loaded into a memory, the second node executes a command relating to a transaction log which is newer than the transaction log indicated by the specific identification information, on the loaded data.

Abstract: A present invention embodiment adjusts application of a set of data quality rules for data within one or more reports. A first report field is selected that receives data from a same source data field as at least one second report field within the one or more reports. An active data quality rule associated with the at least one second report field is identified that is inactive for the first report field. An effectiveness of the identified data quality rule is determined for data quality of the first report field. Application of a set of data quality rules is adjusted for the first report field to include the identified data quality rule in response to the effectiveness satisfying a threshold.

Abstract: Techniques are described for scaling an in-memory data grid to satisfy the needs of client applications requesting data from the in-memory data grid. The in-memory data grid may monitor a variety of factors, such as data traffic or number of received queries from a particular geographical region, to determine whether to create a proximity grid. A proximity grid is an extension of the in-memory data grid that services queries originating from a defined geographic region. Each proximity grid stores data objects relevant to the proximity grid's assigned geographic region. Queries originating from the client applications within the geographic regions are then routed to the corresponding proximity grid for execution. The proximity grid may be terminated when the need of the client applications within the geographic region has subsided.

Abstract: A method for determining a similarity between a plurality of graphs includes inferring a low-rank representation of a first graph, inferring a low-rank representation of a second graph, wherein the low-rank representations of the first and second graphs are stored in memory, estimating a left interaction between the first and second graphs, estimating a middle interaction between the first and second graphs, estimating a right interaction between the first and second graphs, wherein the estimations are based on the low-rank representations of the first and second graphs stored in memory, and aggregating the left interaction, the middle interaction and the right interaction into a kernel, wherein the kernel is indicative of the similarity between the first and second graphs.

Abstract: There is provided a computer-implemented method of optimizing a query. An exemplary method retrieves a subset of rows from a sample table based on a query for a table associated with the sample table. The query specifies the table. The sample table is generated in a previous optimization of the query. The sample table includes a scrambled, random selection of rows from the table. A cardinality of the table is determined based on the subset. A query plan is generated based on the query and the cardinality.

Abstract: A computer-implemented method searches a database for a particular string. One or more processors receive data as an input string, and then identify multiple k-grams in, unique characters in, and a length of the input string. The one or more processors perform binary locality sensitive hashing on the k-grams, the unique characters, and the length for the input string, and then sum the binary locality sensitive hashings to create a first addition vector, which is used to generate a first binary vector. The same process is performed on a particular string being requested to generate a second binary vector. The one or more processors then search the database for the particular string that was requested using the second binary vector in a large scale hamming distance query process that determines a hamming distance between the first binary code and the second binary code.

Abstract: A non-transitory computer-readable storage medium stores a data stream processing program that causes a computer to execute a process. The process includes extracting a relationship between properties included in events in a data stream from the data stream itself, definitions of queries for processing the data stream, or both of the data stream and the definitions of the queries; specifying a common partitioning key common to a subset of the queries to be grouped into a partitioning group based on partitioning keys in the definitions of the queries, the relationship between the properties, and a probability of the relationship; and assigning the subset of the queries belonging to the partitioning group to each of parallel nodes provided for parallel distributed processing based on the specified common partitioning key.

Abstract: In a networked computer system that includes multiple nodes and multiple networks interconnecting the nodes, a database query optimizer takes network choice into consideration when optimizing a query. The query optimizer logs historical information for queries that includes network information. A network monitor determines network characteristics of the multiple networks. The query optimizer then selects a network for a query based on the network characteristics, and optionally based on the historical information as well. The result is a query optimizer that takes network choice into consideration, thereby providing a query that is optimized according to the characteristics of the networks.

Abstract: A system for directing for storage comprises a processor and a memory. The processor is configured to determine a segment overlap for each of a plurality of nodes. The processor is further configured to determine a selected node of the plurality of nodes based at least in part on the segment overlap for each of the plurality of nodes and based at least in part on a selection criteria. The memory is coupled to the processor and configured to provide the processor with instructions.

Abstract: Method, system, and computer readable medium for interest tag recommendation are provided in the present disclosure. Statistics about feature words of an Internet article related to an existing interest tag are collected to generate a characteristic vector of the existing interest tag. According to the characteristic vector of the existing interest tag, degree of similarity between the existing interest tag and an interest tag to be recommended is calculated. An interest tag is recommended according to the degree of similarity between the existing interest tag and the interest tag to be recommended.

Abstract: There is described a method of managing a flow of data packets in a multiple-processing entity system comprising a plurality of look-up tables adapted to store information associated to actions to be performed on packets received by the system. The method comprises storing, on a per entry basis, in a shadowed entry associated to any table entry being updated, the previous content of said table entry being updated, in association with a table entry version number, for use for managing packets received in the system prior to any update operation. It is thus possible to continue using look-up tables while updating process is being carried out for some or all of the table entries. The solution provides benefits for systems that are limited in space and cost, by use of minimal memory thanks to the storing of small shadowed data instead of full shadowed table.

Abstract: A method and system for searching a graph in parallel which constructs an abstract representation of an AND/OR graph using state-space abstraction. The abstract representation of the graph includes one or more abstract nodes having duplicate detection scopes and one or more abstract edges having operator groups adjusted for AND node outcomes. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning, wherein the abstract edges are used to define the smaller duplicate detection scopes. Nodes in the current search layer are expanded by a processing unit using the adjusted operator groups of outgoing abstract edges of the abstract nodes mapped into by the nodes, wherein the nodes expanded in parallel use adjusted operator groups associated with abstract edges having disjoint duplicate detection scopes.

Abstract: A method and system for grouping and compressing system logs are described herein. A generation module residing and executing on a computer system may be configured to generate system logs containing system data important for support purposes describing the computer system, and system log metadata for describing the system logs. A grouping module residing and executing on a computer system may be configured to group system logs based on the system log metadata. Each group of system logs may comprise two or more system logs having the same or similar system log metadata. A data container is produced for each group of system logs and the data container is compressed. System logs having the same or similar system log metadata are more likely to have similar data, thus resulting in a higher degree of compression when grouped and compressed together.

Abstract: A computer system and computer implemented method that obtains coordinated results from at least two queries by utilizing context data of each query. Specifically, the computer system and computer implemented method facilitates enhanced querying functionality by matching entangled queries to achieve coordinated results.

Abstract: A mechanism is disclosed that enables the invocation of methods of object instances that have persistent data and a mutable key. A mutable key capability is advantageous in a variety of applications, such as monitoring a set of users and their login status on a plurality of media servers (e.g., an email server, an instant messaging server, a voice mail server, a video server, an audio-conferencing server, etc.). The methods that can be invoked include get methods, set methods, unset methods, finder methods, destructors, and business methods. Implementations based on the Enterprise JavaBean specification are disclosed for three illustrative embodiments of the present invention. The illustrative embodiments of the present invention can also be implemented in accordance with object persistence mechanisms other than Enterprise JavaBeans.