Skip to main content

Leveraging Pattern Mining Techniques for Efficient Keyword Search on Data Graphs

  • Conference paper
  • First Online:
  • 714 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1155))

Abstract

Graphs model complex relationships among objects in a variety of web applications. Keyword search is a promising method for extraction of data from data graphs and exploration. However, keyword search faces the so called performance scalability problem which hinders its widespread use on data graphs.

In this paper, we address the performance scalability problem by leveraging techniques developed for graph pattern mining. We focus on avoiding the generation of redundant intermediate results when the keyword queries are evaluated. We define a canonical form for the isomorphic representations of the intermediate results and we show how it can be checked incrementally and efficiently. We devise rules that prune the search space without sacrificing completeness and we integrate them in a query evaluation algorithm. Our experimental results show that our approach outperforms previous ones by orders of magnitude and displays smooth scalability.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    http://www.tpc.org/tpch/.

  2. 2.

    https://relational.fit.cvut.cz/dataset/IMDb.

References

  1. Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: a system for keyword-based search over relational databases. In: IEEE ICDE, pp. 5–16 (2002)

    Google Scholar 

  2. Bao, Z., Zeng, Y., Jagadish, H.V., Ling, T.W.: Exploratory keyword search with interactive input. In: ACM SIGMOD, pp. 871–876 (2015)

    Google Scholar 

  3. Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using banks. In: ICDE, pp. 431–440 (2002)

    Google Scholar 

  4. Chi, Y., Yang, Y., Xia, Y., Muntz, R.R.: CMTreeMiner: Mining both closed and maximal frequent subtrees. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 63–73. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24775-3_9

    Chapter  Google Scholar 

  5. Dimitriou, A., Theodoratos, D., Sellis, T.K.: Top-k-size keyword search on tree structured data. Inf. Syst. 47, 178–193 (2015)

    Article  Google Scholar 

  6. Elbassuoni, S., Blanco, R.: Keyword search over RDF graphs. In: ACM CIKM, pp. 237–242 (2011)

    Google Scholar 

  7. Feng, J., Li, G., Wang, J.: Finding top-k answers in keyword search over relational databases using tuple units. IEEE ICDE 23(12), 1781–1794 (2011)

    Google Scholar 

  8. Golenberg, K., Kimelfeld, B., Sagiv, Y.: Keyword proximity search in complex data graphs. In: Proceedings of the ACM SIGMOD, pp. 927–940 (2008)

    Google Scholar 

  9. He, H., Wang, H., Yang, J., Yu, P.S.: BLINKS: ranked keyword searches on graphs. In: ACM SIGMOD, pp. 305–316 (2007)

    Google Scholar 

  10. Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient ir-style keyword search over relational databases. In: VLDB, pp. 850–861 (2003)

    Google Scholar 

  11. Hristidis, V., Papakonstantinou, Y.: DISCOVER: keyword search in relational databases. In: VLDB, pp. 670–681 (2002)

    Google Scholar 

  12. Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: VLDB, pp. 505–516 (2005)

    Google Scholar 

  13. Kargar, M., An, A., Cercone, N., Godfrey, P., Szlichta, J., Yu, X.: Meaningful keyword search in relational databases with large and complex schema. In: IEEE ICDE, pp. 411–422 (2015)

    Google Scholar 

  14. Le, T.N., Ling, T.W.: Survey on keyword search over XML documents. SIGMOD Rec. 45(3), 17–28 (2016)

    Article  Google Scholar 

  15. Liu, F. Yu, C., Meng, W., Chowdhury, A.: Effective keyword search in relational databases. In: ACM SIGMOD, pp. 563–574 (2006)

    Google Scholar 

  16. Liu, Z., Chen, Y.: Processing keyword search on XML: a survey. World Wide Web 14(5–6), 671–707 (2011)

    Article  Google Scholar 

  17. Markowetz, A., Yang, Y., Papadias, D.: Keyword search on relational data streams. In: ACM SIGMOD, pp. 605–616 (2007)

    Google Scholar 

  18. Nijssen, S., Kok, J.N.: Efficient discovery of frequent unordered trees. In: MGTS, pp. 55–64 (2003)

    Google Scholar 

  19. Zaki, M.J.: Efficiently mining frequent trees in a forest. In: ACM SIGKDD, pp. 71–80 (2002)

    Google Scholar 

  20. Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundam. Inform. 66(1–2), 33–52 (2005)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xinge Lu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lu, X., Theodoratos, D., Dimitriou, A. (2020). Leveraging Pattern Mining Techniques for Efficient Keyword Search on Data Graphs. In: U, L., Yang, J., Cai, Y., Karlapalem, K., Liu, A., Huang, X. (eds) Web Information Systems Engineering. WISE 2020. Communications in Computer and Information Science, vol 1155. Springer, Singapore. https://doi.org/10.1007/978-981-15-3281-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-3281-8_10

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-3280-1

  • Online ISBN: 978-981-15-3281-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics