ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 論文誌(トランザクション)
  2. データベース(TOD)[電子情報通信学会データ工学研究専門委員会共同編集]
  3. Vol.1
  4. No.3

An Incremental Maintenance Scheme of Data Cubes and Its Evaluation

https://ipsj.ixsq.nii.ac.jp/records/17375
https://ipsj.ixsq.nii.ac.jp/records/17375
59b3db88-3c36-43da-9102-a81c5c367627
名前 / ファイル ライセンス アクション
IPSJ-TOD0103005.pdf IPSJ-TOD0103005.pdf (1.4 MB)
Copyright (c) 2008 by the Information Processing Society of Japan
オープンアクセス
Item type Trans(1)
公開日 2008-12-26
タイトル
タイトル An Incremental Maintenance Scheme of Data Cubes and Its Evaluation
タイトル
言語 en
タイトル An Incremental Maintenance Scheme of Data Cubes and Its Evaluation
言語
言語 eng
キーワード
主題Scheme Other
主題 研究論文
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者所属
Graduate School of Engineering University of Fukui
著者所属
Graduate School of Engineering University of Fukui
著者所属
Graduate School of Engineering University of Fukui
著者所属(英)
en
Graduate School of Engineering, University of Fukui
著者所属(英)
en
Graduate School of Engineering, University of Fukui
著者所属(英)
en
Graduate School of Engineering, University of Fukui
著者名 Dong, Jin Tatsuo, Tsuji Ken, Higuchi

× Dong, Jin Tatsuo, Tsuji Ken, Higuchi

Dong, Jin
Tatsuo, Tsuji
Ken, Higuchi

Search repository
著者名(英) Dong, Jin Tatsuo, Tsuji Ken, Higuchi

× Dong, Jin Tatsuo, Tsuji Ken, Higuchi

en Dong, Jin
Tatsuo, Tsuji
Ken, Higuchi

Search repository
論文抄録
内容記述タイプ Other
内容記述 Data cube construction is a commonly used operation in data warehouses. Since both the volume of data stored and analyzed in a data warehouse and the amount of computation involved in data cube construction are very large incremental maintenance of data cube is really effective. In this paper we employ an extendible multidimensional array model to maintain data cubes. Such an array enables incremental cube maintenance without relocating any data dumped at an earlier time while computing the data cube efficiently by utilizing the fast random accessing capability of arrays. In this paper we first present our data cube scheme and related maintenance methods and then present the corresponding physical implementation scheme. We developed a prototype system based on the physical implementation scheme and performed evaluation experiments based on the prototype system.
論文抄録(英)
内容記述タイプ Other
内容記述 Data cube construction is a commonly used operation in data warehouses. Since both the volume of data stored and analyzed in a data warehouse and the amount of computation involved in data cube construction are very large, incremental maintenance of data cube is really effective. In this paper, we employ an extendible multidimensional array model to maintain data cubes. Such an array enables incremental cube maintenance without relocating any data dumped at an earlier time, while computing the data cube efficiently by utilizing the fast random accessing capability of arrays. In this paper, we first present our data cube scheme and related maintenance methods, and then present the corresponding physical implementation scheme. We developed a prototype system based on the physical implementation scheme and performed evaluation experiments based on the prototype system.
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA11464847
書誌情報 情報処理学会論文誌データベース(TOD)

巻 1, 号 3, p. 36-48, 発行日 2008-12-26
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-7799
出版者
言語 ja
出版者 情報処理学会
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-22 23:22:15.962204
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3