1. Aditya B, Bhalotia G, Chakrabarti S, Hulgeri A, Nakhe C, Parag P, Sudarshan S (2002) BANKS: browsing and keyword searching in relational databases. In: VLDB
2. Armbrust M, Fox A, Patterson D, Lanham N, Trushkowsky B, Trutna J, Oh H (2009) Scads: scale-independent storage for social computing applications. arXiv preprint arXiv:09091775
3. Cao Y, Fan W, Huai J, Huang R (2015) Making pattern queries bounded in big graphs. In: ICDE, pp 161–172
4. Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(10):1367–1372
5. Fan W, Li J, Ma S, Tang N, Wu Y, Wu Y (2010) Graph pattern matching: from intractable to polynomial time. PVLDB 3(1–2):264–275