Abstract: Systems, methods, and media for generating a normalized schema comparison file are disclosed. A method includes receiving, by a processing device, an extensible markup language (XML) schema for an XML document. The XML schema includes a content model and one or more internal schema structures and the content model is a specification of one or more XML elements and XML attributes allowed within a conformant XML instance file.

Abstract: DBSCAN clustering analyses can be improved by pre-processing of a data set using a Hilbert curve to intelligently identify the centers for initial partitional analysis by a partitional clustering algorithm such as CLARANS. Partitions output by the partitional clustering algorithm can be process by DBSCAN running in parallel before intermediate cluster results are merged.

Abstract: Identifying objects in a datastore with specified object properties, where each object is characterized by a Bloom filter, a Hamming value of the Bloom filter, and a binary logarithm of the Bloom filter. A set of object properties is received. A search Bloom filter is created from the object properties. A Hamming value of the search Bloom filter is determined. A binary logarithm of the search Bloom filter is calculated. Objects in the datastore which have respective Hamming values greater than or equal to the Hamming value of the search Bloom filter and respective binary logarithms that are greater than or equal to the binary logarithm of the search Bloom filter are identified.

Abstract: Indexing objects in a datastore, where the objects are characterized by a set of object properties. For objects from a datastore: a Bloom filter for the object properties, based on a predetermined Bloom filter configuration, is created; the Hamming value of the Bloom filter is determined; a binary logarithm of the Bloom filter is calculated; and the Bloom filter, the Hamming value, the binary logarithm, and a representation of the object is stored in the datastore.

Abstract: Systems and methods for automated creation of a dictionary of scientific terms are described herein. Initially, input data is filtered to obtain a primary file having a plurality of term-ID pairs with each term-ID pair having a unique term ID and a scientific term. Further, a remove-term file is generated based on one or more term-ID pairs identified from the primary file such that the scientific terms of each term-ID pair corresponds to one of additional terms, frequent scientific terms, and undesirable terms. At least one term-ID pair from among the one or more term-ID pairs is altered to obtain a modified term-ID pair based on modification rules. The modified term-ID pair is added to an add-term file and a modified file is obtained based on the remove-term file and the add-term file. Duplicate term-ID pairs present in the modified file are removed to obtain the dictionary of scientific terms.

Abstract: A user of a network-based system may correspond to a user profile that describes the user. The user profile may describe the user using one or more descriptors of items that correspond to the user (e.g., items owned by the user, items liked by the user, or items rated by the user). In some situations, such a user profile may be characterized as a “taste profile” that describes an array or distribution of one or more tastes, preferences, or habits of the user. Accordingly, the user profile machine within the network-based system may generate the user profile by accessing descriptors of items that correspond to the user, clustering one or more of the descriptors, and generating the user profile based on one or more clusters of the descriptors.

Abstract: Methods and systems are described for creating a custom index in a multi-tenant database environment. In one embodiment, a method includes obtaining query for a multi-tenant database that is recommended as a candidate for creating an additional filter, evaluating the query against criteria to determine whether to select the query for creating the additional filter, and creating the additional filter for the query, if the query is selected.

Abstract: A current file is obtained in the data. It is determined whether a similar historical file exists based on a sampled data block from at least one predetermined location in the current file. In response to non-existence of the similar historical file, the current file and corresponding metadata are stored on a file basis. In response to existence of the similar historical file, a deduplication operation is applied on the current file on a block basis.

Abstract: A mobile communication device includes a temperature sensor configured to sense a temperature and a control unit configured to determine whether a change in the sensed temperature relative to a previously-sensed temperature corresponds to a critical time range. The control unit is also configured to store data in a data storage unit when it is determined that the change in the sensed temperature corresponds to the critical time range.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving a query including search parameters; selecting one or more of the search parameters; for each of the selected parameters: generating a natural language representation of the selected parameter, and determining a rank of the selected parameter among the one or more selected parameters; generating a uniform resource identifier comprising the natural language representations of the selected parameters arranged in an order based on the ranks; obtaining one or more search results identified as responsive to the query; and providing the uniform resource identifier and the one or more search results for output.

Abstract: Embodiments include method, computer program products and apparatuses for normalizing non-numeric features of files and corresponding apparatus. Aspects include segmenting at least one pair of positive instances of a non-numeric feature of a file into a number of tokens and -comparing the tokens in the at least one pair of positive instances to obtain matching tokens. Aspects also include calculating weights of their matching the file, for the matching tokens, and storing the tokens and their weights in a token base.

Abstract: Embodiments include method, computer program products and apparatuses for normalizing non-numeric features of files and corresponding apparatus. Aspects include segmenting at least one pair of positive instances of a non-numeric feature of a file into a number of tokens and comparing the tokens in the at least one pair of positive instances to obtain matching tokens. Aspects also include calculating weights of their matching the file, for the matching tokens, and storing the tokens and their weights in a token base.

Abstract: An embodiment of the invention provides a method for storage management in a cloud computing system. More specifically, locations of storage components in the cloud computing system and storage properties of the storage components are identified. The storage properties include the amount of available storage space and/or the cost of storage space. A storage quota for a user of the cloud computing system is generated with a cloud quota management module based on the locations of the storage components and/or the storage properties of the storage components. In at least one embodiment, the storage quota includes the maximum amount of storage allocated to the user in at least one of the storage components.

Abstract: A method is provided for searching a graph to identify cliques using a set of processing elements (PEs), a first PE of the set of PEs having access to an adjacency list of a seed vertex of the graph, the adjacency list of the seed vertex including a set of vertices. The method includes: generating a data structure for each intermediate vertex of the set of vertices, the data structure indicating the respective intermediate vertex and an additional list of intermediate vertices of the set of vertices; storing the generated data structures; for each buffered data structure, receiving the buffered data structure and configuring the available PE to receive an adjacency list of the intermediate vertex indicated in the respective data structure and to select from the adjacency list a set of further vertices that are adjacent to the seed vertex and are part of the additional list.

Abstract: In one embodiment, a method includes receiving a plurality of search results based on a search query from a user. A computing system determines a plurality of scores for each search result, each score generated by applying a distinct scoring function of a plurality of scoring functions to the search result. The computing system generates a plurality of diversity groups, each diversity group corresponding to a scoring function of the plurality of scoring functions, each diversity group including at least a subset of the plurality of search results ordered according to the scores generated by applying the scoring function to the at least the subset of the plurality of search results. The method further includes selecting at least one of the plurality of search results from each diversity group and sending the selected search results to the user.

Abstract: Embodiments of the present disclosure provide for analyzing paragraphs in a fixed format document to determine style clusters or groupings of each paragraph. In certain embodiments, the paragraphs are grouped into style clusters based on a first property. Each style cluster is then further divided into sub-groups based on a second property. Once the sub-groups have been determined, a third property associated with each paragraph in each sub-group is normalized based on a dominant one of the at least the third property.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving one or more search terms, providing the search terms as input to one or more user-specific indices, a user-specific index being generated based on an access privilege granted by a user to a data source, the data source including data that is specific to the user, generating search results based on the one or more search terms and the one or more user-specific indices, and transmitting the search results for display to a searching user.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for identifying a plurality of search results that will be provided in response to a search query received from a user device. Two or more of the search results may reference at least two different resources that are responsive to the search query. It may be determined that the user device will be served a same set of content in response to user interaction with each of the two or more search results. In response to the determination, a replacement search result may be generated, including a reference to a resource serving the same set of content. In response to receiving the search query, a search page may be presented that includes the replacement search result and does not include at least one of the two or more identified search results.

Abstract: A geospatial indexing module operating in a server device operates on an efficient index for retrieving and providing map features which represent geographic entities such as streets, roads, cities, states, buildings, bodies of water, etc. The index includes identification information for a map feature fragment, which represents at least a portion of a map feature, as well as a node in a tree data structure to which the map feature fragment corresponds and a range of levels of detail for which the map feature fragment is valid. When a user requests map data for a geographic region at a level of detail, the geospatial indexing module queries the index for all map feature fragments within the requested region and level of detail and provides the retrieved map feature fragments to the user.

Abstract: Processing a file system operation is disclosed. An indication of a desired operation of a distributed file system is received. A metadata node for the desired operation is identified. It is indicated to the identified metadata node to process the desired operation. In the event the identified metadata node becomes not fully functional before the processing by the identified metadata node is confirmed, the distributed file system is analyzed to determine whether to indicate again to process the desired operation.