Abstract: Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted.

Abstract: A cleaning application that can monitor one or more browser applications that are executed on a computer, and that can, for at least one browser application, clean at least one of one or more files or a registry associated with the at least one browser application is provided. The cleaning application can include a cleaning module. The cleaning module can monitor one or more browser applications that are executed on a computer. The cleaning module can further detect a closing of at least one browser application. The cleaning module can further perform a pre-defined action in response to the closing of the at least one browser application. The pre-defined action can include cleaning at least one of one or more files or a registry associated with the at least one browser application.

Abstract: Techniques described herein provide for a method, system, and apparatus for determining whether a mismatch is present between content and a description associated with a literary work. In various embodiments, a matching score may be calculated based on a number of stems identified from the description that match stems identified from the content. The matching score may be adjusted based on a number of name entities identified from the description that match one or more words in the content. The computed matching score may then indicate whether the description and the content correspond to a same literary work. According to one embodiment, the description and the content correspond to the same literary work even where the computed matching score indicates a mismatch if a title is determined to match in the content. Other embodiments may be described and claimed.

Abstract: A data processor and a data processing method are provided. The data processor is arranged between a client and a database system to determine in advance whether a user instruction sent from the client updates data of the database system. When the data processor determines that the user instruction does not update data of the database system, the data processor sends the predefined data to the client and restrains the user instruction to the database system. Accordingly, the data processor can assist the database system to process the user instruction, so as to reduce in advance the enormous volume of data processing that the database system is requested upon.

Abstract: Techniques are described for identifying conflicts between an index of temporal keys and a prospective temporal key. The prospective temporal key specifies a prospective range of time. Embodiments scan the index to identify a first temporal key that potentially conflicts with the prospective temporal key. The first temporal key specifies a first range of time and is identified based on a comparison between the first range of time and the prospective range of time. Embodiments determine whether the prospective temporal key conflicts with any temporal keys in the index, where the prospective temporal key conflicts with the first temporal key if the first range of time overlaps with the prospective range of time and the first temporal key is not a pseudo-deleted key, and such that the prospective temporal key does not conflict with any temporal keys if the temporal key does not conflict with the first temporal key.

Abstract: System and method for event-based updating of user profiles UP of users U in a social network and formation of new communities based on a resonance condition. A database of user profiles UP with profile domains D based on self-reports as well as observed network behaviors is deployed. The user profiles UP of users U in groups G attending an event are re-compiled by an event-based updating module based on event responses ER. Further, the event-based updating module identifies a profile change ?P* in at least one of the profile domains D of user profiles UP, and the new community is formed by the event-based updating module from a subgroup SG whose profile change ?P* indicates a mutual resonance or consensus in their event responses ER.

Abstract: Data objects stored in a data store include data attribute(s) and associated value(s) for the attributes. Data analysis tools (DATs) stored in a data store are associated with reference data attribute(s). The data objects are identified by one or more DATs based on each reference data attribute(s) of a corresponding DAT matching one of the data attribute(s) of the corresponding data object(s) and independent of the value for the data attribute(s). The DATs generate an additional data object as a function of the identified data object, and the additional data object is stored in the data store.

Abstract: Disclosed are various embodiments that employ application fingerprinting and lifestyle fingerprinting. Application fingerprints are received, where each application fingerprints is associated with a corresponding application and is generated based at least in part on a static analysis, a dynamic analysis, and a behavioral analysis of the corresponding application. A selection of an application is received. Applications that are similar to the selected application are determined by comparing a particular application fingerprint that is associated with the selected application with other application fingerprints. Users are determined based at least in part on lifestyle fingerprints. In one embodiment, such users may be invited to test the selected application.

Abstract: A record is received including a token without a corresponding predetermined weight. Information pertaining to the received token is retrieved from at least one of external reference information and historic statistics. A token with a predetermined weight closest to the received token is determined based on the retrieved information. The predetermined weight of the closest token is assigned to the received token and data is matched based on the assigned weight of the received token.

Abstract: Methods for generating a query input string include sorting a first input relation and a second input relation in order from the first relation to the second relation. The second input relation is concatenated to the first input relation, and the concatenated input relations are stored in a single string.

Abstract: A trail log analysis system detects a fraudulent operation from a trail log of an information system, and confirms the correctness of a system action. An information development device generates an information development table from a trail log to be analyzed. The information development table defines a subject (who), an object (what), and an action (what is to be done) as comparison targets, and counts and record an event occurrence number corresponding to an event occurrence time recorded in a trail log for each combination of comparison targets. An accumulation device generates an accumulative information development table by accumulating the information development table corresponding to a trail log recorded previously and up to a time point immediately before the last collected trail log to be analyzed. A comparison device compares the information development table with the accumulative information development table, and outputs a comparison result.

Abstract: Embodiments are directed to defining a query expression over a dynamic system model and to transforming a dynamically built query expression into a simplified, canonical form. A computer system receives various user inputs that are to be included as part of a query expression for querying a dynamic system model. The dynamic system model is queryable to determine features provided by a service hosted by a back-end server. The computer system dynamically builds the query expression based on both the received inputs and the available features provided by the service as indicated by the dynamic system model. The query expression also includes metadata structures representing those features of the service which are provided by the service. The computer system also queries across the dynamic system model using the dynamically built query expression to retrieve and provide the service features requested in the received user input.

Abstract: Contact objects in one or more databases can be matched using various systems and methods to determine geographical proximity between the objects. Location attributes associated with first and second objects can be compared to determine a distance between the locations associated with the objects. The objects can then be grouped if the distance is less than a threshold distance.

Abstract: A system and method of batch query processing includes accumulating data queries in a query holding area of a query assistant running in a computer server, separating the accumulated data queries into a plurality of partitions, ordering the partitions, ordering the accumulated data queries within each of the partitions, and processing the accumulated data queries in an order based on the ordering of the partitions and the ordering of the data queries within each of the partitions. Each of the partitions includes data queries with a respective from-type. Each respective from-type is associated with a combination of storage tables accessed by each of the data queries in a corresponding partition. In some examples, ordering the accumulated data queries within each of the partitions includes processing the data queries in each partition against a test data set and ordering the data queries based on results of the processing.

Abstract: Query optimizer accuracy is tested by measuring the actual execution times on a database of each of a plurality of alternative query plans for each of a plurality of queries, first ranking the plans by the actual execution times, then ranking the plans by estimated execution times, and correlating the two rankings by computing a rank correlation metric. The rank correlation metric is normalized so that different optimizers can be objectively compared.

Abstract: A system and a method for initializing a streaming application are disclosed. The method may include initializing a streaming application for execution on one or more compute nodes which are adapted to execute one or more stream operators. The method may, during a compiling of code, identify whether a processing condition exists at a first stream operator of a plurality of stream operators. The method may add a grouping condition to a second stream operator of the plurality of stream operators if the processing condition exists. The method may provide for the second stream operator to group tuples for sending to the first stream operator.

Abstract: A continuous query may be received, the continuous query being identified based at least in part on an archived view. The archived view may be created and/or identified based at least in part on a join query related to two or more archived relations associated with an application, at least one of the two or more archived relations being identified as a dimension relation. A query plan for the continuous query may be generated. A join operator in the query plan may be identified based at least in part on the dimension relation. A state of an operator corresponding to the dimension relation may be initialized. It may be identified if the state of the operator identifies an event that detects a change to the dimension relation. The continuous query may be re-started based at least in part on the event that detects the change to the dimension relation.

Abstract: A request is received for a set of entries that make up a small cell in a database, wherein the small cell is initially described at a fine granular level of detail by a set of descriptors. In response to the total number of entries in the small cell being below a predetermined limit, the set of descriptors are modified to reduce the fine granular level of detail to a coarse granular level of detail in order to protect the privacy of individuals described by the set of entries.

Abstract: A computer-implemented method includes receiving a request for information indicative of venues that are located within a geographic region of interest, accessing user data for one or more users of a social networking platform, identifying, in the accessed user data, data indicative of one or more affirmative actions that are performed for the particular venue by at least one of the one or more users, and generating a popularity score for the particular venue, determining one or more popular venues, with a popular venue being associated with an increased popularity score relative to popularity scores of other of the multiple venues located with the geographic region of interest, and for a determined popular venue, generating data indicative of a type of user of the social networking platform who performs one or more affirmative actions for the determined popular venue.

Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, generating a plurality of structured queries, where each structured query comprises references to nodes and edges of the social graph, calculating a score for each structured query based on user-engagement factors, and sending each structured query having a score greater than a threshold score to a first user for display.

Abstract: One or more techniques and/or systems are provided for creating socially authored, or community authored, summaries of documents and/or for navigating a forum comprising such summaries. In one embodiment, at least some of the summaries are generated automatically when a document is written and/or discovered (e.g., by a web crawler), for example. In another embodiment, the documents are created by users of the forum. A plurality of summaries of a document may be created (e.g., by different users), and users can provide feedback, such as comments or ratings, that may assist other users in identifying which summary or summaries better describe the document. Moreover, the users can navigate the forum and retrieve summaries by browsing categories (and subcategories) to identify a topic of interest and/or by performing a search based upon user inputted search term(s).

Abstract: A similarity measure is computed between nodes of first and second networks. Sets of pairwise scores are computed to find nodes in the individual networks that are good matches to one another. A pairwise score is computed for a node i in the first network and a node j in the second network. Similar pairwise scores are computed for each of the nodes in each network. The process identifies node pairs that exhibit high pairwise values. Preferably, nodes i and j are a good match if their neighbors are a good match. This technique produces a measure of network similarity. If node feature data is available, nodes i and j are considered a good match if their neighbors are a good match (network similarity) and their node features are a good match (node similarity). Using the similarity scores, a common subgraph between the first and second networks is computed.

Abstract: Embodiments relate to identifying a sketching matrix used by a linear sketch. Aspects include receiving an initial output of the linear sketch, generating a query vector and inputting the query vector into the linear sketch. Aspects further include receiving an revised output of the linear sketch based on inputting the query vector and iteratively repeating the steps of generating the query vector, inputting the query vector into the linear sketch, and receiving an revised output of the linear sketch based on inputting the query vector until the sketching matrix used by the linear sketch can be identified.

Abstract: A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document lists for the tokens are stored at leaf nodes. When performing a fuzzy full text search, the system uses an edit distance greater than zero. After receiving search tokens, the system traverses the NVC tree to generate document error lists. The system then compares the error lists to identify relevant document identifiers and provides a result set.

Abstract: Methods, systems, and apparatuses for a portable device capable of receiving satellite navigational system signals to retrieve visibility mask information corresponding to the portable device's current location and/or trajectory are described.

Abstract: Described herein is a technology for facilitating visualization of multiple hierarchies. In some implementations, a primary hierarchy having primary components arranged in different primary hierarchical levels is provided. A second hierarchy for the primary components of the primary hierarchy is provided. The primary components are configured as geometric objects with concentric zones corresponding to different secondary hierarchical levels with secondary components.

Abstract: In one embodiment, a search string is received from a user and the search type of the search is determined from the search string. Based on the search type, an order of repositories to search is determined and each repository is searched. The search results from each repository are displayed for the user in separate panels for each repository and the panels are ordered based on search type and the search results within each panel are ordered using that respective repository's relevancy.

Abstract: A method and apparatus is provided for dynamically generating data to dataset mappings and dataset to logical instance mappings and distributing these mappings to subscribers for the purpose of routing work. An advisory engine updates the mappings of data to data sets based at least in part on changing demands and patterns of access to data, and updates the mappings of datasets to logical instances based at least in part on anticipated capacity and change in conditions of the database servers. The subscribers receive and store the mapping information that maps the data to dataset identifiers, and dataset identifiers to logical database instances. The subscribers may also receive information that describes the current availability conditions of database instances, which are used to override the mapping of logical database instances to physical database instances. Subscribers may use the data to dataset mapping to map data identified from in an incoming database request to a dataset.

Abstract: A computer-implemented method, computer program product, and computing system for implementing multi-temporal tables in a database is described. One or more databases are utilized, wherein the one or more databases implement a first temporal table that includes a first and a second time domain. The one or more databases are enabled to implement a second temporal table that includes at least a third time domain, wherein the second temporal table is associated with the first temporal table.

Abstract: Disclosed herein are techniques for arranging a series of operations. It is determined whether an operation executes more efficiently when divided. It is further determined whether a plurality of operations execute more efficiently when combined.

Abstract: A data analytic plan is defined for analyzing a given data set associated with a given data problem. A test data set and a training data set are obtained from the given data set associated with the given data problem. At least one model is executed to confirm an adequacy of the at least one model for the data analytic plan by fitting the at least one model on the training data set and evaluating the at least one model fitted on the training data set against the test data set. The defining, obtaining and executing steps are performed on one or more processing elements associated with a computing system and automate at least part of a data analytics lifecycle.

Abstract: The present invention extends to methods, systems, and computer program products for importing data into dynamic distributed databases. Embodiments of the invention include an import service that facilitates data imports without any distribution logic on a tenant. A tenant (caller) provides data in essentially any order. The import service understands the distribution of data across multiple databases and determines for any given piece of import data what database the import data is to be inserted into. Accordingly, the tenant (caller) is relieved from having to know how the data is distributed across a set (of potentially hundreds or thousands) of databases. The import service can group sets of data destined for a given database together and can use batch operations to increase efficiency.

Abstract: Mechanisms are provided for transforming an original graph data set into a representative form having a smaller number of dimensions that the original graph data set. The mechanisms generate a graph transformation basis structure based on an input graph data structure. The mechanisms further transform an original graph data set based on an intersection of the graph transformation basis structure and the input graph data structure to thereby generate a transformed graph data set data structure. The transformed graph data set data structure has a reduced dimensionality from that of the input graph data structure but represents characteristics of the original graph data set. Moreover, the mechanisms perform an application specific operation on the transformed graph data set data structure to generate an output of a closest similarity record in the transformed graph data set to a target component.

Abstract: A method and system for providing unified access to data for multiple computing devices includes a system that associates multiple computing devices with a user of an information management system, assigns information management policies to data from the multiple computing devices within the information management system, and collects multiple data objects from the multiple computers. The system may generate a preview version of each collected data object, and provide at least one preview version of a collected data object to a computing device associated with the user. The system may also generate indexing information for each collected data object and distribute the indexing information with the preview version of the data object.

Abstract: A method and apparatus to manage files of a portable device such as an mp3 player, a mobile phone, or a game console, the method comprising copying files to be played from a source server and storing the files in a file system on a folder-by-folder basis; determining the presence of files which have been changed in the portable device by checking the file system when the files are completely copied; and creating a playlist of the files, folder-by-folder, according to file path information of the file system when there are the changed files.

Abstract: Embodiments relate to systems and methods for generating optimized host placement of data payload in a cloud-based storage network. In aspects, a user can maintain a user premise network including servers, clients, local area networks, data stores, and/or other network assets. An administrator or other user of the premise network may wish to extract data from the premise network and transfer that data payload to a set of host storage clouds to leverage cost, redundancy, consolidation, or other cloud advantages. The placement tool can evaluate potential target cloud-based data stores based on various or multiple parameters for the hosting features offered by different cloud providers. The tool can generate a determination of the target host or hosts which can provide the best-matched or optimized data hosting facilities or services for the user's data payload in the cloud.

Abstract: A context-based graphical database system for storing a data structure comprises an entity node that stores an identifier of an entity. A data node stores non-contextual entity data about the entity. At least one context node is linked to the data node. The at least one context node provides context to the non-contextual entity data in the data node to create contextual entity data. A pointer from the entity node to the data node returns a data node identifier to the entity node to link the contextual entity data to the entity.

Abstract: According to one embodiment, a memory system including a key-value store containing key-value data as a pair of a key and a value corresponding to the key, includes a first memory, a control circuit and a second memory. The first memory is configured to contain a data area for storing data, and a table area containing the key-value data. The control circuit is configured to perform write and read to the first memory by addressing, and execute a request based on the key-value store. The second memory is configured to store the key-value data in accordance with an instruction from the control circuit. The control circuit performs a set operation by using the key-value data stored in the first memory, and the key-value data stored in the second memory.

Abstract: An apparatus, computer-readable medium, and computer-implemented method for data subsetting, including receiving a request for a subset of data from a plurality of tables, determining whether an entity graph corresponding the plurality of tables contains a cycle, and if so, performing cyclic subset processing, otherwise, expanding the entity graph and performing acyclic subset processing if the expanded entity graph does not have any cycles and cyclic subset processing if the expanded entity graph does have cycles.

Abstract: There is provided systems and methods for creating a repository of templates. The templates are deterministic of a configuration a virtual machine. The method includes creating one or more templates for each of one or more applications types based on a benchmark data. Each of the one or more templates is stored in a hierarchal structure having one or more hierarchal levels. Each of the one or more hierarchal levels is indicative of a parameter of the configuration of the virtual machine. Thereafter, one or more rules are defined to traverse through the one or more hierarchal levels to access the one or more templates.

Abstract: In embodiments of the present invention improved capabilities are described for identifying a first classification scheme associated with product attributes of a first grouping of products, identifying a second classification scheme associated with product attributes of a second grouping of products, and receiving a record of data relating to an item, the classification of which is uncertain. It may also involve receiving a dictionary of attributes associated with products and assigning the item to at least one of the classification schemes based on probabilistic matching among the attributes in the classification schemes, the attributes in the dictionary of attributes and the known attributes of the item.

Abstract: Methods, systems, and products characterize consistency of data in a stream warehouse. A warehouse table is derived from a continuously received a stream of data. The warehouse table is stored in memory as a plurality of temporal partitions, with each temporal partition storing data within a contiguous range of time. A level of consistency is assigned to each temporal partition in the warehouse table.

Abstract: A database management system may be operated by a third-party provider that hosts the system in a datacenter and provides access to the system to end users on behalf of various entities. Limits on total capacity consumption may be imposed, but may result in service outages when capacity consumption exceeds those limits. Requests to perform operations on the system may be classified. The request classifications may be associated with policies for admitting or rejecting the request. One or more token buckets representative of capacity available to the request to perform the operation may be used to determine to admit the request and updated based on the cost of performing the operation.

Abstract: A method, a system and a computer program product create mappings between taxonomies in which documents are classified from a category of a taxonomy to one or more categories within a master taxonomy based on a statistical model and classification score values. The document classifications are analyzed to determine a mapping between the taxonomy category and a corresponding category of the master taxonomy, where the category is mapped to the corresponding category in the master taxonomy in response to sufficient classification score values for the documents.

Abstract: A classification system executing on one or more computer systems includes a processor and a memory coupled to the processor. The memory includes a discovery engine configured to navigate through non-volatile memory storage to discover an identity and location of one or more files in one or more computer storage systems by tracing the one or more files from file system mount points through file system objects and to disk objects. A classifier is configured to classify the one or more the files into a classification category. The one or more files are associated with the classification category and stored in at least one data structure. The one or more files are classified using an installed storage driver method. Methods are also provided.

Abstract: An RFID event tracking and management system provides a standardized approach that can be utilized by various industry verticals. A series of industry-specific data models can be built upon a common data model using an object-oriented database and relational mapping tool. Using the industry-specific data models, an object-oriented database is generated that can be used by all vertical applications that sit on top of the database. The data models can be defined using a data model service, such that query and capture interfaces can interact with the respective data model. Such an approach allows the data models to be dynamic, which is desirable as a single static data model is not appropriate for all industries.

Abstract: A system and method for performing classification using semantic distance measurements. Items of electronic content accessed by individuals over a global communications network are identified. A set of content that includes the plurality of identified items of electronic content are stored. The set of content is normalized. Each of the keywords contained the set of content is identified and a semantic distance between each of the identified keywords is measured.

Abstract: Techniques for managing big data include tagging of documents and subsequent retrieval using per-subject dictionaries having entries with subject-determining-power scores. The subject-determining-power scores provide an indication of the descriptive power of the term with respect to the subject of the dictionary containing the term. The same term may have entries in multiple dictionaries with different subject-determining-power scores in each of the dictionaries. A retrieval request for one or more documents containing search terms descriptive of the one or more documents can be processed identifying a set of candidate documents tagged with subjects and optional terms, and then applying subject-determining-power scores from the multiple dictionaries for the search term to determine a subject for the search term. The method then selects the one or more documents from the candidate documents according to the subject.

Abstract: A system, method and computer readable medium for indexing streaming data. Data may be received from distributed devices connected via a network. Data elements may be stored and allocated to data blocks and events of the block stores. Non-text data may be converted into a text representation. The data may be split into terms, and term frequencies of each term within each of the event may be calculated. Block-level term frequency statics may be calculated based on the term frequencies. Tree index structures, such as the Y-tree index, may be generated based on the block-level term frequency data. The Y-tree index structures may use the terms as keys and pointers to the corresponding data blocks and block-level term frequency data. A search query may be performed over the tree index structures.

Abstract: Provided are a computer program product for generating suggestions for an input string. A determination is made of strings in a user selected data source having at least a substring matching an input string, from a computer implemented user interface, comprising at least one character for use by a computer implemented process. The determined strings are provided to the user interface and selection is received of one of the determined strings from the user interface to provide to the computer implemented process.