Abstract: Event time selection output techniques are described. In one or more implementations, one or more inputs are received, at one or more computing devices, that involve interaction associated with a particular one of a plurality of events via a user interface, in which the plurality of events result from a search of data, each of the plurality of events include the data that is associated with a respective point in time, and the one or more inputs specify a relative time in relation to the respective point in time of the particular event. A determination is made as to which of the plurality of events correspond to the specified relative time by the one or more computing devices and a result of the determination is output by the one or more computing devices for display in the user interface.

Abstract: A tokenization environment includes a first tokenization system in a first token domain and a second tokenization system in a second token domain. A token mapper accesses a first token from the first tokenization system and maps it to a second token from the second tokenization system. The first token can be a single-use or SLT token mapped to a clear text value within a single-use token table in the first tokenization system. The token mapper can identify the clear text value, and can query a multi-use token table in the second tokenization system with the clear text value to identify a multi-use token (the second token) mapped to the same clear text value. The token mapper can store the association between the first token and the second token in a token map.

Abstract: A method may include maintaining first data structure with records organized in a first hierarchy, and maintaining a second data structure with records organized in a second hierarchy. The method may also include receiving a first change request for a value stored in a first record. The first change request may be received from a parent in the first data structure of the first record. The method may additionally include changing the first value according to the first change request, and receiving a second change request for the value stored in the first record. The second change request may be received from a parent in the second data structure of the first record. The method may further include sending a notification to the parent in the first data structure that the parent in the second data structure is attempting to change the first record.

Abstract: Presented systems and methods can facilitate efficient and effective information storage management. A system may include a plurality of nodes, shared storage and a centralized lock manager. A storage management method can include: receiving an access request to information, performing a lock resolution process; and performing an access operation (e.g., read, information update, etc.). The information can be associated with a shared storage component. The lock resolution process can include participating in a lock management process that manages a physical lock (P-lock), wherein the lock management process utilizes transaction information associated with an implicit lock process and proceeds without communication overhead associated with explicit requests for a logical lock.

Abstract: Limiting the number of concurrent requests in a database system. Arranging requests to be handled by the database system in at least one queue. Defining a maximum value (SS) of concurrent requests corresponding to the at least one queue. Monitoring at least one queue utilization parameter corresponding to the at least one queue and calculating a performance value based on the at least one queue utilization parameter. Adapting the maximum value (SS) of concurrent requests of the at least one queue dynamically based on the performance value (PF) in order to improve system performance. Limiting the number of concurrent requests of the at least one queue dynamically based on the dynamically adapted maximum value (SS).

Abstract: A storage apparatus and data management method capable of utilizing storage resources effectively is proposed. A storage apparatus storing primary data and analysis data obtained based on the primary data as a result of the execution of specified analysis processing by an external computing system is designed so that metadata of the analysis data includes regeneratable attribute information indicating whether or not the corresponding analysis data can be regenerated by means of the analysis processing by the external computing system; and a control unit regularly or irregularly selects the analysis data, which satisfies a specified condition and can be regenerated, based on the metadata for each piece of the analysis data and deletes the selected analysis data from one or more storage devices.

Abstract: A append-only data storage system that stores sets of data blocks in extents that are located in storage devices. When an extent becomes full, the system changes the extent from an open state, wherein data can be appended to the extent, to a closed state, wherein data cannot be appended to the extent. This change involves performing a synchronization operation by: obtaining a list of data blocks in the extent from each storage device that has a copy of the extent; forming a union of the lists; looking up data blocks from the union in a database that maps data blocks to storage devices and extents to determine which data blocks belong in the extent; and if a copy of the extent is missing data blocks that belong in the extent, performing a remedial action before changing the extent from the open state to the closed state.

Abstract: A string of data is partitioned into a set of blocks. Each block is compressed based on a set of initial dictionaries and a set of Huffman trees. Each block is associated by a pointer with an initial dictionary in the set of initial dictionaries and a Huffman tree in the set of Huffman trees used to compress that block. A compressed string of data includes the set of initial dictionaries, the set of Huffman trees, and the compressed blocks and associated pointers.

Abstract: Various embodiments execute MapReduce jobs. In one embodiment, at least one MapReduce job is received from one or more user programs. At least one input file associated with the MapReduce job is divided into a plurality of data blocks each including a plurality of key-value pairs. A first unique name is associated with each of the data blocks. Each of a plurality of mapper nodes generates an intermediate dataset for at least one of the plurality of data blocks. A second unique name is associated with the intermediate dataset generated by each of the plurality of mapper nodes. The second unique name is based on at least one of the first unique name, a set of mapping operations performed on the at least one of the plurality of data blocks, and a number associated with a reducer node in a set of reducer nodes assigned to the intermediate dataset.

Abstract: A method, executed by a computer, for de-duplicating data includes receiving a dataset, pivoting the dataset along a set of columns that have a common domain to provide a pivoted dataset, de-duplicating the pivoted dataset to provide a de-duplicated dataset, and using the de-duplicated dataset. De-duplicating the pivoted dataset may include computing similarity scores for records that have different primary keys and merging records that have a similarity score that exceeds a selected threshold value. The method may include determining the set of columns having a common domain by referencing a business catalog and/or conducting a data classification operation on some or all of the columns of the dataset. The method may also include pivoting the dataset along another set of columns that have a different common domain. A computer system and computer program product corresponding to the method are also disclosed herein.

Abstract: Data from a database object are processed. Transaction information for a set of data of the database object is stored separate from the set of data in an allocated storage space, where the transaction information indicates visibility of the set of data to other transactions. A map structure is generated indicating storage of the set of data and the allocated storage space of the transaction information. The transaction information is altered in response to a transaction to the set of data to alter visibility of the set of data. Altering the transaction information is accomplished by providing updated transaction information within a new storage space in accordance with the transaction to the set of data and generating a descriptor for the transaction indicating an existing location of the set of data and the new storage space.

Abstract: Elements of a database object are removed. The database object is stored as a plurality of different object portions, where each object portion is associated with one or more versions of transaction identifiers stored separately from the database object. An oldest transaction identifier is determined for a transaction for which data portions of the database object remains visible. Each object portion is examined and object portions with a threshold amount of data to remove are determined based on a comparison of the transaction identifiers for those object portions and the oldest transaction identifier. Data from the database object are removed in response to a sufficient quantity of data is to be removed from object portions containing the threshold amount of data.

Abstract: A processor receives statistical information about a data set included in a column of a data table. The processor receives additional information about the data set that indicates a data format utilized by the data set and a type of information represented by the data set. The processor generates a data dictionary for compression of the data set based, at least in part, on the statistical information and the additional information. The data dictionary is created such that the data dictionary is capable of compressing data that is statistically predicted to be received at a future point.

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: The present disclosure relates generally to a data integration system that may provide techniques for capturing definitions from business entities and how the business entities are implemented in a set of tables. This enables the data integration system to transform a data flow defined using business entities into code that may be used to transform the underlying tables and columns. Additionally to generate tables, classes and APIs to provide persistence of and manipulation for the definitions of these business entities. Additionally to dynamically generate a GUI editor for an object model of arbitrary complexity while maintaining GUI usability. This reduces development time and supports editing of an arbitrary object model. A dynamically generated GUI may be generated from an object model definition that is received from a user and/or is derived from the user's code.

Abstract: A method of and system for managing a data set of a storage facility is disclosed. The data set may be a sequential-access data set. The method and system may include structuring the sequential-access data set to have a first group-of-records configured for adding a second group-of-records to the sequential-access data set. The method and system add a second group-of-records to the sequential-access data set. The method and system merge the second group-of-records with the first group-of-records in response to a triggering event. The method and system establish, in response to merging the second group-of-records with the first group-of-records, a marker configured to indicate the first and second group-of-records, as merged, is sorted.

Abstract: Systems are disclosed herein for improving analytic processing and processing for handling severe outliers in a dataset that cause predictive analytic processing to fail. In one embodiment, the system comprises one or more processors, a memory communicatively coupled to the one or more processors and to store logic, the logic, upon being executed by the one or more processors, transmits instructions to filter data for only a specified one or more variables, receives a first set of specified variables corresponding to a first external database, upon receiving the first set of specified variables, accessing a second set of specified variables corresponding to a second external database, accessing a third set of specified variables corresponding to a third external database, and performing predictive analytic processing using the first set of specified variables, the second set of specified variables and the third set of specified variables to generate a first insight.

Abstract: Example embodiments involve a system, computer-readable storage medium storing at least one program, and computer-implemented method for graphical modeling and editing of database query statements. The method may include accessing a database query statement, and generating an abstract syntax tree (AST) representing a syntactic structure of the database query statement. The method may further include generating a graphical model of the database query statement based on the AST, and rendering the graphical model.

Abstract: According to one embodiment of the present invention, a system maps one or more virtual relations to a table of a relational database management system. The system generates a structured query language (SQL) statement for the table from a SQL statement for a virtual relation by applying the mapping to one or more elements of the SQL statement for the virtual relation. Embodiments of the present invention further include a method and computer program product for mapping virtual relations to a table in substantially the same manners described above.

Abstract: A user performs a gesture with a hand-held or wearable device capable of sensing its own orientation. Orientation data, in the form of a sequence of rotation vectors, is collected throughout the duration of the gesture. To construct a trace representing the shape of the gesture and the direction of device motion, the orientation data is processed by a robotic chain model with four or fewer degrees of freedom, simulating a set of joints moved by the user to perform the gesture (e.g., a shoulder and an elbow). To classify the gesture, a trace is compared to contents of a training database including many different users' versions of the gesture and analyzed by a learning module such as support vector machine.

Abstract: A framework for handling a wrapper procedure is provided herein. In accordance with one aspect, a user definition of a wrapper procedure encapsulating a stored procedure is received. The framework retrieves metadata associated with the stored procedure. The framework may prepare at least one query statement to invoke the stored procedure using an input parameter identified from the metadata. The framework may further set at least one value of at least one identified input parameter based on the metadata, and execute the prepared query statement using the set value of the input parameter to generate at least one value for an output parameter.

Abstract: Method and system to assist a user in formulating a search query is described. The system may be configured to examine an input string submitted by a user via a search box and present suggestions in the form of structured queries, determine an entity and an entity type that corresponds to the input string and generate search suggestions in the form of complex structured queries. The generated query may be presented on a display device of a user.

Abstract: Techniques for optimizing a query with an extrema function are provided. In main memory, a data summary is maintained for a plurality of extents stored by at least one storage server. The data summary includes an extent minimum value and an extent maximum value for one or more columns. A storage server request is received, from a database server, based on a query with an extrema function applied to a particular column of a particular table. The data summaries for a set of relevant extents are processed by maintaining at least one global extrema value corresponding to the extrema function and, for each relevant extent of the set of relevant extents, determining whether to scan records of the relevant extent based on at least one of the global extrema value and an extent summary value of the data summary of the relevant extent.

Abstract: A system and method for rearranging search operators of a search query are disclosed. In some example embodiments, a first initial search query is received from a first user. The first initial search query comprises at least one search operator and at least one search term. A first rewritten search query is generated based on the first initial search query. The generating of the first rewritten search query comprises rewriting at least one optional search operator in the first initial search query using at least one required search operator and at least one exclusion search operator in response to a determination that the first initial search query comprises the at least one optional search operator and does not comprise any required search operators. A first set of search results is generated for the first rewritten search query and caused to be presented to the first user.

Abstract: Provided are data processing apparatus and methods for predicting a pattern frequency thereof. The data processing apparatus includes: a storage unit adapted to store a preset graph pattern, an occurrence frequency of the preset graph pattern, and information on actual data nodes corresponding to each node which belongs to the graph pattern; and a control unit adapted to compare the preset graph pattern with a graph pattern to be searched to perform a graph search, and when the preset graph pattern is not included in the graph to be searched, search for a node shared by two different preset graph patterns which are stored in the storage unit to perform the graph search. By this configuration, it is possible to predict a level of an intermediate result to optimize a graph query and effectively calculate sizes of various graphs patterns while making a capacity of a memory small.

Abstract: Embodiments presented herein provide techniques for managing data in manufacturing systems. One embodiment includes receiving a set of data from a plurality of devices operating in a manufacturing environment. A portion of the set of data is written by a data management application to both a relational database and a distributed storage cluster that includes a plurality of storage nodes in a distributed computing environment. Upon receiving a query to extract a subset of data from the set of data, the query is analyzed to determine attributes of the query. Based, in part on the analysis, one of the relational database and the distributed storage cluster is selected for processing the query.

Abstract: Method and system to assist a user in formulating a search query is described. The system may provide suggested entities, entity types, and relationship operators to a user and interactively build a complex structured query. Complex structured queries may include a combination of one or more entities and entity types, together with one or more relationship operators.

Abstract: An image of a physical book environment is obtained, and the image is associated with a user. The image is processed to detect one or more books in the physical book environment. A title of at least a first book in the physical book environment is determined based on information determined from processing the image. A content item is then recommended for the user to acquire based on the title of the first book.

Abstract: A system, method, and processor readable medium for processing data in a knowledge management system gathers information content and transmits a work request for the information content gathered. The information content may be registered with a K-map and assigned a unique document identifier. A work queue processes the work requests. The processed information may then be transmitted to another work queue for further processing. Further processing may include categorization, full-text indexing, metrics extraction or other process. Control messages may be transmitted to one or more users providing a status of the work request. The information may be analyzed and further indexed. A progress statistics report may be generated for each of the processes performed on the document. The progress statistics may be provided in a record. A shared access to a central data structure representing the metrics history and taxonomy may be provided for all work queues via a CORBA service.

Abstract: In each iteration of the process of mining association rules from transaction data by a cluster of computing systems, each mapper node in the cluster receives a split of the transaction data. Each mapper node scans the split to count an absolute support value of each candidate itemset for current search level(s), and passes the candidate itemsets and their support values to reducer nodes in the cluster. The number of reducer nodes will be determined adaptively based on the number of the candidate itemsets and the number of maximum available resource nodes in the cluster. Each reducer node combines the absolute support value of each candidate itemset, and finds frequent itemsets among them using a minimum support threshold. For each frequent itemset it finds, the reducer node creates association rule(s) satisfying a minimum confidence threshold, and exports all discovered frequent itemsets and association rules to a file system for storage.

Abstract: In each iteration of the process of mining association rules from transaction data by a cluster of computing systems, each mapper node in the cluster receives a split of the transaction data. Each mapper node scans the split to count an absolute support value of each candidate itemset for current search level(s), and passes the candidate itemsets and their support values to reducer nodes in the cluster. The number of reducer nodes will be determined adaptively based on the number of the candidate itemsets and the number of maximum available resource nodes in the cluster. Each reducer node combines the absolute support value of each candidate itemset, and finds frequent itemsets among them using a minimum support threshold. For each frequent itemset it finds, the reducer node creates association rule(s) satisfying a minimum confidence threshold, and exports all discovered frequent itemsets and association rules to a file system for storage.

Abstract: A correlation relationship between two metric time series is determined after removing the impact of outlying metric values (“outliers”) that are unimportant for analytical purposes. Each of the metric time series can represent values of different system metrics obtained by mining data gathered through the monitoring of cloud deployments. The outliers can be determined based on a maximum concentration interval of the data. Removing the impact of the outliers enhances the correlation of the metric time series and provides a better representation of the correlation relationship.

Abstract: A data processing method is executed by a computer to perform distributed processing of a first query and a second query. The data processing method includes calculating a first value indicating a dependency between a first partitioning key and a second partitioning key, the first partitioning key specifying a categorical attribute extracted from syntax of the first query, and the second partitioning key specifying a numerical attribute holding numerical values associated with the second query; generating a query group made of the first query and the second query based on the first value; and performing distributed processing of the first query and the second query based on the query group when executing the first query and the second query.

Abstract: Architecture that enables increased content presentation as part of the results where the results returned are insufficient to fill the results page being presented. An analysis component can be provided and configured to compute excess presentation space of a results area, where the results area comprises map results having content presented in association with a map. A content component presents additional content in the results area based on availability of the excess presentation space of the results area. The additional content and map results are limited to a maximum presentation space of the results area. The additional content includes portions of content individually relevant to corresponding map results and the portions of content are distributed in equivalent amounts of space among the map results.

Abstract: A system and method for capturing seasonality in a database system is disclosed herein. A database system may comprise a first database cluster H and a second database cluster L, with records being divided between the first database cluster H and the second database cluster L by likelihood of the record being accessed. Several criteria may be used to determine the likelihood of a record being accessed. For example, one may review access history to determine the activity for the record during various time periods, such as comparing access history for the record the same day one year ago, in an attempt to determine seasonality of the record. One may also review the newness of a record, such that the newness of a record is part of the criteria being reviewed when assigning record to a database cluster. Other embodiments are also disclosed herein.

Abstract: A system and method for using past information for future search results is disclosed. A database system may comprise a first database cluster H and a second database cluster L. Social media mentions are mapped to products in the database system. Thereafter, each record in the database system is tracked to determine if mentions on social media platforms are increasing or decreasing, using a social media popularity trend signal. The social media popularity trend signal is created by comparing social media mentions during one time period to social media mentions in another time period. Other embodiments are also disclosed herein.

Abstract: In an approach to contextual search of electronic records, one or more computer processors receive a first search request from a user. The one or more computer processors send a plurality of first search results associated with the first search request to the user. The one or more computer processors receive one or more selected policies from the user, based, at least in part, on the plurality of search results. Responsive to receiving the one or more selected policies, the one or more computer processors apply the one or more selected policies to the plurality of first search results. The one or more computer processors generate a second search request based, at least in part, on the one or more applied selected policies. The one or more computer processors send a plurality of second search results associated with the second search request to the user.

Abstract: Provided are techniques for interactive social media access to data systems. A social media gateway interface with adapters for each of multiple social media applications is provided. An event is published from a data system to at least one of the multiple social media applications. A social media bot is created to represent the data system. The social media bot and one of the adapters are used to enable the data system to interact with at least one of the multiple social media applications.

Abstract: An approach is provided dynamically prioritizing question requests based on extracted question data. In the approach, performed by an information handling system, a number of question requests to a question and answering (QA) system are received from a computer network, and a plurality of question priority parameters are identified, including one or more question topics and a plurality question context parameters, by performing natural language processing (NLP) analysis of each question request. The approach determines a target priority value for each question request based on the plurality of question priority parameters identified for said question request. By evaluating the target priority values for the plurality of question requests, processing of the question requests is prioritized, such as by applying an artificial intelligence (AI) learned models and rule-based logic at the information handling system to evaluate the target priority values for the plurality of question requests.

Abstract: A system and method is described for database split generation in a massively parallel or distributed database environment including a plurality of databases and a data warehouse layer providing data summarization and querying functionality. A database table accessor of the system obtains, from an associated client application, a query for data in a table of the data warehouse layer, wherein the query includes a user preference. The system obtains table data representative of properties of the table, and determines a splits generator in accordance with one or more of the user preference or the properties of the table. The system generates, by the selected splits generator, table splits dividing the user query into a plurality of query splits, and outputs the plurality of query splits to an associated plurality of mappers for execution by the associated plurality of mappers of each of the plurality of query splits against the table.

Abstract: The present disclosure relates generally to a data integration system that integrate an object based data integration tool, such a GUI-based data integration tools, with version control systems using a relational database repository for persistence. Examples of distributed version control systems include Git, Mercurial, and Bazaar, and examples of centralized version control systems include Subversion, CVS etc. in centralized or distributed environments.

Abstract: The present disclosure relates generally to a data integration system that integrate an object based data integration tool, such a GUI-based data integration tools, with version control systems using a relational database repository for persistence. Examples of distributed version control systems include Git, Mercurial, and Bazaar, and examples of centralized version control systems include Subversion, CVS etc. in centralized or distributed environments.

Abstract: Provided are a data processing apparatus and a data mapping method thereof. The data processing apparatus according to an present invention includes: a storage unit adapted to store relational data; a mapping unit adapted to store mapping information for mapping a schema of a relational database having the relational data stored therein to a node or an edge of a graph database; and a control unit adapted to convert the relational data into graph data by the mapping unit. By this configuration, it is possible to easily transfer the data of the relational database into the graph database, query the relational database using a query language used in a graph data model, and visualize the relational database in a graph represented by a node and an edge.

Abstract: Text is extracted from and information resource such as documents, emails, relational database tables and other digitized information sources. The extracted text is processed using a decomposition function to create. Nodes are a particular data structure that stores elemental units of information. The nodes can convey meaning because they relate a subject term or phrase to an attribute term or phrase. Removed from the node data structure, the node contents are or can become a text fragment which conveys meaning, i.e., a note. The notes generated from each digital resource are associated with the digital resource from which they are captured. The notes are then stored, organized and presented in several ways which facilitate knowledge acquisition and utilization by a user.

Abstract: Some examples of visualizing relationships in data sets can be implemented as a method by one or more computer systems. Dimension objects and multiple measure objects are displayed adjacent to a cause region and an effect region in a user interface. Each dimension object represents an input category associated with an input quantity that contributes to a total quantity in a data set. Each measure object represents an output category associated with an output quantity based on an input category. A dimension object and a measure object can be moved into the cause region and the effect region, respectively, in response to input. From the data set, an output quantity associated with the measure object is determined based on an input quantity associated with the dimension object from the total quantity in the data set. A result representing the output quantity is displayed in the measure object.

Abstract: Some embodiments disclose techniques for enabling cross visualization interaction between data corresponding to different visualizations. In an embodiment, a visual analyzer system is disclosed that is capable of generating and displaying a plurality of visualizations to a user via a graphical user interface. The visual analyzer system is capable of receiving a selection of a particular portion of a visualization from a user and correlating the selected portion with portions of data in other visualizations that are displayed to the user. In some embodiments, the visual analyzer system is capable of highlighting the correlated portions of the data and presenting the highlighted portions via the graphical user interface to a user.

Abstract: Provided are a method, a system, and a computer program for managing metadata for different distributed federated workspaces. A distributed metadata infrastructure is provided for supporting at least two different distributed federated workspaces. The distributed metadata infrastructure monitors the at least two different distributed federated workspaces to identify common metadata between the at least two different distributed federated workspaces. The distributed metadata infrastructure presents a consistent view of the common metadata.

Abstract: Some embodiments include a method of operating a load-balancing engine for a social networking system receiving real-time updates from mobile devices. The method can include receiving a location-based record update associated with a user account; writing the location-based record update separately to at least two different databases; forwarding the location-based record update to an analytic engine of a web service computer system; receiving a first derivative dataset computed based on the location-based record from the analytic engine; and writing the first derivative dataset separately to the at least two different databases.

Abstract: Provided are a method, a system, and a computer program for managing metadata for different distributed federated workspaces. A distributed metadata infrastructure is provided for supporting at least two different distributed federated workspaces. The distributed metadata infrastructure monitors the at least two different distributed federated workspaces to identify common metadata between the at least two different distributed federated workspaces. The distributed metadata infrastructure presents a consistent view of the common metadata.

Abstract: Techniques herein are for creating a database snapshot by creating a sparse database. A method involves receiving a creation request to create a sparse database. The creation request has an identity of a parent database. The creation request is processed to create a sparse database. The sparse database has the identity of the parent database. The sparse database does not contain data copied from the parent database. A write request to write data into the sparse database is received. The write request is processed by writing the data into the sparse database. The parent database does not receive the data.