Journal of KIISE:Databases (한국정보과학회논문지:데이타베이스)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Reordering Scheme of Location Identifiers for Indexing RFID Tags

RFID 태그의 색인을 위한 위치 식별자 재순서 기법

  • 안성우 (부산대학교 컴퓨터공학과) ;
  • 홍봉희 (부산대학교 컴퓨터공학과)
  • Published : 2009.06.15
Download PDF
⟨ Previous Next ⟩

Abstract

Trajectories of RFID tags can be modeled as a line, denoted by tag interval, captured by an RFID reader and indexed in a three-dimensional domain, with the axes being the tag identifier (TID), the location identifier (LID), and the time (TIME). Distribution of tag intervals in the domain space is an important factor for efficient processing of a query for tracing tags and is changed according to arranging coordinates of each domain. Particularly, the arrangement of LIDs in the domain has an effect on the performance of queries retrieving the traces of tags as times goes by because it provides the location information of tags. Therefore, it is necessary to determine the optimal ordering of LIDs in order to perform queries efficiently for retrieving tag intervals from the index. To do this, we propose LID proximity for reordering previously assigned LIDs to new LIDs and define the LID proximity function for storing tag intervals accessed together closely in index nodes when a query is processed. To determine the sequence of LIDs in the domain, we also propose a reordering scheme of LIDs based on LID proximity. Our experiments show that the proposed reordering scheme considerably improves the performance of Queries for tracing tag locations comparing with the previous method of assigning LIDs.

RFID 태그의 시공간 이력정보는 리더에 의해 수집된 선분인 태그간격으로 모델링될 수 있으며, 태그 식별자(TID), 위치 식별자(LID), 시간(TIME)을 축으로 하는 3차원 도메인에서 색인될 수 있다. 도메인 공간에서 태그간격의 분포는 태그 위치추적 질의의 성능을 결정짓는 주요 요소이며 이는 각 도메인 좌표의 정렬에 따라 달라진다. 특히, 시간에 따라 변경되는 태그의 위치 이력을 검색하는 태그 위치추적 질의는 위치정보를 제공하는 LID가 도메인에서 정렬되는 순서에 따라 성능이 달라진다. 따라서, 색인에 저장된 태그간격의 검색 성능 향상을 위해서는 최적의 LID 순서를 결정하는 것이 필요하다. 이를 위하여 이 논문에서는 LID 간의 새로운 순서화 기준으로써 적용하기 위한 LID 근접성을 정의하고, 질의 시 함께 접근되는 태그간격을 색인에서 근접 저장하기 위한 LID 근접성 함수를 제안한다. 또한, 이를 기반으로 이미 부여된 LID의 재순서 기법을 제안한다. 성능 평가 결과 이 논문에서 제안한 LID 재순서 기법을 색인에 적용했을 때 기존의 LID 부여방식보다 월등한 질의 성능 향상을 보여주고 있다.

Keywords

References

  1. Q. Z. Sheng, X. Li, and S. Zeadally, 'Enabling Next-Generation RPID Applications: Solutions and Challenges,' IEEE Computer, Vo1.41(9), pp. 21-28, 2008 https://doi.org/10.1109/MC.2008.386
  2. C. H. Lee and C. W. Chung. 'Efficient Storage Scheme and Query Processing for Supply Chain Management using RFID,' ACM SIGMOD, pp. 291-302, 2008 https://doi.org/10.1145/1376616.1376648
  3. F. Wang and P. Liu, 'Temporal Management of RFID Data,' International Conference on VLDB, pp. 1128-1139, 2005
  4. R. Derakhshan, M. E. Orlowska, and Xue Li, 'RFID Data Management: Challenges and Oppertunities,' IEEE International Conference on RFID, pp. 175-182, 2007 https://doi.org/10.1109/RFID.2007.346166
  5. EPCglobal, http://www.epcglobalinc.org
  6. M. Harrison, 'EPC Information Service - Data Model and Queries,' Technical Report, Auto-ID Center, 2003
  7. EPCglobal, 'EPC Information Services (EPCIS) Specification,' Version 1.0, EPCglobal Inc., 2006
  8. C. H. Ban, B. H. Hong, and D. H. Kim, 'Time Parameterized Interval R-tree for Tracing Tags in RFID Systems,' International Conference on DEXA, pp. 503-513, 2005 https://doi.org/10.1007/11546924_49
  9. Y. Theodoridis, M. Vazirgiannis, and T. Sellis, 'Spatio-Temporal Indexing for Large Multimedia Applications.' International Conference on Multimedia Computing and Systems, pp. 441-448, 1996 https://doi.org/10.1109/MMCS.1996.535011
  10. D. Pfoser, C. S. Jensen, and Y. Theodoridis, 'Novel Approaches to the Indexing of Moving Object Trajectories,' International Conference on VLDB, pp. 395-406, 2000
  11. EPCglobal, 'The EPCglobal Architecture Framework,' EPCglobal Inc., 2005
  12. EPCgloba1, 'EPCTM Radio-Frequency Identity Protocols Class-1 Generation-2 UHF RFID Protocol for Communications at 860 MHz-960MHz,' Version 1.1.0, EPCglobal Inc., 2005
  13. EPCglobal, 'Reader Protocol (RP) Standard,' Version 1.1, Ratified Standard, EPCglobal Inc., 2006
  14. EPCglobal, 'The Application Level Events (ALE) Specification,' Version 1.1, EPCglobal Inc., 2008
  15. T. Brinkhoff and H.-P. Kriegel, 'The Impact of Global Clustering on Spatial Database Systems,' International Conference on VLDB, pp. 168-179, 1994
  16. I. Kamel and C. Faloutsos, 'Hilbert R-tree: An Improved R-tree using Fractals,' International Conference on VLDB Conference, pp. 500-509, 1994
  17. I. Kamel and C. Faloutsos, 'On Packing R-trees,' CIKM, pp. 490-499, 1993 https://doi.org/10.1145/170088.170403
  18. D. S. Cho and B. H. Hong, 'Optimal Page Ordering for Region Queries in Static Spatial Databases,' International Conference on DEXA, pp. 366-375, 2000 https://doi.org/10.1007/3-540-44469-6_34
  19. A. Hutflesz, H.-W. Six, and P. Widmayer, 'Globally Order Preserving Multidimensional Linear Hashing,' ICDE, pp. 572-579, 1988
  20. H. V. Jagadish, 'Linear Clustering of Objects with Multiple Attributes,' ACM SIGMOD, pp. 332-342. 1990 https://doi.org/10.1145/93605.98742
  21. S. S. Skiena, 'The Algorithm Design Manual,' Springer-Verlag, New York Berlin Heidelberg, 1998
  22. N. Beckmann and H. P. Kriegel. 'The R*-tree: An Efficient and Robust Access Method for Points and Rectangles,' ACM SIGMOD, pp. 322-331, 1990 https://doi.org/10.1145/93605.98741
  23. D. Whitley, 'A Genetic Algorithm Tutorial,' Statistics and Computing, Vol.4, pp. 65-85, 1994 https://doi.org/10.1007/BF00175354
  24. K. Marthias and D. Whitley, 'Genetic Operators, the Fitness Landscape and the Traveling Salesman Problem,' Parallel Problem Solving from Nature, pp. 219-228. 1992
  25. D. Whitley and J. Dzebera, 'Advance Correlation Analysis of Operators for the Traveling Salesman Problems,' Parallel Problem Solving from Nature, pp. 68-77, 1994 https://doi.org/10.1007/3-540-58484-6_251
  26. Y. Theodoridis, J. R. O. Silva, and M. A. Nascimento, 'On the Generation of Spatiotemporal Datasets,' International Symposium on Spatial Databases, pp. 147-164, 1999 https://doi.org/10.1007/3-540-48482-5_11
  27. T. Brinkhoff, 'A Framework for Generating Network-Based Moving Objects,' GeoInformatica, Vol.6(2), pp. 153-180, 2002 https://doi.org/10.1023/A:1015231126594