Prefetching RDF Triple Data via Weighted Pattern Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing technologies are inefficient in optimizing the query process for RDF triple data due to high IO costs associated with large data storage, as they lack effective methods for prefetching data into easily accessible buffers, particularly in the context of RDF data's unique triple format.
Innovation Solution
A method and apparatus for selectively prefetching RDF triples into a buffer by converting query requests into weighted elementary patterns, computing their occurrence frequency, and prefaching those with higher frequencies, thereby reducing IO costs and improving query efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If RDF triple data are stored in a database using traditional storage methods, then storage space is saved through compression, but query efficiency deteriorates due to high IO costs when accessing large volumes of data
Solution Approach 1:
The patent applies preliminary action by prefetching RDF triples into a buffer before they are actually needed for query processing. The system analyzes query patterns, identifies frequently accessed triples, and pre-loads them into memory buffer, thereby reducing IO costs during actual query execution and improving overall query efficiency while maintaining compressed storage
2Productivity
If all RDF triples are loaded into buffer for fast access, then query efficiency is improved, but memory consumption increases excessively
Solution Approach 1:
The patent applies local quality by selectively loading only the frequently accessed RDF triples into the buffer based on query pattern analysis, rather than loading all triples uniformly. This targeted approach ensures that the buffer contains high-value data that will actually be used, optimizing memory utilization while maintaining query efficiency
Solution Approach 2:
The patent applies partial action by loading only a subset of RDF triples into the buffer - specifically those that are frequently accessed according to query pattern analysis. This partial loading strategy avoids the excessive memory consumption of loading all triples while still providing sufficient buffer content to improve query performance for the majority of access patterns
3Quantity of substance
If RDF data are stored in compressed format, then storage efficiency is improved, but data access speed deteriorates due to decompression overhead
Solution Approach 1:
The patent applies preliminary action by pre-decompressing frequently accessed RDF triples and storing them in an uncompressed format within the buffer. This allows fast access to hot data without decompression overhead, while the majority of data remains compressed in storage. The system dynamically manages the buffer to maintain uncompressed copies of frequently accessed triples
Data Source
AI summary
Query requests for RDF triples are obtained, wherein the query request(s) contain(s) at least one triple pattern; for each triple pattern, the corresponding elementary pattern is determined, and each triple pattern is converted to a weighted elementary pattern. The occurrence frequency of each elementary pattern is computed based on the weighted elementary patterns; at least one elementary pattern is chosen at least according to the occurrence frequency; and the RDF triples corresponding to the chosen at least elementary pattern are prefetched into the buffer. The corresponding apparatus is also provided. With the above method and apparatus, the frequently accessed RDF triples can be determined and prefetched into the buffer, which improves the query efficiency.