Abstract: In accordance with embodiments, there are provided mechanisms and methods for creating an object within a system, utilizing a template. These mechanisms and methods for creating an object within a system, utilizing a template can enable increased efficiency, resource and time savings, more intuitive object creation, etc.

Abstract: A data slice to be stored in a dispersed storage unit of the dispersed storage system is received. A plurality of data blocks are generated from the data slice and metadata are generated associated with each of the plurality of data blocks. A data file is generated based on the plurality of data blocks. A metadata file is generated based on the metadata associated with the plurality of data blocks. The metadata file and the data file are stored in at least one memory of the dispersed storage unit.

Abstract: Securing application information in a shared, system-wide search service, in which each application can register a security filtering module that is to be used at search time to filter data associated with that application. Initial, unfiltered search results are obtained based on the contents of the shared search index, and are organized by application. Previously registered filter modules are called to perform user specific, per-application filtering on the initial results, such that data to which the user issuing the search request does not have access is removed from the search results, resulting in a set of filtered search results that are presented to the user and that contain indications only of data that is accessible to the user.

Abstract: Search results are provided with personalized deeplinks for an end user. User behavior information is gathered regarding web pages visited by the end user. When the end user submits a search query, the website category of a search result is identified and user behavior information regarding web pages visited at other websites within the website category is identified. At least one deeplink is selected for the search result based on that user behavior information. In some instances, user behavior information may be tracked for a group of end users. The user behavior information for the group of end users may be used in conjunction with the user behavior information for the end user to facilitate deeplink selections for search results returned in response to search queries from the end user.

Abstract: A mechanism is provided for computing the frequency packets in network devices. Respective packets are associated with entities in a vector, where each of the entities is mapped to corresponding ones of the respective packets, and the entities correspond to computers. Upon a network device receiving the respective packets, a count is individually increased for the respective packets in the vector respectively mapped to the entities, and computing a matrix vector product of a matrix A and the vector. The matrix A is a product of at least a first matrix and a second matrix. The first matrix includes rows and columns where each of the rows has a single random location with a one value and remaining locations with zero values. The matrix vector product is transmitted to a centralized computer for aggregating with other matrix vector products.

Abstract: A method for archiving to a single database table information located across multiple database tables. The method begins by monitoring at least one data value residing in the multiple database tables. After monitoring, the method continues by identifying at least one archival data value where each archival data value corresponds to a unique data value not exceeding a threshold. An end user provides the threshold used to identify the archival data values prior to execution of the method. After identifying the archival data values, the method continues by storing archive files in the single database table, each archive file comprising at least one archive data value. Finally, after storing the archive files in the single database table, the method concludes by removing from the multiple database tables each archival data value.

Abstract: A file server system having solid-state drive primary storage and magnetic disk drive secondary storage aggressively moves newly created files from the primary storage to selected file systems in the secondary storage to match expected access patterns upon the files to different configurations of the file systems and for load balancing upon the file systems in the secondary storage. Upon read access to a file that has been moved to the secondary storage, or upon migration of a newly created file that was read in primary storage after creation, a corresponding stub file containing file mapping metadata is created in the primary storage. The file mapping metadata in the stub file maps the extent of the file to logical storage addresses in the secondary storage.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for training recognition canonical representations corresponding to named-entity phrases in a second natural language based on translating a set of allowable expressions with canonical representations from a first natural language, which may be generated by expanding a context-free grammar for the allowable expressions for the first natural language.

Abstract: Relaxing of anchor validation in a distributed synchronization environment, in one aspect, updates a synchronization anchor during synchronization of data between computing devices only in response to determining that the data operation if repeated the second time on the computing device would change overall data stored on the computing device.

Abstract: Systems and methods are provided herein for storing data to enable inexpensive and/or guaranteed deletion of data. In various embodiments, a customer specifies a data deletion indication associated with a data object to be stored, specifying when and/or how to delete the data object. Such a data deletion indication may be based, for example, on a regulatory compliance requirement. Based at least in part on the data deletion indication, the storage system may select, from a plurality of storage devices, a storage device to store the data object. Data objects with similar data deletion indications may be stored in the same storage device. In some embodiments, a data object stored in a storage device using the methods described herein may be deleted as part of the deletion of all or a portion of the storage device near a time specified by the data deletion indication of the data object.

Abstract: Disclosed are various embodiments for analyzing user searches of verbal media content associated with media content features. A search query is obtained from a user. Media content items are determined by executing a verbal media content search based at least in part on the search query. The media content items include verbal media content that is relevant to the search query. Data relating to the verbal media content search is stored. A user interest in media content is determined by analyzing the data relating to the verbal media content search.

Abstract: A mechanism is provided for computing the frequency packets in network devices. Respective packets are associated with entities in a vector, where each of the entities is mapped to corresponding ones of the respective packets, and the entities correspond to computers. Upon a network device receiving the respective packets, a count is individually increased for the respective packets in the vector respectively mapped to the entities, and computing a matrix vector product of a matrix A and the vector. The matrix A is a product of at least a first matrix and a second matrix. The first matrix includes rows and columns where each of the rows has a single random location with a one value and remaining locations with zero values. The matrix vector product is transmitted to a centralized computer for aggregating with other matrix vector products.

Abstract: A first iterative Grover Search process is performed by causing at least one quantum computer to perform a first series of Grover Searches according to a characteristic function for varying numbers of iterations to identify a first search target. The characteristic function is modified according to the identified first search target. A second iterative Grover Search process is performed by causing the at least one quantum computer to perform a second series of Grover Searches according to the modified characteristic function beginning with a number of iterations determined based on a number of iterations required for at least one prior iterative Grover Search process to identify a second search target.

Abstract: A system, method, means, and/or computer program code may be provided to facilitate query creation and a presentation of information to a user. According to some embodiments, continuous query definition parameters are received from a user via a graphical user interface. Moreover, semantic layer information associated with an event processing engine may be retrieved, the event processing engine being adapted to receive an event stream. Based on the continuous query definition parameters, a pre-fetch query may be automatically created to pre-fetch historical data from a database. An event processing language statement may also be created based on (i) the continuous query definition parameters and (ii) the semantic layer information. The event processing language statement may be provided to the complex event processing engine so as to establish a continuous query. A response to the query may be output based on both the pre-fetched historical data and events in the event stream.

Abstract: A method, system, and computer program product for processing a stream of tuples are disclosed. The method, system, and computer program product may include receiving a stream of tuples to be processed by a plurality of processing elements. Each tuple may have an associated processing history. The stream of tuples may be segmented into a plurality of partitions, each representing a subset of the stream of tuples. The method, system, and computer program product may include estimating the contribution each partition will have on a particular processing result and processing a partition if it substantially contributes to the particular processing result.

Abstract: The present invention provides methods and systems for saving and querying context data for an online application. The context data of an online application related to pages visited by a user are collected, where the context data is associated with page identifiers of the visited pages. A step-by-step path is generated based on the page identifiers of the pages visited by the user, and a context data record is generated and saved based on the collected context data and the step-by-step path. According to the methods and systems, a query term is further generated using on the collected context data and the step-by-step path, for performing query to the context data. By applying the methods and systems of the present invention to different contexts, the user is able to easily save and later reference the previous actual running data of some functional contexts.

Abstract: A method, system, and computer program product for processing a stream of tuples are disclosed. The method, system, and computer program product may include receiving a stream of tuples to be processed by a plurality of processing elements. Each tuple may have an associated processing history. The stream of tuples may be segmented into a plurality of partitions, each representing a subset of the stream of tuples. The method, system, and computer program product may include estimating the contribution each partition will have on a particular processing result and processing a partition if it substantially contributes to the particular processing result.

Abstract: An information retrieval system includes a query revision architecture that integrates multiple different query revisers, each implementing one or more query revision strategies. A revision server receives a user's query, and interfaces with the various query revisers, each of which generates one or more potential revised queries. The revision server evaluates the potential revised queries, and selects one or more of them to provide to the user. A session-based reviser suggests one or more revised queries, given a first query, by calculating an expected utility for the revised query. The expected utility is calculated as the product of a frequency of occurrence of the query pair and an increase in quality of the revised query over the first query.

Abstract: A technique for enforcing a database relationship is disclosed. The technique includes specifying within a database schema a reference type that associates two structures and specifies the relationship between the two structures, and automatically generating code that checks the relationship between the two structures based on the specified reference in the database schema.

Abstract: A computer-implemented method for deduplicating file data in tiered file systems may include identifying a tiered file system that includes a primary storage tier and a deduplicated storage tier. The method may also include detecting at least a portion of file data that has not been accessed in the primary storage tier within a predetermined period of time. The method may further include determining whether the portion of data stored in the primary storage tier is also stored in the deduplicated storage tier. In addition, the method may include ensuring that the deduplicated storage tier is currently storing a unique instance of the portion of file data stored in the primary storage tier and then removing the portion of file data from the primary storage tier. Various other methods, systems, and computer-readable media are also disclosed.