{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T17:12:42Z","timestamp":1763572362792,"version":"3.41.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T00:00:00Z","timestamp":1472860800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472263"],"award-info":[{"award-number":["61472263"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Australian Research Council (AU)","award":["DP150103008"],"award-info":[{"award-number":["DP150103008"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s11280-016-0407-z","type":"journal-article","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T06:47:22Z","timestamp":1472885242000},"page":"677-696","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["HD-GDD: high dimensional graph dominance drawing approach for reachability query"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1386-767X","authenticated-orcid":false,"given":"Lei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Hua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,3]]},"reference":[{"key":"407_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. ACM 18(2) (1989)","DOI":"10.1145\/66926.66950"},{"key":"407_CR2","doi-asserted-by":"crossref","unstructured":"Anyanwu, K., Sheth, A: P-queries: enabling querying for semantic associations on the semantic Web. In: Proceedings of the 12th International Conference on World Wide Web, pp. 690\u2013699. ACM (2003)","DOI":"10.1145\/775152.775249"},{"key":"407_CR3","unstructured":"Baidu internal links network dataset \u2013 KONECT (2014) [Online]. Available: http:\/\/konect.uni-koblenz.de\/networks\/zhishi-baidu-internallink"},{"issue":"1","key":"407_CR4","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/s007780050083","volume":"9","author":"B Berendt","year":"2000","unstructured":"Berendt, B., Spiliopoulou, M.: Analysis of navigation behaviour in Web sites integrating multiple information systems. VLDB J Int J Very Large Data Bases 9(1), 56\u201375 (2000)","journal-title":"VLDB J Int J Very Large Data Bases"},{"key":"407_CR5","doi-asserted-by":"crossref","unstructured":"Bollacker, K., Lawrence, S., Giles, C.L.: CiteSeer: An autonomous Web agent for automatic retrieval and identification of interesting publications. In: Proc. Int. Conf. on Autonomous Agents, pp. 116\u2013123 (1998)","DOI":"10.1145\/280765.280786"},{"key":"407_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, Y.: An efficient algorithm for answering graph reachability queries. In: IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008, pp. 893\u2013902. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497498"},{"key":"407_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X., Lin, X., Wang, H., Yu, P.S: Fast computing reachability labelings for large graphs with high compression rate. In: Proceedings of the 11th International Conference On Extending Database Technology: Advances In Database Technology, pp. 193\u2013204. ACM (2008)","DOI":"10.1145\/1353343.1353370"},{"key":"407_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, J., Huang, S., Wu, H., Fu, A.W.-C: Tf-label: A topological-folding labeling scheme for reachability querying in a large graph. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 193\u2013204. ACM (2013)","DOI":"10.1145\/2463676.2465286"},{"issue":"5\u20136","key":"407_CR9","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s11280-011-0146-0","volume":"15","author":"M-F Chiang","year":"2012","unstructured":"Chiang, M.-F., Peng, W.-C., Philip, S.Y.: Exploring latent browsing graph for question answering recommendation. World Wide Web 15(5\u20136), 603\u2013630 (2012)","journal-title":"World Wide Web"},{"key":"407_CR10","unstructured":"Citeseer network dataset \u2013 KONECT (2015) [Online]. Available: http:\/\/konect.uni-koblenz.de\/networks\/citeseer"},{"issue":"5","key":"407_CR11","doi-asserted-by":"crossref","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"407_CR12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s11280-012-0168-2","volume":"16","author":"Y Cui","year":"2013","unstructured":"Cui, Y., Pei, J., Tang, G., Luk, W.-S., Jiang, D., Hua, M.: Finding email correspondents in online social networks. World Wide Web 16(2), 195\u2013218 (2013)","journal-title":"World Wide Web"},{"key":"407_CR13","doi-asserted-by":"crossref","unstructured":"Eades, P., ElGindy, H., Houle, M., Lenhart, B., Miller, M., Rappaport, D., Whitesides, S: Dominance drawings of bipartite graphs (1994)","DOI":"10.1007\/BF01187020"},{"key":"407_CR14","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P ERDdS","year":"1959","unstructured":"ERDdS, P., A.R., WI: On random graphs i. Publ. Math. Debrecen 6, 290\u2013297 (1959)","journal-title":"Publ. Math. Debrecen"},{"key":"407_CR15","unstructured":"Eu institution network dataset \u2013 KONECT (2014) [Online]. Available: http:\/\/konect.uni-koblenz.de\/networks\/email-EuAll"},{"key":"407_CR16","doi-asserted-by":"crossref","unstructured":"Fernandez, M., Florescu, D., Levy, A., Suciu, D.: A query language and processor for a web-site management system. In: Proc. of the Workshop on Semi-Structured Data, pp. 26\u201333. Citeseer, Tucson (1997)","DOI":"10.1145\/262762.262763"},{"key":"407_CR17","unstructured":"Google network dataset \u2013 KONECT (2014) [Online]. Available: http:\/\/konect.uni-koblenz.de\/networks\/web-Google"},{"key":"407_CR18","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in Science Conference (SciPy2008), pp. 11\u201315. Pasadena (2008)","DOI":"10.25080\/TCWV9851"},{"key":"407_CR19","doi-asserted-by":"crossref","unstructured":"Hall, B.H., Jaffe, A.B., Trajtenberg, M.: The NBER patent citations data file: Lessons, insights and methodological tools. In: NBER Working Papers 8498, National Bureau of Economic Research, Inc (2001)","DOI":"10.3386\/w8498"},{"key":"407_CR20","doi-asserted-by":"crossref","unstructured":"He, H., Wang, H., Yang, J., Yu, P.S: Compact reachability labeling for graph-structured data. In: Proceedings of the 14th ACM International Conference on Information and Knowledge Management, pp. 594\u2013601. ACM (2005)","DOI":"10.1145\/1099554.1099708"},{"issue":"14","key":"407_CR21","first-page":"1978","volume":"6","author":"R Jin","year":"2013","unstructured":"Jin, R., Wang, G.: Simple, fast, and scalable reachability oracle. Proc. VLDB Endow. 6(14), 1978\u20131989 (2013). doi: 10.14778\/2556549.2556578","journal-title":"Proc. VLDB Endow."},{"key":"407_CR22","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Wang, H: Efficiently answering reachability queries on very large directed graphs. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 595\u2013608. ACM (2008)","DOI":"10.1145\/1376616.1376677"},{"key":"407_CR23","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-hop: A high-compression indexing scheme for reachability query. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, pp. 813\u2013826. ACM (2009)","DOI":"10.1145\/1559845.1559930"},{"issue":"3","key":"407_CR24","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0020-0190(75)90019-8","volume":"3","author":"T Kameda","year":"1975","unstructured":"Kameda, T.: On the vector representation of the reachability in planar directed graphs. Inf. Process. Lett. 3(3), 75\u201377 (1975)","journal-title":"Inf. Process. Lett."},{"key":"407_CR25","unstructured":"Kornaropoulos, E.M., Tollis, I.G.: Weak dominance drawings and linear extension diameter. arXiv preprint arXiv: 1108.1439 (2011)"},{"key":"407_CR26","doi-asserted-by":"crossref","unstructured":"Kornaropoulos, E.M., Tollis, I.G: Overloaded orthogonal drawings. In: Graph Drawing, pp. 242\u2013253. Springer (2012)","DOI":"10.1007\/978-3-642-25878-7_24"},{"key":"407_CR27","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT \u2013 the Koblenz network collection. In: Proc. Int. Conf. on World Wide Web Companions, pp. 1343\u20131350. http:\/\/userpages.uni-koblenz.de\/kunegis\/paper\/kunegis-koblenz-network-collection.pdf (2013)","DOI":"10.1145\/2487788.2488173"},{"issue":"3","key":"407_CR28","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s11280-013-0202-z","volume":"17","author":"S Kutty","year":"2014","unstructured":"Kutty, S., Nayak, R., Chen, L.: A people-to-people matching system using graph mining techniques. World Wide Web 17(3), 311\u2013349 (2014)","journal-title":"World Wide Web"},{"issue":"1","key":"407_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. ACM Trans. Knowledge Discov. Data 1(1), 1\u201340 (2007)","journal-title":"ACM Trans. Knowledge Discov. Data"},{"key":"407_CR30","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: Proc. Int. World Wide Web Conf., pp. 695\u2013704 (2008)","DOI":"10.1145\/1367497.1367591"},{"key":"407_CR31","doi-asserted-by":"crossref","unstructured":"Niu, X., Sun, X., Wang, H., Rong, S., Qi, G., Yu, Y: Zhishi.me \u2013 weaving Chinese linking open data. In: Proc. Int. Semantic Web Conf., pp. 205\u2013220 (2011)","DOI":"10.1007\/978-3-642-25093-4_14"},{"key":"407_CR32","first-page":"1","volume":"74","author":"E Nuutila","year":"1995","unstructured":"Nuutila, E.: Efficient transitive closure computation in large digraphs. Acta Polytechnica Scandinavia: Math. Comput. Eng. 74, 1\u2013124 (1995) [ http:\/\/dl.acm.org\/ citation.cfm?id=224478.224481 ]","journal-title":"Acta Polytechnica Scandinavia: Math. Comput. Eng."},{"key":"407_CR33","doi-asserted-by":"crossref","unstructured":"Schenkel, R., Theobald, A., Weikum, G.: Efficient creation and incremental maintenance of the hopi index for complex xml document collections. In: 21st International Conference on Data Engineering, 2005. ICDE 2005. Proceedings, pp. 360\u2013371. IEEE (2005)","DOI":"10.1109\/ICDE.2005.57"},{"key":"407_CR34","doi-asserted-by":"crossref","unstructured":"Seufert, S., Anand, A., Bedathur, S., Weikum, G: Ferrari: Flexible and efficient reachability range assignment for graph indexing. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 1009\u20131020. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544893"},{"issue":"2","key":"407_CR35","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"407_CR36","unstructured":"Us patents network dataset \u2013 KONECT (2014) [Online]. Available: http:\/\/konect.uni-koblenz.de\/networks\/patentcite"},{"issue":"9-10","key":"407_CR37","first-page":"921","volume":"381","author":"J Van Helden","year":"2000","unstructured":"Van Helden, J., Naim, A., Mancuso, R., Eldridge, M., Wernisch, L., Gilbert, D., Wodak, S.J.: Representing and analysing molecular and cellular function in the computer. Biol. Chem. 381(9-10), 921\u2013935 (2000)","journal-title":"Biol. Chem."},{"key":"407_CR38","doi-asserted-by":"crossref","unstructured":"van Schaik, S.J., de Moor, O.: A memory efficient reachability data structure through bit vector compression. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, pp. 913\u2013924. ACM (2011)","DOI":"10.1145\/1989323.1989419"},{"key":"407_CR39","unstructured":"Veloso, R.R., Cerf, L., Junior, W.M., Zaki, M.J: Reachability queries in very large graphs: A fast refined online search approach. In: EDBT, pp. 511\u2013522 (2014)"},{"issue":"4","key":"407_CR40","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s11280-008-0050-4","volume":"11","author":"H Wang","year":"2008","unstructured":"Wang, H., Li, J., Wang, W., Lin, X.: Coding-based join algorithms for structural queries on graph-structured xml document. World Wide Web 11(4), 485\u2013510 (2008)","journal-title":"World Wide Web"},{"issue":"6684","key":"407_CR41","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-worldnetworks,. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"407_CR42","first-page":"12","volume":"7","author":"H Wei","year":"2014","unstructured":"Wei, H., Yu, J.X., Lu, C., Jin, R.: Reachability querying: An independent permutation labeling approach. Proc. VLDB Endowment 7, 12 (2014)","journal-title":"Proc. VLDB Endowment"},{"issue":"1\u20132","key":"407_CR43","doi-asserted-by":"crossref","first-page":"276","DOI":"10.14778\/1920841.1920879","volume":"3","author":"H Yildirim","year":"2010","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J.: Grail: Scalable reachability index for large graphs. Proc. VLDB Endowment 3(1\u20132), 276\u2013284 (2010)","journal-title":"Proc. VLDB Endowment"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0407-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-016-0407-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0407-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0407-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:42:06Z","timestamp":1749573726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-016-0407-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,3]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["407"],"URL":"https:\/\/doi.org\/10.1007\/s11280-016-0407-z","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2016,9,3]]}}}