Warehousing RFID and Location-Based Sensor Data

Massive Radio Frequency Identification (RFID) datasets are expected to become commonplace in supply-chain management systems. Warehousing and mining this data is an essential problem with great potential benefits for inventory management, object tracking, and product procurement processes. Since RFID tags can be used to identify each individual item, enormous amounts of location-tracking data are generated. Furthermore, RFID tags can record sensor information such as temperature or humidity. With such data, object movements can be modeled by movement graphs, where nodes correspond to locations, and edges record the history of item transitions between locations and sensor readings recorded during the transition. This chapter shows the benefits of the movement graph model in terms of compact representation, complete recording of spatio-temporal and item level information, and its role in facilitating multidimensional analysis. Compression power and efficiency in query processing are gained by organizing the model around the concept of gateway nodes, which serve as bridges connecting different regions of graph, and provide a natural partition of item trajectories. Multi-dimensional analysis is provided by a graph-based object movement data cube that is constructed by merging and collapsing nodes and edges according to an application-oriented topological structure. DOI: 10.4018/978-1-60566-328-9.ch003

[1]  Jiawei Han,et al.  Cost-Conscious Cleaning of Massive RFID Data Sets , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[2]  Jeffrey F. Naughton,et al.  An array-based algorithm for simultaneous multidimensional aggregates , 1997, SIGMOD '97.

[3]  Klaus Finkenzeller,et al.  Book Reviews: RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification, 2nd ed. , 2004, ACM Queue.

[4]  Sudarshan S. Chawathe,et al.  Managing RFID Data , 2004, VLDB.

[5]  Minos N. Garofalakis,et al.  Adaptive cleaning for RFID data streams , 2006, VLDB.

[6]  Jiawei Han,et al.  Flowcube: constructing RFID flowcubes for multi-dimensional analysis of commodity flows , 2006, VLDB.

[7]  Diego Klabjan,et al.  Warehousing and Analyzing Massive RFID Data Sets , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[8]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[9]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[10]  Jiawei Han,et al.  Mining compressed commodity workflows from massive RFID data sets , 2006, CIKM '06.

[11]  Jeffrey D. Ullman,et al.  Implementing data cubes efficiently , 1996, SIGMOD '96.

[12]  Jeffrey F. Naughton,et al.  On the Computation of Multidimensional Aggregates , 1996, VLDB.

[13]  Jun Rao,et al.  A deferred cleansing method for RFID data analytics , 2006, VLDB.

[14]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[15]  Gustavo Alonso,et al.  A Pipelined Framework for Online Cleaning of Sensor Data Streams , 2006, 22nd International Conference on Data Engineering (ICDE'06).