DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chung, Chin-Wan | ko |
dc.contributor.author | Choi, Sunghee | ko |
dc.contributor.author | Choi, Y | ko |
dc.date.accessioned | 2011-02-14 | - |
dc.date.available | 2011-02-14 | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2005-03 | - |
dc.identifier.citation | COMPUTER SYSTEMS SCIENCE AND ENGINEERING, v.20, pp.107 - 115 | - |
dc.identifier.issn | 0267-6192 | - |
dc.identifier.uri | http://hdl.handle.net/10203/22081 | - |
dc.description.abstract | In recent years, spatio-temporal databases have been studied intensively. This paper proposes how to process k closest pair queries in spatio-temporal databases for the first time. A spatio-temporal k closest pair query continuously searches the k closest pairs between a set of spatial objects and a set of moving objects for a specified time interval of the query. To maintain the order of the kclosest pairs, we use a time function that can represent the change in distance between a spatial object and a moving object as time passes. For efficient processing of k closest pair queries, we present an event-based structure, instead of a simple split list structure to avoid unnecessary computations, along with a distance bound used to prune unnecessary node accesses. Our event-based method is 9 to 43 times faster, compared to a method using a simple split list structure. Also, our event-based structure can be applied to process spatio-temporal k nearest neighbor queries. In various experiments, our event-based approach is 11 to 46 times faster than an existing approach for processing spatio-temporal k nearest neighbor queries. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | C R L PUBLISHING LTD | - |
dc.subject | MOVING-OBJECTS | - |
dc.title | Closest pair queries in spatio-temporal databases | - |
dc.type | Article | - |
dc.identifier.wosid | 000228597500004 | - |
dc.identifier.scopusid | 2-s2.0-17444389677 | - |
dc.type.rims | ART | - |
dc.citation.volume | 20 | - |
dc.citation.beginningpage | 107 | - |
dc.citation.endingpage | 115 | - |
dc.citation.publicationname | COMPUTER SYSTEMS SCIENCE AND ENGINEERING | - |
dc.contributor.localauthor | Chung, Chin-Wan | - |
dc.contributor.localauthor | Choi, Sunghee | - |
dc.contributor.nonIdAuthor | Choi, Y | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | spatio-temporal databases | - |
dc.subject.keywordAuthor | moving object | - |
dc.subject.keywordAuthor | closest pair query | - |
dc.subject.keywordPlus | MOVING-OBJECTS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.