| Item type |
SIG Technical Reports(1) |
| 公開日 |
2000-07-26 |
| タイトル |
|
|
タイトル |
コンティニュアス・データベースを対象とする最適コンピュータ資源割り当て |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Optimal Computer Resource Allocation for Continues Media Database |
| 言語 |
|
|
言語 |
jpn |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
神奈川工科大学情報工学科 |
| 著者所属 |
|
|
|
神奈川工科大学情報工学科 |
| 著者所属(英) |
|
|
|
en |
|
|
Kanagawa Institute of Technology Department of Information & Computer Sciences |
| 著者所属(英) |
|
|
|
en |
|
|
Kanagawa Institute of Technology Department of Information & Computer Sciences |
| 著者名 |
陳, 幸
清木, 康
|
| 著者名(英) |
Xing, Chen
Yasushi, Kiyoki
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
In this paper we apply a stream-oriented database processing scheme for the continues media processing. We focus on the presentation operations for the continues media data. In this kind of processing database operations are repeatedly executed. For example in the case that several music data streams are presented simultaneously as that stream-A and stream-B are presented as the background music stream-C is presented as the main melody music. It is clear that when the background music is repeated the database operation for processing the background music must be repeatedly executed. It is shown in this paper that the overhead of the re-execution can be reduced by optimal memory resources allocation. Therefore we introduce an optimal memory allocation method. A heuristics is utilized in the method. Based on the heuristics the calculation complexity of the method is reduced. We also discuss the property of the method and show several calculration examples to clarify the efficiency of the method. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
In this paper, we apply a stream-oriented database processing scheme for the continues media processing. We focus on the presentation operations for the continues media data. In this kind of processing, database operations are repeatedly executed. For example, in the case that several music data streams are presented simultaneously, as that, stream-A and stream-B are presented as the background music, stream-C is presented as the main melody music. It is clear that when the background music is repeated, the database operation for processing the background music must be repeatedly executed. It is shown in this paper that the overhead of the re-execution can be reduced by optimal memory resources allocation. Therefore, we introduce an optimal memory allocation method. A heuristics is utilized in the method. Based on the heuristics, the calculation complexity of the method is reduced. We also discuss the property of the method and show several calculration examples to clarify the efficiency of the method. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AN10112482 |
| 書誌情報 |
情報処理学会研究報告データベースシステム（DBS）
巻 2000,
号 69(2000-DBS-122),
p. 97-103,
発行日 2000-07-26
|
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-DBS00122013 (547.0 kB)
