Abstract: A system such as a database management system determines a rule to impose sorted order upon a column without applying a sorting algorithm to the column and stores the rule to be applied to sort the column. In an embodiment, a permutation is the rule. The column, in an embodiment, is a column of a database table. In some cases, the rule is used to efficiently impose a correct sorted order on a subset of unsorted columns without the use of a sorting algorithm. In some cases, the rule is generated based at least in part on another column that is sorted using a sorting algorithm such as quicksort.

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: A computer-implemented method groups queries to reduce performance degradation. The method includes, receiving, by a database manager, a set of queries from one or more requestors, wherein each query of the set of queries includes an access plan. The method includes, determining, based at least on the access plan of each query, that a first query in the set of queries is incompatible with a second query of the set of queries. The method includes, grouping, in response to the first query and the second query being incompatible, the first query in a first group, and the second query in a second group, wherein the first group and the second group are included in a set of groups. The method includes, determining an order for each group of the set of groups. The method further includes, executing, in response to determining the order, each group in the determined order.

Abstract: Methods and systems for converting user data from disparate sources to bitmap data are described, where user data from a plurality of different data sources are conformed to a conformed user data set using a conform mapping schema, and the conformed data set is then analyzed to create a bitmap mapping schema which provides a mapping from the conformed user data set to a bitmap data set. The conformed user data set is then converted to a bitmap data set using the bitmap mapping schema and the current user data in the conformed user data set. A query user interface (UI) may be provided to allow clients or others to query the resulting bitmap data set.

Abstract: A method and a related system for controlling user access to a target node in a knowledge graph may be provided. The method comprises defining a knowledge graph structure limitation for a user, defining a node type depending on the number of edges connecting to the node, determining a condition for an access to the target node, based on the knowledge graph structure limitation relative to the start node and the node type of the target node, upon the user attempting, coming from a start node, to access the target node in the knowledge graph, and granting access to the target node based on the determination.

Abstract: Disclosed are various embodiments for the efficient hashing of data objects. In one embodiment, a hashing application receives an update to a portion of a data object. The hashing application then generates an updated hash value of the data object by hashing the portion of the data object and at least one stored internal hash value corresponding to one or more portions of the data object that are unaffected by the update.

Abstract: An apparatus comprises a processing device configured to generate a tree structure characterizing relationships between storage objects in a storage system represented as logical page nodes specifying respective logical page addresses, arrays of pointers to other logical page addresses, snapshot group identifiers, and logical extent offsets. The processing device is also configured to traverse the generated tree structure to identify (i) a given logical page node specifying a given logical page address, snapshot group identifier and logical extent offset from a query and (ii) other ones of the logical page nodes that specify the given snapshot group identifier and logical extent offset and comprise a pointer to the given logical page address in its associated array of pointers. The processing device is further configured to provide a response to the query specifying the given logical page node and the identified other ones of the logical page nodes.

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: 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: 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: Disclosed is a computer program stored in a computer-readable storage including encoded commands. When the computer program is executed by one or more processors of a source database server, the computer program performs steps for Change Data Capture (CDC) by one or more processors. The steps may include: identifying a plurality of Structured Query Language (SQL) operations generated for one or more objects associated with a transaction by analyzing a log record including information about the transaction processed at a source database server; determining whether a previous SQL operation history for an object corresponding to an individual SQL operation is in a CDC file, based on whether an order in which the plurality of identified SQL operations occur; determining information to write on the CDC file based on whether a previous SQL operation history is in the CDC file; writing the determined information on the CDC file; and deciding to send the CDC file to a target database server.

Abstract: Content fragments aligned to content criteria enable rich sets of multimodal content to be generated based on specified content criteria, such as content needs pertaining to various content delivery platforms and scenarios. For instance, the described techniques take a set of content (e.g., text, images, etc.) along with a specified content criteria (e.g., business/user need) and creates content fragment variants that are tailored to the content criteria with respect to both the information presented as well as the style of the content presented.

Abstract: Described is an improved approach to remove data outliers by filtering out data correlated to detrimental events within a system. One or more detrimental even conditions are defined to identify and handle abnormal transient states from collected data for a monitored system.

Abstract: An analysis method includes acquiring target data collected at edges; determining first analysis target satisfying a first condition, and specifying a first detection position indicating a position at which the first analysis target is detected at the edges and a first detection time; calculating a correlation coefficient of the feature amount; specifying a first range of the first detection position and a second range of the first detection time of the analysis target for which the correlation coefficient satisfies a predetermined relationship; determining second analysis target satisfying a second condition, and specifying a second detection position and a second detection time; determining whether the analysis target in which the second detection position is included in the first range and the second detection time; and acquiring any one of the analysis target from the edges when it is determined that the analysis target is included.

Abstract: The present disclosure is associated with operation of a metadata server for package management including development and deployment of software. To illustrate, a metadata server stores a database model including multiple data structures that each include one or more entries of multiple data objects and a set of mapping rules defining links between different data structures of the multiple data structure. A method of operating the metadata server includes determining access permissions for an entity. The access permissions correspond to authorization to access a set of the multiple data structures. The method further includes identifying and executing a mapping rule to authorize a link between two or more data structures. The method further includes accessing a portion of requested metadata from the two or more data structures that have an authorized active link, and providing an output of the portion of the requested metadata arranged according to an output format.

Abstract: Example methods, apparatuses, and systems are disclosed for ingesting and consuming data utilizing a trading partner manager. In one example embodiment, an example computing device receives user input comprising a set of data fabric configurations. The computing device then receives, into a data landing zone and based on the data fabric configurations, a data set from a data source. The computing device then ingests, based on the data fabric configurations, the received data set from the data landing zone into a data lake. The computing device then enriches, based on the data fabric configurations, the ingested data set. The computing device then enables data consumption of the ingested data set by the user.

Abstract: The present subject matter discloses system and method for querying a dwarf cube. The method comprises receiving a query for retrieving data from a dwarf cube comprising a set of dwarf nodes. The dwarf nodes are clustered based on group by views and a dimension index is assigned for each dwarf node. The query is processed through the clustered dwarf nodes. One or more group by views of the query is determined based on dimensions and hierarchy levels associated with the query. The clustered dwarf nodes to be searched for the query are identified according to the group by views of the query. The clustered dwarf nodes are read from the views based on the identifying. The dimension index is utilized for determining a relationship between values of different dimensions queried for the reading. The response towards the query is generated.

Abstract: A facility for managing filesystem object storage quotas (i.e., size limits) in a storage environment is disclosed. The facility enables users to establish, modify, and remove quotas on directories and files within a filesystem. Each quota acts as a soft limit on the size of the associated filesystem object, including any child objects of the filesystem object. The facility improves the speed at which the system can test for and identify violations of quotas established for individual filesystem objects by using aggregation and reconciliation techniques rather than constantly traversing a filesystem in its entirety to test for violations of quotas.

Abstract: Embodiments of the present disclosure disclose a method and apparatus for processing information. A specific implementation of the method includes: acquiring a search result set related to a search statement inputted by a user; parsing the search statement to generate a first syntax tree, and parsing a search result in the search result set to generate a second syntax tree set; calculating a similarity between the search statement and the search result in the search result set using a pre-trained semantic matching model on the basis of the first syntax tree and the second syntax tree set, the semantic matching model being used to determine the similarity between the syntax trees; and sorting the search result in the search result set on the basis of the similarity between the search statement and the search result in the search result set, and pushing the sorted search result set to the user.

Abstract: Embodiments of the present disclosure disclose a method, an apparatus, a server, and a storage medium for recalling for a search. The method for recalling for a search includes: acquiring a search term inputted by a user; calculating a semantic vector of the search term using a pre-trained neural network model; and recalling, according to a pre-established index, target documents related to the semantic vector of the search term from candidate documents, the index being established based on the semantic vectors of the candidate documents, and the semantic vectors of the candidate documents being calculated using the pre-trained neural network model. The embodiments of the present disclosure may solve a problem in the existing method for recalling that the recalling accuracy is affected by failing to generalize semantics, to improve the accuracy of recalling for a search.