Abstract: Systems and methods for processing a query are provided. A method for processing a query of a tree-based dataset, comprises receiving the query, and analyzing the query and the dataset to create an execution plan for the query, wherein creating the execution plan comprises partitioning traversals over the dataset into sequential and parallel components, and distributing the components across a plurality of processing threads that independently traverse their portion of the dataset and compute local results. The method further comprises merging the local results to compute a final result.

Abstract: Digital content, such as video, audio, multimedia, and similar files may be segmented at a determined frame resolution rate and analyzed to determine a fingerprint for each content segment. An identifier that uniquely identifies each content segment may be determined based on the fingerprint of the respective content segment. The identifier may be associated with data relating to the content segment and with one or more identifiers that uniquely identify other content segments of the content. The content segment identifiers may be used to construct a content segment sequencing representation that represents the playback of the content segments in playback order.

Abstract: Described are methods, systems and computer readable media for data source refreshing using an update propagation graph with feedback cyclicality.

Abstract: Technology is disclosed for classification of data objects (e.g., files) in a distributed file system based on application creation and/or access information. In some embodiments, data objects of a user are stored across multiple computing devices associated with a user, e.g., mobile computing devices such as a tablet, a laptop, or a smartphone, and/or at server systems, e.g., cloud-based storage servers, in a distributed cloud-based storage system. The technology described tracks the applications that create or touch particular data objects in the distributed file system and classifies the data objects according to these applications resulting in various application classifications. For example, a classification engine can process data objects in the distributed file system to identify an application that created the data object and/or applications that have accessed the data object. The classification information can be saved by, for example, a cloud-based storage server.

Abstract: A method of securely deleting data from a data storage device is described. The method includes the steps of receiving a secure delete command to securely delete a file. A data block of the file to securely delete is identified. A pointer to the data block is stored in a deletion buffer. It is then determined whether the secure delete command has a highest priority over other data storage device commands. In response to the secure delete command having the highest priority, the secure delete command to the data block is performed.

Abstract: Embodiments are directed towards managing within a cluster environment having a plurality of indexers for data storage using redundancy the data being managed using a generation identifier, such that a primary indexer is designated for a given generation of data. When a master device for the cluster fails, data may continue to be stored using redundancy, and data searches performed may still be performed.

Abstract: To enable visual verification of the suitability of work items that has been recorded, with an application created in accordance with a document centric architecture. The present invention includes: extracting, from a design, a document state that will become a trigger for work activity start and a document state for the result, and, based on matching the triggers and results, diagramming through automatically structuring a flow for the plurality of activities. Specifically, design documents are analyzed and implementations for each activity support system, and extracted the collection of documents that have become the conditions for document states that will become triggers for work start, as well as the document states that will remain as work results.

Abstract: An “operate with missing region” feature allows a cluster to continue servicing reads for available regions even when some regions are missing. Upon a given node failure condition, the cluster is placed in an effective read-only mode for all regions. The node failure condition typically is one where there has been a failure of an authoritative region copy and no backup copy is then available. Typically, “read-only” means no client write or update requests succeed while the cluster is in this state. Those requests should fail with an error message that indicates failure because of the read-only status. Preferably, such requests are re-tried. In this mode, regions are only allowed to perform read operations but the cluster continues to operate with missing regions, and missing regions are entered on a region map. The cluster then automatically recovers returning missing regions, after which it leaves the read-only state.

Abstract: Example apparatus and methods access multiple sources of information concerning features for applications, clean the data from the multiple sources, extract features from the cleaned data, selectively weight the sources, data or extracted features and produce a feature vector. The feature vector may then be used in a single language feature space or in a multi-language feature space. Feature spaces may then be used to find similarities between applications to facilitate recommending applications. In one embodiment, different feature spaces may be connected using a graph where nodes represent items and edges represent similarity relationships between items based on related feature spaces. Traversing the graph may allow similarities to be found that might not otherwise be possible. For example, while there may be no direct English to Hebrew similarity relationship, there may be English to French and French to Hebrew relationships that can be followed in the graph.

Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. Metadata objects are stored in a set of regions distributed among the nodes across the array. A given region is identified by hashing a metadata object attribute and extracting a given set of bits of a resulting hash value. A method of managing query results comprises: receiving, by a first node of the plurality of independent nodes from a client application, a request for a list of objects with a criterion; issuing by the first node a query to all the nodes based on the received request; processing the query by each node over the regions in the node using the metadata objects stored in the regions; aggregating and filtering by the first node results of the query from all the nodes; and returning by the first node the aggregated and filtered results to the client application.

Abstract: A row is inserted in a database table on a page having a first space reserved for inserting rows of the database table. A second space is reserved for adding data to the inserted row, wherein reserving the second space includes reserving the second space on the page responsive to inserting the row, so that the amount of space reserved for adding data to inserted rows grows as more rows are inserted. The page is marked full for the second space independently of whether the first space is full for inserting new rows. Data is added to rows on the page, responsive to detecting that the second space is full, by adding the data to one or more new pages, even though rows may still be inserted on the page using any remaining room in the first space on the page.

Abstract: Streaming data, such as streaming records transmitted from entities, can be managed. For example, a new record associated with an entity can be received. There can be an existing record for the entity within a group of records. The group of records can form a block. A new block for the new record can be generated. A datastore can be updated to indicate that the new block has the most current record for the entity. Entries in the datastore can be filtered to identify a subgroup of blocks that has the most current record for each entity of multiple entities. A combined group of blocks can be generated by joining the new block with the subgroup of blocks. The combined group of blocks can be processed as a batch of data by a processing engine.

Abstract: A system and method for data storage by shredding and deshredding of the data allows for various combinations of processing of the data to provide various resultant storage of the data. Data storage and retrieval functions include various combinations of data redundancy generation, data compression and decompression, data encryption and decryption, and data integrity by signature generation and verification. Data shredding is performed by shredders and data deshredding is performed by deshredders that have some implementations that allocate processing internally in the shredder and deshredder either in parallel to multiple processors or sequentially to a single processor. Other implementations use multiple processing through multi-level shredders and deshredders. Redundancy generation includes implementations using non-systematic encoding, systematic encoding, or a hybrid combination.

Abstract: In one embodiment, a computer-implemented method includes selecting one or more sub-expressions of a query during compile time. One or more pilot runs are performed by one or more computer processors. The one or more pilot runs include a pilot run associated with each of one or more of the selected sub-expressions, and each pilot run includes at least partial execution of the associated selected sub-expression. The pilot runs are performed during execution time. Statistics are collected on the one or more pilot runs during performance of the one or more pilot runs. The query is optimized based at least in part on the statistics collected during the one or more pilot runs, where the optimization includes basing cardinality and cost estimates on the statistics collected during the pilot runs.

Abstract: Disclosed are systems and methods for requesting operations at a remote server utilizing a network file system. A client may encapsulate a request for a cache coherency mechanism as an encapsulated message and provide the encapsulated message to a network file system executing on the client. The network file system may be configured to prevent the request for server functionality from being transmitted to the remote server. The client may also cause, via the network file system, the encapsulated message to be transmitted to the remote server.

Abstract: A system and method for data storage by shredding and deshredding of the data allows for various combinations of processing of the data to provide various resultant storage of the data. Data storage and retrieval functions include various combinations of data redundancy generation, data compression and decompression, data encryption and decryption, and data integrity by signature generation and verification. Data shredding is performed by shredders and data deshredding is performed by deshredders that have some implementations that allocate processing internally in the shredder and deshredder either in parallel to multiple processors or sequentially to a single processor. Other implementations use multiple processing through multi-level shredders and deshredders. Redundancy generation includes implementations using non-systematic encoding, systematic encoding, or a hybrid combination.

Abstract: In a storage cluster, a producer and a consumer can be remote from each other and have different capabilities. For example, a consumer may be running on a computing node (hereinafter “node”) that operates faster than a node hosting a producer. In addition, network conditions can impact communications to/from the producer and/or the consumer. This environment allows the possibility of a consumer violating sequential access constraints of a file when a producer is writing to the file. This can lead to the consumer reading incorrect data. A file system can ensure compliance with serialization of a concurrently accessed file by obtaining a lock on a subsequent file range before releasing a currently held write lock.

Abstract: Techniques to back up data are disclosed. In various embodiments, a shadow copy of a source volume is created. An excluded file is deleted from the shadow copy. One or more blocks modified in the shadow copy in connection with deleting the excluded file from the shadow copy are tracked. An incremental backup is performed, the incremental backup includes determining one or more blocks to be backed up in connection with the incremental backup based at least in part on at least one of the tracked one or more blocks modified in the shadow copy and a merged bitmap corresponding to a merger of a first bitmap associated with the shadow copy and a second bitmap associated with the source volume.

Abstract: A method for providing a search tool for use in connection with address book management may include receiving an indication of an address book update event associated with a contact of an address book of a user, causing performance, via a processor, of a search responsive to receipt of the indication, and enabling modification of contact information associated with the contact based on the search results. A corresponding apparatus and computer program product are also provided.

Abstract: An information processing device includes: a metadata retaining section retaining metadata of a file formed by a plurality of data blocks; a correspondence file retaining section retaining a correspondence file associating information identifying a recording location of a data block with information identifying the metadata retaining section retaining the metadata of the data block; a change processing section changing the recording location of the data block; and an update processing section updating the metadata retained by the metadata retaining section. The update processing section refers to the correspondence file, identifies the metadata retaining section retaining the metadata of the data block whose recording location is changed by the change processing section, and updates the metadata.