Abstract: Systems, methods, and computer-readable storage media are described for processing data change requests. In one exemplary embodiment, a computer-implemented method receives one or more requests in a software production environment for one or more data changes to data from a requestor. The method executes the request(s) in a rollback mode. The method generates a snapshot of the executed request(s). The method also transmits the snapshot to an approver. In response to an approval of the snapshot from the approver, the method also executes the request(s) in a commit mode.

Abstract: A system includes an interface and a processor. The interface is configured to receive a table indication of a data table and to receive a transaction indication to perform a transaction. The processor is configured to determine a current position N in a transaction log; determine a current state of the metadata; determine a read set associated with a transaction; attempt to write an update to the transaction log associated with a next position N+1; in response to a transaction determination that a simultaneous transaction associated with the next position N+1 already exists, determine a set of updated files; and in response to a determination that there is not an overlap between the read set associated with the current transaction and the set of updated files associated with the simultaneous transaction, attempt to write the update to the transaction to the transaction log associated with a further position N+2.

Abstract: A method and apparatus for maintaining file system consistency in a distributed system using version vectors is presented. A method generally includes comparing incarnation and transaction identifiers of a current version vector associated with a file with incarnation and transaction identifiers of a last completed version vector associated with the file. Upon determining that a current version vector reflects operations on the file that are either earlier than or the same as the identifiers in the last completed version vector, the node performing one or more file system operations on the file.

Abstract: Embodiments of the present disclosure provide for trace and span sampling and analysis for instrumented software. Each span may be annotated with one or more tags that provide context about an executed task, such as a user instrumenting the software, a document involved in a request, an infrastructure element used in servicing a request, etc. A sampler may perform tail-based sampling of traces comprising spans. The sampler may select a portion of the traces having selected features and send them to an analyzer. The analyzer may receive the selected traces and determine whether the selected traces are indicative of configuration problems for the instrumented software. An alert may be generated based on identified configuration problems.

Abstract: Embodiments of the present technology provide systems, methods, and computer storage media for facilitating anomaly detection. In some embodiments, a prediction model is generated using a training data set. The prediction model is used to predict an expected value for a latest (current) timestamp, which is used to determine that the incoming observed data value is an anomaly. Based on the incoming observed data value determined to be the anomaly or not, a corrected data value is generated to be included in the training data set. Thereafter, the training data set having the corrected data value is used to update the prediction model for use in determining whether a subsequent observed data value is anomalous. Such a process may be performed in an iterative manner to maintain optimized training data and prediction model.

Abstract: A system and method for global data de-duplication in a cloud storage environment utilizing a plurality of data centers is provided. Each cloud storage gateway appliance divides a data stream into a plurality of data objects and generates a content-based hash value as a key for each data object. An IMMUTABLE PUT operation is utilized to store the data object at the associated key within the cloud.

Abstract: A method for computer estimations based on statistical tree structures involves obtaining a statistical tree structure for reference elements. The statistical tree structure includes leaf nodes segmenting a statistic for a data label according to data features in the reference elements, and intermediate nodes connecting a first node to the leaf nodes. Each of the first node and the intermediate nodes provide a branching based on one of the data features. The method further includes obtaining target data, including values for the data features, and a value for the data label. The method also includes selecting the first node, associated with a first data feature, traversing the statistical tree structure to a leaf node by matching the values of the data features to the branching of the intermediate nodes, and assessing the value for the data label in the target data based on the statistic associated with the leaf node.

Abstract: Various embodiments provide methods, systems, apparatus, computer program products, and/or the like for managing, ingesting, monitoring, updating, and/or extracting/retrieving information/data associated with an electronic record (ER) stored in an ER data store and/or accessing information/data from the ER data store, wherein the ERs are generated, updated/modified, and/or accessed via a graph-based domain ontology.

Abstract: A collaboration tool includes a collaborative database consistency system that includes a host service to receive user input and, in particular, a selection of data to monitor. The host service is coupled to an upstream dependency traverser service configured to generate a dependency tree identifying all tables upon which the selected data to monitor depends, at least in part. A unit test service receives the dependency tree as input and automatically generates suitable pass/fail tests for each table identified in the dependency tree. Thereafter, the unit test service can execute each generated pass/fail test to determine whether the data to monitor is valid.

Abstract: A computer-implemented method, medium, and system are disclosed. In one computer-implemented method, an invocation request sent by an initiator is received by a blockchain node in a blockchain network. The invocation request is associated with invocation of a smart contract in the blockchain network. The smart contract includes contract code, data, and pre-update metadata. A pre-update data structure described by the pre-update metadata is parsed by the blockchain node and by execution of the contract code. The pre-update data structure is associated with the data comprised in the smart contract. Following parsing of the pre-update data structure, the pre-update data structure is represented by the blockchain node using a computer programming language. The pre-update data structure specified by the computer programming language is sent by the blockchain node to the initiator.

Abstract: A system and a method for adjusting an order of parsing rules for routing incoming security logs to log normalization routines that are used for processing large volumes of security incident event data are provided. The method includes: sequentially applying, in a first order, a set of parsing rules to each of a first set of logs to determine destinations that correspond to log normalization routines for reformatting into a common format; determining whether an efficiency of the application of the parsing rules would be increased by reordering into a second order; and reordering the set of parsing rules into the second order based on the determination, so that the parsing rules will be sequentially applied to the next set of logs based on the second order thereof. The efficiency determination is based on volumes and complexities of various log types.

Abstract: Methods and apparatus are provided to fully process an incomplete transaction which is incomplete in either a source database or a target database. Transactions are completed within a transaction processing system that includes a non-static application. The non-static application has a transaction mix that varies over its life cycle. The transactions are replicated from the source database to the target database by a replication engine. Each transaction is a series of one or more transaction steps or operations. A plurality of transaction pattern tables are provided, and one of the transaction pattern tables are selected for use in the process depending upon a time of day or a transaction mix.

Abstract: A computer method and system for providing information results in response to a natural language information request. The system and method include receiving a natural language information request from a user and compiling a computer executable query from the natural language information request from a user wherein the query is formatted to extract data from one or more computer databases. The query is then presented to the user prior to execution of the query so as to enable the user to change the query prior to its execution. The query is then executed to extract data from one or more computer databases whereby extracted data is presented to the user in a certain presentation format.

Abstract: A computer retrieves data from a database. The computer retrieves a Machine Learning (ML) model trained to generate database queries. The computer applies the ML model to generate a primary database query based, at least in part, on a user inquiry available to the computer. The computer retrieves the primary database query, an initial set of data from a database available to the computer. The computer, in response to retrieving the initial set of data, receives feedback assessing the initial set of data. The computer, in response to receiving the feedback, applies a Natural Language Processing (NLP) model to identify query adjustment content within the feedback. The computer revises the primary database query based, at least in part, on the model adjustment content, to generate a secondary database query. The computer retrieves using the secondary database query, a secondary set of data from the database.

Abstract: According to one embodiment, a data analysis apparatus includes a processor. The processor acquires, for a plurality of products as analysis targets, manufacturing data including at least one manufacturing condition for each product. The processor calculates, based on a bias of state data representing a degree that the product is in a specific state in at least one item that can be taken concerning one manufacturing condition extracted from the manufacturing data, an index value representing a degree that a cause of the specific state of the product is the manufacturing condition.

Abstract: Described herein are techniques, devices, and systems for database management using sound-based identifiers. The sound-based identifiers can be encoded based on text-based identifiers input into one or more databases. The sound-based identifiers can be preprocessed and encoded by encoding the text-based identifiers with a double metaphone algorithm. First sound-based identifiers can be sorted in a cluster associated with a node of a hybrid prefix tree list, based on a longest common prefix of the group. The first sound-based identifiers can be re-encoded as second sound-based identifiers and organized into sub-clusters associated with nodes, based on characters of the second sound-based identifiers positioned after characters associated with the clusters. The re-encoded sound-based identifiers can be determined based on metadata. A query can be received and utilized to identify a re-encoded sound-based identifier.

Abstract: Methods, systems, and computer-readable media are disclosed herein that create inter-communication capabilities between servers that use technologically diverse and/or incompatible operating systems. Herein, a driver is leveraged to create these inter-communication capabilities by inserting a source server generated message into a table at the target server. The target server automatically executes code in the message and generates results therefrom. The target serer communicates the results to the source server, where the source server again leverages the driver to handle the results.

Abstract: One embodiment of the present invention sets forth a technique for optimizing data in a dataset. The technique includes determining, based on one or more attributes of a dataset, an optimization that is associated with at least one of a file encoding, a file size, and a sort column. The technique also includes identifying a plurality of candidate configurations associated with the dataset and corresponding to the optimization, and for each candidate configuration, generating a corresponding set of evaluation metrics associated with the first optimization. The technique further includes determining, based on the sets of evaluation metrics corresponding to the plurality of candidate configurations, a set of configurations in the plurality of candidate configurations to be applied to the dataset. Finally, the technique includes modifying the dataset based on the set of configurations.

Abstract: Machine-learning-based, adaptive updating of quantitative data in a database system is provided, which includes training one or more machine learning models to facilitate adaptively updating quantitative data in the database system, and ascertaining an update urgency index for updating the quantitative data for one or more data structures of the database system. The update urgency index is representative of an urgency for updating the quantitative data for the data structure(s) and is based, at least in part, on real-time query metrics. The machine learning model(s) is used to adaptively update the quantitative data, where the adaptively updating is based, at least in part, on the ascertained update urgency index. Processing of a database query is optimized in the database system using the adaptively updated quantitative data.

Abstract: Query content-based data generation includes obtaining a query having an outer query and one or more subqueries, converting predicates of a subquery to be predicates of the outer query, and thereby obtain a transformed query, generate from the transformed query a query block having a list of predicate(s) selected from the transformed query, obtaining column information based on the list of predicate(s) and using the column information to select data for a dataset such that data records from the dataset are produced as results to executing the obtained query against the dataset.

Abstract: Technologies described reduce the amount of time between requesting content and receiving the requested content. In some embodiments, a client provides a search query. A search result page is generated and, prior to returning the search result page to the client, some or all of the search results are asynchronously pre-fetched and cached. The search query can include custom parameters that are also included in the pre-fetch requests. Web addresses in the search results page can be modified to indicate whether a prefetch operation was initiated. Once a user activates one of the search results, the responding web server uses the cached data while generating a response.

Abstract: A system executes a set of database operations and determines counts of instances that each key is specified for a corresponding column by any database operations on a database table. The system identifies each key which is associated with any determined count that satisfies a threshold as a corresponding frequently accessed key. The system creates an optimized index for each column which stores any frequently accessed key. The system inserts each frequently accessed key into a corresponding optimized index. The system receives a database operation that specifies a specific key for a specific column in the database table. If any optimized index matches the specific column and stores any frequently accessed key that matches the specific key, then the system references a matching frequently accessed key in a matching optimized index to access a record, which is associated with the specific column and the specific key, via the database table.

Abstract: Methods and apparatus for updating a denormalized database object after updating, deleting, or inserting a record in a source database object are described. A first operation on a source database object that involves a record of the source database object being updated, deleted, or inserted is performed. A first part of a corresponding second operation involving a respective record of the denormalized database object being updated, deleted, or inserted is performed. A query result that references an aggregate field of a set of records in the denormalized database object is altered. The altering includes an aggregation operation using values in the query result being performed and altering that part of the query result that includes the aggregate field of the set of records. A second part is optionally performed to complete the corresponding second operation and update the denormalized database object.

Abstract: A method for workload balancing is implemented in a computer system including a primary database system and a secondary database system, the secondary database system being configured as a backup system for the primary database system. The method includes compiling a query received from a client application. The query indicates one or more source tables have corresponding replicate tables. The compiling comprises replace the one or more source tables with the corresponding replicate tables. The method can generate a query execution plan based on the compiled query, determine a per-table result lag based on minimum commit times of the corresponding replicate tables, and compare the per-table result lag with a predefined threshold. Responsive to a determination that the per-table result lag exceeds the predefined threshold, the method can recompile the query by falling back to the one or more source tables from the corresponding replicate tables.

Abstract: Features are disclosed for dynamically generating a proxy representation of characteristics associated with a private data set. A computing device can receive a private data set including private or proprietary information. The compute device can determine one or more characteristics that are associated with the private data set. The computing device can further receive a public data library that includes characteristics that are publicly available. The computing device may generate a proxy representation based on the public data library and the proxy representation may include one or more characteristics that represent the private data set. The proxy representation may be provided to one or more entities who are unauthorized to access the private data set. In some embodiments, the private data set may correspond to an exchange traded fund and the characteristics may correspond to risk factors associated with the exchange traded fund.

Abstract: An improved hash table structure compatible with in-memory processing for increasing cache efficiency during hash join processing of a small and large table in a relational database system. The hash table, residing in processor memory, includes a first partition containing a join condition column providing best selectivity for joining the small table with the large table, at least one additional partition containing additional join condition columns for joining the small table with the large table; and an array of hash values, the array of hash values providing an index into the hash table partitions.

Abstract: Techniques are disclosed relating to maintaining a cache usable to locate data stored in a data structure. A computer system, in various embodiments, maintains a data structure having a plurality of levels that store files for a database. The files may include one or more records that each have a key and corresponding data. The computer system may also maintain a cache for the database whose entries store, for a key, an indication of a location of a corresponding record in a file of the data structure. In some embodiments, the computer system receives a request to access a particular record stored in the data structure where the request specifies a key usable to locate the particular record. The computer system may retrieve, from the cache via the key, a particular indication of a location of the particular record and may use the particular indication to access the particular record.

Abstract: A database system is operable to generate a plurality of segment row data from a plurality of records received for storage. The plurality of segment row data is stored via a first storage mechanism corresponding to a first durability level. Storage of the plurality of segment row data via a second storage mechanism corresponding to a second durability level that is more durable than the first durability level is facilitated. Execution of a plurality of queries against the dataset is facilitated by accessing the plurality of segment row data via the first storage mechanism. A failure of storage of one of the plurality of segment row data via the first storage mechanism is detected. The one of the plurality of segment row data is recovered for storage via the first storage mechanism based on accessing at least one of the plurality of segment row data via the second storage mechanism.

Abstract: The presently disclosed systems and methods receive a search request for information provided in a first field of a first index of a non-relational database cluster and a second field of a second index of the non-relational database cluster. A first database query is performed on the first index based on the first field, and the first database query results may be stored in volatile memory. A second database query is performed on the second index based on the second field, and the second database query results may be stored in the volatile memory. A joined dataset of the first database query results and the second database query results having a joined field corresponding to the first field and the second field is then be generated. The joined dataset is displayed in a user interface.

Abstract: Region summaries of database data are stored in persistent memory of a storage cell. Because the region summaries are stored in persistent memory, when a storage cell is powered off and data in volatile memory is not retained, region summaries are nevertheless preserved in persistent memory. When the storage cell comes online, the region summaries already exist and may be used without the delay attendant to regenerating the region summaries stored in volatile memory.

Abstract: Embodiments of the present disclosure are directed a distributed storage system that supports query data. One embodiment provides, at a front-end node, a method comprising receiving a query regarding data stored in an object, obtaining information identifying data nodes at which blocks of the object are stored, sending, to a first data node, a query regarding data in a first block, and receiving results for the query regarding the data in the first block comprising an incomplete record. The method further comprises sending, to a second data node, a query regarding data in a second block comprising the incomplete record, the second block being stored on a different physical device than the first block, and receiving results for the query regarding the data in the second block. The method further comprises outputting the results for the queries regarding the data in the first block and the data in the second block.

Abstract: A method for execution by a query processing system includes receiving a query expression that includes a call to a computing window function. The computing window function is executed in accordance with execution of the query expression against a database. Execution of the query expression includes accessing an ordered set of rows of the database indicated in the call to the computing window function, and applying a recursive definition indicated in the call to the computing window function to each row in the ordered set of rows to generate output for each row in the ordered set of rows. A query resultant for the query expression is generated based on the output for each row in the ordered set of rows.

Abstract: Methods and systems for data management are described, particularly for processing global queries. Each global query includes a user-defined query constraint value, such as laxity or query response time limit. The query receiving node maintains a copy of the previously updated data from all of its children node. The query receiving node first searches for the requested query data in its local data storage to minimize children node query. If any portion of the requested data in the local data storage fails to meet the query constraint value, then the child node from which the data came from is tasked with recursively executing the global query.

Abstract: Systems and methods for lossy data compression using key artifacts and dynamically generated cycles are described, including receiving a data stream of relational data; detecting an artifact in the data stream associated with a critical point in the relational data; analyzing, by a processing device, the artifact to determine a set of artifacts associated with a complex event where the critical point is an endpoint of the complex event; calculating one or more cycle metrics based on the set of artifacts; generating a data structure associated with the complex event and cycle metrics; providing the data structure for marking a display of the relational data with the complex event based on the cycle metrics.

Abstract: Techniques for fully or comprehensively resolving relationships within and among different data sets are disclosed. The techniques evaluate identification tags of respective transaction records to resolve transitive relationships between and among the identification tags, which vary across the different data sets. Based on this resolving, the techniques comprehensively sort the identification tags into mutually exclusive sets of related identification tags. Additionally, the techniques resolve and sort identification tags that are transitively unrelated to every other identification tag. At least these features enable comprehensive identification and intelligent sorting of related/unrelated transaction records, provide enhanced transaction tracking and security, more efficient and accurate transaction record storage (and in particular, of composite records), and enhanced tracking accuracy of accounts or types of units) as compared to known techniques.

Abstract: Methods and systems disclosed herein describe customizing searching. Search queries may be customized according to a user's preferences. A user may emphasize or indicate that additional weight should be given to one or more terms in a search query. Terms that are weighted higher may have a larger impact on the results that are returned in response to the search query. In addition to changing the terms in a search query, a user may provide a weight for each term. Each term in a search query may be weighted to varying degrees, giving a user more control over the results that are returned. The weights may be used with machine learning techniques to generate a vector representation of a search query. The vector representation of the search query may be compared with vector representations of search objects to determine results that match the search query.

Abstract: A computing system can receive event data corresponding to a user's experience with a network service. Based on the event data, the system can generate a set of representations that correspond to the user's experience with the network service. The representations may be analyzed and/or filtered by an artificial intelligence model executing on the computing system, which can predict negative experiences of users at future time intervals. Based on these predictions, the computing system can implement a set of corrective actions to steer the user experience to a more positive path.

Abstract: A method of presenting computer-generated search result information can include receiving a search request from a client computer; identifying a plurality of search results responsive to the search request; ranking the plurality of search results using content in one or more web notebooks; and providing the ranked plurality of search results for presentation in the client computer. Using the content can include determining whether at least one of a title, a heading, clipped content, metadata or a user-annotation in at least one web notebook relates to the search request and, if so, increasing a ranking of at least one search result referenced by the at least one web notebook.

Abstract: A method and system for intelligently organizing one or more groups of relevant files may include retrieving a user data signal including user-specific data, analyzing the user data signal to identify a parameter relating to file relevance, identifying one or more relevant files in a storage medium based on the parameter at least one of a user category property, a lifecycle stage property, a relevant activity property, or an activity level property of one or more files in the storage medium, organizing the one or more relevant file into the one or more groups of relevant files, and providing for display data relating to the one or more groups of relevant files.

Abstract: In one implementation, a method is provided that receives multiple potential listings associated with an entity. A listing is selected from the multiple listings and is designated as a representative listing of the entity. A first request is transmitted to synchronize the representative listing with the entity. Responsive to receiving an indication that a synchronization of the first listing and a web address corresponding with the entity is complete, transmitting to the provider system using an application programming interface, a second request to suppress a second listing of the plurality of potential listings as a duplicate listing. A communication is received from the provider system via the application programming interface that confirms that the second request to suppress the second listing from a search result generated by the provider system is accepted.

Abstract: A system and method are provided for automatically proofing the patent specification of a granted patent issued on a patent application. The method comprises the steps of scanning amendments made to the patent application during prosecution; assembling the most recent claims, based on the scanned amendments, to create a test claim set of the claims; comparing the test claim set to the claims of the issued patent as published; and identifying any differences between the compared sets of claims and communicating the differences to a user.

Abstract: A method for personalizing reviews for a user on a social network, comprising the steps of: receiving from at least two or more users a rating and a recommendation for a reviewable item, wherein the rating is numerical value in a rating scale, and wherein a recommendation is a binary endorsement; receiving a request from a user to view the ratings and recommendations for one or more reviewable items; determining a combined rating and an combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items; and displaying, by a user interface, the combined rating and combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items.

Abstract: Disclosed are systems and methods for data mining a plurality of records to identify one or more patterns. A list of frequent items is generated using the records of a certain subpopulation in a dataset of the records. By scanning through the dataset, a prefix tree is generated based on the list of frequent items. Each node in the prefix tree includes an accumulator which maintains separate counts of records from the subpopulation matching the respective node and of records from the plurality of records matching the respective node. One or more population-normalized frequent patterns associated with the plurality of records are extracted based on a traversal of the prefix tree.

Abstract: Embodiments as disclosed may provide a search operator that addresses the problem of query construction for finding objects that include some number (N) of a set of terms (M). Moreover, embodiments as disclosed herein may efficiently implement the searches specified by such subset operators using a subset process that combines results from a set of term processes where only one term process may be needed for each search term (or search term variant).

Abstract: A system and method for processing data wherein one or more user selections of source data and an input defining one or more operations to be performed on the selected source data are received to generate processed data for display as a chart; the source data is retrieved from at least one data source, the source data is processed according to the defined one or more operations to generate processed data for output for display as a chart, the chart is stored as data defining the one or more operations and data identifying the source data operated on, a further user selection is received to redisplay the chart; retrieving the source data from the at least one data source; and the source data is processed according to the defined one or more operations to generate the processed data for output for redisplay as the chart.

Abstract: A method for performing a parallelized heapsort operation may include updating, by a first worker thread, a first buffer while a second worker thread updates a second buffer in parallel. The first worker thread may update the first buffer by adding, to the first buffer, elements from a first partition of a dataset. The second worker thread may update the second buffer by adding, to the second buffer, elements from a second partition of the dataset. Upon the first buffer reaching a threshold size, the first worker thread may acquire a lock for the first worker thread to update a heap based on the first buffer while the second worker thread is prevented from updating the heap based on the second buffer. A result of a top k query comprising a k quantity of smallest elements from the dataset may be generated based on the heap.

Abstract: The subject technology receives by a database system, raw input data from a source table provided by an external environment, the source table comprising multiple rows and multiple columns, the raw input data comprising values in a first format, the values comprising input features corresponding to datasets included in the raw input data for machine learning models, the external environment comprising an external system from the database system and is accessed by different users. The subject technology generates cell data for a second table based on the values from the source table. The subject technology performs a database operation to generate the second table including table metadata, column metadata, and the generated cell data.

Abstract: Methods, systems, and computer-readable media for a cloud-based database for spatial data lifecycle management. A spatial database receives elements of spatial data from a plurality of clients of the distributed spatial database. An individual element of the spatial data comprises one or more location values or one or more spatial objects. The spatial database stores the plurality of elements of spatial data using a plurality of storage resources. The spatial database receives a query. The spatial database determines one or more elements of spatial data matching the query from the plurality of elements of spatial data that were stored using the plurality of storage resources.

Abstract: A method and apparatus for optimizing a query in a relational database management system (RDBMS) when a predicate on a data column in the query has a correlation to a partitioning attribute of a partitioning column in data retrieved from a cloud-based store, wherein the optimizing uses the correlation between the data column in the query to the partitioning column in the data retrieved from the cloud-based store for data elimination when processing the query. The correlation is defined in a formula or lookup data structure that maps or range-maps from the data column to the partitioning column.

Abstract: Various techniques are disclosed for computerized tools to discover, form, and analyze dataset interrelations among a system of networked collaborative datasets including a repository configured to receive and store a dataset, and a dataset consolidation system configured to receive data to form a first input to initiate creation of a dataset based on a set of data, to activate a programmatic interface, to transform the set of data from a first format to an atomized format to form an atomized dataset, to monitor the creation of the dataset, to present data representing a status of a portion of the creation of the dataset, to calculate automatically dataset attributes of the linked dataset, to generate a plurality of sub-queries, and to retrieve data representing query results from the at least one of the different data repositories.