Abstract: Systems and methods are disclosed for implementing an event based retention schedule for a read only file. When a regular file is to be converted to an event based retention read only file, an “event-retain” property may be enabled on the file allowing the feature to be implemented. Then, that file may have its permissions changed to read only. This will allow the file to be changed to a read only file without using a default retention time. Then, once the event is triggered, the retention time may be set so the file can be scheduled for automatic deletion.

Abstract: Techniques are described for generating a hierarchical group based on a set of data. In one example, a method includes classifying two or more data items from a set of data with respect to a library of ontological concepts. The method further includes classifying the two or more data items with respect to lexical correlations between the two or more data items. The method further includes generating a hierarchical group in which the two or more data items are partitioned into one or more hierarchical partitions based at least in part on the classifying with respect to the library of ontological concepts and the classifying with respect to the lexical correlations, wherein each of the one or more hierarchical partitions comprises the two or more data items.

Abstract: One or more techniques and/or computing devices are provided for data synchronization. For example, an in-flight log may be maintained to track storage operations that are received by a first storage node, but have not been committed to both first storage of the first storage node and second storage of a second storage node that has a replication relationship, such as a disaster recovery relationship, with the first storage node. A dirty region log may be maintained to track regions within the first storage that have been modified by storage operations that have not been replicated to the second storage. Accordingly, a catchup synchronization phase (e.g., asynchronous replication by a resync scanner) may be performed to replicate storage operations (e.g., replicate data within dirty regions of the first storage that were modified by such storage operations) to the second storage until the first storage and the second storage are synchronized.

Abstract: Systems and methods are provided for evicting entries from a file handle cache. In accordance with certain embodiments, a two-stage eviction process is utilized. In a first stage of the eviction process, entries in the file entry cache are analyzed and marked for eviction while a shared lock is maintained on the file handle cache. The shared lock enables the file handle cache to be concurrently accessed by a content serving system to service content requests. In a second stage of the eviction process, entries in the file handle cache that are marked for eviction are removed while an exclusive lock is maintained on the file handle cache. The exclusive lock prevents the content serving system from concurrently accessing the file handle cache to service content requests.

Abstract: Managing data conversion for user-defined data types within a DBMS. A custom data type definition and one or more converters are stored within a database management system. Each converter can convert instances of the custom data type between a binary format and a programming language format. The database management system receives a request for a custom data type instance in a specified programming language format. A converter among the one or more converters converts the custom data type instance expressed in the binary format into a custom data type instance expressed in the specified programming language format, using a custom data type definition from the database management system. The request is responded to with the converted custom data type instance in the specified programming language format.

Abstract: Methods, systems, and computer-readable media for digital document management. A physical context can be identified, wherein such a physical context includes three dimensions of data. One or more digital documents can be automatically linked to the physical context, after identifying the physical context. Constraints can then be combined, which are derived from the three dimensions of data, allow particular actions with respect to the digital document(s). The three dimensions of data include, for example, data indicative of location, time, and a social component (e.g., people present at a location). Actions with respect to the digital document can include, for example: an allowed action, a restricted action, or a prohibited action (e.g., read/write).

Abstract: Techniques herein minimize memory needed to store distances between vertices of a graph for use during a multi-source breadth-first search (MS-BFS). In an embodiment, during each iteration of a first sequence of iterations of a MS-BFS, a computer updates a first matrix that contains elements that use a first primitive integer type having a first width to record a distance from a source vertex of a graph to another vertex. The computer detects that a count of iterations of the first sequence of iterations exceeds a threshold. Responsively, the computer creates a second matrix that contains elements that use a second primitive integer type having a second width that is larger than the first width to record a distance from a source vertex of the graph to another vertex. During each iteration of a second sequence of iterations of the MS-BFS, the computer updates the second matrix.

Abstract: A system and method is described for database split generation in a massively parallel or distributed database environment including a plurality of databases and a data warehouse layer providing data summarization and querying functionality. A database table accessor of the system obtains, from an associated client application, a query for data in a table of the data warehouse layer, wherein the query includes a user preference. The system obtains table data representative of properties of the table, and determines a splits generator in accordance with one or more of the user preference or the properties of the table. The system generates, by the selected splits generator, table splits dividing the user query into a plurality of query splits, and outputs the plurality of query splits to an associated plurality of mappers for execution by the associated plurality of mappers of each of the plurality of query splits against the table.

Abstract: Disclosed is a method and apparatus to programmatically determine a home location for a user, to cluster photographs and videos into events and trips relative to the home location, to determine names for the events and trips, to composite stories created from the events and trips, to update the composited stories over time, and to output the composited stories for display.

Abstract: A storage device initiates a change in its file system and locally stores it for future updates of the file system. The host device sends a command to the storage device and the storage device responds by commencing a synchronization process during which the two parties coordinate the update of the file system with the stored change.

Abstract: A method for comparing and analyzing digital documents includes searching for unambiguous roots in both documents. These roots are unique units that occur in both documents. The roots can be individual words, word groups or other unambiguous textual formatting functions. There is then a search for identical roots in the other document (Root1 from Content1, and Root2 from Content2, with Root1=Root2). If a pair is found, the area around these roots is compared until there is no longer any agreement. During the area search, both preceding words and subsequent words are analyzed. The areas that are found in this way, Area1 around Root1 and Area2 around Root2, are stored in lists, List1 and List2, allocated to Doc1 and Doc2. This procedure is repeated until no roots can be found any longer. The result is either a remaining area that has no overlaps, or complete identity of the documents.

Abstract: A database system supporting persistent queries, using an enhanced persistent query service and various data sources. On receiving a request to create a persistent query from a client software application, the persistent query service: creates a query virtual table; parses the persistent query; creates a plurality of intermediate virtual tables; establishes listeners for the query virtual table; creates a plurality of data source virtual tables; causes the plurality of data source virtual tables to retrieve initial data from data sources; and propagates data via intermediate virtual tables to the persistent query virtual table.

Abstract: An embodiment pertains generally to a method of classifying information. The method includes providing for a data object and receiving ownership roles for the data object. The ownership roles establishes at least one user as associated with the data object and a relationship of the at least one user to the data object. The method also includes generating metadata comprising the ownership roles and outputting the metadata to be stored with the data object.

Abstract: A processor-implemented method for replicating structured query language (SQL) in a heterogeneous replication environment is provided. The method includes receiving a first statement for a multi-row operation, whereby the multi-row operation is directed to one or more tables of a database, and whereby the first statement includes a text of a SQL statement in a DBMS transaction log. The method also provides for evaluating whether to create a source tree structure from the received first statement. In response to creating the source tree structure, the method evaluates whether the source tree structure is transformable. The method transforms the source tree structure to a target tree structure in response to evaluating that the source tree structure is transformable.

Abstract: A processor-implemented method for replicating structured query language (SQL) in a heterogeneous replication environment is provided. The method includes receiving a first statement for a multi-row operation, whereby the multi-row operation is directed to one or more tables of a database, and whereby the first statement includes a text of a SQL statement in a DBMS transaction log. The method also provides for evaluating whether to create a source tree structure from the received first statement. In response to creating the source tree structure, the method evaluates whether the source tree structure is transformable. The method transforms the source tree structure to a target tree structure in response to evaluating that the source tree structure is transformable.

Abstract: Embodiments provide a computer implemented method, in a data processing system comprising a processor and a memory comprising instructions which are executed by the processor to cause the processor to implement a full question generation system, the method comprising ingesting, into the full question generation system, a query dataset derived from one or more search queries entered by one or more users of an internet search engine; identifying questions from the ingested query dataset; separating, through a full question identification module, one or more prior full questions from the ingested dataset; identifying, through a question intent query identification module, one or more question intent queries from the query dataset; for each identified question intent query: sorting, through a sorting module, the question intent query into one or more bins based on one or more missing interrogative words; and appending, through an appending module, the missing interrogative word and a verb onto the question intent

Abstract: Embodiments provide a computer implemented method, in a data processing system comprising a processor and a memory comprising instructions which are executed by the processor to cause the processor to implement a full question generation system, the method comprising ingesting a query dataset derived from one or more search queries entered by one or more users of an internet search engine; identifying questions from the ingested query dataset; separating one or more prior full questions from the ingested dataset; identifying one or more question intent queries from the query dataset; for each identified question intent query; sorting the question intent query into one or more bins based on one or more missing interrogative words; and appending the missing interrogative word and a verb onto the question intent query to generate a full question. The full question generation method can additionally generate un-canonical questions.

Abstract: Some stream data (e.g., sensor streams) has characteristics in which data is periodically sent to a stream data processing server. When data arrives periodically, to hold a certain period is the same as to hold a certain amount. Example implementations described herein are directed to replacing the range window, which holds a period of stream data, with a row window which holds an amount of stream data. In the same manner, the example implementations replace the range rstream, which outputs results every period, with a row rstream which outputs results for every amount.

Abstract: The illustrative systems and methods advantageously reduce the amount of storage space occupied by data that no longer has a useful life—as established by the data objects' user(s) and overcoming predetermined rules required by information management policies. An illustrative data agent may receive instructions from an illustrative storage manager to perform secondary copy operations for a given set of data objects. The instructions may generally instruct that expiry-marked data objects are to be treated based on parsing each data object's user-supplied expiry timeframe.

Abstract: A method for organizing images from multiple image capture devices includes automatically determining a coarse offset between image capture times recorded in a first image capture device and image capture times recorded in a second image capture device. The coarse offset is determined by a computing a correlation between image counts of images captured by the first image capture device and images captured by the first image capture device. The method also includes adjusting the image capture times of images recorded in the second image capture device by the coarse offset to produce adjusted image capture times for images captured by the second image capture device.