Algorithm 1: Faceted Search-Based Query Visualization

	Data: User query q
	Result: Facets F = {f1, …, fk}, relevant text T,     Displayable models D = {d1, …, d)n}
1	Process query q into query set Q
2	for each query qj ∈ Q do
3	{Fj, Tj, Dj} → Process query qj using hierarchical search
4	F ← F ∪ Fj, T ← T ∪ Tj, D ← D ∪ Dj
5	end
6	if D ≠ ∅ then
7	Visualize models D
8	end
9	Display related text T, and Facets F
10	if User selects items t from facet list F then
11	for each item ti ∈ t do
12	if ti is predicate then
13	Make ti as specialized query of       q : qti ← q; ti and add to new query       nq ← nq ∪ qti
14	else
15	Make ti as simple query and add to new       query set, nq ← nq ∪ ti
16	end
17	end
18	Set q ← nq
19	Go to 1
20	end