{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T12:04:22Z","timestamp":1748952262409,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":77,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642363177"},{"type":"electronic","value":"9783642363184"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36318-4_5","type":"book-chapter","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T16:22:59Z","timestamp":1364228579000},"page":"103-124","source":"Crossref","is-referenced-by-count":5,"title":["Large Graph Mining: Recent Developments, Challenges and Potential Solutions"],"prefix":"10.1007","author":[{"given":"Sabri","family":"Skhiri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salim","family":"Jouili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"5_CR1","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.is.2004.12.002","volume":"31","author":"A. Abell\u00f3","year":"2006","unstructured":"Abell\u00f3, A., Samos, J., Saltor, F.: YAM2: a multidimensional conceptual model extending UML. Inf. Syst.\u00a031(6), 541\u2013567 (2006)","journal-title":"Inf. Syst."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Wang, H. (eds.): Managing and Mining Graph Data. Advances in Database Systems, vol.\u00a040. Springer (2010)","DOI":"10.1007\/978-1-4419-6045-0"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Akkaoui, Z.E., Zim\u00e1nyi, E., Maz\u00f3n, J.-N., Trujillo, J.: A model-driven framework for ETL process development. In: Proceedings of the 14th ACM International Workshop on Data Warehousing and OLAP, DOLAP 2011, pp. 45\u201352. ACM (2011)","DOI":"10.1145\/2064676.2064685"},{"key":"5_CR4","unstructured":"Avram, A.: Gremlin, a language for working with graphs. Technical report, InfoQ (2010), http:\/\/www.infoq.com\/news\/2010\/01\/Gremlin"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-16233-6_1","volume-title":"Facing the Multicore-Challenge","author":"D. Bader","year":"2010","unstructured":"Bader, D.: Analyzing Massive Social Networks Using Multicore and Multithreaded Architectures. In: Keller, R., Kramer, D., Weiss, J.-P. (eds.) Facing the Multicore-Challenge. LNCS, vol.\u00a06310, p. 1. Springer, Heidelberg (2010)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Madduri, K.: Snap, small-world network analysis and partitioning: An open-source parallel graph framework for the exploration of large-scale networks. In: Proceedings of the IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, pp. 1\u201312. IEEE (2008)","DOI":"10.1109\/IPDPS.2008.4536261"},{"issue":"5","key":"5_CR7","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A. Balakrishnan","year":"1989","unstructured":"Balakrishnan, A., Magnanti, T.L., Wong, R.T.: A Dual-Ascent procedure for Large-Scale uncapacitated network design. Operations Research\u00a037(5), 716\u2013740 (1989)","journal-title":"Operations Research"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-44466-1_19","volume-title":"Data Warehousing and Knowledge Discovery","author":"A. Bauer","year":"2000","unstructured":"Bauer, A., H\u00fcmmer, W., Lehner, W.: An Alternative Relational OLAP Modeling Approach. In: Kambayashi, Y., Mohania, M., Tjoa, A.M. (eds.) DaWaK 2000. LNCS, vol.\u00a01874, pp. 189\u2013198. Springer, Heidelberg (2000)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Quarterly of Applied Mathematics\u00a016, 87\u201390 (1958)","journal-title":"Quarterly of Applied Mathematics"},{"key":"5_CR10","unstructured":"Bialecki, A., Cafarella, M., Cutting, D., O\u2019Malley, O.: Hadoop: A framework for running applications on large clusters built of commodity hardware (2005), http:\/\/lucene.apache.org\/hadoop\/"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Borodin, A., Roberts, G.O., Rosenthal, J.S., Tsaparas, P.: Finding authorities and hubs from link structures on the World Wide Web. In: Proceedings of the 10th International Conference on World Wide Web, WWW 2001, pp. 415\u2013429. ACM (2001)","DOI":"10.1145\/371920.372096"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1145\/146802.146826","volume":"10","author":"R.A. Botafogo","year":"1992","unstructured":"Botafogo, R.A., Rivlin, E., Shneiderman, B.: Structural analysis of hypertexts: Identifying hierarchies and useful metrics. ACM Trans. Inf. Syst.\u00a010(2), 142\u2013180 (1992)","journal-title":"ACM Trans. Inf. Syst."},{"key":"5_CR13","unstructured":"Brants, T., Popat, A.C., Xu, P., Och, F.J., Dean, J.: Large language models in machine translation. In: Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, EMNLP-CoNLL 2007, pp. 858\u2013867. ACL (2007)"},{"issue":"1-7","key":"5_CR14","first-page":"107","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks\u00a030(1-7), 107\u2013117 (1998)","journal-title":"Computer Networks"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.14778\/1920841.1920881","volume":"3","author":"Y. Bu","year":"2010","unstructured":"Bu, Y., Howe, B., Balazinska, M., Ernst, M.D.: Haloop: efficient iterative data processing on large clusters. Proceedings of the VLDB Endowment\u00a03, 285\u2013296 (2010)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/248603.248616","volume":"26","author":"S. Chaudhuri","year":"1997","unstructured":"Chaudhuri, S., Dayal, U.: An overview of data warehousing and OLAP technology. SIGMOD Record\u00a026(1), 65\u201374 (1997)","journal-title":"SIGMOD Record"},{"issue":"6","key":"5_CR17","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/69.553155","volume":"8","author":"M.-S. Chen","year":"1996","unstructured":"Chen, M.-S., Han, J., Yu, P.S.: Data mining: An overview from a database perspective. IEEE Trans. Knowl. Data Eng.\u00a08(6), 866\u2013883 (1996)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Chen, R., Weng, X., He, B., Yang, M.: Large graph processing in the cloud. In: Proceedings of the 2010 International Conference on Management of Data, SIGMOD 2010, pp. 1123\u20131126. ACM (2010)","DOI":"10.1145\/1807167.1807297"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1080\/15427951.2009.10390643","volume":"6","author":"F.R.K. Chung","year":"2009","unstructured":"Chung, F.R.K.: A local graph partitioning algorithm using heat kernel pagerank. Internet Mathematics\u00a06(3), 315\u2013330 (2009)","journal-title":"Internet Mathematics"},{"key":"5_CR20","unstructured":"Cohn, D., Chang, H.: Learning to probabilistically identify authoritative documents. In: Proceedings of the Twenty-Fourth International Conference on Machine Learning, ICML 2007, pp. 167\u2013174. Morgan Kaufmann (2007)"},{"issue":"5","key":"5_CR21","doi-asserted-by":"publisher","first-page":"3976","DOI":"10.1016\/j.asoc.2011.01.044","volume":"11","author":"D. Datta","year":"2011","unstructured":"Datta, D., Figueira, J.R.: Graph partitioning by multi-objective real-valued metaheuristics: A comparative study. Appl. Soft Comput.\u00a011(5), 3976\u20133987 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Ekanayake, J., Li, H., Zhang, B., Gunarathne, T., Bae, S.-H., Qiu, J., Fox, G.: Twister: a runtime for iterative mapreduce. In: Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing, HPDC 2010, pp. 810\u2013818. ACM (2010)","DOI":"10.1145\/1851476.1851593"},{"key":"5_CR24","unstructured":"Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.): Advances in Knowledge Discovery and Data Mining. AAAI\/MIT Press (1996)"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Fedak, G., Fox, G., Antoniu, G., He, H.: Future of mapreduce for scientific computing. In: Proceedings of the Second International Workshop on MapReduce and its Applications, MapReduce 2011, pp. 75\u201376. ACM (2011)","DOI":"10.1145\/1996092.1996108"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: Shortest path. Commun. ACM\u00a05, 345 (1962)","journal-title":"Commun. ACM"},{"issue":"3","key":"5_CR27","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"L. Freeman","year":"1979","unstructured":"Freeman, L.: Centrality in social networks conceptual clarification. Social Networks\u00a01(3), 215\u2013239 (1979)","journal-title":"Social Networks"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1145\/1113830.1113838","volume":"4","author":"B. Gaujal","year":"2005","unstructured":"Gaujal, B., Navet, N., Walsh, C.: Shortest-path algorithms for real-time scheduling of FIFO tasks with minimal energy use. ACM Trans. Embed. Comput. Syst.\u00a04, 907\u2013933 (2005)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"issue":"12","key":"5_CR29","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences\u00a099(12), 7821\u20137826 (2002)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Gupta, R., Malik, S.K.: SPARQL semantics and execution analysis in semantic web using various tools. In: Proceedings of the 2011 International Conference on Communication Systems and Network Technologies, CSNT 2011, pp. 278\u2013282. IEEE Computer Society (2011)","DOI":"10.1109\/CSNT.2011.67"},{"key":"5_CR31","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann (2000)"},{"key":"5_CR32","unstructured":"Husemann, B., Lechtenb\u00f6rger, J., Vossen, G.: Conceptual data warehouse design. In: Proceedings of the International Workshop on Design and Management of Data Warehouses, DMDW 2000, pp. 3\u20139 (2000)"},{"issue":"11","key":"5_CR33","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/240455.240472","volume":"39","author":"T. Imielinski","year":"1996","unstructured":"Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. Commun. ACM\u00a039(11), 58\u201364 (1996)","journal-title":"Commun. ACM"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Isard, M., Budiu, M., Yu, Y., Birrell, A., Fetterly, D.: Dryad: distributed data-parallel programs from sequential building blocks. In: Proceedings of the 2nd ACM SIGOPS\/EuroSys European Conference on Computer Systems 2007, EuroSys 2007, pp. 59\u201372. ACM (2007)","DOI":"10.1145\/1272996.1273005"},{"issue":"3","key":"5_CR35","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A. Jain","year":"1999","unstructured":"Jain, A., Murty, M., Flynn, P.: Data clustering: a review. ACM Computing Surveys (CSUR)\u00a031(3), 264\u2013323 (1999)","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1147\/rd.413.0205","volume":"41","author":"D.R. Kaeli","year":"1997","unstructured":"Kaeli, D.R., Fong, L.L., Booth, R.C., Imming, K.C., Weigel, J.P.: Performance analysis on a cc-numa prototype. IBM J. Res. Dev.\u00a041, 205\u2013214 (1997)","journal-title":"IBM J. Res. Dev."},{"key":"5_CR37","unstructured":"Kang, U., Tsourakakis, C., Appel, A., Faloutsos, C., Leskovec, J.: Hadi: Fast diameter estimation and mining in massive graphs with hadoop. CMU-ML-08-117 (2008)"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: PEGASUS: A peta-scale graph mining system. In: Proceedings of the Ninth IEEE International Conference on Data Mining, ICDM 2009, pp. 229\u2013238. IEEE Computer Society (2009)","DOI":"10.1109\/ICDM.2009.14"},{"key":"5_CR39","unstructured":"Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley-Interscience (2005)"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Khosrow-Pour, M. (ed.): Encyclopedia of Information Science and Technology, 5 volumes. Idea Group (2005)","DOI":"10.4018\/978-1-59140-553-5"},{"key":"5_CR41","unstructured":"Kimball, R., Ross, M.: The Data Warehouse Toolkit: The Complete Guide to Dimensional Modeling, 2nd edn. John Wiley & Sons, Inc. (2002)"},{"key":"5_CR42","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1998, pp. 668\u2013677. ACM\/SIAM (1998)"},{"key":"5_CR43","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM\u00a046, 604\u2013632 (1999)","journal-title":"J. ACM"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Kumar, R., Novak, J., Tomkins, A.: Structure and evolution of online social networks. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2006, pp. 611\u2013617. ACM (2006)","DOI":"10.1145\/1150402.1150476"},{"key":"5_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.scico.2007.07.001","volume":"70","author":"R. L\u00e4mmel","year":"2008","unstructured":"L\u00e4mmel, R.: Google\u2019s mapreduce programming model revisited. Sci. Comput. Program.\u00a070, 1\u201330 (2008)","journal-title":"Sci. Comput. Program."},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: Proceedings of the 17th International Conference on World Wide Web, WWW 2008, pp. 695\u2013704. ACM (2008)","DOI":"10.1145\/1367497.1367591"},{"key":"5_CR47","doi-asserted-by":"crossref","unstructured":"Liu, C., Guo, F., Faloutsos, C.: Bbm: bayesian browsing model from petabyte-scale data. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2009, pp. 537\u2013546. ACM (2009)","DOI":"10.1145\/1557019.1557081"},{"key":"5_CR48","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1109\/90.748088","volume":"6","author":"D.H. Lorenz","year":"1998","unstructured":"Lorenz, D.H., Orda, A.: Qos routing in networks with uncertain parameters. IEEE\/ACM Trans. Netw.\u00a06, 768\u2013778 (1998)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"3","key":"5_CR49","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.datak.2005.11.004","volume":"59","author":"S. Luj\u00e1n-Mora","year":"2006","unstructured":"Luj\u00e1n-Mora, S., Trujillo, J., Song, I.-Y.: A uml profile for multidimensional modeling in data warehouses. Data Knowl. Eng.\u00a059(3), 725\u2013769 (2006)","journal-title":"Data Knowl. Eng."},{"key":"5_CR50","unstructured":"MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol.\u00a01, pp. 281\u2013297. University of California Press (1967)"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, pp. 135\u2013146. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"5_CR52","unstructured":"Malinowski, E., Zim\u00e1nyi, E.: Advanced data warehouse design: From conventional to spatial and temporal applications. Springer (2008)"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Malinowski, E., Zim\u00e1nyi, E.: Multidimensional conceptual modeling. In: Wang, J. (ed.) Encyclopedia of Data Warehousing and Mining, 2nd edn., pp. 293\u2013300. IGI Global (2008)","DOI":"10.4018\/978-1-60566-010-3.ch047"},{"issue":"8-13","key":"5_CR54","first-page":"1225","volume":"29","author":"M. Marchiori","year":"1997","unstructured":"Marchiori, M.: The quest for correct information on the web: Hyper search engines. Computer Networks\u00a029(8-13), 1225\u20131236 (1997)","journal-title":"Computer Networks"},{"key":"5_CR55","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Bazan, N., Munt\u00e9s-Mulero, V., G\u00f3mez-Villamor, S., Nin, J., S\u00e1nchez-Mart\u00ednez, M.-A., Larriba-Pey, J.-L.: Dex: high-performance exploration on large graphs for information retrieval. In: Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, CIKM 2007, pp. 573\u2013582. ACM (2007)","DOI":"10.1145\/1321440.1321521"},{"key":"5_CR56","doi-asserted-by":"crossref","unstructured":"McSherry, F.: Spectral partitioning of random graphs. In: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, pp. 529\u2013537 (2001)","DOI":"10.1109\/SFCS.2001.959929"},{"key":"5_CR57","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1006\/gmip.1998.0480","volume":"60","author":"E.N. Mortensen","year":"1998","unstructured":"Mortensen, E.N., Barrett, W.A.: Interactive segmentation with intelligent scissors. Graph. Models Image Process.\u00a060, 349\u2013384 (1998)","journal-title":"Graph. Models Image Process."},{"key":"5_CR58","unstructured":"Nolan, C.: Manipulate and query OLAP data using ADOMD and multidimensional expressions. Technical report, Microsoft Research (1999)"},{"key":"5_CR59","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab. Previous number = SIDL-WP-1999-0120 (November 1999)"},{"key":"5_CR60","doi-asserted-by":"crossref","unstructured":"Qiu, X., Ekanayake, J., Beason, S., Gunarathne, T., Fox, G., Barga, R., Gannon, D.: Cloud technologies for bioinformatics applications. In: Proceedings of the 2nd Workshop on Many-Task Computing on Grids and Supercomputers, MTAGS 2009, pp. 6:1\u20136:10. ACM (2009)","DOI":"10.1145\/1646468.1646474"},{"issue":"9","key":"5_CR61","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F. Radicchi","year":"2004","unstructured":"Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. Proceedings of the National Academy of Sciences of the United States of America\u00a0101(9), 2658 (2004)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"5_CR62","doi-asserted-by":"crossref","unstructured":"Rattigan, M.J., Maier, M.E., Jensen, D.: Graph clustering with network structure indices. In: Proceedings of the Twenty-Fourth International Conference on Machine Learning, ICML 2007, pp. 783\u2013790. ACM (2007)","DOI":"10.1145\/1273496.1273595"},{"key":"5_CR63","doi-asserted-by":"crossref","unstructured":"Rizzi, S.: Conceptual modeling solutions for the data warehouse. In: Erickson, J. (ed.) Database Technologies: Concepts, Methodologies, Tools, and Applications, pp. 86\u2013104. IGI Global (2009)","DOI":"10.4018\/978-1-60566-058-5.ch006"},{"key":"5_CR64","doi-asserted-by":"crossref","unstructured":"Rodriguez, M.A., Neubauer, P.: A path algebra for multi-relational graphs. In: Proceedings of the 2011 IEEE 27th International Conference on Data Engineering Workshops, ICDEW 2011, pp. 128\u2013131. IEEE Computer Society (2011)","DOI":"10.1109\/ICDEW.2011.5767613"},{"key":"5_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-49121-7_9","volume-title":"Advances in Database Technologies","author":"C. Sapia","year":"1999","unstructured":"Sapia, C., Blaschka, M., H\u00f6fling, G., Dinter, B.: Extending the E\/R Model for the Multidimensional Paradigm. In: Kambayashi, Y., Lee, D.-L., Lim, E.-P., Mohania, M., Masunaga, Y. (eds.) ER 1998. LNCS, vol.\u00a01552, pp. 105\u2013116. Springer, Heidelberg (1999)"},{"key":"5_CR66","doi-asserted-by":"crossref","unstructured":"Sch\u00e4tzle, A., Przyjaciel-Zablocki, M., Lausen, G.: PigSPARQL: mapping SPARQL to Pig Latin. In: Proceedings of the International Workshop on Semantic Web Information Management, SWIM 2011, pp. 4:1\u20134:8. ACM (2011)","DOI":"10.1145\/1999299.1999303"},{"key":"5_CR67","unstructured":"Segaran, T., Evans, C., Taylor, J.: Programming the Semantic Web - Build Flexible Applications with Graph Data. O\u2019Reilly (2009)"},{"key":"5_CR68","unstructured":"Sommer, C.: Approximate Shortest Path and Distance Queries in Networks. PhD thesis, University of Tokyo (2010)"},{"key":"5_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-19595-2_17","volume-title":"Languages and Compilers for Parallel Computing","author":"X. Sui","year":"2011","unstructured":"Sui, X., Nguyen, D., Burtscher, M., Pingali, K.: Parallel Graph Partitioning on Multicore Architectures. In: Cooper, K., Mellor-Crummey, J., Sarkar, V. (eds.) LCPC 2010. LNCS, vol.\u00a06548, pp. 246\u2013260. Springer, Heidelberg (2011)"},{"key":"5_CR70","doi-asserted-by":"crossref","unstructured":"Tryfona, N., Busborg, F., Christiansen, J.G.B.: Starer: A conceptual model for data warehouse design. In: Proceedings of the Second ACM International Workshop on Data Warehousing and OLAP, DOLAP 1999, pp. 3\u20138. ACM (1999)","DOI":"10.1145\/319757.319776"},{"key":"5_CR71","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L.G. Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM\u00a033, 103\u2013111 (1990)","journal-title":"Commun. ACM"},{"key":"5_CR72","doi-asserted-by":"crossref","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Structural analysis in the social sciences, vol.\u00a08. Cambridge University Press (1994)","DOI":"10.1017\/CBO9780511815478"},{"key":"5_CR73","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1287\/trsc.32.1.65","volume":"32","author":"F.B. Zhan","year":"1998","unstructured":"Zhan, F.B., Noon, C.E.: Shortest path algorithms: An evaluation using real road networks. Transportation Science\u00a032, 65\u201373 (1998)","journal-title":"Transportation Science"},{"key":"5_CR74","doi-asserted-by":"crossref","unstructured":"Zhao, P., Li, X., Xin, D., Han, J.: Graph cube: on warehousing and OLAP multidimensional networks. In: Proceedings of the 2011 International Conference on Management of Data, SIGMOD 2011, pp. 853\u2013864. ACM (2011)","DOI":"10.1145\/1989323.1989413"},{"key":"5_CR75","unstructured":"Zhao, X., Sala, A., Wilson, C., Zheng, H., Zhao, B.Y.: Orion: shortest path estimation for large social graphs. In: Proceedings of the 3rd Conference on Online Social Networks, WOSN 2010, p. 9. USENIX Association (2010)"},{"key":"5_CR76","doi-asserted-by":"crossref","unstructured":"Zhou, A., Qian, W., Tao, D., Ma, Q.: Disg: A distributed graph repository for web infrastructure (invited paper). In: Proceedings of the Second International Symposium on Universal Communication, ISUC 2008, pp. 141\u2013145. IEEE Computer Society (2008)","DOI":"10.1109\/ISUC.2008.83"},{"key":"5_CR77","unstructured":"Zhuang, L., Dunagan, J., Simon, D.R., Wang, H.J., Tygar, J.D.: Characterizing botnets from email spam records. In: Proceedings of the 1st Usenix Workshop on Large-Scale Exploits and Emergent Threats, pp. 2:1\u20132:9. USENIX Association (2008)"}],"container-title":["Lecture Notes in Business Information Processing","Business Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36318-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T01:57:25Z","timestamp":1745978245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-36318-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642363177","9783642363184"],"references-count":77,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36318-4_5","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2013]]}}}