Abstract: A query optimization system is described that, at runtime, optimizes the execution pipeline generated for a query. Based upon communications between nodes in the execution pipeline, the execution pipeline generated for a query is optimized by modifying the execution pipeline to create a modified execution pipeline. The modified execution pipeline is then executed to execute the query and results obtained for the query. The changes or modifications made to an execution pipeline may include changing the capabilities (e.g., changes to inputs and/or outputs of a node, changing the task(s) or function(s) performed by the node) of one or more nodes within the execution pipeline. The changes may include changing the position of one or more nodes within a directed acyclic graph representing the execution pipeline.

Abstract: Disclosed aspects include the database management system detecting that a first data storage medium includes a first set of data of a database. The first data storage medium has a first access-factor. The database management system detects that a second data storage medium includes a second set of data of the database. The second data storage medium has a second access-factor which differs from the first access-factor. Based on a data storage relationship, the database management system determines a query plan to access both the first set of data with respect to the first data storage medium and the second set of data with respect to the second data storage medium. The database management system establishes the query plan.

Abstract: Disclosed herein are systems and methods for implementing a RELATED command with a predictive query interface including means for generating indices from a dataset of columns and rows, the indices representing probabilistic relationships between the rows and the columns of the dataset; storing the indices within a database of a host organization; exposing the database of the host organization via a request interface; receiving, at the request interface, a query for the database specifying a RELATED command term and a specified column as a parameter for the RELATED command term; querying the database using the RELATED command term and passing the specified column to generate a predictive record set; and returning the predictive record set responsive to the query, the predictive record set having a plurality of elements therein, each of the returned elements including a column identifier and a confidence indicator for the specified column passed with the RELATED command term, wherein the confidence indicator in

Abstract: Disclosed is a system, method, and computer program product that allows multiple partition schemes to be applied to a single object. Each scheme represents the same set of partitions, but the schemes may have different partition methods, different partition keys, and/or different partition bounds.

Abstract: Mechanisms are provided to automatically identify source code relevant to a task among a set of disparate source code. The mechanisms search a plurality of working sets based on a given keyword associated with the task in order to identify a subset of working sets from a working set store that comprises the given keyword. The mechanisms identify source code files associated with the identified working sets. The mechanisms determine a score that depends on the occurrences of matched working sets for the given keyword within each identified source code file. For each directory or repository, the mechanisms determine an aggregated score for all the source code files comprised therein. The mechanisms present a listing of all identified source code files by directory and repository, where the listing illustrates a relevancy of repositories, directories, and source code files that comprise the given keyword associated with the task.

Abstract: Provided are techniques for progressive optimization for implicit CAST predicates. In response to receiving a query with an original predicate comparing a character value of a character data type to a literal value of a numeric data type, a number of iterations is set to a length of the character data type. For each of the number of iterations, prefix predicates are generated based on that iteration and processed to identify a qualified index key in an index. Once the iterations are completed, the character value and the literal value are normalized. The original predicate with the normalized character value and the normalized literal value is applied starting at the qualified index key identified in a last iteration to generate a result set for the query. The result set is returned.

Abstract: Application-aware database environments. A repository of previously received and registered database queries is maintained that includes at least corresponding metadata having information about an application generating the database queries. A subsequent database query and application metadata corresponding to the subsequent database query can be received. The repository to determine if the subsequent database query and application metadata match one of the previously received database queries and application metadata. A matching previously received database query is retrieved from the repository if a match is determined. The retrieved database query is executed.

Abstract: Techniques related to a database performance tuning framework are disclosed. The techniques include a system for improving performance of a database query, the system configured to generate one or more query execution time statistics relating to a database query operation performed by a database in response to a received query, store the query execution time statistics, determine the database query operation is slow based on the stored query execution time statistics, generate one or more database statistics based on the contents of the database, generate a suggested index using one or more of the generated database statistics, create the suggested index, determine another one or more query execution time statistics for the database query operation after creating the suggested index, and retain the suggested index based on a comparison of the stored query execution time statistics and the another query execution time statistics.

Abstract: Based on analysis of messages transmitted to a communication channel, a schema for a category of messages is generated. The schema indicates one or more data types and an ordering of instances of the data types. The schema is stored in a registry. A code artifact generated in accordance with the schema is provided to automate event processing tasks associated with the message category.

Abstract: A replicated key-value store is implemented using a “last-write-wins” consensus protocol. To improve throughput and latency in cross-data-center configurations, a system deploys a cross-cluster, learner-only member to a cluster of nodes (e.g., a data center). The cross-cluster, learner-only member submits key-values received at local leader members to remote clusters. Conflicts between the key-values and initial values at the remote clusters are resolved using a “last-write-wins” consensus protocol.

Abstract: A system identifies a first number of distinct values stored in a first field by a dataset of records. The system identifies a second number of distinct values stored in a second field by the dataset of records. The system creates a trie from values stored in a field by multiple records, the field corresponding to the first field or the second field, based on comparing the first number to the second number. The system associates a node in the trie with one of the multiple records, based on a value stored in the field by the record. The system identifies a branch sequence in the trie as a key for a prospective record, based on a prospective value stored in a corresponding field by the prospective record. The system uses the key for the prospective record to identify one of the multiple records that matches the prospective record.

Abstract: System creates three tries based on values stored in first three fields by records. System associates node in third trie with record, based on value stored in third field by record. System associates node with first dispersion measure, based on values stored in first field by records associated with node, and with second dispersion measure, based on values stored in second field by records associated with node. System identifies branch sequence in third trie as key for prospective record, based on value stored in third field by prospective record. System uses key to identify a subset of records that match prospective record. If a count of the subset exceeds threshold, the system identifies other branch sequence in first trie or second trie as other key for prospective record, based on first dispersion measure and second dispersion measure. System uses the key and the other key to identify at least one record that matches prospective record.

Abstract: A system operation management server computer (server), agent computer (agent), and related methods are disclosed to configure and manage the operation of systems in a system category. In some embodiments, the server and a plurality of agents are programmed to collaborate on exploring and improving the operation of systems in a system category through reinforcement learning.

Abstract: A system for query optimization by a federation engine is provided. When a data source supports a target feature of an expression of a query in the common query language, the system executes a converter for the data source to convert the target feature to the corresponding feature of the data source query language. The system then submits to the data source a query with the expression with the converted target feature so that the expression is evaluated at the data source and receives query results. When a data source does not support the target feature of the expression, the system submits to the data source a query without the expression and evaluates the expression on the query results returned by the data source. The system then combines the query results based on the evaluation of the expression as the query results of the query.

Abstract: A data management device, communication system and methods for tagging data in a data table and triggering automated action. A data management device receives from a first data provider one or more records of a data table, each record comprising a plurality of fields. The data table is associated with an account having one or more authorized users. The plurality of fields each has a value set by the first data provider. The data manger determines one or more tags for the one or more records in accordance with a plurality of autotagging rules. The autotagging rules include heuristic rules learned from user behavior and based on one or more of the plurality of fields of the record. The data manger appends the one or more records to include one or more tag fields corresponding to the one or more tags for the one or more records. The appended records are stored in a database. One or more automated actions may be triggered based on one or more tag fields of one or more of the plurality of records.

Abstract: In accordance with disclosed embodiments, there are provided systems, methods, and apparatuses for implementing conditional statement execution within a multi-tenant aware structured query language within a computing environment.

Abstract: In accordance with disclosed embodiments, there are provided systems, methods, and apparatuses for implementing a BY ORGID command term within a multi-tenant aware structured query language within a computing environment.

Abstract: A transformation job associated with a storage container is created. The transformation job creation includes turning specified comparison predicates into a composite filter. A transformation service is performed for the created transformation job. The transformation service performance includes enumerating content of the storage container and applying the composite filter to each found object. One or more objects that are determined to pass the composite filter are added to an object index of a primary storage.

Abstract: A learning system is provided to improve the speed of queries in a relational database management system. The learning system may include a query pipeline which utilizes a transform generator and a transform engine to transform uncommitted data corresponding to slow queries, and a query multiplexer to query primary keys of uncommitted data and committed data if the query has been improved by an existing transform.

Abstract: A method to search for at least one relationship pattern in a plurality of runtime artifacts is provided. The method may include detecting at least one data manipulation statement in the plurality of runtime artifacts. The method may also include extracting at least one relationship clause from the detected at least one data manipulation statement. The method may further include parsing the extracted at least one relationship clause. The method may include generating at least one normalized syntax tree based on the parsed at least one relationship clause. The method may also include performing a classification and a snippet discovery on the generated at least one normalized syntax tree.

Abstract: Disclosed herein are system, method, and computer program product embodiments for generating a native access plan from a query execution plan for dynamic entity calling. An embodiment operates by receiving the query execution plan comprising at least one call to an entity, the entity being implemented by a plurality of classes, and generating source code of a native access plan that implements the query execution plan. The source code of the native access plan includes instructions to translate a run-time call to the entity to a call to a corresponding implementation of the entity based on an identifier of the called implementation of the entity.

Abstract: A method includes setting, by an update processor, a write latch in a first data structure associated with an object. The first data structure is copied to a storage structure. A history tuple sequence number (TSN) of the first data structure is set to point to a TSN of the copied first data structure. The version identifier is set to point to a transaction identification for the object. Data portions are updated for the first data structure. The version identifier is read from the first data structure. It is determined whether the version identifier of the first data structure is visible for a transaction including isolation requirements. If version identifier of the first data structure is visible, the first data structure is accessed and it is determined whether the version identifier of the first data structure changed since starting the transaction.

Abstract: Methods and apparatus for configurable-capacity time-series tables are disclosed. A schedule of database table management operations, including at least an operation to change a throughput constraint associated with a table in response to a triggering event, is generated. The table is instantiated with an initial throughput constraint in accordance with the schedule. Work requests directed to the table are accepted based on the initial throughput constraint. The throughput constraint is modified in response to the triggering event. Subsequent work requests are accepted based on the modified throughput constraint.

Abstract: Methods and apparatus are provided for authenticated pattern matching and authenticated exact path queries on outsourced data by a third party server. A source of the outsourced data computes verification information for node and suffix accumulators and sends the data, accumulation values and suffix tree or label trie information to the server; and publishes its public key and the verification digests. The verification may comprise an accumulation tree (AT) or any other public key authentication scheme, such as digital signatures, Merkle Trees and publishing the accumulation values. The server receives the query from a client and the server computes an answer ? to the query and a verification proof that are provided to the client. The client then verifies the answer.

Abstract: Improvements in a reusable locating bracket for a recessed speaker or light bracket is disclosed. The bracket matches the hole diameter for a speaker of light. The bracket is installed prior to installation of drywall and is used as a trim guide. After installation of the drywall and cutting or trimming of the opening, the bracket is folded, bent, rotated or articulated where it can be removable through the trimmed opening in the drywall or sheet rock. The bracket has folding hinges for retaining side supports. The side supports are typically strips of cardboard, chip board or other material that provides a span from the bracket to studs, joists or beams. The folding hinges have teeth that grip the cardboard and can be opened to pull the cardboard through the retainer.

Abstract: A method of generating a recommended subset of items for a user of an electronic device, the method being executed at a server, the method comprises: acquiring user events associated with a plurality of users, the user events comprising indications of user queries; for each of the user queries, generating a ranked predicted items list that comprises at least some items from a set of potentially recommendable items, such that each particular item within the ranked predicted items list has an associated rank; for each item within a plurality of ranked predicted items lists, generating, by the server, an item score based on a totality of ranks associated therewith; generating the recommended subset of items from the set of potentially recommendable items by selecting at least one item within the plurality of ranked predicted items lists as the recommended subset of items based on the item scores.

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: In-database parallel analytics is disclosed. An example method includes receiving a function in a functional programming environment. The example method includes pushing operations for the function to a database layer for executing the operations. The example method also includes returning results of the operations to the functional programming environment.

Abstract: Method and system for securely storing data in a database comprising: receiving data to be stored. Dividing the data into a plurality of elements. Encrypting each element of the plurality of elements with an encryption function. Combining the encrypted elements to form a data attribute. Storing the data attribute in the database. Method and system for searching a database having encrypted data attributes comprising: receiving a search term. Encrypting the search term with an encryption function. Searching a database for records having data attributes matching the encrypted search term.

Abstract: A set of domain aware tokens generated for a given unstructured data set are obtained. A value is computed for the given unstructured data set as a function of the set of domain aware tokens and a given context of interest. The value represents a valuation of the unstructured data set for the given context of interest. A placement of the unstructured data set within a data storage environment may be determined based on the computed value.

Abstract: A system implements user permissions and user subscriptions with regard to content posted on one or more peer-to-peer knowledge sharing platforms (e.g., Community pages). Permissions are assigned to groups of users, rather than individual users. Permissions are determined by the groups of which the user in question is a member.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for evaluating indexing systems. Comparative tests are performed on two or more indexing systems. Each test uses one or more of: benchmarks, metrics, estimates of input data, desired index configuration, and performance constraints. A recommendation is automatically provided for an indexing system and an optimal configuration of the indexing system is also provided, based on an evaluation metrics from the tests.

Abstract: One or more table partitions may communicate with an index partition that may be a master of a replication group. A communications channel may exist between table partitions and the index partition. Upon splitting the index partition, communications between the table partitions and the index partition may be suspended. Upon completion of the split, communications may be reestablished between the table partitions and a partition, of the replication group of index partitions, designated to be a master following the split. Messages accumulated by the table partitions during the split may be sent to the index partition upon reestablishing communications.

Abstract: Improved integrated search techniques. A request for performance of a search for objects is received within a multi-tenant database environment having a plurality of tenants each having individual tenant information. A query is generated in response to the request. The query is specialized based on tenant information corresponding to a tenant from which the request originates. The tenant information is retrieved from the multi-tenant database environment. The query is performed on information stored in the multi-tenant database environment. Results of the query are presented to a user in a graphical user interface.

Abstract: A method for joining records from database tables is proposed. Join attributes are ordered into a sequence S0, and a scope C is initialized to empty. Tables including a join attribute A that is first in S0 are identified. A new sequence S? omits A from S0. Iteration through each identified table proceeds in join attribute A order. The iteration utilizes a tree index structure for each identified table where the index key includes all join attributes in the identified table in S0 order. For each matched value v of the join attribute located during the iterating, a new scope Cv is created by appending “A=v” to the scope C. If S? is empty, a tuple corresponding to the scope Cv is output. Otherwise, S0 is set to S? and for each scope Cv, C is set to Cv and the steps beginning with the identifying step are recursively invoked.

Abstract: One or more table partitions may communicate with one or more index partitions. A communications channel may be dedicated to each combination of table partition and index partition. The communications channel may act as a queue of messages corresponding to updates to data maintained in a table partition that have yet to be processed by a corresponding index partition. Upon splitting a table partition, communications channels may be duplicated including unprocessed messages. Connections between new table partitions and an index may be finalized upon the index's receipt of a message indicative of the new table partition.

Abstract: A method of using images and image metadata to locate one or more resources includes receiving a requests, each request requesting a location of a resource and including an image related to the resource, information specifying how the image and the resource are related, and metadata for the image. A queue is created for each of a plurality of responding systems, the queue ranked, and specifying the order in which the requests are to be displayed at respective responding systems. The generated queues and sent to their respective responding systems, and a response is received that specifies the location of a resource.

Abstract: In one embodiment, one or more computing systems may implement a social networking environment and may be operable to access, in a social graph associated with one or more computing systems of a social network environment, a user node representing a particular user, the user node connected to a plurality of attribute nodes. The social graph may comprise a plurality of object nodes in the social graph, each object node being connected to a plurality of attribute nodes. The systems may be further operable to calculate a match coefficient between the user node and an individual object node. The calculation may include operations to, for each attribute node in a set of all attribute nodes connected to both the user node and the object node, calculate a first coefficient between the user node and the attribute node.

Abstract: Provided are techniques for a Data-Partitioned Secondary Index (DPSI) partition level join. While using a Data-Partitioned Secondary Index (DPSI) to perform a join of an outer table and an inner table, a different task from multiple tasks is assigned to each partition of the inner table. With each task, a join is performed of the outer table and the assigned partition of the inner table using the DPSI to generate results. The results from each different task are merged.

Abstract: Disclosed herein is an enhanced device personalization that personalizes a user's experience with a device, e.g., a multi-user device. Rather than personalizing based on the specific user(s) that are using, an active entity, which represents a type of consumption, may be generated and used to make recommendations for personalizing an experience using the device. In a case of a multi-user device, each user's experience is personalized by determining an active entity for the user's experience and without knowledge of which user is using the device.

Abstract: Rolling back data on tape in a file system is provided. A management tape is prepared. The management tape has only index files recorded thereon. The index files contain information about start positions and lengths of corresponding data files recorded on normal tapes. The index files further contain identification information for the normal tapes. A first index file of the management tape is read. The first index file is related to a data file to be rolled back. The first index file is read out from the management tape mounted on a first tape drive. The data file to be rolled back is read out of a first normal tape. The first normal tape is identified based on information in the first index file. The first normal tape is mounted on a second tape drive.

Abstract: A method of executing a job in a computer system having a plurality of different allowed configurations comprises: receiving the job; identifying one or more representative samples of the job; executing the one or more representative samples in an experimental phase, the or each representative sample being executed with each different allowed configuration of the computer cluster; collecting execution data including speed of execution and energy used in each configuration during execution of the one or more representative samples and selecting a suitable configuration for the job taking speed of execution and energy use into account; and executing the remainder of the job in a completion phase with the suitable configuration.

Abstract: A method includes: extracting a partial character string including a reserved word and a character string immediately previous or subsequent to the reserved word from each of a plurality of pieces of target data, the plurality of pieces of target data conforming to a first pattern character string including the reserved word defined by a protocol; detecting target data including the partial character string among the plurality of pieces of target data; specifying a first partial character string from the extracted partial character string based on the detected target data; and creating, by a processor, a second pattern character string for classifying the plurality of pieces of target data based on the first pattern character string and the first partial character string.

Abstract: Techniques are described for providing visual bundlers that group and represent specified data subsets of very large datasets in a manner that is expressive and intuitive for a user, and which provide a dynamic, configurable visualization that may be leveraged by the user to search, aggregate, or otherwise interact with the data of a very large dataset. By nesting such visual bundlers, a geometric equivalent of a dynamically-generated search tree is realized, in which a structure for executing a search for a desired data element is not required to be fixed or otherwise predefined. Consequently, during a runtime of providing related visualizations, multiple alternative search trees may be created for the same underlying content, with minimal effort, and in a manner that is highly intuitive and useful for the user.

Abstract: A vendor is authenticated for use of a retailer's data warehouse and limited access rights are assigned to the vendor for access. The vendor accesses a graphical user interface (GUI) to select an available analysis module for execution against the data warehouse. Schemas are presented in the GUI based on the access rights, and specific schema selections are made by the vendor. The analysis module is then configured and executed against the data warehouse and filtered results are presented to the vendor; the results filtered based on the access rights assigned to the vendor.

Abstract: Event data collected for a given event is obtained, wherein the event data comprises a plurality of time series data sets. The plurality of time series data sets are divided into a set of time windows (e.g., epochs). Data in the plurality of time series data sets occurring within each time window of the set of time windows is aligned. A metric is computed for each aligned time window, wherein the metric for each aligned time window represents a measure of at least one of completeness and support attributable to data in the aligned time window. Data is pruned from the set of event data for one or more of the set of time windows based on the computed metrics. The pruned event data is provided to a data analytics process which is configured to further process the pruned event data.

Abstract: A hybrid database table is stored as both a row and a column store. One or more techniques may be employed alone or in combination to enhance performance of the hybrid table by regulating access to, and/or the size of, the processing-intensive column store data. For example during an insert operation, the column store data may be searched for a uniqueness violation only after certain filtering and/or boundary conditions have been considered. In another technique, a hybrid table manager may control movement of data to the column store based upon considerations such as frequency of access, or underlying business logic. In still another technique, querying of the hybrid table may result in a search of the column store data only after an initial search of row store data fails to return a result.

Abstract: System, method, and computer program product to modify a received query, the received query including a first predicate specifying a comparison operator and a second predicate specifying an IS NULL operator, by replacing the comparison operator of the first predicate with an extended comparison operator, and removing the IS NULL operator from the received query, the extended comparison operator configured to support searching of NULL values in a database management system (DBMS), wherein the extended comparison operator is configured to return rows having column data matching a value predefined to represent NULL values.

Abstract: Methods and systems for securely storing data in a database are described herein. According to an aspect, a technique may include receiving data to be stored, dividing the data into a plurality of elements, encrypting each element of the plurality of elements with an encryption function, combining the encrypted elements to form a data attribute, and storing the data attribute in the database. According to another aspect, a technique for searching a database having encrypted data attributes may include receiving a search term, encrypting the search term with an encryption function, and searching a database for records having data attributes matching the encrypted search term.

Abstract: System, method, and computer program product to modify a received query, the received query including a first predicate specifying a comparison operator and a second predicate specifying an IS NULL operator, by replacing the comparison operator of the first predicate with an extended comparison operator, and removing the IS NULL operator from the received query, the extended comparison operator configured to support searching of NULL values in a database management system (DBMS), wherein the extended comparison operator is configured to return rows having column data matching a value predefined to represent NULL values.