Abstract: A shared resource update apparatus includes: a processor unit including at least one processor having a plurality of processor cores that respectively execute a plurality of threads; and a storage unit storing a program that executes conflict avoidance control by being executed by the processor unit. A shared resource for the plurality of threads comprises a plurality of shared resource parts which are logically or physically partitioned. Each first thread among the plurality of threads is an update thread which updates an allocated shared resource part in response to an update request. Each second thread among the plurality of threads is a reference thread which issues an update request and references a shared resource part. Conflict avoidance control includes allocation of different shared resource parts to different update threads at a ratio of 1:n or 1:1, where n is an integer equal to or larger than 2.

Abstract: Monitoring statements in a database environment. Substantially all database query statements to be executed against a database in the database environment are analyzed to determine if a statement has an outlier statistic. Database queries that do not have an associated outlier statistic are serviced. Further analysis is performed for statements having an outlier statistic to determine if the corresponding statement poses a security risk to the database environment.

Abstract: A computing apparatus may process an operation. The computing apparatus may output information regarding an aggregation operation and an operand corresponding to a variable stored in a memory, store information regarding an operator and the aggregation operands regarding the aggregation operation, perform a first partial operation with respect to the aggregation operands and store a result value of the first partial operation, and process the aggregation operation based on storing the variable, performing a second partial operation with respect to the result value of the first partial operation stored in the cache and the operand corresponding to the variable, and storing a result value of the second partial operation.

Abstract: One embodiment provides a system that facilitates a flexible strategy for matching content objects and interests. During operation, the system receives, by a computing device, an interest which includes a set of attributes, wherein a respective attribute has one or more values. In response to not obtaining a matching entry for the interest in a pending interest table, the system adds to the pending interest table a first entry which indicates the interest based on the attributes and their values. The system determines whether a received content object satisfies the interest indicated in the first entry based on the attributes of the first entry and attributes of the content object. In response to determining that the content object satisfies the interest, the system forwards the content object, thereby facilitating a flexible strategy for matching content objects to interests.

Abstract: A system for exploring data in a database comprises a query parser, a parameter manager, a query submitter, and a result formatter. The query parser is to receive a base query and determine an input parameter from the base query. The parameter manager is to provide a first request for a value for the input parameter; receive the value for the input parameter; and provide a second request for the value for the input parameter. The query submitter is to determine a first query using the base query and the value for the input parameter; and provide an indication to execute the first query. The result formatter is to receive a result associated with the indication to execute the first query.

Abstract: A method, computer system and computer program product, the method comprising: upon receiving a database query comprising at least a first and a second join operations: storing the database query in the memory; identifying by the processor within the database query the first join operation, wherein the first join operation is a many-to-many join operation or a one-to-many join operation between a first table and a second table, in which fields of the second table are used only for filtering rows from the first table or for joining with another table; and converting by the processor the first join operation to an enhanced operation which eliminates returning at least two matches for at least one row from the first table when the database query is executed.

Abstract: In one embodiment, a method stores a mapping table that includes a zero data identifier corresponding to a zero data record in the second database table. The method receives a query for data in a cube data structure. A first join between the first database table and the mapping table and a second join between the second database table and the mapping table are performed to generate a combined table for the cube data structure. The combined table includes a combined record that includes information from a first record from the first database table and includes the zero data identifier with information from the zero data record in the second database table when the first record for an entity in the first database table does not include a corresponding second record for the entity in the second database table.

Abstract: A computer scale-out method by adding a second computer to a first computer receiving stream data from a data source and executing a query to make the second computer execute the query, the computer scale-out method including: receiving, by a management computer, a request to scale out; a second step of generating, by the management computer, rewritten queries that are copies of the query; sending, by the management computer, instructions to scale out including the rewritten queries to the first computer and the second computer; receiving, by the first computer and the second computer, the instructions to scale out, extracting the rewritten queries, and switching to the extracted rewritten queries; notifying, by the first computer or the second computer, the management computer of readiness of the rewritten queries; and sending, by the management computer, an instruction to add the second computer as a destination to the data source.

Abstract: A computer-implemented method for determining a query execution plan based on transaction state may include determining that a first set of database values in a database table are in a committed transaction state and that a second set of database values in the database table are in an uncommitted transaction state. In response to the determining, the first set of database values may have a first set of statistics generated and the second set of database values may have a second set of statistics generated. The first and second set of statistics may be for use in determining a query execution plan.

Abstract: A computer-implemented method for determining a query execution plan based on transaction state may include determining that a first set of database values in a database table are in a committed transaction state and that a second set of database values in the database table are in an uncommitted transaction state. In response to the determining, the first set of database values may have a first set of statistics generated and the second set of database values may have a second set of statistics generated. The first and second set of statistics may be for use in determining a query execution plan.

Abstract: A computer-implemented method, system, and/or computer program product optimizes an order of execution of column join operations. A first partitioning of the first data column splits the first data column into first subsets of rows. A second partitioning of the second data column splits the second data column into a second subsets of rows. Cardinalities of sub-tables derived by a respective joining of the subsets of rows of the first and second data columns are estimated, based on the first and second value frequency information. An order of execution of multiple join operations is then optimized based on the estimated cardinalities of the sub-tables.

Abstract: A DBMS optimizer generates a first query plan based on a first set of configuration parameters. The first query plan is executed in test mode one or more times. A first query object corresponding to the first query plan is created. The first query object includes the execution time of the first query plan. When the optimizer determines a first query plan is generated, a second query plan is generated based on a second set of configuration parameters. The second query plan is executed in test mode one or more times. A second query object corresponding to the second query plan is created. The second query object includes the execution time of the second query plan. Execution times of the first query plan and the second query plan are compared. The query plan with the shortest execution time is set as current query execution plan.

Abstract: A method stores records for a set of entities that are generated using an input parameter that is not based on a date. A query is received that includes one or more date parameters, the query for aggregating a value. Upon receiving the query, the method performs: selecting a set of records from the stored records that are valid based on comparing first date information determined from the one or more date parameters and second date information from the records; performing an aggregation calculation of the value for the set of records to generate a query result; and returning the query result in response to the query.

Abstract: A database system searches for any statements that satisfy one or more of a set of filtering criteria. When a given dynamic query statement fully satisfies the set of filtering criteria, the given statement is stabilized by persistently storing a bound form of the given dynamic query statement. When the given dynamic query statement partly satisfies the set of filtering criteria, a monitoring request is created with the set of filtering criteria to begin monitoring subsequent executions of the statement, and the statement is linked to the monitoring request. When the given dynamic query statement subsequently fully satisfies the set of filtering criteria, the statement is stabilized by persistently storing the bound form of the statement. When the given dynamic query is re-executed, the stabilized statement is loaded, and the PREPARE process is bypassed.

Abstract: One or more client threads are executed. One or more processing threads corresponding to the one or more client threads are executed. The processing threads are configurable to generate statistical information for each database query statement processed by the corresponding client thread. The statistical information is generated from the processing threads. The statistical information is stored in chunks of memory managed via a plurality of queues. The chunks of memory containing the statistics are analyzed. Outlier statements are filtered based on the statistics. Non-outlier statements are stored by a storage device.

Abstract: A method includes retrieving de-identified records for individuals from at least two different databases. Each of the databases stores a different type of information for the individuals. The method further includes identifying a set of features common across the at least two different databases. The method further includes generating a unique identification for each of the individuals in the retrieved de-identified records based on the set of features. The method further includes computing a rarity coefficient for each of the individuals based on the set of features. The method further includes matching the de-identified entities across the at least two different databases based on the rarity coefficients. The method further includes matching the de-identified patient records for a set of matched de-identified entities. The method further includes constructing a database with one or more sets of the matched de-identified records.

Abstract: A method for providing a social media matrix is disclosed. Leveraging the social media matrix between two or more users, matches are realized using one or more different categories based on profile information provided by the users.

Abstract: With respect to data items presented in structured, sorted listing having an initial arrangement positioning of the data items relative to each other, aspects select a subset group of the data items having values in a data field selected within one of the items and that share a common value within a different data field. The selected data field is replaced within the selected data item by a roller widget having data values of the selected field of each of the first data item and of the subset of data items. Thus, the roller widget is enabled to scroll through the data values while the unselected data items of the structured list are continually displayed in their initial arrangement positioning relative to each other and to the roller widget in place of the selected data field.

Abstract: User-submitted content (e.g., stories) may be associated with descriptive metadata (intersection metadata), such as a timeframe, location, tags, and so on. The user-submitted content may be browed and/or searched using the descriptive metadata. Intersection criteria comprising a prevailing timeframe, a location, and/or other metadata criteria may be used to identify an intersection space comprising one or more stories. The stories may be ordered according to relative importance, which may be determined (at least in part) by comparing story metadata to the intersection criteria.

Abstract: A method of providing a search word list includes acquiring a tag set in a search word, applying an effect corresponding to the tag to the search word, and providing a search word list including the search word to which the effect has been applied.

Abstract: This disclosure describes systems, methods, and apparatus for expanding a row or column in an existing report, sourced from a relational database, where a column or row, respectively, of an opposite axis has already been expanded. Such a need often arises in reports sourced from a SQL database, and overcomes the storage-draining need to pre-compute all possible arrangements of data from the database prior to displaying the report. In some embodiments, a client can make a request for a multi-axis expansion, and a server can create filters for use in sub queries, one for each level of expansion in an axis of the report opposite to the axis where expansion is requested, the sub queries can be executed, results sets can be combined/formatted to form a new report, and the new report can be returned to the client for stitching into the existing report.

Abstract: A computer-implemented method for generating results for a client-requested query involves receiving a query produced by a client communication device, generating a result for the query in response to reception of the query, determining one or more predictive follow-up requests before receiving an actual follow-up request from the client device, and initiating retrieval of information associated with the one or more predictive follow-up requests, and transmitting at least part of the result to the client device, and then transmitting to the client device at least part of the information associated with the one or more predictive follow-up requests.

Abstract: A management device managing a storage device having a plurality of logical storage areas accessed by a computer has a monitor module for determining whether a setting is made by which the computer uniformly accesses the plurality of logical storage areas, obtaining respective access counts of the plurality of logical storage areas when it is determined that the setting is made, and comparing the obtained plurality of access counts, thereby determining whether a logical storage area having a problem exists; an analysis module for obtaining, when the problem exists, configuration information of the storage device assigned to the logical storage area having the problem, and identifying a configuration in the storage device as a bottleneck on the basis of the obtained configuration information; a creation module for creating a countermeasure of changing an access route passing through the configuration as the identified bottleneck.

Abstract: A method, non-transitory computer readable medium, and device that assists with managing storage in a distributed deduplication system includes receiving an object to be stored from a client computing device. The received object is divided into a plurality of fragments. A plaintext hash value and a ciphertext hash value is determined for each of the plurality of fragments, wherein each of the plurality of fragments is renamed with the corresponding determined ciphertext hash value. Each of the renamed plurality of fragments are stored in a plurality of storage repositories.

Abstract: Various embodiments are described that relate to creating a user interface when a data structure is unknown. An application can be used to discover the content of that unknown data structure at runtime. Part of this discovery can include conversion of that data structure from a virtual machine class to a markup language. The discovered content can be used to build a user interface presented on a display. The user interface can be interactive such that information is entered into the user interface. That entered information can be retained in a database as can the discovered content. The entered information along with the content can be converted from the markup language to the virtual machine class back to an originator of the unknown data structure. This way, the originator receives a response in a format usable by the originator.

Abstract: A technique is provided that reduces the number of used entries in a CAM required to store a rule. A data conversion device generates entry data which is to be compared with a search key and is stored in an associative memory that can hold three or more values. The data conversion device includes a conversion circuit for extracting a plurality of character strings from an inputted rule in accordance with a regular expression based on the regular expression and converting first and second character strings included in the character strings, respectively, into first and second bit data different from each other, and an encode circuit that compares the first bit data and the second bit data for each bit and generates entry data where each mismatch bit among a plurality of bits included in the first bit data is converted into “Don't Care” value based on a comparison result.

Abstract: A data visualization tool (“tool”) configured to generate a visualization for tree data. The tool can calculate a number of hierarchical levels of the tree data. The tool can further subdivide a presentation area for the data visualization into a number of concentric parts. The concentric parts are equivalent to the number of hierarchical levels. Each of the concentric parts corresponds to one of the hierarchical levels. Further, the tool can graphically generate the data visualization for presentation via an electronic display. A first of the concentric parts that corresponds to a highest of the hierarchal levels is an outermost one of the concentric parts in the presentation area. Each successive concentric part inward corresponds to a next lower hierarchical level.

Abstract: Embodiments of the present disclosure provide a method, system, and computer program product for managing the execution of a query. The method, system and computer program product include receiving a query to be executed. The query governor calculates an estimated replication time of the received query. The estimated replication time is an estimated duration of time required to replicate changes caused by the query. The query governor determines whether the estimated replication time exceeds the threshold replication time. Responsive to the query governor determining that the estimated replication time does not exceed the threshold replication time, the query governor executes the query against the database in accordance with the instructions.

Abstract: Methods, systems, and computer program products are provided for performing a secure delete operation in a wide area network (WAN) including a cache site and a home site. A method includes identifying a file for deletion at the cache site, determining whether the file has a copy stored at the home site, detecting a location of the copy at the home site prior to a disconnection event of the cache site from the home site, deleting the file from the cache site during the disconnection event, and in response to the secure deletion of the file not being complete during the disconnection event, indicating on a table a remote inode number assigned to the copy associated with the file at the home site, a name under which the copy is saved, and a list of data chunk tuples specifying selected data of the copy to undergo secure deletion.

Abstract: A method includes, where a first database engine maintains a first database, a second database engine maintains a second database, and a table has a first instance in the first database and a second instance in the second database, executing write transactions, asynchronously pooling the changes of the first instance, and, in response to receiving a query against the table, determining to execute the query against the second instance. The method further includes identifying a first time, defining a current replication batch that selectively comprises the pooled changes of the transactions before the first time, asynchronously replicating the current replication batch, storing each change, assigning a batch-ID to the query, sending the query and the batch-ID to the second engine, responsive to the current replication batch being completed, executing the query on the second instance, and returning results of the query execution on the second instance.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enhancing search results. In one aspect, a method includes receiving a query. A plurality of search results responsive to the query are identified. The search results are analyzed to determine that at least a first search result is associated with a first answer box topic. The search results are provided along with an answer box precursor for the first answer box topic.

Abstract: A method is performed at a computing system having one or more processors and memory. The process generates a hierarchical set of folders for a collection of documents. Each folder specifies a rule/query (possibly empty) for identifying a subset of the collection of documents. Each folder also specifies a user-defined set (possibly empty) of individual documents from the collection of documents. In addition, each folder specifies a set (possible empty) of subfolders. The process receives user input to select a first folder of the set of folders, and generates a responsive result set. The result set includes documents that satisfy the specified rule for the first folder, documents from the user-defined set of documents for the first folder, and documents recursively contained in subfolders of the first folder. The process then displays the result set to the user.

Abstract: A method and system are provided. The method includes correlating end user response time monitoring data from an end user response time monitoring system to an infrastructure ownership database. The method further includes correlating the infrastructure ownership database to an organizational structure, using a unique identifier available in both the infrastructure ownership database and the organizational structure. The method also includes automatically creating, on a display device, a custom dashboard for a user logging into the end user response time monitoring system based on correlations resulting from the correlating steps. The custom dashboard shows application performance data for applications relevant to the user based on the hierarchical level of the user in the organizational structure.

Abstract: Systems and methods for tokenization of log records for efficient data storage, log querying, and log data analytics can utilize a trie pattern conversion of the log files, storing trie data pattern IDs, free parameters, and metadata instead of the entire log record. New trie patterns can be discovered automatically by counting the occurrences of tokens matching wildcards for existing patterns.

Abstract: An improved method is the product of an exploration for ways in which to improve the success of genomic disease prediction and presents the elements of more successful prediction tools for the identification of genomic locations of disease based on: genomic labeling it loci as determined by correlated SNP linkage as determined from several additional GWAS (Genome Wide Association Studies) databases. The Wellcome Trust T2D (type 2, adult-onset, diabetes) has played a particularly important role in developing the new tools; additionally, the development of a wellness classifier, probably in part due to counter disease mutations has proven to be a powerful new tool and concept. The result has been a substantial increase in the successful genomic prediction of disease, for example, for the Wellcome Trust data there is compelling evidence of a greater than 99% successful prediction rate.

Abstract: A computer-implemented system and method for identifying documents for review is provided. A set of documents is sorted by topic. A status of near duplicate is assigned to two or more documents in the set. Threads of the documents are identified. Each thread includes at least one near duplicate document that is recursively included within another near duplicate document in that thread. In each thread, the near duplicate documents are ordered based on a length of the thread included in each near duplicate document. The near duplicate document that has the longest length is selected for each thread and provided for review.

Abstract: The invention relates to a method, computer program product and computer system for providing attribute value information for a data extent comprising a set of data entries.

Abstract: Generating a compliance framework. The compliance framework facilitates an organization's compliance with multiple authority documents by providing efficient methodologies and refinements to existing technologies, such as providing hierarchical fidelity to the original authority document; separating auditable citations from their context (e.g., prepositions and or informational citations); asset focused citations; SNED and Live values, among others.

Abstract: Disclosed are a digital device and method of processing data therein. The present invention includes a first receiving unit for receiving application data, a second receiving unit for receiving a signal including a request for a search service and search word data for the search service, a memory storing search history data, a controller configured to perform a first operation based on the search word data in response to the received search service request, control to display a first search result data on a screen, if the displayed first search result data is not valid, add the received search word data to the search history data, and control to display a second search result data on the screen by performing a second search based on the search word data included in the search history data after the search service, and a display unit displaying the application data, the first search result data and the second search result data.

Abstract: A system and method including receiving from a user machine a text input inserted as search input into a search input interface, providing the user machine at least one search category suggestion obtained from hierarchic data structure of search categories, once a suggested search category is selected, adding an indication of the selected search category to the search input, and providing at least one additional search category suggestion by filtering suggested search categories according to previously selected search categories included in the search input.

Abstract: Described herein are systems and methods for selection-based contextual help retrieval. One example method involves (a) receiving first-query data including contextual data, the contextual data indicating a user-interface element type, a user-interface element location, and user-interface element text; (b) determining at least one first-query response based on at least the contextual data; and (c) causing an indication of the determined at least one first-query response to be provided via an output device.

Abstract: A system, method and computer program product for conducting questions and answers with deferred type evaluation based on any corpus of data. The method includes processing a query including waiting until a “Type” (i.e. a descriptor) is determined AND a candidate answer is provided. Then, a search is conducted to look (search) for evidence that the candidate answer has the required Lexical Answer Type (e.g., as determined by a matching function that can leverage a parser, a semantic interpreter and/or a simple pattern matcher). Prior to or during candidate answer evaluation, a process is provided for extracting and storing collections of entity-type pairs from semi-structured text documents. During QA processing and candidate answer scoring, a process is implemented to match the query LAT against the lexical type of each provided candidate answer and generate a score judging a degree of match.

Abstract: A search system includes a reception unit 601 for receiving specification of a specific sentence in an article, a search unit 602 using a first sentence being the specified sentence as a search query to search an article including a sentence having a meaning similar to the connotations of the first sentence, and a display unit 603 for displaying information of the searched article as a related article to the first sentence, and when there are a plurality of related articles, the display unit 603 preferentially displays the related articles in descending order of difference relative to a first article being the article including the first sentence.

Abstract: A method, system and computer program product for providing a searching strategy in connection with answering a question in a message. A message containing a question is detected as being received from a sender. The steps performed by the recipient of the message to answer the question are monitored. Content is detected as being inserted in a reply message responding to the sender's message via a copy and paste operation. In response to detecting the copy and paste operation, the monitored steps utilized by the user in the user's searching strategy in arriving at an answer to the sender's question are stored in a database. The monitored steps are then attached to the reply message as tags or a link to the database to retrieve the stored monitored steps is inserted in the reply message thereby allowing the sender to replay the searching strategy used in answering the sender's question.

Abstract: The disclosure provides methods and systems that automatically detect and cluster related articles in a publication for archival, search, and other purposes. Text and images are recognized and scored in order to cluster related content into coherent and searchable articles.

Abstract: A device for automatically generating a real time accompaniment of input music data includes a music input that receives music data. A music analyzer analyzes received music data to obtain a music data description including one or more characteristics of the analyzed music data. A query generator generates a query to a music database including music patterns and associated metadata including one or more characteristics of the music patterns, the query being generated from the music data description and from an accompaniment description describing preferences of the real time accompaniment and/or music rules describing general rules of music. A query interface queries the music database using a generated query and receives a music pattern selected from the music database by use of the query. A music output outputs the received music pattern.

Abstract: The disclosure is directed to automatically generating a playlist of conversations having a specified moment. A moment can be occurrence of a specific event or a specific characteristic in a conversation, or any event that is of specific interest for an application for which the playlist is being generated. For example, a moment can include laughter, fast-talking, objections, response to questions, a discussion on a particular topic such as budget, behavior of a speaker, intent to buy, etc., in a conversation. A moment identification system analyzes each of the conversations to determine if one or more features of a conversation correspond to a specified moment, and includes those of the conversations in the playlist having one or more features that correspond to the specified moment. The playlist may include a portion of a conversation that has the specified moment rather than the entire conversation.

Abstract: A system for providing a directory service for generating network presence documents may include a computer processor and memory having instructions stored thereon. These may instruct the processor to parse registration information of a member to obtain a set of keywords. Using the set of keywords, the network maybe searched for information about the member, and registration information may be created based on the information. A trusted network presence document may be generated to include at least a first portion of the registration information as read only content. A link may be created between a profile document and the trusted network presence document. The profile document may include at least a second portion of the registration information as customizable content customizable by the member. The document may then be published on the network.

Abstract: Technologies are described herein for artificial intelligence content detection system. According to some examples, a pattern detector is used to analyze content generated as a result of a search query acted on by an Internet search engine. The system analyzes content from one or more of the search results against patterns stored in a pattern data store. The patterns, if matched against the content, indicate that the content has a certain likelihood of being generated by an artificial intelligence source. The search results are modified to indicate content generated by an artificial intelligence source.

Abstract: A user may submit a search query to a search engine. The search engine may process the search query and generate a set of results. Each of the items searched by the search engine may have been pre-assigned to a category in a category tree. Previous interactions by other users with the items after similar queries may have been recorded. The search engine may identify categories based on the distribution of the interacted—with results among the categories. The category tree may be analyzed at different levels, based on the entropy observed at each level. A level with low entropy may be chosen, and categories at that level used to constrain the query.