Bounded Pattern Matching Using Views

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12391)


Bounded evaluation using views is to compute the answers \(Q(\mathcal{D})\) to a query Q in a dataset \(\mathcal{D}\) by accessing only cached views and a small fraction \(D_Q\) of \(\mathcal{D}\) such that the size \(|D_Q|\) of \(D_Q\) and the time to identify \(D_Q\) are independent of \(|\mathcal{D}|\), no matter how big \(\mathcal{D}\) is. Though proven effective for relational data, it has yet been investigated for graph data. In light of this, we study the problem of bounded pattern matching using views. We first introduce access schema \(\mathcal{C}\) for graphs and propose a notion of joint containment to characterize bounded pattern matching using views. We show that a pattern query \({\mathsf {Q}} \) can be boundedly evaluated using views \(\mathcal{V}(G)\) and a fraction \(G_Q\) of G if and only if the query \({\mathsf {Q}} \) is jointly contained by \(\mathcal{V}\) and \(\mathcal{C}\). Based on the characterization, we develop an efficient algorithm as well as an optimization strategy to compute matches by using \(\mathcal{V}(G)\) and \(G_Q\). Using real-life and synthetic data, we experimentally verify the performance of these algorithms, and show that (a) our algorithm for joint containment determination is not only effective but also efficient; and (b) our matching algorithm significantly outperforms its counterpart, and the optimization technique can further improve performance by eliminating unnecessary input..


  1. 1.
  2. 2.
  3. 3.
  4. 4.
    Stanford large network dataset collection.
  5. 5.
  6. 6.
    Facebook (2013).
  7. 7.
    Afrati, F.N., Chirkova, R.: Answering Queries Using Views, Second Edition. Synthesis Lectures on Data Management. Morgan & Claypool Publishers (2019)Google Scholar
  8. 8.
    Armbrust, M., Curtis, K., Kraska, T., Fox, A., Franklin, M.J., Patterson, D.A.: PIQL: success-tolerant query processing in the cloud. PVLDB 5(3), 181–192 (2011)Google Scholar
  9. 9.
    Armbrust, M., et al.: SCADS: scale-independent storage for social computing applications. In: CIDR (2009)Google Scholar
  10. 10.
    Armbrust, M., Liang, E., Kraska, T., Fox, A., Franklin, M.J., Patterson, D.A.: Generalized scale independence through incremental precomputation. In: SIGMOD, pp. 625–636 (2013)Google Scholar
  11. 11.
    Cao, Y., Fan, W., Geerts, F., Lu, P.: Bounded query rewriting using views. ACM Trans. Database Syst. 43(1), 6:1–6:46 (2018)Google Scholar
  12. 12.
    Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs (2004)Google Scholar
  13. 13.
    Fan, W., Geerts, F., Cao, Y., Deng, T., Lu, P.: Querying big data by accessing small data. In: PODS, pp. 173–184 (2015)Google Scholar
  14. 14.
    Fan, W., Geerts, F., Libkin, L.: On scale independence for querying big data. In: PODS, pp. 51–62 (2014)Google Scholar
  15. 15.
    Fan. W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: from intractability to polynomial time. In: PVLDB (2010)Google Scholar
  16. 16.
    Fan, W., Wang, X., Wu, Y.: Answering pattern queries using views. IEEE Trans. Knowl. Data Eng. 28(2), 326–341 (2016)CrossRefGoogle Scholar
  17. 17.
    Gerome, M., Suciu, D.: Containment and equivalence for an xpath fragment. In: PODS (2002)Google Scholar
  18. 18.
    Halevy, A.Y.: Answering queries using views: a survey. VLDB J. 10(4), 270–294 (2001)CrossRefGoogle Scholar
  19. 19.
    Halevy, A.Y.: Theory of answering queries using views. SIGMOD Record 29(4), 56 (2001)zbMATHGoogle Scholar
  20. 20.
    Henzinger, M.R., Henzinger, T., Kopke, P.: Computing simulations on finite and infinite graphs. In: FOCS (1995)Google Scholar
  21. 21.
    Kumar, R., Novak, J., Tomkins, A.: Structure and evolution of online social networks. In: KDD (2006)Google Scholar
  22. 22.
    Lenzerini, M.: Data integration: a theoretical perspective. In: PODS (2002)Google Scholar
  23. 23.
    Leskovec, J., Singh, A., Kleinberg, J.: Patterns of influence in a recommendation network. In: Advances in Knowledge Discovery and Data Mining (2006)Google Scholar
  24. 24.
    Neven, F., Schwentick, T.: XPath containment in the presence of disjunction, DTDs, and variables. In: ICDT (2003)Google Scholar
  25. 25.
    Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)Google Scholar
  26. 26.
    Wang, J., Li, J., Yu, J.X.: Answering tree pattern queries using views: a revisit. In: EDBT (2011)Google Scholar
  27. 27.
    Wang, X.: Answering graph pattern matching using views: a revisit. In: DEXA (2017)Google Scholar
  28. 28.
    Wang, X., Zhan, H.: Approximating diversified top-k graph pattern matching. In: DEXA, pp. 407–423 (2018)Google Scholar
  29. 29.

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Southwest Petroleum UniversityChengduChina
  2. 2.University of Southern QueenslandToowoombaAustralia
  3. 3.Southwest Jiaotong UniversityChengduChina

Personalised recommendations