|
ホウチン テルヒサ
Teruhisa Hochin
寶珍 輝尚 所属 追手門学院大学 理工学部 情報工学科 職種 教授 |
|
| 言語種別 | 英語 |
| 発行・発表の年月 | 1998 |
| 形態種別 | 論文 |
| 査読 | 査読あり |
| 標題 | Storage structure for graph-oriented databases using an array of element types |
| 執筆形態 | 共著・編著（代表編著を除く） |
| 掲載誌名 | Proceedings of the IEEE Great Lakes Symposium on VLSI |
| 掲載区分 | 国外 |
| 出版社・発行元 | IEEE COMPUTER SOC |
| 巻・号・頁 | pp.452-457 |
| 担当区分 | 筆頭著者,責任著者 |
| 著者・共著者 | Teruhisa Hochin,Tatsuo Tsuji |
| 概要 | This paper proposes a storage structure for graph-oriented databases called the flattened separable directory method. In this method, a data representing graph, which is a unit of representing graph, is primarily represented with an array of edge or node types. As every node or edge can be accessed without navigation, the values of nodes and/or edges can be quickly evaluated. Experimental evaluations support this characteristics, and clarify that the performance of inserting data is high, and less storage overhead is needed in the case of the graphs consisting of many node and edge types. |
| DOI | 10.1109/GLSV.1998.665346 |
| ISSN | 1066-1395 |
| DBLP ID | conf/glvlsi/HochinT98 |
| PermalinkURL | https://dblp.uni-trier.de/rec/conf/glvlsi/1998 |
| researchmap用URL | https://dblp.uni-trier.de/db/conf/glvlsi/glvlsi1998.html#HochinT98 |