Abstract: A database query optimizer optimizes a query that uses multiple networks. The query optimizer optimizes a query to reduce network traffic on a network or node that is overloaded or above an established parameter in a node/network attribute table. The query optimization to reduce network traffic may result in a sub-optimal query in other respects such as execution time. The result is a query optimizer that rewrites or optimizes a query to execute on multiple nodes or networks to reduce traffic on a network or node according to the loading characteristics and assigned attributes of a node or network.

Abstract: A database loader loads data to an in-memory database across multiple nodes in a parallel computing system. The database loader uses SQL flags, historical information gained from monitoring prior query execution times and patterns, and node and network configuration to determine how to effectively cluster data attributes across multiple nodes. The database loader may also allow a system administrator to force placement of database structures in particular nodes.

Abstract: A database loader loads data to an in-memory database across multiple nodes in a parallel computing system. The database loader uses SQL flags, historical information gained from monitoring prior query execution times and patterns, and node and network configuration to determine how to effectively cluster data attributes across multiple nodes. The database loader may also allow a system administrator to force placement of database structures in particular nodes.

Abstract: A usage model and the underlying technology used to provide sequence analysis as part of a relational database system. Included components include the semantic and syntactic integration of the sequence analysis with an existing query language, the storage methods for the sequence data, and the design of a multipart execution scheme that runs the sequence analysis as part of a potentially larger database join, especially using parallel execution techniques.

Abstract: The present technology includes systems and methods for searching for social profiles based on user search queries and sorting search results based on determining and matching personal similarities. In some implementations, the systems and methods retrieve a plurality of search results that either partially or fully match a search query by a user of an online community for a particular social profile. The systems and methods determine a plurality of personal similarity factors relating to the search results and compare them to the profile of the user requesting the search based on predetermined criteria and assign varying weights to the personal similarity factors. The weights are aggregated and total scores for the search results are computed. The systems and methods sort the search results based on the total scores to identify and separate results of greater interest to the user from those that of less interest.

Abstract: In some implementations, a method for providing user-based context to a virtual workspace includes generating a first virtual workspace viewable by a user on a graphical user interface. The virtual workspace comprises a plurality of workspace modules comprising first data aggregated from one or more data objects. The aggregated data is determined to be semantically proximate aggregated data in a second virtual workspace. User annotations assigned to the semantically-proximate aggregated data are identified. The user annotations are presented in the first virtual workplace viewable by the user.

Abstract: Methods for creation of a content association system in which a client application communicates to a distributed hash table network an association between one piece of content in a client's library and one other piece of content in the client's library are described. The client creates a hash for a first file in the library and a reference to a second file in the library. The client stores the reference to the second file in the distributed hash table at a node corresponding to the hash. To discover files associated with a file in a peer's library, the peer creates a hash for a file in its library and retrieves references to other files from the distributed hash table.

Abstract: A primary master node and a standby master node monitor the health of a shared nothing database appliance to afford high availability while minimizing false negatives and duplicate alerts by executing continuously in parallel complimentary processes that determine whether the database is running, and which master node is the active database master node. The active database master node monitors the health of the components of the database appliance by polling each component to detect failures and warnings, and the other master node monitors the status of the active master node. Upon detecting a failure of the active master node, the other node takes over health monitoring. If the database is not running, the designated primary master node performs health monitoring.

Abstract: Systems and methods for the management of contact information, which may include automatic transfer processes, automatic update processes, automatic customization processes, automatic delivery processes, automatic storage processes, automatic portability processes, and/or automatic radial mining processes.

Abstract: A system and method for creating, managing, and publishing audio microposts is provided. An audio micropost comprises a short audio segment recorded and/or captured based on voice, speech, and/or other sound, which may be shared with and/or published to subscribers and/or other users. The system may enable creating a discussion and playlist based on the audio microposts. The discussion may be generated by identifying and/or selecting an audio micropost that may pose a question and/or topic for a discussion and/or debate. The system may further enable granting the ability to participate in the discussion to a selected group of participants. The playlist of audio microposts may be created by adding individual posts into the playlist and/or by using hashtags and/or keywords to search for audio microposts of interest.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing live search suggestions. In one aspect, a method includes obtaining a suggested query term by a client device, initiating a live query to obtain live content relating to the suggested query term responsive to obtaining the suggested query term, obtaining the live content, and displaying the live content on a user interface of the client device.

Abstract: The invention provides a method and system for visualization of a data set, the method comprises: dividing the data set into a plurality of information layers based on different information dimensions; and visually processing the plurality of information layers based on different information dimensions, respectively, in order to present respective views of the plurality of information layers. In the present invention, by visualizing the data set through presenting different overviews of the data set from different information dimensions, respectively, the presentation of comprehensive information of the data set to a data set analyst is ensured while distortion of presented contents as well as visual clutter are prevented.

Abstract: Example apparatus and methods protect state in a file system using a message-passing multi-threaded journal. One example apparatus stores, in memory, data and metadata affected by a file system transaction. The apparatus may run a thread that receives the file system transaction from the file system and that produces a set of atomic operations configured to complete the file system transaction. The apparatus may also run a thread that records a set of journal entries associated with the set of atomic operations to protect the file system while the atomic operations complete. The journal entries may be written on a non-volatile computer-readable medium. The apparatus may also run a thread that co-ordinates usage of space on the computer-readable medium. Rather than synchronizing journal activity with locks, the threads running on the example apparatus may synchronize their activity using message passing.

Abstract: Searching stored content is disclosed. A first mapping is created from an object to one or more stored relational database tables. A second mapping is created from the object to an indexer schema. One or both of the following is done: 1) using the first mapping to translate a search request expressed in an abstract query language to a first query language associated with the relational database; and 2) using the second mapping to translate the search request to a second query language associated with the indexer schema.

Abstract: A mixed workload management system and associated operating method modify a shortest job first (SJF) by service levels. The workload management system comprises a scheduler configured for scheduling mixed workloads. The scheduler comprises an analyzer that determines query execution time, assigns scheduling priority to a query in order inverse to the query execution time, weights the assigned scheduling priority by service level of the query, and sorts a list of queries in order of weighted scheduling priority. A schedule controller selects a query for execution from head of the sorted list of queries.

Abstract: Embodiments of the invention are generally related to data processing, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query.

Abstract: A method, system, and computer program product for use in replication comprising intercepting an IO for a file at an application layer at the production site, determining if the file is being replicated, and based on a determination the file is being replicated, sending the IO to a first data recovery appliance and recording the IO in a journal.

Abstract: The techniques introduced here provide for enabling deduplication operations for a file system without significantly affecting read performance of the file system due to fragmentation of the data sets in the file system. The techniques include determining, by a storage server that hosts the file system, a level of fragmentation that would be introduced to a data set stored in the file system as a result of performing a deduplication operation on the data set. The storage server then compares the level of fragmentation with a threshold value and determines whether to perform the deduplication operation based on a result of comparing the level of fragmentation with the threshold value. The threshold value represents an acceptable level of fragmentation in the data sets of the file system.

Abstract: Techniques for assisting owners to remotely administer their digital content items stored at non-owners' personal computing devices. The techniques involve identifying owned content items from among content items stored in a synchronization replica that is synchronized with synchronization replicas at the non-owners' personal computing devices. The techniques further involve allowing owners to remotely perform certain administrative actions on owned content items. For example, in response to a command initiated at an owner's personal computing device, a network signal or signals can be sent to a synchronization agent installed on the non-owners' personal computing devices to automatically remove all owned content items from the synchronization replicas at the non-owners' personal computing devices.

Abstract: In response to a stimulus indicating configuration of a node into a cluster of a plurality of nodes including the node, the node determines whether or not the node has a universally unique identifier (UUID), and if not, the node provides its own persistent self-assigned UUID. The node searches a cluster configuration database for a temporary identifier associated with the node. In response to the node locating the temporary identifier of the node in the cluster configuration database, the node writes its self-assigned UUID into the cluster configuration database and joins the cluster.