SwePub
Sök i LIBRIS databas

  Utökad sökning

WFRF:(Risch Tore Professor)
 

Sökning: WFRF:(Risch Tore Professor) > Indexing strategies...

Indexing strategies for time series data

André-Jönsson, Henrik, 1968- (författare)
Linköpings universitet,Institutionen för datavetenskap,Tekniska högskolan
Shahmehri, Nahid, Professor, 1952- (preses)
Linköpings universitet,Databas och informationsteknik,Tekniska fakulteten
Lambrix, Patrick, Professor, 1965- (preses)
Linköpings universitet,Databas och informationsteknik,Tekniska fakulteten
visa fler...
Risch, Tore (preses)
Linköpings universitet,Institutionen för datavetenskap,Tekniska fakulteten
visa färre...
 (creator_code:org_t)
ISBN 9173733466
Linköping : Linköpings universitet, 2002
Engelska 210 s.
Serie: Linköping Studies in Science and Technology. Dissertations, 0345-7524 ; 757
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)
Abstract Ämnesord
Stäng  
  • Traditionally, databases have stored textual data and have been used to store administrative information. The computers used. and more specifically the storage available, have been neither large enough nor fast enough to allow databases to be used for more technical applications. In recent years these two bottlenecks have started to di sappear and there is an increasing interest in using databases to store non-textual data like sensor measurements or other types of process-related data. In a database a sequence of sensor measurements can be represented as a time series. The database can then be queried to find, for instance, subsequences, extrema points, or the points in time at which the time series had a specific value. To make this search efficient, indexing methods are required. Finding appropriate indexing methods is the focus of this thesis.There are two major problems with existing time series indexing strategies: the size of the index structures and the lack of general indexing strategies that are application independent. These problems have been thoroughly researched and solved in the case of text indexing files. We have examined the extent to which text indexing methods can be used for indexing time series.A method for transforming time series into text sequences has been investigated. An investigation was then made on how text indexing methods can be applied on these text sequences. We have examined two well known text indexing methods: the signature files and the B-tree. A study has been made on how these methods can be modified so that they can be used to index time series. We have also developed two new index structures, the signature tree and paged trie structures. For each index structure we have constructed cost and size models. resulting in comparisons between the different approaches.Our tests indicate that the indexing method we have developed. together with the B-tree structure. produces good results. It is possible to search for and find sub-sequences of very large time series efficiently.The thesis also discusses what future issues will have to be investigated for these techniques to be usable in a control system relying on time-series indexing to identify control modes.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

Computer science
Datavetenskap

Publikations- och innehållstyp

vet (ämneskategori)
dok (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy