What is the time and space complexity of Rete algorithm I am working on pattern matching algorithm. Its working and using very less memory. For the comparison, I have to compare it with the Rete Algorithm. I have checked it in the thesis of the author, some of his paper and he has provided some complexities which are not based on then, nor does its efficiency is provided in the space complexity. 

My algorithm despite large inputs worst case is $O(n^2)$. Can someone point me to a good reference where I can find its complexity? I have been searching for a while now, and I did not even get the pseudo code. Things not to consider in order to save your time is algorithms, software, expert systems based on Rete algorithm e.g. Jess etc. 
reference link for algorithm thesis pdf  Click to download 

citation of the paper "Forgy, C.L., 1982. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial intelligence, 19(1), pp.17-37."
finally i found what was needed, thought i wil share here for others who might need it.
http://reports-archive.adm.cs.cmu.edu/anon/1995/CMU-CS-95-113.pdf