Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Time sequence data similarity query method based on memory calculation

A technology of time series and query methods, which is applied in computing, electrical digital data processing, special data processing applications, etc. It can solve the problems of increasing query delay and reducing query efficiency, achieving low space overhead and maintenance costs, and high query accuracy , Efficient time series similarity query effect

Active Publication Date: 2018-09-18
ANHUI UNIVERSITY OF TECHNOLOGY +1
View PDF5 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

According to whether the representation method satisfies the triangle inequality, it can be judged whether the method can build an index, and the representation method that cannot build an index will reduce the query efficiency and increase the query delay

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
  • Time sequence data similarity query method based on memory calculation
  • Time sequence data similarity query method based on memory calculation
  • Time sequence data similarity query method based on memory calculation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0067] to combine figure 1 , a time series data similarity query method based on memory computing in this embodiment uses a cluster composed of distributed computing nodes, stores data through memory, and expands the computing power of the cluster by expanding distributed nodes. In this embodiment, time-series data is allocated to computing nodes according to corresponding steps, and index resident memory is formed according to corresponding steps. After the cluster receives a search request, each computing node is scheduled to search according to corresponding steps. The partitioning and index construction of each node's data are performed in local memory, and can communicate with other nodes or overall external submodules to aggregate, move and process data. The query process reads data on some of the nodes, guided by an in-memory index, eliminating the need to scan the entire cluster. This embodiment specifically includes the following steps:

[0068] (1) Data preprocessi...

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 time sequence data similarity query method based on memory calculation, and belongs to the technical fields of distributed databases, memory calculation and information retrieval. According to the method, a cluster composed of distributed calculation nodes is used, data are stored through memory, and cluster calculation ability is expanded through expanding the distributed nodes; time sequence data are allocated to the calculation nodes, index resident memory is formed, and each calculation node is scheduled for searching after the cluster receives a searching request; partitioning and indexing of data of each node are all carried out in local memory, and communication can be carried out with the other nodes or overall external sub-modules; and data can be read atpartial nodes in a query process through guiding of an index residing in the memory without the need for scanning the entire cluster. For a time sequence given by a user at will, the method can quickly find out most of similar sequences from the cluster using the memory in a large scale for calculation.

Description

technical field [0001] The invention relates to the technical fields of distributed databases, memory computing and information retrieval, in particular to a time series data similarity query method based on memory computing. Background technique [0002] Time is a natural description of the objective existence of things, and almost all things have invisible or explicit time attributes. As the medium of this description, time-series data refers to a set of data arranged in chronological order, which has been widely used in various fields, such as exchange rate data in the foreign exchange financial market, temperature data in weather forecasts, and urban demographic data. , and genetic data in biomedicine, etc. [0003] The similarity query of time series is to find similar change patterns in time series data sets. It is an important query mode and has great significance for the classification, prediction and knowledge discovery of sequence data. According to different tec...

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
IPC IPC(8): G06F17/30
Inventor 秦锋茆凯成郑啸
Owner ANHUI UNIVERSITY OF TECHNOLOGY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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