14 results about "Very large database" patented technology

The invention discloses a database query optimization method and system based on a general relation view. According to the method and the system, a query instruction input by a user in a similar natural language is received, and a database table associated with target attributes and conditions is automatically analyzed; a weighted graph model is constructed based on table relation topology, an improved path optimization algorithm is adopted to dynamically generate a table connection sequence, and a path selection mechanism preferentially minimizes the calculation complexity of connection operation; for a cross-multi-table query scene, generating an optimal connection path through a global model; finally, an optimization result is converted into a standard database query statement to be executed. Compared with the prior art, the method and the system have the advantages that the user operation threshold is obviously reduced, non-technical personnel can directly realize complex query through attribute names, the multi-table connection query efficiency is effectively improved, and the performance is close to that of native query in a large database environment; and a mainstream database system can be compatible through a middleware framework, so that the method has wide applicability.

A database system comprised of a decoupled compute layer and storage layer is implemented to store, build, and maintain a canonical dataset, a temporary buffer, and projection datasets. The canonical dataset is a set of batch updated data. The data is appended in chunks to the canonical dataset such that the canonical dataset becomes a historical dataset over time. The buffer is a write ahead log that contains the most recent chunks of data and provides atomicity and durability for the database system. The projection datasets are indexes of the canonical dataset and / or the buffer that may have single or multiple column sort-orders and / or particular data formats. The writes to the canonical dataset, projection datasets, and buffer may be asynchronous and therefore the database system is advantageously less resource constrained.

The method can involve displaying a multitude of parallel graphs, each extending linearly from a first end to a second end along a time axis spanning incremental time values. Each graph represents a sequence of severity levels for a given parameter, encoded as different colors or shades across these incremental time values. The incremental time values ​​are the same for each of the multiple graphs, so severity levels oriented perpendicular to the time axis correspond to time points. The resulting dashboard can help transform complex analyses into key performance indicators and / or identify areas of interest in large databases.

The invention discloses a semantic extraction method and device, equipment and a medium, relates to the technical field of artificial intelligence, and is used for shortening the semantic extraction duration of a dialogue type business analysis system on a large database. The method comprises the following steps: receiving a first request; in response to the first request, obtaining structure information of the to-be-analyzed table from a database; inputting the structural feature vector corresponding to the structural information into a first prediction model, and predicting to obtain first prediction response time; if the first prediction response duration is greater than the response time threshold, segmenting the to-be-analyzed table according to a segmentation strategy to obtain at least two pieces of segmented data meeting a preset condition; the preset condition includes that the second prediction response duration of each piece of segmented data is smaller than or equal to a response duration threshold value; and calling the large language model to extract semantic information from the at least two pieces of segmented data, and determining a result for responding to the first request according to the extracted semantic information, so that the semantic extraction time of the dialogue type business analysis system on the large database can be shortened.

Methods and apparatus for sparse column-aware encodings for numeric data types, including integer data and floating-point data (float, double, etc.). The encoding schemes are tailored to take advantage of column addressable memories such as stochastic associative memories (SAM) to enable Stochastic Associative Search (SAS), which is a highly efficient and fast way of searching through a very large database of records (order of Billions) and finding similar records to a given query record (search key). Techniques are also disclosed for performing range searches for both integer and floating-point data types. The integer or float data is converted to Hexadecimal form and encoded using an m-of-n constant weight encoding. Only the columns with set bits in search keys need to be read, which significantly reduces the number of reads required for searches.

An object of a system according to an embodiment is to propose an optimal cocktail based on a customer's desire.SOLUTION: A system includes a reception part, a generation part, an output part, a feedback collection part, and a fine tuning part. The reception unit inputs a desire of a customer. The generation unit analyzes the information input by the reception unit and generates a recipe of an appropriate cocktail from a large-scale database. The output unit outputs the recipe of the cocktail generated by the generation unit in a moving image format. The output unit outputs the appearance of the cocktail generated by the generation unit in an image format. The output unit outputs the name of the cocktail generated by the generation unit in a text format. The feedback collection unit collects feedback on the recipe of the cocktail output by the output unit. The fine-tuning unit fine-tunes the model of the generative AI based on the feedback collected by the feedback collection unit.SELECTED DRAWING: Figure 1

The method can include displaying a plurality of graphs disposed parallel to one another, each graph extending linearly from a first end to a second end along a temporal axis spanning incremental values of time, and representing a sequence of severity levels of a corresponding one of the parameters encoded as different colors or tones over the incremental values of time, the incremental values of time being common to each one of the plurality of graphs such that severity levels aligned transversally to the temporal axes correspond to simultaneous moments in time. The dashboard so made available can help convert complex analyses into key performance indicators, and / or to identify regions of interest in large databases.

This disclosure relates to a method and system for data scrubbing in very-large-databases (VLDB) within regulated industries. The method involves segmenting a copy of a production database into manageable chunks based on row identifiers, allowing for parallel processing without database contention. Each chunk is processed by concurrently executing instances of a data scrubbing component, which replaces sensitive data with anonymous data of the same type using specified scrubbing algorithms. The system ensures that scrubbed data maintains the same structure and statistical properties as the original data while preventing the restoration of sensitive information. The process is meticulously documented to meet regulatory standards and facilitate audits, making it a robust solution for data scrubbing in environments with stringent compliance requirements.

A method and system utilize unexpected combinations of cognitive exercises to provide routines performed simultaneously with aerobic exercise to address cognitive impairments. Cognitive exercises comprise specific steps in order to interact with a specific cognitive domain. All stimuli may be aural. Specific combinations of cognitive exercises are created to engage selected brain circuits and are correlated to specific cognitive impairments. The method may remediate selected cognitive impairments and strengthen cognitive abilities. The user responds to instructions for each exercise and performs each exercise in a specific order for a specific duration of time and through a specific number of sets. A processor performs a program comprising the routines and evaluates performance of a user. A program may be customized for an individual user. An individual user's data is processed to evaluate progress. Large libraries of data for multiple users may be processed to provide statistical databases.

The present invention relates to the technical field of databases, and relates to a large database algorithm based on two-factor encryption and decryption, comprising: performing content encryption and file structure encryption processing on a personal information portion in a medical database file, so as to implement secure storage of a database file written into a disk; and when the database file is read, using parallel processing and buffer processing techniques, so as to implement storage of personal information and public information in different buffer areas, and performing corresponding decryption processing on the personal information to obtain original user record data. The present invention is compatible with traditional SQL statement query and segmented full-text search processing, and rapid data conversion from a memory to a disk and from the disk to the memory is achieved. The present invention solves the problem of data security management and control of a disk and memory buffer areas, improves the security of a database, and reduces the risk of data leakage.

This disclosure relates to a method and system for data scrubbing in very-large-databases (VLDB) within regulated industries. The method involves segmenting a copy of a production database into manageable chunks based on row identifiers, allowing for parallel processing without database contention. Each chunk is processed by concurrently executing instances of a data scrubbing component, which replaces sensitive data with anonymous data of the same type using specified scrubbing algorithms. The system ensures that scrubbed data maintains the same structure and statistical properties as the original data while preventing the restoration of sensitive information. The process is meticulously documented to meet regulatory standards and facilitate audits, making it a robust solution for data scrubbing in environments with stringent compliance requirements.

This disclosure relates to a method and system for data scrubbing in very-large-databases (VLDB) within regulated industries. The method involves segmenting a copy of a production database into manageable chunks based on row identifiers, allowing for parallel processing without database contention. Each chunk is processed by concurrently executing instances of a data scrubbing component, which replaces sensitive data with anonymous data of the same type using specified scrubbing algorithms. The system ensures that scrubbed data maintains the same structure and statistical properties as the original data while preventing the restoration of sensitive information. The process is meticulously documented to meet regulatory standards and facilitate audits, making it a robust solution for data scrubbing in environments with stringent compliance requirements.

Embodiments of the present application disclose a database data row number counting method and device, equipment and a storage medium, comprising: when counting a row number of target data in a target database of an electronic device, acquiring an index range corresponding to the target data; wherein the target data is data meeting a counting condition in all to-be-counted data contained in the target database; generating a plurality of counting tasks according to the index range; wherein each counting task is used for counting the row number of the target data in a partial index range; distributing the plurality of counting tasks to at least one thread created in advance for processing to obtain a plurality of counting results; and adding the plurality of counting results to obtain a target counting result of the row number of the target data. Through implementation of the method, the counting speed of the row number of data meeting the counting condition can be improved for a large database with a data volume of ten million or more when the index cannot be compressed.