Abstract: Systems and methods for reducing latency of probing operations of remotely located linear hash tables are described herein. In an embodiment, a system receives a request to perform a probing operation on a remotely located linear hash table based on a key value. Prior to performing the probing operation, the system dynamically predicts a number of slots for a single read of the linear hash table to minimize total cost for an average probing operation. The system determines a hash value based on the key value and determines a slot of the linear hash table to which the hash value corresponds. After predicting the number of slots, the system issues an RDMA request to perform a read of the predicted number of slots from the linear hash table starting at the slot to which the hash value corresponds.

Abstract: Disclosed are systems, devices, methods, and computer-readable media for performing various actions for bringing data stores into compliance with a policy. The actions include generating a global scan index (“scan index”) for SAS® software and using the scan index to handle data management operations. Unlike traditional B-tree indices that consume a larger quantity of resources to parse through data, the scan indices may include a table of three columns. A first column may include an indication of a search value, a second column may include an indication of what table(s) in the data store(s) include the requested value, and a third column may include an indication of the row number for the tables in column two in which the value resides. The actions further include batching requests to perform a data management operation on data of a certain category by employing the scan index.

Abstract: Disclosed are various approaches for workflow service application searching. In some aspects, a search query is entered through a search element of a workflow application on a client device. A request is transmitted from a workflow application to a workflow service, to search within an application based on the search query. Application content corresponding to the search query and the application is received from the workflow service. A search result is provided based on the application content and without opening the application on the client device.

Abstract: Techniques are disclosed that pertain to deploying immutable instances of a system. A computer system may maintain an active generation value that indicates an immutable instance of a database system that is permitted to write data to a database. The computer system may deploy a first immutable instance of the database system and update the active generation value to permit the first immutable instance to write data to the database. The computer system may receive a request to deploy a second immutable instance of the database system that includes an update not found in the first immutable instance. The computer system may deploy the second immutable instance and update the active generation value to cause the first immutable instance to cease writing data to the database and to permit the second immutable instance to write data to the database.

Abstract: A system for determining biological entities of interest is described. The system comprises a user input module configured to receive a search term comprising a representation of a biological entity; a search module configured to determine which biological entities of a set have a known association with the biological entity of the search term, those having a known association being results and those not having a known association being non-results, wherein biological entities of the set are related to each other by parent-child relationships in a relationship tree; and an analysis module configured to determine biological entities of interest by identifying non-results that have one or more results within a boundary in the relationship tree.

Abstract: A data retrieval system can include a computing device that is configured to, in response to receiving a uniform resource locator from a user device, parse the uniform resource locator to identify a dynamic path variable. The computing device can be configured to generate a set of execution steps based on the received uniform resource locator. The computing device can also be configured to execute the set of execution steps to retrieve a set of data, the set of execution steps being executed based on the dynamic path variable in response to the dynamic path variable being identified. The computing device can further be configured to transform a user interface of the user device based on the set of data.

Abstract: A differentially private security system communicatively coupled to a database storing restricted data receives a database query from a client. The database query includes an operation, a target accuracy, and a maximum privacy spend for the query. The system performs the operation to produce a result, then injects the result with noise sampled from a Laplace distribution to produce a differentially private result. The system iteratively calibrates the noise value of the differentially private result using a secondary distribution different from the Laplace distribution and a new fractional privacy spend. The system ceases to iterate when an iteration uses the maximum privacy spend or a relative error of the differentially private result is determined to satisfy the target accuracy, or both. The system sends the differentially private result to the client.

Abstract: In response to identifying an update operation for a system table of a DBMS, a row that corresponds to the update operation is identified using a partial image of the update operation. A before image that corresponds to the row is gathered and a new before image of the row that reflects the update operation is generated by overlaying the before image with the partial image. In response to identifying a delete operation that relates to the system table, a row of the system table that corresponds to the delete operation is identified using an identifier of the delete operation. A before image that corresponds to this row is gathered. A new before image of the row of the system table that reflects the delete operation is generated by applying the delete operation to this before image.

Abstract: Systems and methods are provided for integrated data analysis. At least one object that is responsive to a first search query is determined. The object is stored in an object model that is managed by a first computing platform, and the at least one object is associated with one or more properties. One or more data sets that are responsive to a second search query are determined. The data sets are managed by a second computing platform. The one or more data sets are determined related to the at least one object. The at least one object is updated to include at least one property that references at least one analysis that relies on the one or more data sets.

Abstract: Data deduplication techniques may use a fingerprint hash table and a backend location hash table in connection with performing operations including fingerprint insertion, fingerprint deletion and fingerprint lookup. Processing I/O operations may include: receiving a write operation that writes data to a target logical address; determining a fingerprint for the data; querying the fingerprint hash table using the fingerprint to determine a matching entry of the fingerprint hash table for the fingerprint; and responsive to determining that the fingerprint hash table does not have the matching entry that matches the fingerprint, performing processing including: inserting a first entry in the fingerprint hash table, wherein the first entry includes the fingerprint for the data and identifies a storage location at which the data is stored; and inserting a second entry in a backend location hash table, wherein the second entry references the first entry.

Abstract: Methods and systems for accessing, maintaining, analyzing, and visualizing structured data are presented. The system receives from a requesting computing device, a first request for a first hierarchical record. The system searches a first repository having first structured data. The system determines whether the first hierarchical record is present in the first structured data and creates, based on the first hierarchical record, a snapshot query criterion. The system then searches, based on the snapshot query criterion, a second repository comprising a first snapshot of the first structured data. The system determines whether a second hierarchical record at least partially matches the first hierarchical record.

Abstract: Techniques are disclosed relating to providing data views from a time-series data lake to a data warehousing system. In various embodiments, the disclosed techniques include providing, by a cloud-based service, a data lake service that maintains a time-series data lake storing a time-series representation of data from a plurality of data sources associated with a first organization. In some embodiments, the cloud-based service may receive additional backup data, including a first backup image of a first data source, associated with the first organization as part of a backup operation. The cloud-based service may then store a logical backup of the first data source in the data lake and, in response to a query from a data warehousing system, the cloud-based service may retrieve a particular view of the backup data from the data lake and provide it to the data warehousing system.

Abstract: Methods and systems for indexing data for a search tool are disclosed, wherein the method is performed using one or more processors. The methods and systems may comprise an operation of providing an indexing application programming interface (API) for implementation in relation to one or more data resources of a data processing platform requiring data of the data resource to be indexed for searching using a search tool of the data processing platform. The interface may be configured, when implemented in relation to a data resource, to send data indicative of one or more definitions of data to be crawled from said data resource to an indexing system of the data processing platform, and to generate an event queue indicative of one or more events associated with said defined data that have occurred in relation to the data resource.

Abstract: Systems, methods, and computer-readable media are provided for data catalogs, metadata repositories, data discovery, and data governance, and in particular, for a canonical model-driven active metadata exchange for distributed data catalogues. Disclosed implementations include an application independent metadata repository with a Canonical Data Model (CDM). The CDM maintains a single set of use case agnostic mappings between data sources and the CDM. The physical mappings of a particular entity in the CDM are used to determine the different applications that are mapped to it and what objects or data structures that are exposed by that particular data source. Other embodiments may be described and/or claimed.

Abstract: In accordance with an embodiment, described herein are systems and methods for providing a remote data gateway that supports peer routing for use with an analytics environment. In accordance with an embodiment, a data analytics remote data gateway server connects to on-premise data clients, via remote data gateway agents. If a remote data gateway server cannot reach a particular data client at its remote data gateway agent, then it can determine which other clients it can get requests from. To address this, the system can use a process of inverse proxy peer-to-peer routing—if a client has a request to be processed, but the server has not yet called into that client, then the client can hand off the request to a peer remote data gateway server, and the server can retrieve/process that request from that server operating as a proxy.

Abstract: Systems and methods for reducing latency of probing operations of remotely located linear hash tables are described herein. In an embodiment, a system receives a request to perform a probing operation on a remotely located linear hash table based on a key value. Prior to performing the probing operation, the system dynamically predicts a number of slots for a single read of the linear hash table to minimize total cost for an average probing operation. The system determines a hash value based on the key value and determines a slot of the linear hash table to which the hash value corresponds. After predicting the number of slots, the system issues an RDMA request to perform a read of the predicted number of slots from the linear hash table starting at the slot to which the hash value corresponds.

Abstract: A system and a method for on-demand search of a large data-set is presented. The system includes a data indexer, an index writer, and an index reader. The data indexer is configured to index the data set. The index writer is configured to create a multi-level directory including a plurality of directories having one or more hash partitions. The index writer is further configured to generate a hash table for each directory and write data from the indexed data set into a corresponding hash partition of a directory. The index reader is configured to identify and query a hash partition in each directory based on a search term and a corresponding hash table for the directory. The index reader is further configured to retrieve one or more relevant records, and present the one or more relevant records to a user.

Abstract: A method for operating a search engine may include determining a multi-dimensional search parameter space comprising a set of possible weight values for each of a plurality of search parameters and dividing the search parameter space into a grid of evenly-spaced values that is a subset of the set of possible values. The method may further include defining one or more initial populations of search parameter weight values, wherein each population of search parameter weight values comprises a plurality of initial individuals, wherein each initial individual comprises a respective one of the evenly-spaced values for each of the search parameters. The method may further include executing one or more genetic algorithms based on the one or more initial populations to select a final set of search parameter weight values, and returning results of a user search in the search engine according to the final set of search parameter weight values.

Abstract: Techniques are disclosed relating to managing virtual data sources (VDSs), including creating and using VDSs. A virtual data source manager (VDSM) that is executing on a computer system may receive a VDS creation request to create a particular VDS. The VDS creation request may include information that is usable to identify a data origin of the particular VDS and an ingestion routine. The VDSM may use the ingestion routine to create the particular VDS that includes a bitmap index that is representative of data stored at the origin. In response to a data request corresponding to the origin, the particular VDS may be used to initiate a query to the particular VDS for data without accessing the origin. The VDSM may further maintain various software plugins that are executable to perform corresponding functions in relation to the VDSM and the VDSs managed by the VDSM.

Abstract: The embodiments of present disclosure provide a method and device for interface operation and maintenance. The method includes: acquiring query condition parameters input by a user for querying interface log information of at least one system, wherein the query condition parameters at least include a message time parameter that uniquely marks log message time and a system name parameter that uniquely marks the system; invoking an application programming interface provided by the at least one system according to the system name parameter in the query condition parameters, and acquiring first interface log information according to a result of invoking the application programming interface; determining second interface log information in the first interface log information according to the message time parameter that uniquely marks the log message time; and displaying the second interface log information.