Indexing RFID data using the VG-curve

Existing methods for the management of multidimensional data typically do not scale well with an increased number of dimensions or require the unsupported augmentation of the kernel. However, the use of multidimensional data continues to grow in modern database applications, specifically in spatio-temporal databases. These systems produce vast volumes of multidimensional data, and as such, data is stored in commercial RDBMS. Therefore, the efficient management of such multidimensional data is crucial. Despite it being applicable to any multidimensional vector data, we consider Radio Frequency Identifications (RFID) systems in this work. Due to RFID's acceptance and rapid growth into new and complex applications, together with the fact that, as with commercial applications, its data is stored within commercial RDBMS, we have chosen RFID as a pertinent test-bed. We show that its data can be represented as vectors in multidimensional space and that the VG-curve combined with Multidimensional Dynamic Clustering Primary Index, which can be integrated into commercial RDBMS, can be used to efficiently access such data. In an empirical study conducted on three, five and nine dimensional RFID data we show that the presented concept outperforms available off-the-shelf options with a fraction of the required space.

[1]  Beng Chin Ooi,et al.  iDistance: An adaptive B+-tree based indexing method for nearest neighbor search , 2005, TODS.

[2]  Bela Stantic,et al.  Correcting Stored RFID Data with Non-Monotonic Reasoning , 2007 .

[3]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[4]  Beng Chin Ooi,et al.  Indexing the edges—a simple and yet efficient approach to high-dimensional indexing , 2000, PODS '00.

[5]  Fusheng Wang,et al.  Temporal Management of RFID Data , 2005, VLDB.

[6]  Henrik Loeser,et al.  "One Size Fits All": An Idea Whose Time Has Come and Gone? , 2011, BTW.

[7]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

[8]  Abdul Sattar,et al.  Indexing Temporal Data with Virtual Structure , 2010, ADBIS.

[9]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[10]  Arie Shoshani,et al.  Strategies for processing ad hoc queries on large data warehouses , 2002, DOLAP '02.

[11]  Christian Böhm,et al.  Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases , 1999, DaWaK.

[12]  Hicham G. Elmongui,et al.  Data Management in RFID Applications , 2007, DEXA.

[13]  Setsuo Ohsuga,et al.  INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES , 1977 .

[14]  Hans-Jörg Schek,et al.  A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.

[15]  Ying Hu,et al.  Supporting RFID-based Item Tracking Applications in Oracle DBMS Using a Bitmap Datatype , 2005, VLDB.

[16]  Christos H. Papadimitriou,et al.  On the analysis of indexing schemes , 1997, PODS '97.

[17]  Christos Faloutsos,et al.  The TV-tree: An index structure for high-dimensional data , 1994, The VLDB Journal.

[18]  Christian Böhm,et al.  Independent quantization: an index compression technique for high-dimensional data spaces , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[19]  Sharad Mehrotra,et al.  The hybrid tree: an index structure for high dimensional feature spaces , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[20]  Abdul Sattar,et al.  Advanced indexing technique for temporal data , 2010, Comput. Sci. Inf. Syst..

[21]  Abdul Sattar,et al.  Variable Granularity Space Filling Curve for Indexing Multidimensional Data , 2011, ADBIS.

[22]  Beng Chin Ooi,et al.  Making the pyramid technique robust to query types and workloads , 2004, Proceedings. 20th International Conference on Data Engineering.

[23]  Volker Markl,et al.  The UB-Tree: Performance of Multidimensional Range Queries , 1998 .

[24]  Hans-Peter Kriegel,et al.  The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.

[25]  Christian Böhm,et al.  A cost model for query processing in high dimensional data spaces , 2000, TODS.

[26]  D. B. Lomet,et al.  A robust multi-attribute search structure , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[27]  Hans-Peter Kriegel,et al.  The pyramid-technique: towards breaking the curse of dimensionality , 1998, SIGMOD '98.

[28]  Masao Sakauchi,et al.  The BD-Tree - A New N-Dimensional Data Structure with Highly Efficient Dynamic Characteristics , 1983, IFIP Congress.

[29]  Byunggu Yu,et al.  A retrieval technique for high-dimensional data and partially specified queries , 2002, Data Knowl. Eng..

[30]  Olegas Vasilecas,et al.  Advances in Databases and Information Systems (ADBIS) , 2002, SIGMOD Rec..