A Transient Pattern Search Algorithm for Event Visualization

  ijett-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
© 2013 by IJETT Journal
Volume-4 Issue-10                      
Year of Publication : 2013
Authors : Siva Sankar Grandhi , Srinivasu Varma Penumatsa , Chinna babu Galinki


Siva Sankar Grandhi , Srinivasu Varma Penumatsa , Chinna babu Galinki. "A Transient Pattern Search Algorithm for Event Visualization". International Journal of Engineering Trends and Technology (IJETT). V4(10):4394-4399 Oct 2013. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group.


Pattern Searching is more important task during the searching process in records or web or large amount data. In traditional searching operations the patterns are stored in an array and store time stamp anyway. We introduced new algorithm so called as temporal pattern search and it maintains same types in different events and time stamps. It performs binary search using appropriate time stamps. It highly and efficiently works in personal histories.


[1] J. Agrawal, Y. Diao, D. Gyllstrom, and N. Immerman, “Efficient Pattern Matching over Event Streams,” Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 147-160, 2008.
[2] R.S. Boyer and J.S. Moore, “A Fast String-Searching Algorithm,” Comm. ACM, vol. 20, no. 10, pp. 762-772, 1977.
[3] R. Cox, “Regular Expression Matching Can Be Simple and Fast,” http://swtch.com/rsc/regexp/regexp1.html, 2007.
[4] DataMontage, http://www.stottlerhenke.com/datamontage/, 2011.
[5] A. Demers, J. Gehrke, M. Hong, M. Riedewald, and W. White, “Towards Expressive Publish/Subscribe Systems,” Proc. 10th Int’l Conf. Extending Database Technology (EDBT), pp. 627-644, 2006.
[6] J. Fails, A. Karlson, L. Shahamat, and B. Shneiderman, “A Visual Interface for Multivariate Temporal Data: Finding Patterns of Events across Multiple Histories,” Proc. IEEE Symp. Visual Analytics Science and Technology (VAST ’06), pp. 167-174, 2006.
[7] D. Ficara, S. Giodano, G. Procissi, F. Vitucci, G. Antichi, and A.D. Pietro, “An Improved DFA for Fast Regular Expression Matching,” ACM SIGCOMM Computer Comm. Rev., vol. 38, no. 5, pp. 29- 40, 2008.
[8] L. Harada and Y. Hotta, “Order Checking in a CPOE Using Event Analyzer,” Proc. ACM Int’l Conf. Information and Knowledge Management (CIKM), pp. 549-555, 2005.
[9] L. Harada, Y. Hotta, and T. Ohmori, “Detection of Sequential Patterns of Events for Supporting Business Intelligence Solutions,” Proc. Int’l Database Eng. and Applications Symp. (IDEAS ’04), pp. 475-479, 2004.
[10] J.E. Hopcroft, R. Motwani, and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 2000.
[11] R.M. Karp and M.O. Rabin, “Efficient Randomized Patter Matching Algorithms,” Technical Report TR-31-81, Aiken Computation Laboratory, Harvard Univ., 1981.
[12] D.E. Knuth, J.H. Moris, and V.R. Pratt, “Fast Pattern Matching in Strings,” SIAM J. Computing, vol. 6, no. 2, pp. 323-350, 1977.
[13] S. Kumar, B. Chandrasekaran, J. Turner, and G. Varghese, “Curing Regular Expressions Matching Algorithms from Insomnia, Amnesia, and Acalculia,” Proc. Third ACM/IEEE Symp. Architecture for Networking and Comm., Systems (ANCS), pp. 155-164, 2007.
[14] H. Lam, D. Russell, D. Tang, and T. Munzner, “Session Viewer: Visual Exploratory Analysis of Web Session Logs,” Proc. IEEE Symp. Visual Analytics Science and Technology (VAST ’07), pp. 147- 154, 2007.
[15] S. Lam, “PatternFinder in Microsoft Amalga: Temporal Query Formulation and Result Visualization in Action,”http:// www.cs.umd.edu/hcil/patternFinderInAmalga/PatternFinderSHonorsPaper. pdf, 2011.
[16] Microsoft Amalga, http://www.microsoft.com/amalga/, 2009.
[17] A. Møller “Regexp Library for Java,” http://www.brics.dk/ automaton/, 2001.
[18] S. Murphy, M. Mendis, K. Hackett, R. Kuttan, W. Pan, L. Phillips, V. Gainer, D. Berkowicz, J. Glaser, I. Kohane, and H. Chueh, “Architecture of the Open-Source Clinical Research Chart from Informatics for Integrating Biology and the Bedside,” Proc. Am. Medical Informatics Assoc. Ann. Symp. (AMIA ’07), pp. 548-552, 2007.
[19] G. Navarro, “Pattern Matching,” J. Applied Statistics, vol. 31, no. 8, pp. 925-949, 2004.
[20] G. Navarro and M. Raffinot, “Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata,” ACM J. Experimental Algorithmics, vol. 5, article 4, Dec. 2000, http:// doi.acm.org/10.1145/351827.384246.