ABSTRACT
This paper presents a comparative study of signature based indexing techniques applied to a database of temporal patterns. Temporal patterns include a set of states and relationships among the states. Signature-based indexing was used to accommodate multiple state values as well as the relationship among the states. The signature files can be implemented in different organizations and a specific implementation has its advantages and disadvantages. This study was undertaken to compare these implementations based on various criteria as listed in this paper. Specifically sequential signature files, bit-slice signature files, extendible signature hashing and signature trees were compared. The signature tree performed significantly better than Sequential and Bit-slice Signature files for content-based retrieval of temporal patterns, extendible signature hashing performed best of all the other implementations. However, the space overhead for Signature trees was significantly higher than all the other implementations.
- A. Carlson, S. Estepp, M. Fowler. "Temporal Patterns"(AT&T Martin Fowler and Policy Management Systems Corporation, August 1998)Google Scholar
- A. Nanopoulos, M. Zakrzewicz, T. Morzy, and Y. Manolopoulos, "Efficient storage and querying of sequential patterns in database systems," Information and Software Technology, vol. 45, pp. 23--34, 2003.Google ScholarDigital Library
- A. Tuzhilin and B. Liu, "Querying multiple sets of discovered rules," Proc. ACM SIGKDD '02, pp. 52--60, 2002. Google ScholarDigital Library
- C. Faloutsos and S. Christodoulakis. Signature files: An access method for documents and its analytical performance evaluation. ACM Transactions on Office Informations Systems, 2(4): 267--288, October 1984. Google ScholarDigital Library
- C. M. Antunes and A. L. Oliveira, "Temporal data mining: An overview," Proc. ACM SIGKDD Workshop Temporal Data Mining, pp. 1--13, 2001.Google Scholar
- E. Winarko and J. F. Roddick, "A signature-based indexing method for efficient content-based retrieval of relative temporal patterns", IEEE Trans. on Knowledge and Data Engineering, VOL. 20, NO. 6, JUNE 2008. Google ScholarDigital Library
- F. Höppner, "Learning Temporal Rules from State Sequences, "Proc. IJCAI Workshop Learning from Temporal and Spatial Data, pp. 25--31, 2001.Google Scholar
- Faloutsos C, Christodoulakis S (1984) Signature files: an access method for documents and its analytical performance evaluation. ACM Trans Office Inform Sys 2(4): 267--288 Google ScholarDigital Library
- J. F. Roddick and M. Spiliopoulou, "A survey of temporal knowledge discovery paradigms and methods," IEEE Trans. Knowledge and Data Eng., vol. 14, no. 4, pp. 750--767, Mar./Apr. 2002. Google ScholarDigital Library
- J. Xiao, Y. Zhang, X. Jia, and T. Li, "Measuring similarity of interests for clustering web-users," Proc. 12<sup>th</sup> Australasian Database Conf. (ADC '01), M. Orlowska and J. Roddick, eds., pp. 107--114, 2001. Google ScholarDigital Library
- L. Geng and H. J. Hamilton, "Interestingness Measures for datamining: A survey," ACM Computing Surveys, vol. 38, no. 3, 2006. Google ScholarDigital Library
- M. Zakrzewicz, "Sequential index structure for content-based retrieval," Proc. Fifth Pacific-Asia Conf. Knowledge Discovery and Data Mining (PAKDD '01), pp. 306--311, 2001. Google ScholarDigital Library
- R. Fagin, J. Nievergelt, N. Pippenger, H. R. Strong, "Extendible hashing -- a fast access method for dynamic files. ACM Trans Database Sys 4(3): 315--344. Google ScholarDigital Library
- Ritambhra Korpal, Arpita Gopal "Extendible Signature Hashing based Indexing for Efficient Content-based Retrieval of Temporal Patterns" IJCSA Issue 2010, ISSN 0974-0767; 178--183Google Scholar
- Ritambhra Korpal, Arpita Gopal "Signature Trees as Index for Database of Temporal Patterns", in press.Google Scholar
- S. Helmer and G. Moerkotte, "A performance study of four index structures for set-valued attributes of low cardinality," VLDB J., vol. 12, no. 3, pp. 244--261, 2003. Google ScholarDigital Library
- T. Imielinski and A. Virmani, "Association rules... and what's next? Towards second generation data mining systems," Proc. Second East European Symp. Advances in Databases and Information Systems (ADBIS '98), pp. 6--25, 1998. Google ScholarDigital Library
- T. Imielinski and A. Virmani, "MSQL: A query language for database mining," J. Data mining and Knowledge Discovery, vol. 3, no. 4, pp. 373--408, 1999. Google ScholarDigital Library
- Y. Chen, "Building signature trees into OODBs," J. Information Science and Eng., vol. 20, no. 2, pp. 275--304, 2004.Google Scholar
- Y. Chen, Y. Chen, "On the Signature Tree Construction and Analysis, IEEE Trans. On Knowledge and Data Engineering, VOL. 18, NO. 9, SEPTEMBER 2006. Google ScholarDigital Library
- Y. Ishikawa, H. Kitagawa, and N. Ohbo, "Evaluation of signature files as set access facilities in OODBs," Proc. ACM SIGMOD '93, P. Buneman and S. Jajodia, eds., pp. 247--256, 1993. Google ScholarDigital Library
Index Terms
- A comparative study of signature based indexes for efficient retrieval of temporal patterns
Recommendations
On the Signature Tree Construction and Analysis
Advanced database application areas, such as computer aided design, office automation, digital libraries, data-mining, as well as hypertext and multimedia systems, need to handle complex data structures with set-valued attributes, which can be ...
On the Signature Trees and Balanced Signature Trees
ICDE '05: Proceedings of the 21st International Conference on Data EngineeringAdvanced database application areas, such as computer aided design, office automation, digital libraries, data-mining as well as hypertext and multimedia systems need to handle complex data structures with set-valued attributes, which can be represented ...
Efficient certificate-based verifiable encrypted signature scheme
Certificate-based public key cryptographic is a novel cryptographic primitive solving the heavy management problem in the conventional public key cryptographic. Verifiable encrypted signature is useful for many cryptographic protocols and often is used ...
Comments