Skip to main content
SpringerLink
Log in
Book cover

New Trends in Databases and Information Systems pp 305–315Cite as

Modeling and Storing Complex Network with Graph-Tree

  • Conference paper

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 185))

Abstract

The increased volume of information in recent decades and the emergence of new data types such as complex networks led to the need of development efficient methods for storage and handle these data.Management Systems Database are know for their efficiency and store and retrieve tradicional date as number and small strings. However theses systems need to be modified in order to support complex network data and keep the query processing along with the access methods, the most agile and efficient as possible. Thus the objective of this work is the development of an indexing structure, called Graph − tree that can store complex networks to allow binding prediction algorithms to be applied to large complex networks.

This is a preview of subscription content, 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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adamic, L.A., Huberman, B.A., Barab&aacutesi, A., Albert, R., Jeong, H., Bianconi, G.: Power-law distribution of the world wide web. Science 287(5461), 2115a+ (2000), http://dx.doi.org/10.1126/science.287.5461.2115a , doi:10.1126/science.287.5461.2115a

  2. Albert, R., Jeong, H., Barabasi, A.L.: The diameter of the world wide web (1999), http://arxiv.org/abs/cond-mat/9907038

  3. Angles, R., Gutierrez, C.: Survey of graph database models. ACM Comput. Surv. 40, 1:1–1:39 (2008), doi: http://doi.acm.org/10.1145/1322432.1322433

    Article  Google Scholar 

  4. Backstrom, L., Leskovec, J.: Supervised random walks: predicting and recommending links in social networks. In: King, I., Nejdl, W., Li, H. (eds.) Proceedings of the Forth International Conference on Web Search and Web Data Mining, WSDM 2011, Hong Kong, China, February 9-12, pp. 635–644. ACM (2011), doi: http://doi.acm.org/10.1145/1935826.1935914

  5. Van den Bercken, J., Seeger, B.: An evaluation of generic bulk loading techniques. In: Apers, P.M.G., Atzeni, P., Ceri, S., Paraboschi, S., Ramamohanarao, K., Snodgrass, R.T. (eds.) International Conference on Very Large Databases (VLDB), pp. 461–470. Morgan Kaufmann, Roma (2001)

    Google Scholar 

  6. Chakrabarti, D., Wang, Y., Wang, C., Leskovec, J., Faloutsos, C.: Epidemic thresholds in real networks. ACM Trans. Inf. Syst. Secur. 10(4), 1–26 (2008), http://doi.acm.org/10.1145/1284680.1284681

    Article  Google Scholar 

  7. Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: Bigtable: A distributed storage system for structured data. ACM Trans. Comput. Syst. 26(2), 4:1–4:26 (2008), http://doi.acm.org/10.1145/1365815.1365816 , doi:10.1145/1365815.1365816

    Article  MATH  Google Scholar 

  8. Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Commun. ACM 51(1), 107–113 (2008), http://dx.doi.org/10.1145/1327452.1327492

    Article  Google Scholar 

  9. DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: amazon’s highly available key-value store. SIGOPS Oper. Syst. Rev. 41(6), 205–220 (2007), http://doi.acm.org/10.1145/1323293.1294281 , doi:10.1145/1323293.1294281

    Article  Google Scholar 

  10. Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Numerical Mathematics 1, 269–271 (1959), http://www-m3.ma.tum.de/twiki/pub/MN0506/WebHome/dijkstra.pdf (last visited: May 27, 2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis, E., Han, J., Fayyad, U.M. (eds.) Proceedings of the Second International Conference on KDD 1996, pp. 226–231. AAAI Press (1996)

    Google Scholar 

  12. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM 1999, vol. 1, pp. 251–262. ACM Press, Cambridge (1999)

    Chapter  Google Scholar 

  13. Fortunato, S.: Community detection in graphs. Physics Reports 486(3-5), 75–174 (2010), http://dx.doi.org/10.1016/j.physrep.2009.11.002 , doi:10.1016/j.physrep.2009.11.002

    Article  MathSciNet  Google Scholar 

  14. Johnson, T., Shasha, D.: The performance of current b-tree algorithms. ACM Transactions on Database Systems (TODS) 18(1), 51–101 (1993)

    Article  MathSciNet  Google Scholar 

  15. Kang, U., Tsourakakis, C.E., Appel, A.P., Faloutsos, C., Leskovec, J.: Radius plots for mining tera-byte scale graphs: Algorithms, patterns, and observations. In: SIAM SDM, pp. 548–558. Columbus, Ohio (2010)

    Google Scholar 

  16. Lakshman, A.: Cassandra - a structured storage system on a p2p network (2012), http://www.facebook.com

  17. Lassila, O., Swick, R.R., Wide, W., Consortium, W.: Resource description framework (rdf) model and syntax specification (1998)

    Google Scholar 

  18. Leskovec, J., Backstrom, L., Kumar, R., Tomkins, A.: Microscopic evolution of social networks. In: KDD 2008: Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 462–470. ACM, New York (2008), doi: http://doi.acm.org/10.1145/1401890.1401948

    Chapter  Google Scholar 

  19. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Eleventh ACM SIGKDD, pp. 177–187. ACM Press, New York (2005), doi: http://doi.acm.org/10.1145/1081870.1081893

    Google Scholar 

  20. Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. CoRR abs/0810.1355 (2008)

    Google Scholar 

  21. Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: CIKM 2003: Proceedings of the Twelfth International Conference on Information and Knowledge Management, pp. 556–559. ACM, New York (2003), doi: http://doi.acm.org/10.1145/956863.956972

    Chapter  Google Scholar 

  22. Milgram, S.: The small world problem. Psychology Today 2, 60–67 (1967)

    Google Scholar 

  23. Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  24. Olston, C., Reed, B., Srivastava, U., Kumar, R., Tomkins, A.: Pig latin: a not-so-foreign language for data processing. In: SIGMOD 2008: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 1099–1110. ACM, New York (2008), doi: http://dx.doi.org/10.1145/1376616.1376726

    Chapter  Google Scholar 

  25. Palmer, C.R., Gibbons, P.B., Faloutsos, C.: Anf: A fast and scalable tool for data mining in massive graphs. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, vol. 1, pp. 81–90. ACM Press, Edmonton (2002)

    Google Scholar 

  26. Pavlo, A., Paulson, E., Rasin, A., Abadi, D.J., DeWitt, D.J., Madden, S., Stonebraker, M.: A comparison of approaches to large-scale data analysis. In: Çetintemel, U., Zdonik, S.B., Kossmann, D., Tatbul, N. (eds.) SIGMOD Conference, pp. 165–178. ACM (2009)

    Google Scholar 

  27. Redner, S.: How popular is your paper? an empirical study of the citation distribution (1998), http://arxiv.org/abs/cond-mat/9804163

  28. Sidirourgos, L., Goncalves, R., Kersten, M., Nes, N., Manegold, S.: Column-store support for rdf data management: not all swans are white. Proc. VLDB Endow. 1(2), 1553–1563 (2008), doi: http://doi.acm.org/10.1145/1454159.1454227

    Google Scholar 

  29. Tsourakakis, C.E.: Fast counting of triangles in large real networks without counting: Algorithms and laws. In: ICDM 2008, pp. 608–617. IEEE Computer Society, Washington, DC (2008), doi: http://dx.doi.org/10.1109/ICDM.2008.72

    Google Scholar 

  30. Vicknair, C., Macias, M., Zhao, Z., Nan, X., Chen, Y., Wilkins, D.: A comparison of a graph database and a relational database: a data provenance perspective. In: Proceedings of the 48th Annual Southeast Regional Conference, ACM SE 2010, pp. 42:1–42:6. ACM, New York (2010), http://doi.acm.org/10.1145/1900008.1900067 , doi:10.1145/1900008.1900067

    Google Scholar 

  31. Voldemort, P.: Project voldemort: A distributed database (2012), http://project-voldemort.com/

  32. Wang, W., Wang, C., Zhu, Y., Shi, B., Pei, J., Yan, X., Han, J.: Graphminer: a structural pattern-mining system for large disk-based graph databases and its applications. In: SIGMOD 2005: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 879–881. ACM, New York (2005), doi: http://doi.acm.org/10.1145/1066157.1066273

    Chapter  Google Scholar 

  33. Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(6684), 440–442 (1998), doi: http://dx.doi.org/10.1038/30918

    Article  Google Scholar 

  34. Weiss, C., Karras, P., Bernstein, A.: Hexastore: sextuple indexing for semantic web data management. Proc. VLDB Endow. 1(1), 1008–1019 (2008), doi: http://doi.acm.org/10.1145/1453856.1453965

    Google Scholar 

  35. Zhang, T., Ramakrishnan, R., Livny, M.: Birch: An efficient data clustering method for very large databases. In: Jagadish, H.V., Mumick, I.S. (eds.) ACM SIGMOD International Conference on Management of Data. SIGMOD Record, vol. 25(2), vol. 1, pp. 103–114. ACM Press, Montreal (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Federal University of Espírito Santo São Mateus, Rodovia BR 101 Norte, Km. 60, Bairro Litorâneo, CEP 29932-540, São Mateus, ES, Brazil

    Adan Lucio Pereira

  2. IBM Research Brazil, Rua Tutoia, 1157 - Térreo, São Paulo, SP, CEP 04007-900, Brazil

    Ana Paula Appel

Authors
  1. Adan Lucio Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ana Paula Appel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adan Lucio Pereira .

Editor information

Editors and Affiliations

  1. , Department of Computer Science, Eindhoven University of Technology, Eindhoven, 5600, Netherlands

    Mykola Pechenizkiy

  2. Institute of Computing Science, Poznan University of Technology, ul. Piotrowo 2, Poznan, 60-965, Poland

    Marek Wojciechowski

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pereira, A.L., Appel, A.P. (2013). Modeling and Storing Complex Network with Graph-Tree . In: Pechenizkiy, M., Wojciechowski, M. (eds) New Trends in Databases and Information Systems. Advances in Intelligent Systems and Computing, vol 185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32518-2_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32518-2_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32517-5

  • Online ISBN: 978-3-642-32518-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation