An efficient RDF data storage and query system
A data storage and query system technology, applied in database indexing, structured data retrieval, etc., can solve problems such as slow query speed, improve query efficiency, and speed up query performance.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0033] HTStore is a graph-based triple system that can dynamically support RDF data storage and SPARQL query. In the HTStore system, RDF data is stored in the form of an adjacency list, and at the same time, the embodiment of the present invention also establishes a hash index according to the vertices of the RDF graph.
[0034] The main advantage of hash index is fast retrieval, especially when the amount of data is large. However, there are some inherent defects in the traditional hash index, therefore, the embodiment of the present invention needs to improve the index structure.
[0035] In the RDF data storage and query system constructed in the embodiment of the present invention, a composite index structure including a hash table and a hash tree is used to store RDF data. Hash tables are built for fast access, while hash trees are built to efficiently resolve hash collisions.
[0036] Next, the embodiment of the present invention will describe the design of the HTStore...
Embodiment 2
[0045] Combine below Figure 1-Figure 6 Carry out feasibility verification to the scheme in embodiment 1, see the following description for details:
[0046] see figure 1 , is an index graph of a system that supports RDF storage and SPARQL query, wherein RDF data can be regarded as an RDF graph, and the embodiment of the present invention creates an index for each node in the graph to speed up the query.
[0047] see figure 2 , which are the different situations that may arise from inserting a node in an index. The first case means that there is an empty position in the corresponding position of the hash table, and the insertion is successful. The second case indicates that the location of the hash table is occupied, but the root node of the hash tree is not occupied, then the root node of the tree is created and the insertion is successful. The third case indicates that the location of the hash table has been occupied and the root node of the hash tree has also been esta...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com