Abstract: A program storing computer-readable instructions therein for instructing a computer to perform analytical steps for generating a spatial hierarchy identifier that corresponds to a spatial hierarchy used on a server, the program includes a recording medium readable by the computer; and the computer instructions stored on said recording medium instructing the computer to perform the processes including identifying a position using a position indication system, and generating an identifier within the computer and independent of the server, wherein the identifier identifies first regions within the first spatial hierarchy on the server corresponding to the position.

Abstract: A method is used in managing deduplication of data in storage systems. A candidate data object is identified for deduplicating a data object by evaluating digests stored in a current digest segment to determine whether another digest matching a digest associated with the data block is stored in the current digest segment. The current digest segment includes a set of digests associated with a set of data blocks previously received for deduplication. Based on the evaluation, a deduplicating technique is applied to the data object. The current digest segment is stored in an index table. A previous digest segment associated with a digest stored in the index table matches the digest associated with the data block is replaced by the current digest segment.

Abstract: An example method for determining an influence score of a social media blog domain in accordance with aspects of the present disclosure includes receiving data regarding asocial media blog domain based on relevancy to a plurality of keywords, extracting values from the data for a set of categories of metrics for the social media blog domain, assigning a weight to each metric, and calculating an influence score for the social media blog domain based on the weight of the extracted values for each social media profile. The set of categories comprises social engagement, activity, social media page influence and social media blog domain influence.

Abstract: A system and method for managing media advertising enterprise data. An enterprise data management (EDM) module can be configured to include a set of rules at an enterprise level to manage disparate and disconnected records. A scoring function with respect to each record can be computed based on the rules to determine the highest priority. The rules in association with the scoring function can be stored locally in an EDM database. A matching process can then be performed to accurately match similar records regardless of manual input, location, and format of the records in a distributed system. Each record can then be assigned with a parent enterprise advertiser. Such an optimization mechanism can interactively manage and report records at the enterprise level in a simple and efficient manner.

Abstract: Embodiments of the present disclosure relate to a method and an apparatus for data backup. The method comprises selecting, from a service store, a backup service for an application. The method further comprises setting, for the application, configuration information associated with the selected backup service. Additionally, the method further comprises in response to the backup service being enabled, deploying a backup service agent corresponding to the backup service to a source node associated with the application based on the configuration information, such that data of the application is backed up from the source node to a target node via the backup service agent.

Abstract: A system and method for just in time compilation for hash table probing are disclosed. In one implementation, the method of using just-in-time compilation is used to combine the stages of hash value computation and initial lookup into a single compound operation. In another implementation, the method of using just-in-time compilation is used to combine the stages of a hash table record and input record checking to detect if these records are equal, and if not, fetching the next possible record in the linked list of the per-bucket records.

Abstract: An apparatus and method of identifying semantically related records, including receiving input data from an input device, splitting the input data into a plurality of clusters according to semantic relationship, each of the clusters including a plurality of source terms and a plurality of target terms, transforming each of the plurality of clusters based on the transformation which includes tokenization of the plurality of clusters, for each of the plurality of clusters that are transformed, finding relatedness scores of a plurality of semantic relatedness measures with the plurality of target terms, building a vector of similarity scores for each of the plurality of target terms, and for each of the plurality of source terms, selecting a predetermined number of the plurality of target terms according to the similarity scores.

Abstract: Techniques for visualizing data elements are disclosed. A system presents a first data element profile comprising: a first data element; a second data element; and a first formula used to calculate a value of the first data element using a value of the second data element. The system detects user input selecting the second data element. Based on detecting the user input, the system presents a second data element profile comprising: the second data element; a third data element; and a second formula used to calculate a value of the second data element using a value of the third data element. The system detects user input selecting the third data element. Based on detecting the user input, the system presents a third data element profile comprising the third data element.

Abstract: The present disclosure provides a data clustering method based on K-nearest neighbor, which sorts data points to be clustered in ascending order according to the maximum radiuses of K-nearest neighbors of the data points, that is, according to the density, and perform the first pass across the data points after sorting the data points in ascending order to incorporate the data points that conform to the statistical similarity into the same cluster; then perform the second pass across the data points with smaller cluster density according to the scale required during the clustering to find out all noise points and incorporate non-noise points into the nearest large-density cluster, so as to realize data clustering, which has the benefits of no need to preset the number of clusters and know the probability distribution of the data and convenience to set parameters.

Abstract: A method and associated system for selectively constructing a search result for a data requested by a search request specifying path information of a data node comprising the data. A template tree represents a hierarchy of the search result with expandable nodes which initially do not have actual data. A node of the template tree is dynamically expanded by a callback function to have a respective data for the node when the node is traversed for the first time during traversing the template tree according to the path information. The search result is created by expanding all nodes of the template tree that are specified in the path information. The data node in the search result is communicated to an entity that had originated the search request.

Abstract: Methods and systems for managing data redundancy include registering certified commands, input files, output files, and arguments in an execution history list after execution of said certified commands. An existing output file is provided in response to execution of a first certified command that matches an entry in the execution history list. A file is deleted if the file is reproducible from another file using a second certified command. The deleted file is registered in a reproducible file list. The deleted file is reproduced upon request using the second certified command.

Abstract: A method and a system for structured searches of information via key-objects are disclosed herein. Key-objects may be used to describe certain features or parameters of content within webpages in a structured fashion, may be linked or embedded into respective webpages, and may be subsequently collected and stored by search engines enabling the structured searches. A thesaurus of key-objects may be updated with new key-objects discovered by search engines. Methods described herein may be used for structured searches of merchandise or services in e-commerce or mobile e-commerce thereby facilitating the location and comparison of merchandise by product specifications in lieu of keywords needed to get to the product specifications.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for controlling access to a multi-tenant database system using a virtual portal. These mechanisms and methods for controlling access to a multi-tenant database system using a virtual portal can enable embodiments to provide great flexibility to a tenant of the architecture to select the content that may be perceived by the tenant users while allowing the owner of the architecture control over the content.

Abstract: An information extraction apparatus includes, a controller extracting, as variable elements, parts different between a plurality of structured documents and extract, as peripheral information pieces, elements within a predetermined range from the respective variable elements, and a storage unit storing the variable elements and the peripheral information pieces with respect to at least an extraction object which is at least one of the variable elements.

Abstract: A system and method matches data from a first set of data with that of an other set of data in a manner based on the size of a memory.

Abstract: A system and method matches data from a first set of data with that of an other set of data.

Abstract: A method of operation of an advertisement delivery system includes: receiving a selection for a category of interest; generating search results for the selection, the search results based on a current location for locating a device providing the selection; generating a weighted distance based on distances of the search results from the current location; generating a weighted relevancy based on relative matches of the search results and the selection; generating a weighted customization with the search results sharing a common attribute that is predefined; and delivering a notification from the search results by an aggregation of the weighted distance, the weighted relevancy, and the weighted customization, the aggregation meeting or exceeding a threshold for displaying on the device.

Abstract: A method and system to improve the computer in light of the global information network with numerous computer devices services, and apps, so that a user can capture and find information with high security and usability. The invention makes all information potentially searchable on the Internet, and distinguishes finding the existence of an object of information from its access, and the ability for a searcher to request access to an object that is not permitted, and to enable the object owner to approve requests.

Abstract: In accordance with some embodiments, a method for generating sentimental information associated with media content is provided, the method comprising: receiving user input data corresponding to a user; identifying a portion of the media content item based on the user input data; determining a sentiment based on the user input data, wherein the sentiment is one of a positive sentiment which indicates that the media content item was liked by the user or a negative sentiment which indicates that the media content item was disliked by the user; determining an amount of the sentiment based on the user input data; associating the amount of the sentiment with the portion of the media content item; and generating, for the media content item, sentimental information that indicates the amount of the sentiment associated with at least one portion of the media content item.

Abstract: A method is used in managing deduplication of data in storage systems. A digest is determined for a data object received for deduplication. A candidate data object is identified for deduplicating the data object. A digest associated with the candidate data object matches the digest associated with the data object. The digest in a digest segment is maintained based on identification of the candidate data object. The digest segment includes a set of digests associated with a set of data blocks identified for deduplication in an ordered arrangement.