Abstract: The present disclosure concerns a method of identifying a biometric record of an individual in a database (108), the database comprising at least first and second sets of records, each set comprising at least one record, the method comprising: receiving by a processing device (102) at least first and second input biometric samples of said individual; performing on the records of said first set a first matching process comprising a first filtering operation followed by a second filtering operation, and performing on the records of said second set a second matching process comprising said second filtering operation followed by said first filtering operation, wherein said first filtering operation comprises comparing said first input biometric sample to a first reference biometric sample of each record, and said second filtering operation comprises comparing said second input biometric sample to a second reference biometric sample of each record; and identifying a biometric record of said individual based on res

Abstract: The invention relates to a method, a system (101) and a computer program product to identify a particular data object of a data type in a database (104) that comprises data objects of the data type. The system (101) comprises a query composition unit (102) to compose a search query to identify a candidate data object being a candidate for the particular data object. A search unit (103) identifies the candidate data object in the database (104) based on the search query. A presentation unit (105) presents the candidate data object to the user. A feedback receiving unit (106) receives user feedback on the relevance or irrelevance of a segment of the candidate data object. The search unit (103) further identifies an improved candidate data object in response to the received user feedback. The improved candidate data object is an improved candidate for the particular data object.

Abstract: A feature amount calculation unit 61 calculates a feature amount corresponding to a pattern of a lesion by analyzing an inspection image. A probability calculation unit calculates a first existence probability which is a probability of the pattern of a lesion existing within the inspection image, using a calculation expression. The calculation expression is created in advance by a statistical method on the basis of a relationship between the feature amount and the presence or absence of the pattern of a lesion within an image for learning which is visually determined by a person. A similarity calculation unit calculates a similarity between the inspection image and a case image on the basis of the first existence probability and a second existence probability which is a probability of the pattern of a lesion existing within the case image which is calculated by the statistical method similarly to the first existence probability.

Abstract: According to an embodiment of the present invention, a computer implemented method and system for developing variables for model generation comprises: initiating, via an input to a computer, creation of a new variable for a dataset for model generation; extracting, by the computer, data relevant to the variable from one or more data sources; processing, by the computer, the extracted data to automatically generate an input variable; displaying, via a user interactive interface, the processed data relative to a target variable; modifying, via the user interactive interface, one or more parameters that define the input variable; executing, by the computer, the input variable by extracting code that captures the processing step to generate the input variable; and storing, in a database, the extracted code for the input variable.

Abstract: The focus of the present invention is the modular analysis of Big Data encompassing parallelization, chunking, and distributed analysis applications.

Abstract: Techniques are provided for a fully-automated process for tuning database query language statements that selects database query language statements for tuning, tunes the database query language statements and generates tuning recommendations, tests the tuning recommendations, and determines whether to implement the tuning recommendations based on the test results. The fully-automated tuning process may also automatically implement certain tuning recommendations and monitor the performance of the database query language statements for which tuning recommendations have been implemented.

Abstract: Calculation of aggregated values in a history database table can be optimized using an approach in which an ordered history table is accessed. The ordered history table can include a sequential listing of commit identifiers associated with updates, insertions, and/or deletions to values in the database table. The ordered history table can be traversed in a single pass to calculate an aggregation function using an optimized algorithm. The optimized algorithm can enable calculation of an aggregated metric of the values based on a selected method for tracking invalidated values to their corresponding commit identifiers. The calculated metric is generated for a current version of the database table; and promoted.

Abstract: Shuffling data stored in columnar tables improves data storage security, particularly when used in conjunction with other security operations, such as tokenization and cryptography. A data table is accessed, and pointer values of at least one column of the accessed table are shuffled, generating a protected table. An index table mapping index values to the shuffled pointer values is generated, allowing a user with access to both the protected table and the index table to generate the original table. Without both tables, users are only able to see either the shuffled data or the index values. Example shuffling methods include, but are not limited to, random shuffling, grouped shuffling, sorting by column value, and sorting by index value.

Abstract: Methods for faceted searching within clustered in-memory databases are disclosed. Faceted searching may be used to generate search suggestions. The faceted search engine may be able to use non-literal key algorithms for a partial prefix fuzzy matching and may include a feature disambiguation module. The disclosed search engine may be capable of processing large amounts of unstructured data in real time to generate search suggestions.

Abstract: Embodiments of the present invention disclose a method for processing tabular data. In various embodiments, an electronic document is received through a network, along with associated metadata. A plurality of table markers, or tabular data markers, are identified, in response to analyzing the received electronic document for said markers. References and citations associated with the plurality of tabular data markers are identified. A graphical representation of the relationship between identified tabular data markers and the identified references is generated. A uniqueness score is calculated, based on the generated graph and an ingestion plan is generated for the received electronic documents based on the calculated uniqueness score value.

Abstract: Sparse data may be stored in a search index such that one or more data points related to a number of entities may be queriable. Upon detection of a data point related to an entity, an integer array may be created for the data point to store within a single column of the search index, the integer array including an identifier of the entity and a value associated with the data point. In response to receiving a request from a user to perform a query on the search index that includes the data point, the query may be transformed to a corresponding range based on the identifier of the entity. Upon execution of the query, the identifier may be removed and query results may be provided to the user as another array with a user-compatible identifier for the entity such that the results may be understood by the user.

Abstract: Techniques for cloning, writing to, and reading from file system metadata. Cloning involves identifying a first set of pointers included in a first root node in a file system metadata tree structure that stores file system metadata in leaf nodes of the tree structure, creating a first copy of the first root node that includes the first set of pointers, creating a second copy of the first root node that includes the first set of pointers, associating the first copy with a first view, and associating the second copy with a second view. Reading generally involves traversing the tree structure towards a target leaf node that contains data to be read. Writing generally involves traversing the tree structure in the same manner, but also creating copies of any nodes to be modified if those nodes are deemed to have a different treeID than a particular root node.

Abstract: A method and apparatus for performing relatively fast record searching is provided. The design includes providing one alphanumeric key to any record of a plurality of records not including an alphanumeric key, providing one text description comprising at least one word to any record of the plurality of records not including a text description having at least one word, and establishing a multidimensional index, where for each record there is provided in the multidimensional index a pointer pointing from one alphanumeric key to one associated record, a text description pointer pointing from each text description to the one associated record, a first reverse word index pointer pointing from each word to one alphanumeric key, and a second reverse word index pointer pointing from each word to one text description. Records are searched using the multidimensional index.

Abstract: Client-side partition-aware batch insert operations are presented. For example, a server generates partition metadata, which is provided to a client. The client uses the partition metadata to determine the database nodes to which to send batch insert requests. For example, the client divides batch insert data, such as records for a partitioned table, among multiple database nodes having partitions of the table. The client issues batch insert requests to the respective database nodes for execution. When executed by the database nodes, batch insert operations can be performed in parallel.

Abstract: The method includes generating, by one or more computer processors, a first piece of data based on a defined set of data characteristics. The method further includes generating a first bit, wherein the first bit corresponds to the first generated piece of data. The method further includes sending the first generated piece of data to a target location. The method further includes receiving the first generated piece of data from the target location. The method further includes determining whether to validate the first generated piece of data received from the target location. The method further includes adjusting the first generated bit based on the determination of whether to validate the first generated piece of data.

Abstract: Embodiments enable reduction of database downtime in a live production environment of an on-demand database service during repair and/or maintenance tasks. A source database and a target database are provided. Data is copied from the source database to the target database to create a mirrored set of data. Access is limited to one or more designated tables in the target database. General traffic is redirected from the source database to the target database, wherein the redirection occurs for a duration of a maintenance period. Data modifications that occur in the target database during the maintenance period are captured and then replicated into the source database. Finally, general traffic is redirected from the target database to the source database.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for virtual block storage. In one aspect, a method includes receiving a request to initialize a virtual machine, the virtual machine having an associated virtual block device; accessing a file map comprising a plurality of file map entries; determining file map entries corresponding to blocks of data allocated to the virtual block device and one or more files in which the blocks of data allocated to the virtual block device are stored; determining that a particular one of the blocks allocated to the virtual block device has been written to a new position not associated with the particular block in the file map; and updating the position associated with the particular block to the new position.

Abstract: Systems and methods for converting a data item provided by an external data provider system into a data type specified by a data processing system for a data field of the data item. A data processing system stores a coercion rule for each data field of a first data set provided by the data provider system. Each stored coercion rule identifies at least one data type for the corresponding data field. Responsive to a second data set provided by the data provider system, the data processing system coerces each data item of the second data set into at least one data type specified by the stored coercion rule for the data field of the data item to generate at least one converted data item of the second data set. The data processing system generates information from at least one converted data item, and provides the information to a consuming system.

Abstract: In accordance with disclosed embodiments, there are provided methods, systems, and apparatuses for fixing logical or physical corruption in databases using LSM trees including, for example, means for storing records in a LSM database at the host organization; processing transactions to the LSM database by writing the transactions into immutable extents for subsequent merge into the LSM database; recording a history of the transactions in a log; identifying corruption in at least one of the records of the LSM database represented within the immutable extents prior to use of the immutable extents in the LSM database; and correcting the identified corruption to the at least one of the records of the LSM database based at least in part on the recorded history of the transactions in the log during live operation of the LSM database. Other related embodiments are disclosed.

Abstract: A computing device is described that includes at least one processor and a memory including instructions that when executed cause the at least one processor to output, for display, a graphical keyboard comprising a plurality of keys, and determine, based on an indication of a selection of one or more keys from the plurality of keys, text of an electronic communication. The instructions, when executed, further cause the at least one processor to identify, based at least in part on the text, a searchable entity or trigger phrase, generate, based on the searchable entity or trigger phrase, a search query, and output, for display, within the graphical keyboard, a graphical indication to indicate that the computing device generated the search query.

Abstract: In one embodiment, a method includes receiving an unstructured text query from a first user of an online social network; and accessing, from a data store of the mobile client system, a set of nodes of a social graph of the online social network. The social graph includes a number of nodes and edges connecting the nodes. The nodes include a first node corresponding to the first user and a number of second nodes that each correspond to a concept or a second user associated with the online social network. The method also includes accessing, from the data store of the mobile client system, a set of grammar templates. Each grammar template includes one or more non-terminal tokens and one or more query tokens. The query tokens include references to zero or more second nodes and one or more edges and each grammar template is based on a natural-language string.

Abstract: According to an aspect of the invention, an aggregator node is conceived for use in a network, wherein said aggregator node is arranged to aggregate encrypted data, and wherein said aggregator node comprises a secure element which is arranged to perform the aggregation of the encrypted data in a secure manner.

Abstract: An approach is provided for aggregating business data. Based on received columns, attributes, and keys of a dataset, the dataset is registered in a central hub of datasets which include data that is independently and locally maintained. Initial or updated data is loaded into the dataset in the central hub. Other datasets in the central hub that include columns, attributes, or keys that match the received columns, attributes, or keys, respectively, are determined and displayed. In response to receiving a user selection of one or more of the displayed datasets, cross-links between the dataset and each of the one or more selected datasets are automatically generated. The cross-links are based on the columns, attributes, or keys of the displayed datasets that match the received columns, attributes or keys. The cross-links provide an aggregation of business data in the dataset and the one or more selected datasets.

Abstract: A data output method, includes: extracting, by a computer, data satisfying a first condition on one data among a plurality of conditions, from a plurality of data, as a node; creating a first graph by coupling two nodes satisfying a second condition on a relationship between two data among the plurality of conditions with a link; creating a second graph by deleting a node that does not satisfy the second condition from the first graph; determining candidates of data combination in the second graph; and outputting a data combination satisfying the plurality of conditions from the candidates of data combination.

Abstract: A view schema is generated from a view definition, wherein the view schema includes one or more relational views that are created by translating one or more object queries in the view definition into one or more relational queries. A report design schema is generated from the view definition by: creating one or more report tables that correspond to the one or more relational views of the view schema and extending the one or more report tables with one or more primary key constraints and one or more foreign key constraints. A reporting model is generated by reverse engineering the report design schema, wherein the reporting model includes the one or more primary key constraints and the one or more foreign key constraints. A report is generated using the reporting model, wherein the report includes the one or more primary key constraints and the one or more foreign key constraints.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for implementing algebraic data types in database query languages. One of the methods includes receiving an expression in a database query language, the expression having a programming language construct representing an algebraic data type, wherein the expression specifies two or more alternative subtypes. Respective domain relations are generated using definitions of each of the alternative subtypes within the expression. Unique domain identifiers are assigned among domain tuples belonging to each alternative subtype. A union relation is generated for the algebraic data type. Unique union identifiers are assigned for union tuples belonging to the union relation. Respective injector relations are generated for each of the alternative subtypes.

Abstract: Mechanisms are provided for generating an answer to a superlative question. The mechanisms analyze the superlative question to extract a superlative term in the superlative question and a focus. A metric by which to evaluate the superlative term is identified based on one of a clue term in the superlative question or one or more portions of content of a corpus of information including the superlative term and focus. A search of the corpus is executed to identify one or more candidate answers to the superlative question based on evidence passages in the corpus, the superlative term, the focus, and the metric. A final answer to the superlative question is output based on the one or more candidate answers.

Abstract: Managing confidence data in a question-answering environment is disclosed. Managing confidence data can include sorting, based on a set of answer categories for a subject matter, a first set of a plurality of answers into a first answer category. The first set can correspond to at least one of a third set of a plurality of confidence scores and the second set can correspond to at least one of a fourth set of the plurality of confidence scores. Managing confidence data can include classifying confidence scores of the third set into one of a plurality of confidence buckets using a first threshold and determining a fifth set of a plurality of thresholds using the plurality of confidence scores. Managing confidence data can include classifying unclassified confidence scores of the third set into one of the plurality of confidence buckets using the fifth set of the plurality of thresholds.

Abstract: Methods for enhancing search results includes providing a search result including a plurality of search result items and posting the search result items or a link thereto to a social network cite.

Abstract: A system to assist users to bookmark online content by storing a collection of bookmarks among all the users, classifying the bookmarks by tags submitted by the users, searching the bookmarks by user specified tags returning only the bookmarks actually collected by the user, and allowing narrowing of the search by specifying additional tags. Further embodiments include limiting searching by the classification done only by the user, aggregating bookmarks across user devices and online user publications.

Abstract: An execution plan for executing one or more iterations of recursive database queries can be generated in accordance with one aspect of the invention. For example, in accordance with one embodiment of the invention, one or more cardinalities (results or size of results, including intermediate results) associated with one or more iterations can be estimated. This estimation can, for example, by performed by using a sampling or sampling-based algorithm. In addition, a plan generated for execution of one or more iteration of a recursive query can be modified or replaced by comparing the actual cardinality with its estimation. As a result, the first one or more iterations may be executed using a first plan but the subsequent one or more iterations may use a modified or different execution plan.

Abstract: Techniques for processing queries are provided. In one approach, an execution plan for a query includes multiple sub-plans, one or more of which are selected at runtime while one or more other sub-plans are not executed during execution of the execution plan. In another approach, data about misestimate is generated and stored persistently for subsequent queries. In another approach, statistics for a database object are generated automatically and efficiently while the database object is created or data items are added thereto. In another approach, a hybrid histogram is created that includes a feature of frequency histograms and a feature of height-balanced histograms. In another approach, computer jobs are executed in such a way to avoid deadlock. In another approach, changes to a database object trigger a hard parse of a query even though an execution plan already exists for the query.

Abstract: Optimization of a multi-index database access at runtime. A processor receives a query. A processor determines a plan and a record identifier (RID) results threshold for the plan, wherein the plan includes an access to the index. A processor determines a static risk threshold, a static risk for the access, and whether the static risk exceeds the static risk threshold. Responsive to the static risk exceeding the static risk threshold, a processor determines a risk bound for the access, and links the access to the risk bound. A processor accesses the index with the key. Responsive to the access being linked to a risk bound, a processor determines a dynamic risk for the access. A processor receives one or more RID results during the execution of the plan. A processor aborts the execution of the plan if a quantity of the RID results is less than the RID results threshold.

Abstract: A system and method for efficient storage and retrieval of fragmented data using a pseudo linear dynamic byte array is provided. In accordance with an embodiment, the system comprises a database driver which provides access by a software application to a database. The database driver uses a dynamic byte array to enable access by the application to data in the database, including determining a size of a required data to be stored in memory, and successively allocating and copying the required data into the dynamic byte array as a succession of blocks. The data stored within the succession of blocks can then be accessed and provided to the application.

Abstract: Provided are a method, system, and article of manufacture for discovering transformations applied to a source table to generate a target table. Selection is made of a source table comprising a plurality of rows and a target table resulting from a transformation applied to the rows of the source table. A first pre-processing method is applied with respect to columns in the source and target tables to produce first category pre-processing output. The first category pre-processing output is used to determine first category transformation rules with respect to at least one source table column and at least one target table column. For each unpredicted target column in the target table not predicted by the determined first category transformation rules, a second pre-processing method is applied to columns in the source table and unpredicted target columns to produce second category pre-processing output.

Abstract: Presenting data from different data providers in a correlated fashion. The method includes performing a first query on a first data set controlled by a first entity to capture a first set of data results. The method further includes performing a second query on a second data set controlled by a second entity to capture a second set of data results. The method includes receiving a selection of one or more results from the first data set. The method further includes using the one or more selected results, consulting a relationship ontology that correlates data stored in different data stores controlled by different entities, to identify one or more relationships between data in the selected results set and the second data set.

Abstract: A method, system, and computer program product for initializing a stream computing application are disclosed. The method may include receiving a plurality of tuples to be processed by one or more processing elements operating on one or more computer processors. Each processing element may have one or more stream operators. The method may also include determining a first attribute to be processed at a first stream operator that is configured to transmit a tuple having the first attribute along an execution path including at least one intervening stream operator to a second stream operator. The method may include compressing the first attribute when the first attribute is to be next processed by the second stream operator.

Abstract: A method and system for analyzing user behavior as users search for items within an electronic marketplace is provided. A query is submitted by a user of the electronic marketplace, the query is processed to identify a series of actions or behaviors performed by the user in relation to the query and fingerprint information for the query is determined based at least in part on analyzing the actions. A classification for a query is determined based on the fingerprint information. In one embodiment, an electronic marketplace receives a query from a user, accesses a query classification database having fingerprint information, determines a fingerprint for the query based on the fingerprint information and dynamically modifies a user experience for the user based at least in part on the fingerprint information.

Abstract: An engine and method for tracking the influence of an entity operating within a social network are presented. A query containing social network content is received. A database for entries referencing the social network content is searched, and interactions between an entity participating within the social network and the social network content are identified. A dynamic interaction network (DIN) of a plurality of the entities is identified and a dynamic influence score for an entity in the query specific DIN is calculated.

Abstract: An extracting method includes storing to a storage device: files that include character units; first index information indicating which file includes at least one character unit in a character unit group having a usage frequency less than a predetermined frequency and among character units having common information in a predetermined portion, the usage frequency indicating the extent of files having a given character unit; second index information indicating which file includes a first character unit having a usage frequency at least equal to the predetermined frequency and among the character units having common information in a predetermined portion; and referring to the first and second index information to extract a file having character units in the first and second index information, when a request is received for extraction of a file having the first character unit and a second character unit that is included in the character unit group.

Abstract: A mechanism is provided, in a data processing system comprising a processor and a memory configured to implement a question and answer (QA) system, for weighting search criteria based on similarities to an ingested corpus in the QA system. A set of question characteristics found in a received input question are compared to a set of data characteristics respectively describing data in each corpus of a corpora. For each question characteristic in the set of found question characteristics, a first weight is assigned to the corpus within which data associated with the data characteristic resides in response to the question characteristic being more related to a data characteristic; otherwise a second weight is assigned, where the first weight is greater than the second weight. A selective search is then performed for an answer to the received input question in one or more corpora with a higher weighting.

Abstract: A system that recommends literary works to a user based on identified trends of how text in the literary works liked and/or disliked by the user are written and/or structured is provided. For example, the system may analyze the text of a literary work to identify one or more metrics. Based on the identified metrics, the system can generate an analytical summary called a fingerprint for the literary work. The ratings assigned to literary works by the user may be used in conjunction with the generated fingerprints to generate positive and/or negative models for the user. The positive model captures aspects of literary works that the user likes and the negative model captures aspects of literary works that the user dislikes. The system can then compare some or all of the generated fingerprints in a literary works fingerprint database with the positive and/or negative models to select literary works to recommend to the user.

Abstract: In one exemplary aspect, a method includes the step of obtaining a content of a content block. The content is represented as a content vector. A query is received. The query is represented as a query vector. A hierarchical sliding similarity and dissimilarity is determined for matching the content vector and the query vector, this step can include the steps of: determining a similarity measure and a dissimilarity measure for each content vector element with respect to the query vector; identifying a strong match over a sliding window of sub-terms of each content vector element; computing a sub-similarity score and a sub-dissimilarity score for each level of the convent vector element; determining a final similarity score as a combination of the strong match of some sub-vectors at different levels; and determining a final dissimilarity score as a combination of the strong match of some sub-vectors at different levels.

Abstract: Methods and systems are disclosed for assessing an identifier. The method comprises receiving a string of characters making up the identifier and determining a keyboard type for a keyboard. The method further comprises calculating, by a calculator module, a typeability score for the identifier based on the string of characters and the keyboard type, wherein the typeability score signifies a difficulty of typing the identifier on the keyboard type. In certain embodiments, the method further comprises determining a finger positioning corresponding to a position of a typer's fingers on the keyboard, and the typeability score is further based on the finger positioning. In some embodiments, the finger positioning is based on the typer's typing habits.

Abstract: A mechanism is provided in a data processing system for question answering using multi-instance learning. The mechanism trains an answer ranking multi-instance learned model using a ground truth question and answer-key pairs set. When used for answering questions, the mechanism receives an input question from a user and generates one or more candidate answers to the input question. Each of the one or more candidate answers has an associated set of supporting passages. The mechanism determines a confidence value for each of the one or more candidate answers using an answer ranking multi-instance learned model based on the sets of supporting passages. The mechanism ranks the one or more candidate answers by confidence value to form a ranked set of answers, classifies supporting passages to identify the ones which truly support the answer, and presents a final answer from the ranked set of answers, the confidence value for the final answer, and supporting evidence for the final answer to the user.

Abstract: A method for natural language search for variables is provided. The method may include searching an index using key words from a user's natural language question and the context of the user's question. The index may reference variables and/or web service calls in a domain model. The method may also include saving documents obtained in response to the search. The method may also include mapping each of the documents as a node into an object graph. Each node may be associated with a parent node, except when the node is a root node. The method may also include identifying the root node of each document. The method may also include identifying the path of each node from the node to the node's root node. The method may also include identifying matching paths. Each matching path may provide an answer to the user's question.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for content presentation. In one aspect, a method includes obtaining information associated with a mobile application of interest; determining a plurality of similar applications to the application of interest; determining keywords from the similar applications; and extracting new keywords for the application of interest using a model trained using statistical information for keywords of the plurality of similar applications that overlap with keywords of the application of interest.

Abstract: A system includes a memory operable to store visualization rules. The system also includes a processor communicatively coupled to the memory. The processor is operable to receive a visualization request relating to information stored in an ontology. The processor is further operable to parse the visualization request to generate a search query. The processor is further operable to submit the search query to the ontology. The processor is further operable to receive, in response to the query, a result. The result includes a plurality of instances and a plurality of relationships between the instances. The processor is further operable to generate a visual representation of the result using the visualization rules.

Abstract: A calendared event may be visually indicated. A proposed time for the calendared event can be identified and each of a plurality of event participants can be associated with the calendared event. For each of the participants, a local time of the participant that corresponds to the proposed time for the calendared event can be identified and displayed.

Abstract: A method for integrating data into a database comprises storing data comprising a plurality of records which each comprise a plurality of attributes; analyzing a sample of records from the plurality of records by: identifying duplicate pairs of records in the sample records; analyzing each attribute of each record of the duplicate pairs of records to identify a respective attribute condition which is indicative that the pairs of records are duplicates; wherein the method further comprises: comparing each attribute of a record with the respective attribute condition and, if the attribute satisfies the attribute condition, allocating the record to a disjoint group which comprises records with an attribute that satisfies the same respective attribute condition; identifying duplicate pairs of records in the records in each disjoint group; identifying duplicate pairs of records in records that are not allocated to a disjoint group; and consolidating each duplicate pair of records into one consolidated record and s