Abstract: Database query analysis technology, in which an input query is received that relates to multiple attribute classes of data records. An index that is descriptive of the data records in data storage is accessed and relative positions in the accessed index for the multiple attribute classes are identified. The accessed index is processed based on more than one of the multiple attribute classes and the identified relative positions, and the processed index is used to identify groups of data records that are included in the data records in the data storage and that share common values for the multiple attribute classes in the input query. Metrics corresponding to the data records included in each of the identified groups of data records are accessed, computations are performed on the accessed metrics, and a report is generated that reflects results of the computations.

Abstract: A system is provided to provide near real-time updates to data tables for a data warehouse using a micro-batch manager. The system includes a processor and a computer readable medium operably coupled thereto, to perform table updating operations which include accessing a first staging data table comprising a plurality of records that was generated by the micro-batch manager for a first destination table of the data tables for the data warehouse, reading a merge instruction column of the first staging data table for the plurality of records, determining a merge operation for each of the plurality of records from reading the merge instruction column, merging the plurality of records from the first staging data table to the first destination table using the merge operation for each of the plurality of records, and deleting the plurality of records from the first staging data table after merging.

Abstract: The present disclosure describes apparatuses and methods for artificial intelligence-enabled search of a storage system. In some aspects, a metadata manager of a storage system receives a label of an object that an AI engine detects in data stored in the storage system. The metadata manager creates, in a relational section of a metadata database, an entry for the detected object with an identifier of the label of the detected object and an address of a node corresponding to the detected object. The metadata manager also creates, in a navigational portion of the metadata database and with the address of the detected object, the node that includes a reference to a relative node of another object and a weight of a relationship between the node and the relative node. By so doing, the metadata database may be searched based on weighted relationships between various nodes, thereby enabling contextual or implicit search of data in the storage system.

Abstract: There is a need for more accurate and more efficient database management operations. This need can be addressed by, for example, techniques for efficient matching of data fields in response to database queries. In one example, a method includes: for each input data field of a plurality of input data fields, generating an per-field encoded representation of the input data field based on each per-character increment score for an occurred character in the input data field; performing the automated data field matching based on each per-field encoded representation for an input data field to generate one or more data field matching outputs; and causing display of the one or more data field matching determinations using a data field matching output interface.

Abstract: A computing system may repair a database index for a database table by placing a first structural lock on the database table to prevent modifications to the structure of the table. The computing system may scan the database table to determine a plurality of database records. The system may probe the database index for the database records to identify records with missing entries in the index. Based on the probing, the system may place a first data lock on a record of the database table corresponding to a missing index entry to prevent modification of data in the record. In response to placing the first record lock, the system adds an index entry for the locked database record to the database index. During repair of the index, one or more processes may use the database index to locate one of the plurality of database records included in the database table.

Abstract: Analyzing log data, such as security log data and machine data, is disclosed. A baseline is built for a set of machine data. The baseline is built at least in part by determining a plurality of signature profiles for a plurality of respective time slices. An occurrence of an anomaly associated with the source of the machine data is determined. The occurrence is determined at least in part by determining that received machine data does not conform to the baseline within a threshold.

Abstract: A database-management system (DBMS) dynamically adjusts the logical and physical partitioning of data stored in database tables. An artificially intelligent DBMS partition manager draws expert inferences from the DBMS's current workload, execution logs, and data statistics, in order to identify ranges of database key values that are frequently accessed by incoming queries. The ranges are allocated to logical partitions that are then mapped to physical partitions, such that database records identified by a pair of subranges are stored in proximate areas of physical storage. This partitioning reduces the number of physical-storage accesses by populating each physical partition with records likely to be accessed together.

Abstract: Embodiments for optimizing file lookups after a file or directory rename operation. Files are defined using inode, dirent, and hash entries, and the name space of the files are stored in a B?Tree using file system conventions in which the inode, dirent, and hash values are referenced by the directory first followed by the inode number, as in a first data structure denoted [directory:inode]. Upon a rename of a file, the old inode, dirent, and hash entries are deleted, and a reference is created to the old name using the inode number first followed by the old directory, as in a second data structure denoted [inode:old_directory], and this reference is used as a forward link to the new file under the new directory name.

Abstract: A system and method processes join requests via independently running engines. A build side table to be joined is allocated among high speed memories of the engines. Each row of a probe side are allocated to the engine likely to have build side data corresponding to the row, and the engine then performs the join. Aggregation statistics may be computed by distributing the information across the engines.

Abstract: This application describes a method, a system, and a related device for network attached storage (NAS) data access. The method includes receiving, by a NAS client, an access request message, and determining an operation object according to information about to-be-accessed target data in the access request message, where the operation object includes a directory and/or a file to which the target data belongs. The method may also include generating a first direct memory access file system (DMAFS) packet according to a format described by using a preset file system type, where the preset file system type is used to describe a format of a DMAFS packet. Furthermore, the method may include sending the first DMAFS packet to an acceleration apparatus, so that the acceleration apparatus converts the operation object and an operation type that are in the first DMAFS packet into NFS data, and encapsulates the NFS data into a network protocol packet and sends the network protocol packet to a NAS server.

Abstract: The embodiments of this application provide an uncorrelated subquery optimization method and apparatus, and a storage medium. The method includes determining whether there is an uncorrelated subquery statement in a target clause in a database query statement. In response to the determination that there is the uncorrelated subquery statement in the target clause in the database query statement, the method includes obtaining an estimated number of rows of an execution result set corresponding to the target clause; and determining whether the estimated number of rows is less than a preset threshold. In response to the determination that the estimated number of rows is less than a preset threshold, the method includes executing the uncorrelated subquery statement, and rewriting the target clause according to an execution result set of the uncorrelated subquery statement, to eliminate the uncorrelated subquery statement.

Abstract: Venn diagrams are computed for a given plurality of input sets. The process of computing the Venn diagrams is executed on columnar database systems for efficient execution. The computation of various subsets of the Venn diagrams is performed by determining subsets of various combinations of the input sets and computing set differences of the intersection sets. The process orders the execution of various steps of computing the subsets for the Venn diagram in an order that reduces the number of times an input set is loaded. Information describing various subsets of a Venn diagram is used to render the Venn diagram for display, for example, on a client device.

Abstract: Systems and methods are described to address shortcomings in a conventional conversation system via a novel technique utilizing artificial neural networks to train the conversation system whether or not to continue context. In some aspects, an interactive media guidance application determines a type of conversation continuity in a natural language conversation comprising first and second queries. The interactive media guidance application determines a first token in the first query and a second token in the second query. The interactive media guidance application identifies entity data for the first and second tokens. The interactive media guidance application retrieves, from a knowledge graph, graph connections between the entity data for the first and second tokens. The interactive media guidance application applies this data as inputs to an artificial neural network.

Abstract: A method and apparatus for an adaptive search user interface is provided. An interface is provided that returns search results upon receiving each alphanumeric character of a search query term. Correlations of prefixes of alphanumeric characters and search results selected from previous searches are stored in a correlation matrix. Based upon the correlations in the correlation matrix, relevance rankings for search results with respect to the prefixes of alphanumeric characters are updated. Search results may be grouped based upon one or more common traits. Relevance rankings are also updated based upon the rate of change of selections recorded for a search result.

Abstract: Data segment-based indexing includes identifying data segments of a column of a database based on a data distribution of data of the column, indexing the data segments, including, for each data segment, determining an index type and creating an index of the determined index type, and building a composite link between indexes of a common index type, which indexes of the common index type include a created index, from indexing the data segments of the column, of the common index type and at least one other index, of the common index type, which is for other data segment(s), of other column(s) of the database, that have been indexed using the common index type. The composite link provides for parallel searching against the indexes in the group to search corresponding different data segments, in different columns of the database, indexed using the common index type.

Abstract: Examples are disclosed that relate to grouping query clusters based on intent of a search query. One example provides a system for generating recommended queries related to a search query, the system including a logic subsystem, and memory holding instructions executable by the logic subsystem to receive the search query, execute the search query on an index of pre-computed query clusters to identify a baseline query cluster and one or more neighboring query clusters, form a data structure including queries from within the baseline query cluster and the one or more neighboring query clusters, traverse the data structure to form a hierarchical arrangement of queries, and send the hierarchical arrangement of queries to a computing device from which the search query was received.

Abstract: Embodiments relate to processing a request from a user device for access rights for a resource. An access management system can send a request to query a (e.g., cached or authoritative) data store for available access rights. The query may include an exact-match or fuzzy query. A set of access-right results responsive to the query can be identified. The system may transmit a communication to the user device that identifies the set, or a subset thereof. Upon receiving a selection of a result, the system can facilitate assigning access rights corresponding to the identified result to the user. In some instances, a level of precision at which a characteristic of an access-right result is identified and/or whether or how access rights are held depends on a request load.

Abstract: Technologies for providing dynamic persistence of data in edge computing include a device including circuitry configured to determine multiple different logical domains of data storage resources for use in storing data from a client compute device at an edge of a network. Each logical domain has a different set of characteristics. The circuitry is also to configured to receive, from the client compute device, a request to persist data. The request includes a target persistence objective indicative of an objective to be satisfied in the storage of the data. Additionally, the circuitry is configured to select, as a function of the characteristics of the logical domains and the target persistence objective, a logical domain into which to persist the data and provide the data to the selected logical domain.

Abstract: Systems, and method and computer readable media that store instructions for calculating signatures, utilizing signatures and the like.

Abstract: There is disclosed a method for rendering search results on a map displayable on an electronic device, the search results being responsive to a geo-search query associated with the map, the electronic device connectable to a map server via a communication network. The method is executable by the electronic device. The method includes maintaining POI label rendering rules, which prescribe rendering rules for processing POI labels associated with POIs that form part of the ranked set of search results. When the electronic device processes additional sets of ranked search results, the method comprises generating a POI label density ratio, which is used to modify the rendering rules used for rendering newly received (i.e. not previously rendered) POI labels. The processing rules can be defined for each zoom level of the map viewport. The method further includes executing collision verification routine to further modify the POI label rendering rules.