Abstract: A shared database platform can interface with a cluster computing platform over a network through a connector. The data transferred over the network can include metadata result packages that can be distributed to worker nodes of the duster computing platform, which receive the metadata objects and access the result data for further processing on a staging platform, such as a scalable storage platform.

Abstract: Systems and techniques are disclosed for enabling structured data to be associated with visual content in a manner that preserves the ability to edit the visual content using a content application such as a notebook application. Techniques and systems enable semantic notation to be introduced into selected regions of the visual content that indicate the visual content's structured data, allowing the content to be searched and accessed more easily by common search technologies and search engines. The semantic notation is assigned to the visual content so that the introduction of the semantic notation does not hinder the user's viewing or editing of the visual content with a content application. The inclusion of the semantic notation does not cause existing visual editing tools that do not understand the semantic notation to cease to function properly.

Abstract: Collaboration application includes a set of shared documents shared with users with different authorization rights. A request to provide relevant shared documents from the set of shared documents is received. Document ranks corresponding to the relevant shared documents are determined. The document ranks are determined based on weighted document factors related to the set of shared documents. A ranked list of the relevant shared documents is provided according to the determined document ranks. User rank for users in relation to a document from the relevant shared documents is determined. The user ranks are determined based on user factors and weights of the user factors. The user factors are related to authorization rights of the users to the document, sharing characteristics of the document and the users, and measurements over interactions of the users with documents from the set of shared documents that are shared with the users.

Abstract: Recovery of an in-memory state in a log-structured filesystem using fuzzy checkpoints is disclosed, including: determining a portion of a data structure to checkpoint to a storage unit, wherein the structure is associated with a set of references to locations in persistent storage at which metadata is stored, wherein the portion of the data structure is dynamically determined based at least in part on a size of the data structure and a predetermined number of storage units to be associated with a checkpoint window, wherein the number of storage units to be associated with the checkpoint window is fewer than a total number of storage units associated with the persistent storage; and checkpointing the portion of the data structure to the storage unit.

Abstract: A system for generating and executing a multiple-step request is disclosed. The disclosed system receives a request identifying a multiple-step request from a user. In response to the request, the system sends a series of queries to the user. Then, the system receives a series of responses identifying a plurality of inputs of the multiple-step request. Based on the series of queries and the series of responses, the system generates a series of instructions to perform the multiple-step request. Each instruction includes a command and at least one input. The input includes an editable field that allows the user to change the value of the input. The system records and stores each of the series of instructions as the multiple-step request. The system further stores the multiple-step request as a favorite request.

Abstract: Methods, systems, and media for providing distributed database access during a network split. In some embodiments, the method comprises: receiving, at a node of N nodes, configuration information of the database which indicates which of the N nodes stores replicated shards of the database including master shards and corresponding slave shards, N being an odd number greater than one; identifying, after a network split, a subset of the N nodes which are capable of communicating with each other; receiving, by a proxy, a request to perform a write operation to an object in the database; determining that a second node included in the subset of the N nodes stores a master shard including the object; determining that the subset includes at least (N+1)/2 nodes; and causing the request to perform the write operation to be routed to the second node.

Abstract: A system and method for enabling information extraction from large data sets (so-called “big data”) according to a new paradigm is disclosed. This system does not generate functions describing why certain inputs result in certain outputs. Instead, it creates incident mappings of inputs to outputs without regard to why inputs result in outputs. These mappings can be distributions or other data sets representative of different outcomes occurring. This enables several useful operations. For example, by providing a data set indicative of outputs that have historically occurred following a particular input, the disclosed system can be used to predict future outcomes with probabilities. For example, if a particular stock price pattern is provided as an input, the system generates an output data set indicating the probabilities of certain price behaviors following that input pattern. This data set can thus be used to predict future behavior. Other useful operations are disclosed herein.

Abstract: Systems, methods and computer program products for using searchable aggregate indices associated with non-aggregated value storage. In one method, a search system stores metadata values for each of a plurality of objects in a storage unit. The metadata values are stored in corresponding value storage locations that are associated with an identifiable metadata fields. An aggregate index is provided which includes a dictionary of terms that are contained in metadata values associated with a designated set of the metadata fields. The aggregate index is searched for one or more specific search terms, and one or more of the metadata values are retrieved from the value storage locations in response to the search, where the individual metadata fields associated with the retrieved metadata values are identified.

Abstract: In an approach for managing webpage content access across a group of users, a computer receives a group comprising one or more users. The computer receives a webpage associated with the group. The computer stores at least one snapshot of the received webpage. The computer receives a request to access the received webpage from a user wherein the user is a member of the received group. The computer selects a snapshot from the stored at least one snapshot based on the received request to access the received webpage. The computer provides the selected snapshot from the stored at least one snapshot to the user associated with the received request.

Abstract: Various technologies related to generating and applying content retrieval rules are described herein. A content retrieval rule maps a combination of a query and a context to one of a query reformulation or content. The content retrieval rule is learned from search logs of a search engine, and is applied when the query having the context is received at the search engine.

Abstract: According to one embodiment, a master storage node receives a search query for searching images from a client, where the master storage node is coupled to a number of worker storage nodes over a storage network. The master storage node performs a hash operation on one or more keywords of the search query using a first predetermined hash function, generating a first hash value. A first of the worker storage nodes is identified based on the first hash value. The master storage node redirects the search query to the first worker storage node to allow the first worker storage node service the search query. The first worker storage node is to identify one or more images from a first system memory of the first worker storage node based on the search query and to transmit the one or more images to the client.

Abstract: Techniques for synonym expansion are provided. An example method includes retrieving one or more multimedia items and one or more keywords associated with the multimedia items, wherein the retrieving is performed for the one or more multimedia items that are associated with both a query term and a synonym from a synonym pair, determining a first set of one or more keywords that are common to a group of multimedia items obtained based on the retrieving, determining, for each keyword from the first set of one or more keywords, a context score quantifying a value of the keyword for the synonym pair, based on the context score, determining from the first set of one or more keywords a second set of keywords that correlate higher to the synonym pair relative to other keywords from the second set of one or more keywords.

Abstract: A system and method may allow for improved accuracy for name matching. The system may receive a name input and preprocess the name input. The name input may be tokenized to create a name token. The name token may be compared to a stored name. The system may calculate a first name matching score based on the comparison. The system may permute the name token to form a second level permutation name, compare the second level permutation name with the stored name, and calculate a second name matching score based on the comparison. The first name matching score may be compared with the second name matching score to improve accuracy in name matching.

Abstract: Storing time series data for a search query includes identifying a time series whose representation is to be pre-computed based on available memory storage, pre-computing at least one representation of the identified time series, and storing the at least one representation in the memory storage.

Abstract: An information processing apparatus includes a presentation unit that, when each user is assigned at least one tag indicating characteristics of the user and a tag is in common between a viewing user and a viewed user, presents the tag in common of the viewing user in more detail than a tag which is not in common.

Abstract: A network of computers providing improved data retrieval. The network includes a service platform providing a service to other computers outside of the network. The network also includes a command module deployed on the service platform performing a monitoring action independently or upon request for a capture of data. The network also includes a query module deployed on the service platform responding to requests for a return of data, the query module being independent of the command module. The command module and the query module are implemented using command-query separation based on imperative computer programming. Independence of command and query enable the capture of and review of data to be evolved independently from each other, enabling dynamic change management and responsiveness of monitoring relative to an agent-based service monitoring platform.

Abstract: In a general aspect, a method includes inserting a record in a partitioned fact table of a star schema data mart. Inserting the record can include determining a first hash value from a first dimension value of the record and determining a first set of candidate partitions from the first hash value. The method can further include determining a second hash value from a second dimension value of the record and determining a second set of candidate partitions from the first hash value. The method can further include comparing the first set of candidate partitions with the second set of candidate partitions to determine a common partition and inserting the record into the common partition.

Abstract: Technology is disclosed herein for compressing, encoding, and otherwise reducing the size of resource files. In at least one implementation, similarity compression is employed to reduce the size of a resource file. In another implementation, map-less encoding is employed to reduce the number of bytes used to represent a resource string. Bit-level compression is employed in another implementation to reduce the quantity of bits used to encode each character in a string. In addition, implementations are disclosed related to technology for naming strings and accelerated string location and retrieval.

Abstract: A method is performed at a computing system having one or more processors and memory. The process generates a hierarchical set of folders for a collection of documents. Each folder specifies a rule/query (possibly empty) for identifying a subset of the collection of documents. Each folder also specifies a user-defined set (possibly empty) of individual documents from the collection of documents. In addition, each folder specifies a set (possible empty) of subfolders. The process receives user input to select a first folder of the set of folders, and generates a responsive result set. The result set includes documents that satisfy the specified rule for the first folder, documents from the user-defined set of documents for the first folder, and documents recursively contained in subfolders of the first folder. The process then displays the result set to the user.

Abstract: Aspects described herein relate to methods and systems for comparing data stored in disparate parallel systems using hash sums. A database having a parallel system architecture may comprise a plurality of nodes each storing a plurality of records. A central node may initiate parallel calculation of a set of node hash sums for each individual node. Calculating a node hash sum for an individual node may comprise calculating, by the individual node, a set of hash values for each individual record of the plurality of records stored by the individual node and combining each hash value of the set of hash values to generate the node hash sum for the individual node. The central processor may combine each node hash sum to generate a database hash sum. The central processor may store the generated database hash sum and/or utilize it in comparisons with database hash sums for other databases.