Log Querying via Precomputed Addressing Information
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for querying log information from large databases are inefficient due to the time-consuming process of matching each piece of log information with a keyword, leading to lower inquiry efficiency.
Innovation Solution
A method that involves acquiring a log identifier from a log query request, determining log addressing information including a storage cluster identifier, location information, and number of log entries, and directly querying the corresponding log information from log storage clusters based on this information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If keyword matching is used to retrieve log information from a database, then the system can handle large volumes of log data, but the query time increases significantly
Solution Approach 1:
The patent pre-computes and stores addressing information (hash values, storage cluster identifiers, partition locations) for each log entry during the log writing phase. This preliminary action enables direct location of log data without performing keyword matching during queries, thus resolving the contradiction between handling large log volumes and maintaining fast query performance
Solution Approach 2:
The patent introduces an addressing information structure as an intermediary between the log data and the query operation. This intermediary contains pre-computed hash values and location pointers that enable direct access to log entries, eliminating the need for time-consuming keyword matching while preserving the ability to handle large-scale log data
2Ease of operation
If keyword matching is performed on each log information piece, then comprehensive search results can be obtained, but the inquiry efficiency decreases
Solution Approach 1:
The system pre-computes hash values and storing location information for each log entry during data ingestion. This preliminary action creates direct access paths that maintain search comprehensiveness while dramatically improving inquiry efficiency by eliminating the need for runtime keyword matching across all log entries
Solution Approach 2:
The patent creates a compact addressing information structure that copies essential location metadata (hash values, cluster IDs, partition offsets) separately from the actual log data. This copying approach enables efficient direct access to log entries while maintaining the completeness of search capabilities
Data Source
AI summary
Embodiments of the present disclosure provide a method for querying log information and a device, which includes: in response to receiving a log query request directed to a plurality of log storage clusters, acquiring a log identifier corresponding to the log query request, in which each of the log storage clusters includes a plurality of storage partitions, each of the storage partitions stores multiple pieces of log information; determining log addressing information corresponding to the log identifier, in which the log addressing information includes a storage cluster identifier, location information of the storage partition to which the corresponding piece of log information belongs, a number of the pieces of log information, location information of the corresponding piece of log information in the corresponding storage partition; querying the corresponding piece of log information corresponding to the log query request from the log storage clusters according to the log addressing information.