DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cho, HJ | ko |
dc.contributor.author | Min, JK | ko |
dc.contributor.author | Chung, Chin-Wan | ko |
dc.date.accessioned | 2013-03-05T02:55:05Z | - |
dc.date.available | 2013-03-05T02:55:05Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2004-03 | - |
dc.identifier.citation | INFORMATION AND SOFTWARE TECHNOLOGY, v.46, no.4, pp.229 - 241 | - |
dc.identifier.issn | 0950-5849 | - |
dc.identifier.uri | http://hdl.handle.net/10203/85150 | - |
dc.description.abstract | Many spatio-temporal access methods, such as the HR-tree, the 3DR-tree, and the MV3R-tree, have been proposed for timestamp and interval queries. However, these access methods have the following problems: the poor performance of the 3DR-tree for timestamp queries, the huge size and the poor performance of the HR-tree for interval queries, and the large size and the high update cost of the MV3R-tree. We address these problems by proposing an adaptive partitioning technique called the Adaptive Partitioned R-tree (APR-tree) using workloads with timestamp and interval queries. The APR-tree adaptively partitions the time domain using query workloads. Since the time domain of the APR-tree is automatically fitted to query workloads, the APR-tree outperforms the other access methods for various query workloads. The size of the APR-tree is on the average 1.3 times larger than that of the 3DR-tree which has the smallest size. The update cost of the APR-tree is on the average similar to that of the 3DR-tree which has the smallest update cost. (C) 2003 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | An adaptive indexing technique using spatio-temporal query workloads | - |
dc.type | Article | - |
dc.identifier.wosid | 000189098400003 | - |
dc.identifier.scopusid | 2-s2.0-0742307217 | - |
dc.type.rims | ART | - |
dc.citation.volume | 46 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 229 | - |
dc.citation.endingpage | 241 | - |
dc.citation.publicationname | INFORMATION AND SOFTWARE TECHNOLOGY | - |
dc.identifier.doi | 10.1016/j.infsof.2003.07.001 | - |
dc.contributor.localauthor | Chung, Chin-Wan | - |
dc.contributor.nonIdAuthor | Cho, HJ | - |
dc.contributor.nonIdAuthor | Min, JK | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | spatio-temporal databases | - |
dc.subject.keywordAuthor | indexing technique | - |
dc.subject.keywordAuthor | R-trees | - |
dc.subject.keywordAuthor | timestamp and interval queries | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.