Skip to main content
SpringerLink
Log in

An Improved Keyword Search on Big Data Graph with Graphics Processors

  • Conference paper
  • First Online:
Computational Intelligence and Intelligent Systems (ISICA 2015)

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

Abstract

With the development of database research, keyword search on big data graph have attracted many attentions and becoming a hot topic. However, most of existing works are studied on CPU. An important problem is efficiently generating answers for keyword search. In this paper, we research an method of keyword search under graphical processing unit. An improved algorithm based on interval coding is proposed. It includes two main tasks, which are finding root nodes and getting shortest paths from root to keyword nodes. To find root nodes quickly, we judge the reachability between any two nodes based on interval assigned to every node. To speed up finding root nodes and getting shortest paths from root to keyword nodes, we provide data parallel processing for compute-intensive tasks based on intervals assigned to every node and Floyd-Warshall algorithm. Experiment results show the high performance of the proposed solution both on CPU and graphical processing unit.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

References

  1. Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using banks. In: Proceedings of the 18th International Conference Data Engineering (ICDE), pp. 431–440 (2002)

    Google Scholar 

  2. Kacholia, V., Pandit, S., Chakrabarti, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: Proceedings of the 31st International Conference Very Large Data Bases (VLDB), pp. 505–516 (2005)

    Google Scholar 

  3. Kimelfeld, B., Sagiv, Y.: Finding and approximating top-k answers in keyword proximity search. In: Proceedings of the 25th ACMSIGMOD-SIGACT-SIGART Symposium Principles Database Systems (PODS) (2006)

    Google Scholar 

  4. Huang, H., Liu, C.: Query evaluation on probabilistic RDF databases. In: Vossen, G., Long, D.D., Yu, J.X. (eds.) WISE 2009. LNCS, vol. 5802, pp. 307–320. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: Proceedings of the 12th International Conference Information Knowledge Management (CIKM), pp. 556–569 (2003)

    Google Scholar 

  6. Adar, E., Re, C.: Managing uncertainty in social networks. IEEE Data Eng. Bull. 30(2), 15–22 (2007)

    Google Scholar 

  7. Nierman, A., Jagadish, H.V.: ProTDB: probabilistic data in XML. In: Proceedings of the International Conference Very Large Data Bases (VLDB) (2002)

    Google Scholar 

  8. Senellart, P., Abiteboul, S.: On the complexity of managing probabilistic XML data. In: Proceedings of the 26th ACM SIGMOD-SIGACTSIGART Symposium Principles Database Systems (PODS) (2007)

    Google Scholar 

  9. Kimelfeld, B., Kosharovsky, Y., Sagiv, Y.: Query efficiency in probabilistic XML models. In: Proceedings of the ACM SIGMOD International Conference Management of Data (2008)

    Google Scholar 

  10. Golenberg, B.K.K., Sagiv, Y.: Keyword proximity search in complex data graphs. In: Proceedings of the ACM SIGMOD International Conference Management of Data (2008)

    Google Scholar 

  11. Ke, Y., Cheng, J., Yu, J.X.: Querying large graph databases. In: 15th International Conference on Database Systems for Advanced Applications (2010)

    Google Scholar 

  12. Dalvi, B.B., Kshirsagar, M., Sudarshan, S.: Keyword search on external memory data graphs. In: VLDB, pp. 1189–1204 (2008)

    Google Scholar 

  13. Bhalotia, G., Nakhe, C., Hulgeri, A., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using BANKS. In: International Conference on Data Engineering (ICDE), pp. 431–440 (2002)

    Google Scholar 

  14. Kacholia, V., Pandit, S., Chakrabarti, S., et al.: Bidirectional expansion for keyword search on graph databases. In: Proceedings of 31st International Conference on Very Large Data Bases, pp. 505–516 (2005)

    Google Scholar 

  15. Hao, H., Wang, H., Yang, J., Yu, P.S.: BLINKS: Ranked keyword searches on graphs. In: SIGMOD, pp. 305–316 (2007)

    Google Scholar 

  16. Zhou, G., Feng, H., He, G., Chen, H.: Survey of data management on graphics processor units. J. Front. Comput. Sci. Technol. 4, 289–303 (2010). (in Chinese)

    Google Scholar 

  17. Wang, H., Wang, W., Lin, X., Li, J.: Labeling scheme and structural joins for graph-structured XML data. In: Zhang, Y., Tanaka, K., Yu, J.X., Wang, S., Li, M. (eds.) APWeb 2005. LNCS, vol. 3399, pp. 277–289. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. DBLP XML Repository. http://dblp.uni-trier.de/xml/. Accessed September 2010

  19. Angles, R., Gutierrez, C.: Survey of graph database models. ACM Comput. Surv. 40, 1–39 (2008)

    Article  Google Scholar 

  20. Hristidis, V., Papakonstantinou, Y., Balmin, A.: Keyword proximity search on XML graphs. In: Conference on Data Engineering, pp. 367–378. IEEE Press, Bangalore (2003)

    Google Scholar 

  21. Jagadish, H.V., Agrawal, R., Borgida, A.: Efficient management of transitive relationships in large data and knowledge bases. In: Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data (SIGMOD 1989), Portland, Oregon, pp. 253–262 (1989)

    Google Scholar 

  22. NVIDIA: The cuda toolkit. http://www.nvidia.com/object/what_is_cuda_new.html. Accessed September 2010

Download references

Acknowledgment

This project is supported by Guangdong Province’s Quality engineering construction project in 2015.

Author information

Authors and Affiliations

  1. Department of Computer Science, Guangdong University of Science and Technology, Dongguan, China

    Xiu He

  2. Information Engineering Department, Huashang College, Guangdong University of Finance and Economics, Zengcheng, Guangdong Province, China

    Bo Yang

Authors
  1. Xiu He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bo Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiu He .

Editor information

Editors and Affiliations

  1. College of Mathematics and Informatics, The South China Agricultural University, Guangzhou, China

    Kangshun Li

  2. School of Computer Science, Guangzhou University, Guangzhou, China

    Jin Li

  3. School of Computer Science and Engineeri, The University of Aizu, Aizu-Wakamatsu, Fukushima, Japan

    Yong Liu

  4. Dept. of Informatics, University of Salerno, Fisciano, Italy

    Aniello Castiglione

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

He, X., Yang, B. (2016). An Improved Keyword Search on Big Data Graph with Graphics Processors. In: Li, K., Li, J., Liu, Y., Castiglione, A. (eds) Computational Intelligence and Intelligent Systems. ISICA 2015. Communications in Computer and Information Science, vol 575. Springer, Singapore. https://doi.org/10.1007/978-981-10-0356-1_41

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0356-1_41

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0355-4

  • Online ISBN: 978-981-10-0356-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation