Abstract: Running a transaction against a database that allows the transaction to be automatically retried when the transaction fails such that certain transaction failures that cause the transaction to be automatically retried are not visible to an entity that receives data as a result of the execution of the transaction. A first set of statements of a transaction is identified by identifying statements that will cause a change in the database state. A second set of statements is identified, that result in data being generated to be sent to the entity. The method further includes executing the first set of statements to change the database. The method further includes running the second set of statements separately from the first set of statements to generate data to be sent to the entity.

Abstract: Documentation from a network including a plurality of computing nodes is achieved by processing a query for documentation at one or more of the computing nodes within the network in accordance with a priority of each of the computing nodes to obtain search results pertaining to the documentation, where the priority for each computing node is based on a quantity of incoming connections for each computing node. The search results are prioritized in accordance with the priority of the corresponding one or more computing nodes providing the search results.

Abstract: An approach is provided in which an information handling system crawls a first document corresponding to an existing curated RSS feed list and discovers a new RSS feed embedded in the first document. The information handling system analyzes a second document corresponding to the new RSS feed and generates a feed compatibility score based on the analysis. In turn, the information handling system adds the new RSS feed to the curated RSS feed list when the feed compatibility score reaches a feed compatibility threshold.

Abstract: A group user level association method may obtain user operation information of each user in a group, match the user operation information with a pre-stored user operation-point weight comparison table to obtain a point weight of each user in the group determining a user level of each user in the group according to the point weight, and associates a user in the group with a user level of the user in the group. In addition, a group user level association system is further provided, the technical solution of the present disclosure, as compared with a user level based on an online duration and an active degree, can more truthfully and objectively reflect a level difference between users in a group, so as to improve efficiency of a group owner or an administrator applying or managing the group and increase enthusiasm of using a group operation by a user.

Abstract: Methods and apparatuses for search are provided and related to the field of search technology. A method may include: performing term segmentation for grabbed documents to count a term frequency of each term, the term frequency of the term representing a number of the grabbed documents containing the term; generating a high frequency term inverted index and a low frequency term inverted index respectively, wherein the high frequency term inverted index contains terms having a term frequency higher than a predefined threshold, and the low frequency term inverted index contains terms having a term frequency not higher than the predefined threshold; and loading the high frequency term inverted index and the low frequency term inverted index respectively to different retrieval modules, the different retrieval modules respectively corresponding to mutually independent storage devices.

Abstract: A method, system, and computer program product for adding photograph metadata based on micro-locations of a venue are provided. A photograph is detected, wherein the photograph was taken by a user at a venue. A wireless beacon is detected, wherein the wireless beacon is associated with a micro-location in the venue. Tag information corresponding to the wireless beacon is retrieved. Metadata of the photograph is populated, based on the tag information, wherein the metadata is searchable by the user. One or more rules are determined, wherein the one or more rules define one or more categories of metadata to populate the photograph. A location of a plurality of wireless beacons at the venue is requested. A map indicating the location of each of the plurality of wireless beacons at the venue is generated.

Abstract: A method, system, and computer program product to manage a database is disclosed. The method, system, and computer program product may include structuring the database to have a first table having an index and a second table. A first key of the first table may be related to a second key of the second table. The method, system, and computer program product may include creating an entry locator in the index. The method, system, and computer program product may include maintaining an association between the second key of the second table and the entry locator of the index.

Abstract: In one embodiment, a method includes receiving, from a client device of a first user of an online social network, a search query associated with a first topic. The method also includes identifying one or more key-authors associated with the first topic. The method further includes retrieving multiple objects of the online social network matching the search query, where one or more of the retrieved objects are associated with the first topic and are authored by at least one of the identified key-authors. The method also includes generating multiple search-results modules, each search-result module including references to one or more of the retrieved objects. At least one of the search-results modules is a key-authors-module that includes references to one or more of the retrieved objects associated with the first topic that are authored by at least one of the identified key-authors.

Abstract: Various systems and methods for performing a restore operation. For example, one method involves receiving information identifying a set of data objects to restore. The method also involves dividing the set of data objects into first and second subsets of data objects. After the first one of the subsets of data objects is restored from a backup computing system to a source computing system, the method involves determining whether a deduplication operation is performed on the source computing system. The method also involves delaying restoring the second subset until after the deduplication operation is performed on the source computing device.

Abstract: A system joins predicate evaluated column bitmaps having varying lengths. The system includes a column unifier for querying column values with a predicate generating an indicator bit for each of the column values that is then joined with the respective column value. The system also includes a bitmap generator for creating a column-major linear bitmap from the column values and indicator bits. The column unifier also determines an offset between adjacent indicator bits. The system also includes a converter for multiplying the column-major linear bitmap with a multiplier to shift the indicator bits into consecutive positions in the linear bitmap.

Abstract: Methods and systems for performing an item level restore from a backup are described herein. A method starts by mounting files of content databases from storage device on management server. Content databases from storage device are from the backup. New database is created in relational database server with the mounted files of the content databases. Unattached database object is then created which includes pointing to the new database. Unattached database is not related to the content databases from the storage device. Unattached database object is then searched for source item selected for restore from content databases. Selected source item is exported from new database to a source item location in management server. Data from selected source item is then restored by importing data from the source item location to a target item location in management server.

Abstract: A computer system may include data aggregator logic configured to ingest a data item from a data source via an aggregation socket, wherein the aggregation socket is configured to ingest data items of a particular data type; identify a schema associated with the aggregation socket; convert the data item into a common data format using the identified schema; store the converted data item in a common data format storage associated with the computer device; and provide the stored data item to a data utilization system. The computer system may further maintain and record provenance and reputation models associated with data items stored in the common data format storage.

Abstract: A method, article of manufacture, and apparatus for managing a computing environment, such as a cloud data repository. In some embodiments, this includes modifying an object or a component of an object at runtime and storing the modified object or modified component of an object in a storage device. In some embodiments, the component of an object modified may include traits. In some embodiments, objects or traits may have more than one version.

Abstract: Disclosed is a method and system for creating labels for cluster in computing environment. The system comprises receiving module, candidate items selector, combination array generator, coverage value analyzer, candidate pair selector, unique word filter and cluster label selector. Receiving module receives input data and candidate items selector selects candidate items occurring repetitively using n-gram technique to generate list of candidate items with frequency of occurrence. Combination array generator selects candidate items to populate two-dimensional array wherein each array element represents pair of n-gram. Coverage value analyzer determines coverage value for each pair of n-gram from array. Candidate pair selector selects pairs of n-gram from two-dimensional array to process and generate list of candidate pairs. The unique word filter determines number of unique words in each candidate pair.

Abstract: In accordance with one embodiment, a method can be implemented that comprises receiving as an input a title of a video from a video sharing web site; parsing the title of the video into one or more n-grams; computing with a computer a title-searchability-score by utilizing the one or more n-grams.

Abstract: A method begins by a dispersed storage (DS) processing module of a storage unit receiving a write request for storing a data object that includes updated access control list (ACL) information. The method continues with the DS processing module determining whether the data object is a new data object or a revised version of an existing data object and determining write authority of the requesting entity based on information contained in a locally stored access control list. When the write request is regarding the revised version of the existing data object and the write authority includes authorization to issue the write request for the revised version of the existing data object and authorization to issue the updated ACL information, the method continues with the DS processing module storing the revised version of the existing data object and updating the access control list based on the updated ACL information.

Abstract: The creation of transaction segment records that are each associated with transaction segments within a log that includes multiple tasks, each of at least some associated with a corresponding transaction. The transaction segment records each include a transaction identifier set that define which tasks are included within the transaction segment. The transaction identifier sets are non-overlapping such that the transaction segments may be processed substantially in parallel by dispatching the transaction segment records to different worker threads. The identity of a latest external dependee entity, if any, is included within the transaction segment record. Upon being assigned a transaction segment for processing, the module assigned the transaction segment awaits completion of processing of the latest external dependee entity prior to processing the transaction segment.

Abstract: An example system for processing a federated query includes a query proxy that receives a federated query including a plurality of source queries and receives an indication that a failed set of one or more source queries failed to execute successfully. Each source query is specific to an autonomous data source belonging to a federation. The system also includes a data federation engine that identifies a plurality of autonomous data sources to which to send the plurality of source queries. The plurality of autonomous data sources belong to the federation. The system further includes a query fail analyzer that updates a data structure to reflect the unsuccessful execution of one or more source queries of the failed set.

Abstract: According to embodiments of the present invention, methods, systems and computer-readable media are presented for scanning a plurality of storage regions within memory for a specified quantity of results, wherein each storage region is associated with an interval including first and second interval values indicating a value range for values within that storage region. The techniques comprise sorting the first interval values into an order, wherein the order of the first interval values determines a scanning order for the plurality of storage regions, determining a result value, wherein the result value is an upper bound, a lower bound, or is outside of the specified quantity of results, and examining the sorted first interval values and scanning corresponding individual storage regions in response to a comparison of the determined result value with the first interval value of that storage region.

Abstract: According to embodiments of the present invention, methods, systems and computer-readable media are presented for scanning a plurality of storage regions within memory for a specified quantity of results, wherein each storage region is associated with an interval including first and second interval values indicating a value range for values within that storage region. The techniques comprise sorting the first interval values into an order, wherein the order of the first interval values determines a scanning order for the plurality of storage regions, determining a result value, wherein the result value is an upper bound, a lower bound, or is outside of the specified quantity of results, and examining the sorted first interval values and scanning corresponding individual storage regions in response to a comparison of the determined result value with the first interval value of that storage region.