Abstract: A synchronization engine detects a notification of a change to a file. It determines whether an application associated with the file has indicated that the file is to be synchronized by the application. If so, the changes to the file are synchronized between a cloud-based storage system and a local disk by the application. Collaborative metadata, associated with the synchronized file, is updated to indicate a state of a copy of the file on the local disk and a copy of the file in the cloud-based storage system. The collaborative metadata is stored by the synchronization engine.

Abstract: A transactional replicator applying group commit and barrier concepts is disclosed. Group commit means that the transactional replicator commits multiple transactions in a group and is not restricted to committing single transactions one-at-a-time and is not limited to operating on a single state provider. Barrier means that the transactional replicator does not move forward to commit additional transactions until the previous group of transactions are completed. All state providers must apply their transactions and update state before additional transactions will be committed. A quorum acknowledgement “unlocks” any locks that were acquired to update the state within a state provider. However, as long as there are no lock conflicts, additional transactions can continue to create new group commits as necessary.

Abstract: A system and method for organizing and representing in a single display, using temporal and locational relationships, multiple selected pieces of information that may exist in different embodiments and that may be related to one or more past, present or future events.

Abstract: Embodiments regard protected handling of database queries. An embodiment of a method for querying database system views and tables includes: receiving a user query from a user, the user query being directed to one or both of a view and a table of a database, wherein the user is not a database administrator; parsing the user query with a query parser to identify elements of the user query, parsing the query including determining whether the query meets certain database access criteria; automatically generating a database query based on the parsing of the user query, the generation of the database query including generating a database query that is limited by the database access criteria; accessing the one or both of the view and the table using the generated database query, wherein the access is limited to read-only access; and obtaining a result of the access of the one or both of the view and table.

Abstract: In one aspect, a method for intelligently learning hashtag relevance may include monitoring, with a relevance engine, a target's access to a plurality of hashtag-annotated content comprising a first content, updating, using the relevance engine, an access record with information indicative of a number of times the target is presented with the first content and the first content remains unselected by the target, determining a relevance of the plurality of hashtag-annotated content based on the access record, and presenting a second hashtag-annotated content based on the relevance.

Abstract: Deduplication in a distributed storage system is described. A deduplication manager defines a first extent on a first node in a distributed storage system. The deduplication manager selects a second extent from the one or more groups of extents. The second extent matches the first extent. The deduplication manager removes, from the first extent, one or more data chunks that are included in the second extent. The deduplication manager associates, with the first extent, a pointer to the second extent for the removed one or more data chunks.

Abstract: The present invention provides a method and system for querying a trie data structure. The method and system include constructing a pool of linear programming problems for a trie data structure, storing the pool of linear programming problems in a memory, receiving a request, setting variables in one linear programming problem to unity, sending the one linear programming problem to a solver, wherein the solver sets a p variable corresponding to each path to 0 or 1, iterating through p variables corresponding to one or more paths, considering at most n paths, selecting one path from the n paths, assigning same values as that of one or more variables of the unknown value type nodes that are present in the selected one path, and reselling variables in the one linear programming problem to zero that was previously set to unity.

Abstract: A video searching method and a video searching system are applied to an auxiliary searching of an original video. The video searching method includes setting a region-of-interest in a screen of the original video, setting a capturing condition that includes an interactive relation between the region-of-interest and a moving object of the original video, capturing a background screen of the original video and object snapshots of the moving object that comply with the capturing condition, selecting at least one of the object snapshots captured from the same moving object as a representative object snapshot, or integrating some of the object snapshots as a single representative object snapshot; and pasting the representative object snapshot at a coordinate corresponding to the background screen according to a corresponding timestamp, to generate a graphical event timeline that displays all the object snapshots.

Abstract: Techniques for tuning the key space of an instance of a tree data structure are provided. In one embodiment, a computer system can receive a request to create the instance, where the request includes an expected key space value indicating an expected range of key values to be addressed by the instance. The computer system can further calculate a number of bits to allocate to each key of each node of the instance based on the expected key space value. The computer system can then, at a time of instantiating each node of the instance, allocate the keys for the node in accordance with the calculated number of bits.

Abstract: There is disclosed a method of processing a search query, the method executable at a server.

Abstract: One or more buckets of key-value pairs of a first node of a distributed storage system are selected to be migrated to a second node of the distributed storage system. One or more underlying database files corresponding to the one or more selected buckets are identified. The one or more identified underlying database files are directly copied from a storage of a first node to a storage of the second node. The copied underlying database files are linked in a database of the second node to implement the one or more selected buckets in the second node.

Abstract: In various embodiments, methods, systems, and non-transitory computer-readable media are disclosed that allow developers to place client-side validation rules on user interface components using a desktop integration framework. The validation rules can be tied to translatable resources or model metadata. In one aspect, the validation rules metadata is provided separately from the document to which the validation rules will eventually be tied.

Abstract: An electronic device and a method for providing content on the electronic device are provided. The method includes receiving webpages from information sources, extracting intent data related to an object in the webpages, transmitting the extracted intent data to a server, and receiving, from the server, a content list including a content index that is determined based on the transmitted intent data.

Abstract: A method for recommending hashtags includes determining keywords from a post planned for publishing by a publisher. An input criteria comprising at least one of age group, geographical location, date range, or a keyword is received. Previous posts associated with the keywords and satisfying the input criteria are obtained. The previous posts are categorized into one or more categories based on sentiment of each post and for each category hashtags used in the obtained previous posts in that category are determined. The hashtags are ranked based on predefined criteria comprising at least one of frequency of appearance of respective hashtag in posts, number of likes or shares or retweets of post comprising respective hashtag, number of followers of person who used respective hashtag, or sentiment of post comprising respective hashtag. The hashtags are then recommended, based on ranking, to the publisher for use with the post planned for publishing.

Abstract: The formulation of transformations on one or more input event streams to generation one or more output event streams. Accordingly, the transformations may be considered to be a query on the original input event stream(s). The event query includes event stream source representations representing an input event stream available in a particular execution context. The event query also includes a transformation module identifying the transformation set to be performed on the input event streams in the execution context. Once the query is properly formed, an execution module may then cause the transformations to be executed upon the designated input event stream(s) to generate output event streams.

Abstract: Asynchronous operations associated with a request such as threads, runnable elements, callable elements, and other invokable objects are tracked to determine the metrics about the request and operations. The present technology tracks the start and end of each asynchronous operation and maintains a counter which tracks the currently pending or executing asynchronous operations. By monitoring the request, the start and end of each asynchronous operation associated with the request, and the number of asynchronous operations currently executing, the present technology may identify the end of a request by identifying when the last asynchronous operation associated with the request ends. In some instances, the present technology identifies the end of a request when a counter which tracks the number of asynchronous operations executing reaches a value of zero after the first asynchronous operation has already begun.

Abstract: Exemplary methods, apparatuses, and systems include a host computer detecting a request to utilize data stored at a storage address in an external storage device. The host computer, in response to the detected request, transmits a request to the storage device for a tag that uniquely identifies the data. The tag for the data is received from the storage device. In response to determining that the received tag matches a local mapping of tags stored in the host computer, the host computer utilizes the local mapping of tags to process the detected request.

Abstract: Automated join detection includes: identifying a set of one or more candidate joins of a first table and a second table; evaluating a set of one or more quality measures corresponding to the set of one or more candidate joins; obtaining a set of one or more selected joins among the set of one or more candidate joins, the set of one or more selected joins being selected based at least in part on one or more corresponding quality measures; and generating a joined table, including by joining the first table and the second table according to a selected join.

Abstract: The present disclosure relates to implementing text and formatting changes in a collaborative context. In certain embodiments, a single code pathway is employed that may be used for implementing text and format change operations in a collaborative context. In one such implementation, a multi-field or multi-slot storage class structure is provided that allows a forward action provided by a user to be implemented in a collaborative environment and which allows generation of and tracking of undo, rollback, or reapply operations associated with the initial forward action.

Abstract: A multi-dimensional database and indexes and operations on the multi-dimensional database are described which include video search applications or other similar sequence or structure searches. Traversal indexes utilize highly discriminative information about images and video sequences or about object shapes. Global and local signatures around keypoints are used for compact and robust retrieval and discriminative information content of images or video sequences of interest. For other objects or structures relevant signature of pattern or structure are used for traversal indexes. Traversal indexes are stored in leaf nodes along with distance measures and occurrence of similar images in the database. During a sequence query, correlation scores are calculated for single frame, for frame sequence, and video clips, or for other objects or structures.