Abstract: The embodiments described herein enable the efficient storage and searching of large amounts of data to retrieve desired data with high accuracy and fast response time. The embodiments include for example parsing an input document containing input data into multiple sub-documents based on the structure of the input document and generating for each sub-document, a unique ID, pathway, and metadata. The embodiments also include storage of the ID and pathway for each sub-document in an index database and storage of the input document itself in a separate database. When a query for information from the input document is received, the ID and pathway of the sub document containing the queried information are identified and used to locate the queried information from the input document.

Abstract: A computer system includes a processor and a database. The database includes a plurality of business intelligence (BI) data objects. Each of the BI data objects is associated with one or more data parameters. The processor is programmed with computer-executable instructions that cause the processor to run user code associated with a runtime environment that is hosted on the database. The user code includes executable source code that is not an intrinsic part of the database. The user code is created and deployed into the database and is configured to intercept a data call from a query application to a query interface for data corresponding to one or more of the BI data objects. The data call includes one or more selected parameters. The data call is parsed to ascertain the one or more selected parameters. Data corresponding to the one or more BI data objects is obtained from the database based on the one or more selected parameters. A data prediction result is appended to the obtained data.

Abstract: Systems and methods of monitoring for anomalous data records. The system conducts a method including: receiving a data record associated with at least one meta attribute to determine whether subsequent processing of the data record is warranted; generating an anomaly prediction for the data record based on a detection model and the at least one meta attribute associated with the data record, the detection model defined by a plurality of score distribution representations based on quantile bins and a dynamic quantile weight for providing an interim anomaly measure corresponding to respective score distribution representations, wherein the anomaly prediction is generated based on a combination of interim anomaly measures associated with respective meta attributes associated with the data record; and transmitting a signal representing the anomaly prediction for presentation at a user device for identifying one or more data records for subsequent data processes.

Abstract: A method, system and computer program product are disclosed for determining a shortest path between two nodes of a graph, where the graph is represented in one or more tables of a relational database as a plurality of records identifying edges between pairs of connected nodes in the graph. A request specifies a source node (or set of source nodes), a target node (or set of target nodes) and a maximum path length L. Each path length l, from 1 to L, is iteratively tested by first generating a query comprising a sequence of join operations for that path length, and secondly decomposing the join operations into a sequence of one or more tree-structured queries comprising semi-join operations. Each tree-structured query when executed as a sequence of semi-join operations will return either an empty result set, indicating that no shortest path exists at that path length, or a non-empty result set which identifies all edges at step k of each shortest path of length l, where 1?k?l.

Abstract: A method involves receiving a first command. The first command includes a data extraction expression applied to fields of a dataset of a data source. The first command also includes a first report configuration expression applied to first dimensions of a first report. The method also involves generating, by executing the data extraction expression on the dataset, records of the dataset. The method also involves generating, by executing the first report configuration expression on the records, a first tree of subsets of the records. The method also involves populating, using the first report configuration expression and the first tree of subsets, cells of the first dimensions to obtain first populated dimensions. The method also involves generating, in response to receiving the first command and by traversing the first tree of subsets, the first report including the first populated dimensions.

Abstract: Methods, systems and computer-readable media enable various techniques related to semantic navigation. One aspect is a technique for displaying semantically derived facets in the search engine interface. Each of the facets comprises faceted search results. Each of the faceted search results is displayed in association with user interface elements for including or excluding the faceted search result as additional search terms to subsequently refine the search query. Another aspect automatically infers new metadata from the content and from existing metadata and then automatically annotates the content with the new metadata to improve recall and navigation. Another aspect identifies semantic annotations by determining semantic connections between the semantic annotations and then dynamically generating a topic page based on the semantic connections.

Abstract: The present disclosure relates to systems, methods, and computer-readable media for using a variety of hypothesis tests to identify errors within tables and other structured datasets. For example, systems disclosed herein can generate a modified table from an input table by removing one or more entries from the input table. The systems disclosed herein can further leverage a collection of training tables to determine probabilities associated with whether the input table and modified table are drawn from the collection of training tables. The systems disclosed herein can additionally compare the probabilities to accurately determine whether the one or more entries include errors therein. The systems disclosed herein may apply to a variety of different sizes and types of tables to identify different types of common errors within input tables.

Abstract: The present application relates to a data processing method and system of a distributed graph database. The present application solves the problem of how to improve the efficiency of adding, deleting, modifying and checking data in a graph database, realizes balanced storage and concurrent computing of distributed index, reduces network overhead caused by data operation, and improves the efficiency of data operation effectively.

Abstract: A system and method of joining remote tables by a federated server is provided. A method includes receiving a data join request from a client device; sending a first block fetch request to a first data source based on the data join request; receiving a first set of block data from the first data source; sending a second block fetch request to a second data source based on the data join request and a bind array containing the data of join column in the first data source; receiving a second set of block data from the second data source; and sending an output to the client device in response to the data join request in the form of rows from an outer table and an inner table.

Abstract: Systems and methods for managing data. The methods comprise by a computing system: generating publication identifiers and version values for source data to be stored into a data warehouse; causing a plurality of fact tables in the data warehouse to be populated with the source data and the publication identifiers; causing a publication table in the data warehouse to be updated to include the publication identifiers and the version values so as to be respectively associated with resource names; receiving a query for information directed to the plurality of fact tables; retrieving the publication identifiers from the publication table, in response to the query; and obtaining source data from each said fact table of the plurality of fact tables that is associated with publication identifiers that are stored in both the fact table and the publication table.

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: The present disclosure is directed towards a system, method, and computer readable storage medium for searchable encryption. A plurality of search terms are extracted from at least a part of a data structure. A keyed-hash value for each search term is calculated and stored in a list. The value of a bit in a predetermined position within each keyed-hash value is examined. If the value of the bit is a first value for ? of the keyed-hash values and a second value for ? of the keyed-hash values, wherein ? is a number greater or equal to two and the first value is different to the second value, then the set of keyed-hash values is split into two lists. Each list is assigned a search token value.

Abstract: Techniques for a context preservation during server restart are described. A restart of a database server having at least one open communications session with a database client is initiated. The database server can be executed by a compute instance hosted by a computer system of a provider network. A restarted database server is launched. The restarted database server obtains session state data to resume the at least one open communications session with the database client, the session state data including one or more session variables. The restarted database server receives a transaction from the database client.

Abstract: Aspects include receiving a search request, comparing at least one term of the search request to a plurality of metadata items, wherein each metadata item of the plurality of metadata items is associated with a respective asset of a plurality of assets, generating a plurality of scores, wherein each score of the plurality of scores is associated with a respective asset included in the plurality of assets, and wherein a value of each score of the plurality of scores is based on an identification of a user, selecting at least one asset of the plurality of assets in accordance with the plurality of scores and in accordance with at least one threshold, providing the at least one asset to a communications device that is associated with the user, and providing at least a portion of a metadata item included in the plurality of metadata items to the communications device.

Abstract: A configuration associated with locating personally identifiable information stored in a database is received. An alternate metadata source separate from the database is identified. The separate alternate metadata source is searched using the configuration to identify locations in the database that store personally identifiable information.

Abstract: Aspects of the current subject matter are directed to providing query results to clients by incorporating pause and/or detach operations into the query execution after a first fetch of results. The pause and the detach operations for query execution consistent with implementations of the current subject matter result in reduced times and conserved resources in providing query results by computing only results necessary to satisfy a first fetch call prior to computing results necessary to satisfy subsequent fetch calls.

Abstract: Described is a system and method for enabling visual search for information. With each selection of an object included in an image, additional images that include visually similar objects are determined and presented to the user.

Abstract: Methods, systems, devices, and tangible non-transitory computer readable media facilitating runtime reporting across multiple entities using a multi-tenant database including data of the multiple entities without intermingling the data. In an example embodiment, at a reporting runtime, the disclosed technology can: execute a hybrid class to generate a hybrid runtime data object that can include location-specific reporting data that can correspond to multiple entities and multiple reporting locations; evaluate, with respect to a certain reporting location, a mapping file of the hybrid class to determine whether to retrieve a reporting value of a reporting data field from a first data object corresponding to a first entity or from a second data object corresponding to a second entity; and/or access the first data object or the second data object to retrieve the reporting value based at least in part on evaluation of the mapping file.

Abstract: Definitions of material views are automatically generated. In general, Automated MV generation identifies a set of candidates MVs by examining a working set of query blocks. Once the candidates are formed, the candidate MVs are further evaluated to calculate a benefit to the candidate MVs. An improved approach for generating a candidate set of MVs is described herein. The improved approach is referred to as the extended covering subexpression technique (ECSE). Under ECSE, various relationships between join sets other than strict equivalence are used to generate new resultant join sets. Such relationships include subset, intersection, superset, and union, which shall be described in further detail below. In some cases, relationships among resultant join sets and initial join sets are considered to generate new resultant join sets. The final resultant join sets are then used to form a candidate set of MVs.

Abstract: The application relates to a method for creating a user-augmented index, including: receiving information identifying data, a first user-created category and a first user-designated value from the first user. The data, the first user-created category, and the first user-designated value are associated together in a data entry in the user-augmented index. A second user-created category and a second user-designated value are received from the second user. The second user-created category and the second user-designated value are also associated with the data entry in the user-augmented index. The application further relates to ranking one or more related data entries in response to a query of a user-augmented index.