International Journal of Contents

  • 제5권1호
  • /
  • Pages.46-50
  • /
  • 2009
  • /
  • 1738-6764(pISSN)
  • /
  • 2093-7504(eISSN)
한국콘텐츠학회 (The Korea Contents Association)
권호 표지
DOI QR코드

DOI QR Code

Efficient Data Management in RFID Applications

  • Cho, Yong-Jun (Department of Computer and Communication Engineering Chungbuk National University) ;
  • Bok, Kyoung-Soo (Department of Computer and Communication Engineering Chungbuk National University) ;
  • Park, Yong-Hun (Department of Computer and Communication Engineering Chungbuk National University) ;
  • Park, Hyeong-Soon (Department of Computer and Communication Engineering Chungbuk National University) ;
  • Park, Jun-Ho (Department of Computer and Communication Engineering Chungbuk National University) ;
  • Kang, Tae-Ho (Department of Computer and Communication Engineering Chungbuk National University) ;
  • Kim, Hak-Yong (Department of Biochiemistry Chungbuk National University) ;
  • Yoo, Jae-Soo (Department of Computer and Communication Engineering Chungbuk National University)
  • 발행 : 2009.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Logistics is in the limelight as one of a variety of RFID applications. The RFID technology is actively being applied to improve the competitiveness power of companies through the synthetic management of products and information. The RFID system generates large volume of stream data. It has problems which occur waste of storage and long processing time when storing large data and processing queries. Recently, many studies have been done to solve the problems which are generated in RFID system. In this thesis, we propose an efficient data management scheme for path queries and containment queries which are occurred frequently. The proposed data management scheme considers a change of the containment of products during a transport and supports a path of changed products by representing a path of various containments. Also, the compression utilizing the structure of supply chain reduces the stored data volumes. In order to show the superiority of our approach, we compare it with the existing schemes. As a result, our experimental results show that our scheme outperforms the existing scheme in terms of storage efficiency and query processing time.

키워드

참고문헌

  1. F. Wang and P. Liu, "Temporal Management of RFID Data" Proc. International Conference Vary Large Data Bases, 2005, pp.1128-1139.
  2. H. Gonzalez, J. Han, X. Li and D. Klabjan, "Warehousing and Analyzing Massive RFID Data Sets", Proc. International Conference on Data Engineering, 2006, pp.83-83. https://doi.org/10.1109/ICDE.2006.171
  3. D. Lin, H.G. Elmongui, E. Berino and B.C. Ooi, "Data Management in RFID Applications", Proc. Database and Expert Systems Applications, 2007, pp.434-444. https://doi.org/10.1007/978-3-540-74469-6_43
  4. C.H. Ban, B.H. Hong, and D.H. Kim, "Time Parameterized Interval R-Tree for Tracing Tags in RFID Systems" Proc. Database and Expert Systems Applications, 2005, pp.503-513.
  5. J. Han, H. Gonzalez, X. Li, and D. Klabjan, "Warehousing and Mining Massive RFID Data Sets" Proc. International Conference on Advanced Data Mining and Applications, 2006, pp.1-18. https://doi.org/10.1007/11811305_1
  6. Y. Hu, S. Sundara, T. Chorma, and J. Srinivasan, "Supporting RFID-based Item Tracking Applications in Oracle OBMS Using a Bitmap Datatype" Proc. International Conference on Very Large Data Bases, 2005, pp.1140-1151.