DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, JS | ko |
dc.contributor.author | Kang, ST | ko |
dc.contributor.author | Kim, Myoung Ho | ko |
dc.date.accessioned | 2007-11-19T02:32:04Z | - |
dc.date.available | 2007-11-19T02:32:04Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1999-09 | - |
dc.identifier.citation | INFORMATION PROCESSING LETTERS, v.71, no.5-6, pp.213 - 220 | - |
dc.identifier.issn | 0020-0190 | - |
dc.identifier.uri | http://hdl.handle.net/10203/2001 | - |
dc.description.abstract | Temporal aggregation is an extension of conventional aggregate on the domain and range of aggregates to include the time concept. In this paper, we propose a new tree-based temporal aggregation processing method. The time complexity of the proposed method is better than those of the existing methods. The experimental results indicate that our proposed method ourperforms the existing methods. (C) 1999 Elsevier Science B.V. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | On temporal aggregate processing based on time points | - |
dc.type | Article | - |
dc.identifier.wosid | 000084030000008 | - |
dc.identifier.scopusid | 2-s2.0-0033357347 | - |
dc.type.rims | ART | - |
dc.citation.volume | 71 | - |
dc.citation.issue | 5-6 | - |
dc.citation.beginningpage | 213 | - |
dc.citation.endingpage | 220 | - |
dc.citation.publicationname | INFORMATION PROCESSING LETTERS | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Myoung Ho | - |
dc.contributor.nonIdAuthor | Kim, JS | - |
dc.contributor.nonIdAuthor | Kang, ST | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | data structures | - |
dc.subject.keywordAuthor | temporal databases | - |
dc.subject.keywordAuthor | temporal aggregation | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.