Abstract: In an example embodiment, position bias and other types of bias may be compensated for by using two-phase training of a machine-learned model. In a first phase, the machine-learned model is trained using non-randomized training data. Since certain types of machine-learned models, such as those involving deep learning (e.g., neural networks) require a lot of training data, this allows the bulk of the training to be devoted to training using non-randomized training data. However, since this non-randomized training data may be biased, a second training phase is then used to revise the machine-learned model based on randomized training data to remove the bias from the machine-learned model. Since this randomized training data may be less plentiful, this allows the deep learning machine-learned model to be trained to operate in an unbiased manner without the need to generate additional randomized training data.

Abstract: A method of matching records from a plurality of data sources having variation between them in matching quality of their data, the method including repeatedly matching and filtering records from the data sources to obtain matched records using successively less strict matching rules, the matching rules being defined based on the variation in the matching quality.

Abstract: Systems and methods provide a media guidance application that recognizes a plurality of natural language search queries for identifying a set of search results. For example, a user may want to determine when the Yankees are playing their next baseball game. The user may structure their query in multiple ways, such as, “When are the Yankees playing?” “What time is the Yankees game?” “When is the next Yankees baseball game?” The user would expect the same result, a description of when the Yankees are playing, regardless of how the query is structured. The systems and methods enable a user to use a plurality of search queries when searching for items or information to get desired results.

Abstract: Various embodiments relate generally to data science and data analysis, computer software and systems, and wired and wireless network communications to provide an interface between repositories of disparate datasets and computing machine-based entities that seek access to the datasets, and, more specifically, to a computing and data storage platform that facilitates consolidation of one or more datasets, whereby one or more computerized tools may be configured to discover, form, and analyze, for example, via one or more user interface applications, interrelations among a system of networked collaborative datasets In some examples, a method may include causing transformation of a set of data to an atomized format to form an atomized dataset, monitoring creation of a dataset, and presenting data representing a status of a portion of the creation of the dataset. The status may depict an atomized dataset linked to at least one other dataset.

Abstract: Querying of time-aware metrics time series includes receiving a query, the query comprising a set of query metadata and a query time range. It further includes, based at least in part on the set of query metadata and the query time range, selecting a time series from a plurality of metrics time series. Each metrics time series in the plurality of metrics time series is associated with a set of metadata and an active interval of time. A set of metadata associated with the selected time series matches the set of query metadata, and an active interval of time associated with the selected metrics time series intersects with the query time range. The selected metrics time series is returned.

Abstract: Techniques are described for parallel processing of database queries with an inverse distribution function by a database management system (DBMS). To improve the execution time of a query with an inverse distribution function, the data set referenced in the inverse distribution function is range distributed among parallel processes that are spawned and managed by a query execution coordinator process (QC), in an embodiment. The parallel executing processes sort each range of the data set in parallel, while the QC determines the location(s) of inverse distribution function values based on the count of values in each range of the data set. The QC requests the parallel processes to produce to the next stage of parallel processes the values at the location(s) in the sorted ranges. The next stage of parallel processes computes the inverse distribution function based on the produced values.

Abstract: Disclosed is a conversation-based intelligent scheduling and appointment system and method. The system and method are designed to be capable of interpreting natural language, analyzing the natural language to reduce the language to data inputs, and displaying scheduling information such as appointment/event times, locations, and substantive information organized and presented in a format based on the data inputted by an operator. The display of the available appointment information is prioritized and dynamically displayed based on the natural language, regardless of the style or format of the natural language input in such a manner as to avoid superfluous information.

Abstract: Visualization of time series data includes sending to the data source a request for visualizing sensor data within a canvas having a width of w pixels and covering a visualization time range, each pixel of the canvas being representative of a time duration Iopt, receiving consecutive sets of tuples that each covers a time interval having the time duration It, performing a M4 aggregation comprising generating, from the received tuples, a set of consecutive w groups, each group of the w groups comprising tuples covering a time interval having the time duration Iopt, and determining for each group of the w groups a set of aggregates, and displaying the w sets of aggregates on the canvas of the browser window as a chart, wherein each one of the sets of aggregates is displayed in one of pixel columns of the canvas.

Abstract: A system and method for surfacing tailored actionable items associated with applications in a user experience of a mobile computing device is disclosed. The method includes determining an event associated with a application, determining an action library including a plurality of actionable items, identifying, from the action library, one or more actionable items associated with one or more applications based on the event, generating an action menu based on the one or more actionable items, the action menu including a deep link to perform the one or more actionable items, and presenting the action menu in association with the application in response to the event.

Abstract: Methods, systems, and computer storage media for providing reduced-latency data operations in a file system. In operation, a request to perform a data operation associated with a B+ table storage of a file system is received. The file system supports the B+ table storage that is accessible using a B+ tree lookup logic for accessing B+ table data and supports a cache storage that is accessible using a cache table lookup logic for accessing cache data in the cache storage. A number of references to the location in the B+ table storage is determined. The location in the B+ table storage is associated with the request to perform the data operation. Based on determining the number of references to the location, a cache storage location to perform the data operation is accessed. The cache storage location is mapped (using the cache table) to the location in the B+ table storage.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed. An example partitioned computer database system includes a plurality of nodes, a data director to distribute a plurality of portions of database data across the plurality of nodes, queriers associated with respective ones of the plurality of nodes, the queriers to execute respective sub-queries of respective portions of the database data, and a coordinator to receive a request to query the database data, and merge results of the plurality of sub-queries to form a response to the request.

Abstract: A method for a search engine to provide domain-agnostic options for structured exploration based on a query. The method comprises clustering a corpus of historical queries into a plurality of query clusters. The method further comprises identifying a set of variable query terms in each query cluster. Then, a query structure of a new user query is identified, and a specific query cluster matching the query structure of the new user query is selected. Furthermore, the variable query term in the query structure of the new user query is identified. The method further comprises providing a query exploration interface offering user-selectable options for structured exploration of the new user query. Each of the user-selectable option corresponds to a variable query term in the identified set of variable query terms for the specific query cluster identified as matching the query structure of the new user query.

Abstract: A method includes receiving, from a user via an electronic device, input representing a password to be utilized for an account; automatically determining, utilizing a processor, a complexity value for the input password; automatically determining, based on the determined complexity value, security settings for the account; receiving, from a user via an electronic device, input representing an attempt to login to the account, the input representing an attempt to login to the account including an attempted password; automatically determining that the attempted password does not match the password to be utilized for the account; and determining a course of action to take in response to the determination that the attempted password does not match the password to be utilized for the account, the course of action being determined based at least in part on the automatically determined security settings for the account.

Abstract: Technologies are described here for, among other things, improving search query relevance by executing a query on a search engine, retrieving search-page-data generated from executing the query, the search-page-data including document-titles and universal resource locators (URLs), each document-title being a title of a document associated with a URL, determining relevant-entity-words in the query from an entity relevance score for matching search terms in the query, Domain-URLs, and Domain-Titles, determining relevant-intent-words in the query from an intent-word relevance score based on a number of times a search term appears in the query and the URLs relative to other search terms in the query and the URLs, comparing each of the determined relevant-entity-words and each of the determined relevant-intent-words with a plurality of stored past-user queries, retrieving the plurality of stored past-user search queries including the relevant-entity-words and the relevant-intent-words, and transmitting a set of qu

Abstract: A computer-implemented method can facilitate delivery of targeted content to user devices in situations in which historic tracking data (e.g., cookie data) is generally unavailable and/or unreliable. A p-dimensional embedding of websites can be generated based on a group of user devices for whom tracking data is available. Conversion event data that indicates indicating whether that audience member performed a conversion action can be received. A machine learning model can be trained using the conversion event data and the positions of websites appearing in the conversion event data within the p-dimensional embedding to predict a likelihood of conversion and/or a type of content to provide given a position in the p-dimensional embedding. When an indication that a user device is accessing a website is received, a position of that website in the p-dimensional embedding can be determined and targeted content can be delivered to the user device.

Abstract: Methods and systems to automatically respond to a request for product information are described. In one embodiment, a data collection module may collect product data over a network, identify that the product data is related to a particular product, and store the product data and an association between the product data and the particular product in a database. An instant messaging engine may receive a request for the product data after the product data is stored in the database and an interpreter module may identify, in response to the request, the request to correspond to the particular product and retrieve the product data based on the association between the particular product and the product data. The instant messaging engine may also transmit, using an instant messaging protocol, a response to the request, the response including the product data.

Abstract: Provided are systems and methods for the contextual retrieval and contextual display of records. A search query and/or search results may be contextually enhanced based on (i) natural language processing (NLP) models, (ii) user behavior, and/or (iii) relationships between various entities involved in a search, such as between users, records, and/or fields of expertise. Contextually enhanced search results may be delivered and displayed to a user on a user interface in a contextually relevant order.

Abstract: Systems and methods for content management wherein a client can submit requests to a first API which the forwards the requests to either an IMDB or a gateway to a distributed cluster-computing framework. Requests to the IMDB are serviced and responses from the IMDB are returned to the client. Requests that are forwarded to the gateway are first modified for the distributed cluster-computing framework, and are then parsed by the gateway and used to instantiate processors that generate corresponding requests to the distributed cluster-computing framework. Responsive data from the distributed cluster-computing framework is used to generate responses to the client requests that are forwarded to the first API which modifies them to appear as if they were generated by the IMDB. These modified responses are returned by the first API to the client.

Abstract: A data-interoperability-oriented trusted processing method and system applied to a P2P network system are provided. The P2P network system includes a plurality of nodes. The trusted processing method includes a storage method and a query method. Firstly, a directed acyclic graph ledger structure is employed to be matched with an nRW consensus mechanism during a storage process, so that a supervision problem in a large-scale sharing exchange process is solved. Secondly, in a query process, a P2P network system is optimized by maintaining a tree structure with high fault tolerance and load balance through a hop optimization method to construct the P2P network system with a relatively balanced network, so that a query delay is not greatly influenced on the premise of ensuring the load balance, and an expandability of the system is ensured.

Abstract: Systems and methods for pre-training and fine-tuning of neural-network-based language models are disclosed in which a neural-network-based textual knowledge retriever is trained along with the language model. In some examples, the knowledge retriever obtains documents from an unlabeled pre-training corpus, generates its own training tasks, and learns to retrieve documents relevant to those tasks. In some examples, the knowledge retriever is further refined using supervised open-QA questions. The framework of the present technology provides models that can intelligently retrieve helpful information from a large unlabeled corpus, rather than requiring all potentially relevant information to be stored implicitly in the parameters of the neural network. This framework may thus reduce the storage space and complexity of the neural network, and also enable the model to more effectively handle new tasks that may be different than those on which it was pre-trained.

Abstract: Systems, methods, and devices for retrying a query. A method includes receiving from a client account a query directed to database data associated with the client account. The method includes determining that the attempt to execute the query is unsuccessful and making retry attempts to execute the query until making a retry attempt that is successful. The method includes logging each retry attempt and generating a filtered transaction log at least in part by filtering out from the transaction log each unsuccessful attempt to execute the query and providing the filtered transaction log to the client account.

Abstract: In one embodiment, a system for managing a skiplist includes processors arranged for parallel execution of threads, a shared memory storing a skiplist arranged as an ordered set of nodes, and at least one transaction execution thread executed by at least one of the plurality of processors. The at least one transaction execution thread is to execute a range-query operation to identify at least one node of the ordered set of nodes between a first lower key value and a second upper key value, the key-range operation executed by an execution phase and a commit phase, wherein during the execution phase the at least one transaction execution thread traverses nodes of the skiplist in a lock-free state, wherein during the commit phase the at least one transaction execution thread executes a commit protocol that guarantees transaction consistency of the skiplist structure and validates consistency of the range-query operation.

Abstract: A method performed by a processor in a hybrid cloud environment, the method including: specifying at least one service provider zone associated with a resource or a service of a service provider, the service provider zone including a first management interface node corresponding to the service provider; specifying at least one data center zone associated with a set of services or resources located near one another, the data center zone including a second management interface node corresponding to the set of services or resources; receiving, by the first management interface node, information from the resource or service associated with the at least one service provider zone; translating, by the first management interface node, the information from the resource or service to a format understandable by the second interface node to create first-level translated information; and transmitting the first-level translated information from the first interface node to the second interface node.

Abstract: Techniques are described herein for asynchronous execution of queries on statically replicated graph data. In an embodiment, a graph is partitioned among a plurality of computers executing the graph querying engine. One or more high-degree vertices of the graph are each replicated in each graph partition. The partitions, including the replicated high-degree vertices, are loaded in memory of the plurality of computers. To execute a query, a query plan is generated based on the query. The query plan specifies a plurality of operators and an order for the plurality of operators. The order is such that if an operator requires data generated by another operator, then the other operator is ordered before the operator in the query plan. Replicated copies of a vertex is visited if matches made by subsequent operator(s) are limited by data unique to the replicated vertices.

Abstract: Various embodiments relate generally to data science and data analysis, computer software and systems, and wired and wireless network communications to provide an interface between repositories of disparate datasets and computing machine-based entities that seek access to the datasets, and, more specifically, to a computing and data storage platform that facilitates consolidation of one or more datasets, whereby a collaborative data layer and associated logic facilitate, for example, efficient access to, and implementation of, collaborative datasets. In some examples, a method may include receiving data representing a query into a collaborative dataset consolidation system, identifying datasets relevant to the query, generating one or more queries to access disparate data repositories, and retrieving data representing query results. In some cases, one or more queries are applied (e.g.

Abstract: Methods, systems, and computer program products for automated generation of test cases for analyzing natural-language-interface-to-database systems are provided herein.

Abstract: Receive, by a central controller engine, a user request to perform one or more operations associated with user data, wherein the user data includes first data and second data. Select, by the central controller engine based on the user request, a first service provider interface (SPI) integrated into a first service, the first SPI being configured to operate on the first data in a first datastore associated with the first service. The first SPI including a first service interface component configured based on a uniform access specification. Obtain, by the first SPI, the first data, the first data being formatted according to a first service data specification. Transform, by the first SPI based on the uniform access specification, the first data, thereby generating transformed first data formatted according to the uniform access specification. Provide, by the first SPI, the transformed first data to a target service.

Abstract: In various example embodiments, a system and method for enhancing autocomplete search suggestions are presented. The system receives a query portion with a token portion from a client device and generates a first search query suggestion set having a first order based on the token portion. The system accesses a token pool associated with the client device and generates a second search query suggestion set having a second order based on the token portion and the token pool. The system selects a first subset of search query suggestions and a second subset of search query suggestions. The system merges the first subset of search query suggestions and the second subset of search query suggestions into a third search query suggestion set, organizes the third search query suggestion set into a third order distinct from the first and second orders, and causes presentation of the third search query suggestion set.

Abstract: A method and an apparatus for correcting a query based on artificial intelligence, including: receiving a first query input by a user, and judging whether the first query satisfies an error correcting condition according to a preset error correcting strategy; determining a first segment to be corrected in the first query if the first query satisfies the error correcting condition; acquiring one or more first candidate results corresponding to the first segment according to a preset candidate recalling strategy; determining an error correcting result corresponding to the first segment according to quality feature values of the one or more first candidate results; and performing an error correction on the first query according to the error correcting result, and generating a second query.

Abstract: Disclosed are systems and methods for improving interactions with and between computers in content providing, searching and/or hosting systems supported by or configured with devices, servers and/or platforms. The disclosed systems and methods provide a novel framework for analyzing messages shared over a network and identifying information in them referencing entities based on a determined context of the messages. Once the entity information is identified, the disclosed framework segregates them based on the context, and then presents them in contextual views as content cards within or as part of generated, content-specific interfaces. The disclosed framework enables users to continue messaging while pivoting between different views of the generated interfaces, which enables the retrieval of additional information related to the entity information included on the content cards.

Abstract: Aspects described herein may relate to a transaction exchange platform using a streaming data platform (SDP) and microservices to process transactions according to review and approval workflows. The transaction exchange platform may receive transactions from origination sources, which may be added to the SDP as transaction objects. Microservices on the transaction exchange platform may interact with the transaction objects based on configured workflows associated with the transactions. Processing on the transaction exchange platform may facilitate clearing and settlement of transactions. Some aspects may provide for dynamic and flexible reconfiguration of workflows and/or microservices. Other aspects may provide for data snapshots and workflow tracking, allowing for monitoring, quality control, and auditability of transactions on the transaction exchange platform.

Abstract: A method, system and computer-usable medium are disclosed for preserving temporal relevance of content within a corpus. A corpus is processed to generate temporally-relevant metadata and mined content, which in turn are processed to generate first temporal relevancy metrics. The cache history of a web browser is likewise processed to generate second temporal relevancy metrics, which in turn is processed with the first temporal relevancy metrics to generate first temporal relevancy scores. New documents are ingested into the corpus and existing documents are revised. Temporally-relevant metadata and mined content associated with the updated corpus are then processed to generate third temporal relevancy metrics. The second and third temporal relevancy metrics are then processed to generate second temporal relevancy scores, which is then used to provide a temporally-relevant response to a query.

Abstract: A data store may implement dynamic query predicates for processing queries. Query predicate indexes may be maintained for individual storage locations in a data store. The query predicate indexes may indicate data values not stored in the storage location that satisfy a query predicate in the query predicate index. The query predicate index may be populated when queries are received at the data store which include new query predicates. When queries are received that include query predicates that correspond to query predicates in the query predicate index, the index values for each of the storage locations may be evaluated. Based, at least in part, on the evaluation, particular storage locations may be identified to read for servicing the queries.

Abstract: A system for query planning and execution with reusable memory stack(s) is provided. In some implementations, the system performs operations comprising providing a first space in memory for storing first results of a first operator of a query, the first space located within a portion of a heap memory. The operations can further comprise generating at least a portion of the first results based on executing the first operator, providing a descriptor comprising information regarding the first space to a second operator which occurs after the first operator in a query plan, providing a second space in the previously allocated portion for storing second results of the second operator, and/or generating at least a portion of the second results based on executing the second operator using the first space. Related systems, methods, and articles of manufacture are also described.

Abstract: Various embodiments relate generally to data science and data analysis, computer software and systems, and wired and wireless network communications to provide an interface between repositories of disparate datasets and computing machine-based entities that seek access to the datasets, and, more specifically, to a computing and data storage platform that facilitates consolidation of one or more datasets, whereby a collaborative data layer and associated logic facilitate, for example, efficient access to, and implementation of, collaborative datasets. In some examples, a method may include receiving data representing a query into a collaborative dataset consolidation system, identifying datasets relevant to the query, generating one or more queries to access disparate data repositories, and retrieving data representing query results. In some cases, one or more queries are applied (e.g.

Abstract: Provided is an artificial intelligence (AI) answering system including a user question receiver configured to receive a user question from a user terminal; a first question extender configured to generate a question template by analyzing the user question and determine whether the user question and the generated question template match; a second question extender configured to generate a similar question template by using a natural language processing and a deep learning model when the user question and the generated question template do not match; a training data builder configured to generate training data for training the second question extender by using an neural machine translation (NMT) engine; and a question answering unit configured to transmit a user question result derived through the first question extender or the second question extender to the user terminal.

Abstract: A join operation between split data tables includes providing reduction data from first partitions to each partition among second partitions. The reduction data serves to identify actual values in one of the second partitions that also occur in one of the first partitions. Global IDs are assigned. Translation lists including the global IDs are sent to the first partitions. Each first partition and each second partition create globalized lists which can then be combined to generate respective first and second compiled lists. The join operation can then be conducted on the first and second compiled lists.

Abstract: The current disclosure is directed towards providing methods and systems enabling a plurality of key-value stores to be persisted within a single direct access memory space comprising persistent memory, and further enabling a single key-value store to be implemented via a plurality of memory spaces. In one embodiment, a method comprising: creating a first create-key-value-store operation-performed entry in a global log persisted within a first memory space; allocating a first key-value store name and a first key-value store root address within a second memory space; persisting the first key-value store name and the first key-value store root address within a first local log of the second memory space; updating the global log of the first memory space to include the first key-value store name and the first key-value store root address; and adding the first key-value store name and the first key-value store root address to a meta key-value store.

Abstract: A method, system, and computer program product for dynamically building a database query by combining a static query clause with a user-specified filter. A method commences upon receiving a user-specified query filter from a user interface, then reformatting the user-specified query filter from a first query filter representation (e.g., clicks or text from the user interface) into a second query filter representation (e.g., into XML or into a database connectivity format, or into an SQL format, or into any native format). Subsequent steps combine the second query filter representation with a predefined database query (e.g., from an enterprise application) to form a dynamically-generated database language query. The filter is specified at a user interface, and the predefined database query is specified by an application.

Abstract: A method of training word embeddings is provided. The method includes determining anchors, each comprising a first word in a first domain and a second word in a second domain, training word embeddings for the first and second domains, and training a transform for transforming word embedding vectors in the first domain to word embedding vectors in the second domain, wherein the training minimizes a loss function that includes an anchor loss for each anchor, such that for each anchor, the anchor loss is based on a distance between the anchor's second word's embedding vector and the transform of the anchor's first word's embedding vector, and for each anchor, the anchor loss for the respective anchor is zero when the distance between the respective anchor's second word's embedding vector and the transform of the respective anchor's first word's embedding vector is less than a specific tolerance.

Abstract: A computer-implemented method for correcting a spelling of a search term includes extracting search information from a clickstream database that includes search keywords received by a search engine. A server builds a database of acceptable terms that includes search keywords from the clickstream database that match a product in a product database. The server builds a database of correctable terms that include search keywords from the clickstream database that do not match a product in the product database. A plurality of spell correction candidates are identified based on the search keywords in the database of correctable terms. A confidence value for each of the plurality of spell correction candidates is determined. The spell correction candidate having a relatively highest confidence value among the confidence values for the plurality of spell correction candidates is stored in the database of correctable terms.

Abstract: An image display device, a method for driving the same, and a computer readable recording medium are provided. The image display device includes a speech acquirer configured to acquire a speech query associated with a query created by a user, a display configured to display a query list composed of candidate queries having the same as or similar semantic as the acquired speech query, and an operation performer configured to perform an operation related to the query selected from the displayed query list.

Abstract: Query execution status may be tracked to selectively route queries to resources for execution. The completion of queries executing at computing resources obtained from a pool of computing resources configured to execute queries may be detected. Instead of returning the computing resources to the pool, the computing resources may be identified as available in resource management data. When another query is received, the resource management data may be evaluated to select an available computing resource. The query may then be routed to the selected computing resource for execution.

Abstract: A device can receive a search query from another. The device can determine an information content of the partial query. The device can determine a set of tiles for identifying search results based on the information content of the partial query. The set of tiles can correspond to a geographic area within a proximity of the other device. The set of tiles can be associated with data identifying a set of points of interest associated with the geographic area. The device can obtain the data identifying the set of points of interest associated with the geographic area based on determining the set of tiles. The device can identify a set of search results based on the partial query and the data identifying the set of points of interest associated with the geographic area. The device can provide information identifying the set of search results.

Abstract: A stream application receives a stream of tuples to be processed by a plurality of processing elements. The plurality of processing elements operating on one or more compute nodes. Each processing element has one or more stream operators. The stream application assigns one or more processing cycles to one or more segments of software code. The segments of software code are embedded in a tuple of the stream of tuples. The software-embedded tuple identifies a set of target tuples based upon operation criteria. The set of target tuples are a part of the stream of tuples. The software-embedded tuple performs an operation based on the set of identified target tuples.

Abstract: Described herein is a system and method for a static streaming job startup sequence. During compilation of a streaming job, a graph of computing nodes of the streaming job is traversed to determine a minimum start time of computing node(s) downstream of each input computing node of the streaming job. Also, during compilation, a start time is assigned to each input computing node in accordance with the determined minimum start time. During execution of the streaming job, responsive to receipt of the trigger anchor by a particular input node, processing of the particular input computing node using the determined minimum start time is commenced. The input computing node further generates an anchor. Input data is received, and, a batch of data provided in accordance with the received input data and generated anchor.

Abstract: Systems and methods for optimizing outcomes in multi-factor systems are described. Business process management, consulting intelligence, business intelligence, mobile intelligence, artificial intelligence, machine learning, and transportation management are integrated, as discussed herein, for optimizing transportation and logistics processes. Users may input legacy knowledge and data such as text, numbers, formulas, algorithms, and automated processes into a computing system for providing the system with industry insights for intelligently analyzing situation contexts, or the system may leverage third-party data. The system may suggest recommended actions based on analyzed situation contexts, and the system may furthermore execute various actions for responding to the situation contexts. The system may be configured to automatically analyze situation contexts and furthermore automatically execute various actions for responding to the situation contexts.

Abstract: Query processors often receive queries to be processed against a data set, such as by inserting user input into parameterized fields of a query template. Some queries may be manipulated by user input (e.g., injection attacks) to introduce intentional errors in the query, where the error message reveals a protected detail about the data set, such as the existence or number of records or tables, the data set schema, and/or the configuration of the query processor. Instead, when the processing of a query results in an error message that contains a protected detail about the data set (including the query processor), the error message may be redacted to redact the protected detail before providing a redacted error message that avoids revealing information that might otherwise be usable to exploit the contents of the data set and/or the integrity of the data processor.

Abstract: Aspects described herein may allow for the application of dynamically generating APIs using API generator based on database metadata. An API generator may extract metadata associated with store procedures. The API generator may generate a first layer of API that communicates with an enterprise application via a first data format. The API generator may generate a second layer of the API that communicates with a database via a second data format. The API generator may receive a request to invoke a stored procedure in a first data format. In response to receiving the request, the generated API may generate a converted request in the second data format.

Abstract: Embodiments for space-efficient secondary indexing on distributed data stores in a networked computing environment by a processor. Replicas of corresponding master data at a file system level of a distributed file system (DFS) are sorted for creating secondary indexes of the replicas on different columns of a database table, wherein existing replication data is leveraged for the sorting.