A Scalable and High-efficiency Discovery Service Using a New Storage

2013 
Discovery Service (DS), used to trace the movement of objects along supply chains, is an important component of the Internet of Things (IoT). DS is faced with the challenge of huge volume of data as well as large amount of parallel requests of discovery and publish. This paper proposes a new central-indexing DS system using distributed NOSQL database HBase to better support big data and parallel processing. A new storage schema of DS data is designed to optimize the discovery efficiency of DS records. The new storage schema uses object ID as row key, event timestamp as column identifier and event index content as cell value. The typical recursive discovery algorithm, which is needed in DS but often neglected in previous works, is specified to realize the full tracing of object's movement. A prototype of the DS system proposed is implemented. The experiments show that the number of concurrent discoveries the proposed DS can handle per second is about 200 times that of the DS based on RDBMS, and the number of concurrent publishes the proposed DS can process per second is about five times that of the DS based on RDBMS.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    6
    References
    7
    Citations
    NaN
    KQI
    []