Presentation 2012-11-16
Considering HTable Table Design for Efficient Attribute Search
Masahide NAKAMURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Our long-term goal is to establish a generic datastore and a service platform for bigdata where heterogeneous applications can share and use the bigdata horizontally. The emerging key-value store (KVS), including HBase, has been proven to be useful for managing the bigdata. However, design of a KVS-based datastore often depends heavily on the application how the data is used and searched. This significantly declines generality and extensibility of the datastore. In this paper, we present a design method of HBase tables that achieves generic data search by various attributes. The key idea is to construct an index table in which all permutations of attribute values are used as row keys, pointing to contents of a main data table. The index table allows efficient data retrieval by any attribute specified by applications. A case study using smart city log illustrates practical feasibility of the method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) life log / mash up / common data model / service API
Paper # SC2012-12
Date of Issue

Conference Information
Committee SC
Conference Date 2012/11/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Vice Chair

Paper Information
Registration To Services Computing (SC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Considering HTable Table Design for Efficient Attribute Search
Sub Title (in English)
Keyword(1) life log
Keyword(2) mash up
Keyword(3) common data model
Keyword(4) service API
1st Author's Name Masahide NAKAMURA
1st Author's Affiliation Graduate School of System Informatics, Kobe University()
Date 2012-11-16
Paper # SC2012-12
Volume (vol) vol.112
Number (no) 299
Page pp.pp.-
#Pages 6
Date of Issue