Abstract: A system, a method, and a computer program product for adaptive scheduled periodic caching are disclosed. A data stream is received. The data stream contains a plurality of versions of data arranged in a plurality of data clusters. Each data cluster includes an anchor version having a plurality of versions of data dependent on the anchor version. A size of each anchor version of each data cluster is determined. A number of versions of data dependent on each anchor version is also determined. For each anchor version, a ratio of the determined number of dependent versions of data to the determined size of each anchor is computed. At least one anchor version for storing in a memory location is selected based on the computed ratio.

Abstract: A query is received by a database server from a remote application server. The query is associated with a calculation scenario that defines a data flow model that includes one or more calculation nodes and that includes a pre-defined aggregation property. Each calculation node defines one or more operations to execute on the database server. The database server can include a column-oriented database. Thereafter, the database server instantiates the calculation scenario such that, based on the aggregation property, at least one non-aggregating operation specified by a calculation node is transformed into a aggregating operation based on a root node aggregation of the calculation scenario. Subsequently, the database server executes the operations defined by the calculation nodes of the optimized calculation scenario to result in a responsive data set. The database server then provides the data set to the application server.

Abstract: Disclosed are a system and method for providing search results. The system for providing search results comprises: a keyword-receiving unit which receives a keyword from a user; an exposure-order-applying unit which applies, to a collection search bar, the order of exposure of a collection containing a listing of keyword search results; and a search-result-providing unit which provides the user with a webpage of the keyword search results, said webpage containing the collection search bar.

Abstract: A method for reconstruction includes providing a directed input graph generated from a set of n-grams and statistics for the n-grams, edges of the graph being joined through nodes of the graph. Each edge has an associated label and a multiplicity of at least one. Each of the n-grams in the set being represented by a respective one of the labels, whereby a Eulerian cycle through the graph traverses each edge the respective multiplicity of times. Reduction rules are applied iteratively to generate a refined graph which is both irreducible and equivalent to the input graph. Information is output based on the labels of the refined graph.

Abstract: In one embodiment, a node of a cluster executing a storage input/output (I/O) stack having a volume layer, stores a multi-level dense tree metadata structure. Each level of the dense tree metadata structure includes volume metadata entries for storing volume metadata. One or more non-volatile logs (NVLogs) are updated. The one or more NVLogs including a volume layer log configured to record changes to the volume metadata, wherein volume metadata entries inserted into a top-level of the dense tree metadata structure are recorded in the volume layer log. The node writes volume metadata entries from the volume layer log to one or more storage devices to be stored as extents.

Abstract: Methods and arrangements for storing and retrieving nested structures. A nested structure is obtained. There are created slices containing arbitrary sub-structures of the nested structure. The content of slices is stored in one or more columns of a column-oriented data store. At least one access plan for accessing slices in the data store is developed, to be used when a projection query is received. The access plan is executed to construct a nested structure that answers the projection query. Other variants and embodiments are broadly contemplated herein.

Abstract: A web page identified by a URL stored in a downloads queue is downloaded, and hyperlinks in the downloaded web page are identified. Each hyperlink is screened by parsing the hyperlink (optionally only the URL of the hyperlink) to identify features comprising character strings, computing for each feature values for one or more meta-features indicative of the hyperlinked web page being in a target language, aggregating the meta-feature values to generate a score for the hyperlink, and adding the URL of the hyperlink to the downloads queue conditional upon the score satisfying a screening criterion. The downloading, identifying, and screening are iteratively repeated to perform web crawling, and an index of web pages in the target language is constructed based on analysis of content of the downloaded web pages. The meta-features may include a transliterated target word meta-feature, a language code meta-feature, a country code meta-feature, or so forth.

Abstract: In one embodiment, a method includes receiving a first user action relating to a first topic from a first user, identifying the first topic based on the first user action, identifying one or more second posts that relate to the first topic, and transmitting to the first user one or more of the second posts or information associated with the second posts in a structured document for display to the first user, the structured document further comprising one or more interactive elements that enable the first user to interact with the one or more second posts or to respective second users that declared the second posts.

Abstract: A system and device are provided for intelligently, or programmatically, assigning weights for one or more criterion utilized to score media content items based on an analysis of a group of media content items. In general, scoring criteria to be used to score media content items for a user are defined. A group of media content items associated with the user is then analyzed with respect to the criteria to provide results such as a number or percentage of media content items from the group of media content items that satisfy each of the scoring criteria. Based on the results of the analysis, a weight is assigned to each of the scoring criteria. Thereafter, media content items are scored as a function of the weights assigned to the scoring criteria.

Abstract: Techniques are provided for storing files in a parallel computing system using different resolutions. A method is provided for storing at least one file generated by a distributed application in a parallel computing system. The file comprises one or more of a complete file and a sub-file. The method comprises the steps of obtaining semantic information related to the file; generating a plurality of replicas of the file with different resolutions based on the semantic information; and storing the file and the plurality of replicas of the file in one or more storage nodes of the parallel computing system. The different resolutions comprise, for example, a variable number of bits and/or a different sub-set of data elements from the file. A plurality of the sub-files can be merged to reproduce the file.

Abstract: An embodiment for object integrity service in a storage system includes generating a list of objects stored in a storage system, wherein the list of objects may list an unchecked object, and wherein the unchecked object is an object that has not been checked within a set time period, walking through the list of objects to identify the unchecked object, adding a task to a queue to check the unchecked object, and clearing the task from the queue by checking the unchecked object.

Abstract: Methods, systems, and apparatus, including computer programs for receiving a set of content items, each content item including a time reference and digital content that is distributed using one or more computer-implemented services, for each content item: determining an event time based on a respective time reference, identifying one or more n-grams based on text of the content item, associating each of the one or more n-grams with the event time, and including the one or more n-grams in a superset of n-grams, the superset of n-grams including n-grams provided from one or more of the content items in the set of content items, generating one or more n-gram clusters based on the superset of n-grams, each n-gram cluster providing a description of an event and including at least one n-gram and an associated event time and storing each of the one or more n-gram clusters in a cluster database.

Abstract: A system for providing a user interface includes a gadget definition, a style definition, and a scene file. The gadget definition includes one or more XML-based gadget definition tags defining a gadget element and the style definition includes one or more XML-based style definition tags defining one or more style attributes to be applied to the gadget element. The scene file is an XML-based document that includes a gadget element tag that specifies the gadget element. The system further includes a parser to parse the scene file, the style definition, and the gadget definition, and to generate an object that includes a gadget object corresponding to the gadget element. The system also includes a layout engine to determine, based on the object model, a layout of the user interface, and a rendering engine to render, based on the determined layout, the user interface including the gadget element.

Abstract: A computer-implemented method for efficient data storage is provided. A first storage medium associates data stored on one or more data storage media with a unique identification value (ID) for the purpose of determining de-duplication status of the data. In response to receiving a request to read the data from a logical address, the first storage medium retrieves the data from a second storage medium based on the unique ID. In response to receiving a request to write the data to a logical address, the one or more data storage media store at least one copy of the data based on the de-duplication status of the data.

Abstract: At least certain embodiments of the present disclosure include a method to extend search capabilities to third party applications installed on a device. In one embodiment, records associated with a third party application are indexed in a process isolated from other third party applications installed on the device using a search plugin specific to the third party application. Furthermore, the indexed records can be searched in response to a user search query without invoking the third party application.

Abstract: A parsing method and system. The method includes generating an n-gram model of a domain and computing a tf-idf frequency associated with n-grams of the n-gram model. A list including a frequently occurring group of n-grams based on the tf-idf frequency is generated. The frequently occurring group of n-grams is transmitted to a deep parser component and a deep parse output from the deep parser component is generated. The deep parse output is stored within a cache and a processor verifies if a specified text word sequence of the deep parse output is available in the cache.

Abstract: The present invention relies on the two-dimensional information in documents and encodes two-dimensional structures into a one-dimensional synthetic language such that two-dimensional documents can be searched at text search speed. The system comprises: an indexing module, a retrieval module, an encoder, a quantization module, a retrieval engine and a control module coupled by a bus. Electronic documents are first indexed by the indexing module and stored as a synthetic text library. The retrieval module then converts an input image to synthetic text and searches for matches to the synthetic text in the synthetic text library. The matches can be in turn used to retrieve the corresponding electronic documents. In one or more embodiments, the present invention includes a method for comparing the synthetic text to documents that have been converted to synthetic text for a match.

Abstract: A method and system for utilizing snapshots to provide copies of a database or other application or large data structure to computing devices receives a request for access to a copy of a database, and performs a snapshot of a storage volume containing the requested database. The system then clones the snapshot and mounts the snapshot to a computing device, thus enabling the computing device to access a copy of the database. In some examples, the system automatically updates copies of a database on a scheduled basis (e.g., daily or weekly basis) to refresh a database regularly.

Abstract: Improved techniques are provided for storing files in a parallel computing system using a list-based index to identify file replicas. A file and at least one replica of the file are stored in one or more storage nodes of the parallel computing system. An index for the file comprises at least one list comprising a pointer to a storage location of the file and a storage location of the at least one replica of the file. The file comprises one or more of a complete file and one or more sub-files. The index may also comprise a checksum value for one or more of the file and the replica(s) of the file. The checksum value can be evaluated to validate the file and/or the file replica(s). A query can be processed using the list.

Abstract: Information representing a plurality of clients on a network is stored in a data structure. The data structure may be stored within a server or agent in a content delivery network and may include client network address information. The data structure is dynamically compressed based on network proximity information relating to the clients.