An open source library to parse and analyze online collaborative knowledge-building portals

Journal of Internet Services and Applications

Table 1 Time Complexity of Key Operations in KDAP

Operations	Time Complexity ^a
	Wiki-Based	QnA-Based
Get an instance	\(\mathcal {O}(k^{2}m)\)	\(\mathcal {O}(n)\)
Get all instances	\(\mathcal {O}(kmn)\)	\(\mathcal {O}(n)\)
Retrieve instance attributes	\(\mathcal {O}(1)\)	\(\mathcal {O}(1)\)
Add an instance	\(\mathcal {O}(1)\)	\(\mathcal {O}(1)\)

^aThe time complexity of \(\mathcal {O}(1)\) is achieved by hashing the instances. Although hashing has worst case time complexity of \(\mathcal {O}(n)\), on an average \(\mathcal {O}(1)\) complexity is achieved.