Window query method in P2P environment

A query method and technology of P2P network, applied in the field of window query in P2P environment, can solve the problem that nodes cannot manage data autonomously, achieve the effect of good performance and avoid flooding

Inactive Publication Date: 2011-06-01
ZHEJIANG UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] With the rise of P2P networks, the demand for distributed query and indexing of high-dimensional data is more obvious, but most of the applications and research are still limited to structured P2P networks, which leads to the shortcomings of nodes not being able to manage data autonomously.

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
  • Window query method in P2P environment
  • Window query method in P2P environment
  • Window query method in P2P environment

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] The present invention will now be further described in conjunction with the accompanying drawings and specific embodiments.

[0025] The concrete implementation process and working principle of the present invention are as follows:

[0026] 1) Select a super-peer P2P network with a centralized network and a completely unstructured network as the underlying network foundation;

[0027] 2) On each individual network node, the data is mapped to a one-dimensional space through a dimensionality reduction algorithm;

[0028] 3) Construct the statistical information table of the data and construct the network query tree on the super node;

[0029] 4) When a node P initiates a query request, the query q is sent to the super node where the node P is located, and the super node completes the query internally;

[0030] 5) The super node queries the data of other connected super nodes and returns the result.

[0031] The network structure in step 1) is as figure 1 As shown, eac...

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 window query method in P2P environment. The window query method can be constructed on the network structure by utilizing the advantages possessed by centralized network and completely unstructured network simultaneously by the super node P2P network; on each individual network node, data are mapped to a one-dimensional space by the dimension-reduction algorithm iMinMax, and the values after mapping can be stored and queried by B+ tree and other traditional DBMS index structures; then a data statistic information sheet is built and a network query tree is constructed on each super node; and when the node P transmits a query request, firstly, the query request is transmitted to the super node to which P belongs, then the super node finishes querying internally according to the data statistic information sheet, and transmits the query to other super nodes according to the network query tree to finish the query of the whole network ultimately, and finally the query results are returned to P. The method can effectively avoid network flooding and can query the returned data efficiently.

Description

technical field [0001] The invention relates to multimedia, web and other high-dimensional data mapping and query technologies, and super node P2P network technology, in particular to a window query method in a P2P environment. Background technique [0002] With the development of multimedia, web and other technologies, new database applications have emerged, including content-based video and audio retrieval, streaming data matching, digital image processing, text processing, etc. The basic operations of query and matching on these high-dimensional data can be summarized into three categories: similar range query, k-NN (k-Nearest Neighbor) query, and window-based range query. Among them, the similar range query and k-NN query are mainly used to find similar objects in high-dimensional databases (for example, to find the 10 banks closest to the school or the bus stop within 1 kilometer, etc.). Window-based range query is mainly to filter out window data based on data attribu...

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): G06F17/30H04L29/08
CPCY02A10/40
Inventor 寿黎但胡天磊陈珂陈刚汤天亮
Owner ZHEJIANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products