Subsequence matching method using duality in constructing windows in time-series databases

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 494
  • Download : 0
DC FieldValueLanguage
dc.contributor.author황규영ko
dc.date.accessioned2017-12-20T11:13:37Z-
dc.date.available2017-12-20T11:13:37Z-
dc.date.issued2002-12-17-
dc.identifier.urihttp://hdl.handle.net/10203/233629-
dc.description.abstractA subsequence matching method in time-series databases, reduces the number of points stored in the multidimensional index and can store individual points directly in the index by dividing the data sequence into disjoint windows using duality in constructing windows. The method reduces false alarms and improves performance by searching the index using the individual points that represent sliding windows of the query sequence and by comparing the points used in the query and the points stored in the index. Moreover, the method can create the index much faster than the previous method by reducing the number of calls to the feature extraction function that is a major part of CPU overhead in the index creation.-
dc.titleSubsequence matching method using duality in constructing windows in time-series databases-
dc.typePatent-
dc.type.rimsPAT-
dc.contributor.localauthor황규영-
dc.contributor.assigneeKAIST-
dc.identifier.iprsType특허-
dc.identifier.patentApplicationNumber09559673-
dc.identifier.patentRegistrationNumber6496817-
dc.date.application2000-04-27-
dc.date.registration2002-12-17-
dc.publisher.countryUS-
Appears in Collection
CS-Patent(특허)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0