Query method of resource allocation problem in high-dimensional environment

A resource allocation and query method technology, which is applied in the query field of resource allocation problems in a high-dimensional environment, can solve problems such as speeding up query difficulty, and achieve good performance.

Inactive Publication Date: 2012-07-25
ZHEJIANG UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Due to the existence of these problems, it is more difficult to build indexes for this complex type of data to speed up queries

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
  • Query method of resource allocation problem in high-dimensional environment
  • Query method of resource allocation problem in high-dimensional environment
  • Query method of resource allocation problem in high-dimensional environment

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

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

[0024] The specific implementation process and working principle of the present invention, such as figure 1 Shown:

[0025] 1) Each object is represented by a high-dimensional point in a high-dimensional environment and two additional parameters;

[0026] 2) Convert the high-dimensional point corresponding to each object obtained in step 1) into a one-dimensional key value through a dimensionality reduction method;

[0027] 3) use B + The tree method indexes the one-dimensional key values ​​and additional parameters corresponding to all objects obtained in step 1) and step 2) in memory;

[0028] 4) Before query processing, according to the query conditions of the query object, the resource allocation problem is transformed into a one-dimensional key-value interval;

[0029] 5) During query processing, use the "best first" method to access the...

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 query method of resource allocation problem in high-dimensional environment. The method comprises representing each object by one high-dimensional point in the high-dimensional environment and two additional parameters; mapping the high-dimensional point corresponding to each object to a key value in a one-dimensional space by a dimension reduction technique, and indexing the one-dimensional key values and additional parameters corresponding to all objects into a memory by use of a B+tree; converting the resource allocation problem to a key value interval in the one-dimensional space according to query conditions of a query object of the resource allocation problem before query treatment; and accessing the B+tree by adopting a best-first method, controlling the access stop time of the B+tree according to an allocation mark value, and stopping query. According to the invention, the method is very convenient and quick in querying the resource allocation problemby using the existing search and the realized results of database and information retrieval based on the extension and fusion of the existing dimension reduction methods, thereby providing the best performance.

Description

technical field [0001] The invention relates to a database system, information retrieval, high-dimensional data mapping and query technology, in particular to a query method for resource allocation problems in a high-dimensional environment. Background technique [0002] In more and more applications, the server allocates resources to users according to their own requirements and preferences. This includes online matchmaking sites, home exchange services, and job search sites. This type of resource allocation problem usually specifies a query object. The query object contains a certain number of its own attribute parameters, and at the same time, it also contains a series of requirements. Furthermore, each object in the database also has a certain number of its own attribute parameters and a series of conditions for each other. [0003] Different from traditional query types, for example, area query only needs to determine whether the object in the database is in the quer...

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 Applications(China)
IPC IPC(8): G06F17/30
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap