Indexing RFID data using the VG-curve

Conferences in Research and Practice in Information Technology Series

Volumn 124, Issue , 2012, Pages 117-126

  Terry, Justin ^a   Stantic, Bela ^a   Sattar, Abdul ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

Access method; Multidimensional data; Radio frequency identification RFID

Indexed keywords

DATABASE SYSTEMS; RADIO WAVES; VECTOR SPACES;

ACCESS METHODS; COMMERCIAL APPLICATIONS; EFFICIENT MANAGEMENTS; MULTI-DIMENSIONAL DYNAMICS; MULTI-DIMENSIONAL SPACE; MULTI-DIMENSIONAL VECTORS; MULTIDIMENSIONAL DATA; SPATIO-TEMPORAL DATABASE;

RADIO FREQUENCY IDENTIFICATION (RFID);

EID: 84904439612     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Bentley, J. (1975), 'Multidimensional binary search trees used for associative searching', Communications of the ACM 18, 509-517
2. Berchtold, S., Bohm, C. & Kriegel, H.-P. (1998), 'The Pyramid-Tree: Breaking the Curse of Dimensionality', Proceedings ACM SIGMOD pp. 142-153
3. Berchtold, S., Bohm, C., Kriegel, H.-P., Sander, J. & Jagadish, H. (2000), 'Independent quantization: An index compression technique for highdimensional data spaces', icde 00, 577
4. Berchtold, S., C.Bohm, Kriegel, H. P. & Michel, U. (1999), Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases, in 'Int. Conf. on Data Warehousing and Knowledge Discovery DaWaK', pp. 261-270
5. Berchtold, S., Keim, D. & Kriegel, H. (1996), 'The X-tree: An index structure for high-dimensional data', In Proceedings of the 22nd Int. Conf. on Very Large Data Bases pp. 28-39
6. Bohm, C. (2000), 'A Cost Model for Query Processing in High Dimensional Data Spaces', ACM Transactions on Database Systems 25(2), 129-178
7. Chakrabarti, K. & Mehrotra, S. (1999), The hybrid tree: An index structure for high dimensional feature spaces, in 'Proceedings of the 15th International Conference on Data Engineering (ICDE'99)', pp. 440-447
8. Darcy, P., Stantic, B. & Derakhshan, R. (2007), 'Correcting Stored RFID Data with Non-Monotonic Reasoning', Principles and Applications in Information Systems and Technology (PAIST) 1(1), 65-77
9. Gargantini, I. (1982), 'An Effective Way to Represent Quadtrees', Commun. ACM 25(12), 905-910
10. Hellerstein, J., Koutsupias, E. & Papadimitriou, C. (1997), 'On the Analysis of Indexing Schemes', 16th ACM SIGMOD Symposium on Principles of Database Systems pp. 249-256
11. Hu, Y., Sundara, S., Chorma, T. & Srinivasan, J. (2005), Supporting RFID-based Item Tracking Applications in Oracle DBMS Using a Bitmap Datatype, in 'Proceedings of Very Large Data Bases VLDB', pp. 1140-1151
12. Jagadish, H. V., Ooi, B. C., Tan, K.-L., Yu, C. & Zhang, R. (2005), 'iDistance: An Adaptive B+-tree Based Indexing Method for Nearest Neighbor Search', ACM Trans. Database Syst. 30(2), 364-397
13. Lin, D., Elmongui, H. G., Bertino, E. & Ooi, B. C. (2007), Data management in rfid applications, in 'DEXA', pp. 434-444
14. Lin, K., Jagadish, H. & Faloutsos, C. (1994), 'The TVtree an index stucture for high dimensional data', In VLDB Journal 3(4), 517-543
15. Lomet, D. & Salzberg, B. (1989), 'The hB-tree: A robust multiattribute search structure', In Proc. IEEE international conference on data enginerring 5, 296-304
16. M.Stonebraker & U.Cetintemel (2005), One size fits all: an idea whose time has come and gone, in 'Proceedings of the 21st International Conference on Data Engineering (ICDE 2005)', pp. 2-11
17. Murray, C. (2005), 'Oracle Spatial User's Guide and Reference, Release 10g'
18. Ohsawa, Y. & Sakauchi, M. (1983), 'Bd-tree: A new n-dimensional data structure with efficient dynamic characteristics', Proceedings of the Ninth World Computer Congress, IFIP pp. 539-544
19. Ooi, B. C., Tan, K.-L., Yu, C. & Bressan, S. (2000), Indexing the Edges-A Simple and Yet Efficient Approach to High-Dimensional Indexing, in 'Symposium on Principles of Database Systems', pp. 166-174
20. Orlandic, R. & Yu, B. (2002), 'A retrieval technique for high-dimensional data and partially specified queries', Data Knowl. Eng. 42(1), 1-21
21. Rudolf Bayer and Volker Markl (1998), The UB-Tree: Performance of Multidimensional Range Queries, Technical report, Institute for Informatik, TU Muenchen
22. Samet, H. (1984), 'The quadtree and related hierarchical data structures', ACM Computing Surveys 16(2), 187-260
23. Stantic, B., Terry, J., Topor, R. W. & Sattar, A. (2010), Indexing Temporal Data with Virtual Structure, in 'Advances in Databases and Information Systems-ADBIS', pp. 591-594
24. Stantic, B., Topor, R. W., Terry, J. & Sattar, A. (2010), 'Advanced indexing technique for temporal data', Comput. Sci. Inf. Syst. 7(4), 679-703
25. Stockinger, K., Wu, K. & Shoshani, A. (2002), Strategies for processing ad hoc queries on large data warehouses, in 'DOLAP '02: Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP', pp. 72-79
26. Terry, J., Stantic, B., Terenziani, P. & Sattar, A. (2011), Variable Granularity Space filling Curve for Indexing Multidimensional Data, in 'Advances in Databases and Information Systems-ADBIS, (toappear)'
27. Wang, F. & Liu, P. (2005), Temporal management of rfid data, in 'VLDB '05: Proceedings of the 31st international conference on Very large data bases', VLDB Endowment, pp. 1128-1139
28. Weber, R., Schek, H. J. & Blott, S. (1998), A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces, in 'VLDB'98, Proceedings of 24rd International Conference on Very Large Data Bases', pp. 194-205
29. Zhang, R., Ooi, B. C. & Tan, K.-L. (2004), Making the Pyramid Technique Robust to Query Types and Workloads, in 'ICDE '04: Proceedings of the 20th International Conference on Data Engineering'