Unlock instant, AI-driven research and patent intelligence for your innovation.

B+ tree temporal query method based on hash strategy

A query method and B+ tree technology, applied in the field of data query, can solve problems such as low efficiency, achieve the effects of shortening depth, facilitating data storage, and realizing data search

Active Publication Date: 2019-05-14
THE 41ST INST OF CHINA ELECTRONICS TECH GRP
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In addition, the search of existing solutions is mostly a top-to-bottom traversal method, which is inefficient

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • B+ tree temporal query method based on hash strategy
  • B+ tree temporal query method based on hash strategy
  • B+ tree temporal query method based on hash strategy

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] The present invention will be further described below in conjunction with the drawings and embodiments.

[0037] The B+ tree temporal query method based on hash strategy includes the following steps:

[0038] Step 1: Add temporal information to a simple XML document;

[0039] Step 2: Build an XML document tree with temporal information added;

[0040] Step 3: Construct a temporal B+ tree of XML documents according to the XML document tree of Step 2, and add hash variables to the leaf nodes of the B+ tree;

[0041] Step 4: Use a hash algorithm on the leaf nodes of the B+ tree to find XML elements.

[0042] Here is an example to illustrate this method:

[0043]

[0044] XML

[0045]

[0046] Anne

[0047]

[0048] 2015

[0049]

[0050] A1

[0051] B1

[0052]

[0053]

[0054] The above is a traditional simple XML document, add temporal information (start, end) to the XML document, as shown below:

[0055] (10)

[0056] (20)XML(30) (40)

[0057] (50)

[0058] (60)Anne(70) (80)

[00...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a B+ tree temporal query method based on a hash strategy, comprising the following steps: Step 1, adding temporal information in an XML document; Step 2, constructing an XML document tree adding temporal information; Step 3, according to the step The second XML document tree constructs a temporal B+ tree of the XML document, and adds a hash variable to the leaf node of the B+ tree; Step 4, uses a hash algorithm on the leaf node of the B+ tree to find the XML element. Based on B+ tree management of time information in XML data, B+ tree only saves information in leaf nodes and does not search for useless nodes. Use the Hash algorithm in the leaf node to find the element value of the page node. The time complexity of Hash search is 0(1), and the speed is very fast.

Description

Technical field [0001] The invention relates to the technical field of data query, in particular to a B+ tree temporal query method based on a hash strategy. Background technique [0002] Most existing databases have temporal characteristics, but traditional databases store and manage time data as the value of a field, which only reflects the information state of the data at a certain moment. Current databases cannot well support the over-finding of time fields, so Poor support for temporal data. With the deepening and development of database and cloud technologies, big data is facing many new references and demands. Temporal information processing is becoming increasingly important, and temporal information will play a more important role. [0003] XML (extensible makeup language, extensible markup language) is a markup language. Compared with HTML, XML has many advantages: (1) XML is self-descriptive and can define its own markup set to describe the content of the document; 2) ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06F16/22G06F16/81G06F16/835
CPCG06F16/2246G06F16/81G06F16/835
Inventor 王天罡吴恒奎
Owner THE 41ST INST OF CHINA ELECTRONICS TECH GRP