{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T03:21:39Z","timestamp":1709868099932},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,8,2]],"date-time":"2016-08-02T00:00:00Z","timestamp":1470096000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s11280-016-0401-5","type":"journal-article","created":{"date-parts":[[2016,8,2]],"date-time":"2016-08-02T05:51:41Z","timestamp":1470117101000},"page":"515-541","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Para-G: Path pattern query processing on large graphs"],"prefix":"10.1007","volume":"20","author":[{"given":"Yiyuan","family":"Bai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaokun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Ying","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,2]]},"reference":[{"issue":"1","key":"401_CR1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s007990050005","volume":"1","author":"S Abiteboul","year":"1997","unstructured":"Abiteboul, S., Quass, D., McHugh, J., Widom, J., Wiener, J.L.: The lorel query language for semistructured data. Int. J. Dig. Libr. 1(1), 68\u201388 (1997).","journal-title":"Int. J. Dig. Libr."},{"key":"401_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data. ACM, 253\u2013262 (1989).","DOI":"10.1145\/67544.66950"},{"key":"401_CR3","unstructured":"Bai, Y., Wang, C., Ning, Y., Wu, H., Wang, H.: G-Path: Flexible path pattern query on large graphs. Proceedings of the 22nd International Conference on World Wide WEB (Companion Volume). ACM Press, Rio de Janeiro, Brazil, 333\u2013336 (2013)."},{"key":"401_CR4","doi-asserted-by":"crossref","unstructured":"Bai, Y., Wang, C., Ying, X., Wang, M., Gong, Y.: Path pattern query processing on large graphs. Proceedings of the 3rd International Workshop on Graph Databases and Social Networking (GSN. IEEE Press, Sydney, Australia, 2014 (2014).","DOI":"10.1109\/BDCloud.2014.101"},{"key":"401_CR5","unstructured":"Chen, L., Gupta, A., Kurul, M.E.: Stack-based algorithms for pattern matching on DAGs. Proceedings of the 31st International Conference on Very Large Data Bases, VLDB \u201905. VLDB Endowment, 493\u2013504 (2005)."},{"key":"401_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, Y.: An efficient algorithm for answering graph reachability queries. IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008, 893 \u2013902 (2008).","DOI":"10.1109\/ICDE.2008.4497498"},{"key":"401_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X., Lin, X., Wang, H., Yu, P.S.: Fast computation of reachability labeling for large graphs. Advance Database Technology-EDBT 2006 pp. 961\u2013979, 2006.","DOI":"10.1007\/11687238_56"},{"issue":"5","key":"401_CR8","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."},{"key":"401_CR9","doi-asserted-by":"crossref","unstructured":"Consens, M.P., Mendelzon, A.O.: GraphLog: A visual formalism for real life recursion. Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, 404\u2013416 (1990).","DOI":"10.1145\/298514.298591"},{"key":"401_CR10","unstructured":"Detwiler, L.T., Suciu, D., Brinkley, J.F.: Regular paths in SPARQL: Querying the NCI thesaurus. AMIA Annual Symposium Proceedings. American Medical Informatics Association, 161 (2008)."},{"key":"401_CR11","doi-asserted-by":"crossref","unstructured":"Fan, W.: Graph pattern matching revised for social network analysis. Proceedings of the 15th International Conference on Database Theory. ACM, 8\u201321 (2012).","DOI":"10.1145\/2274576.2274578"},{"issue":"3","key":"401_CR12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s11704-012-1312-y","volume":"6","author":"W Fan","year":"2012","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y.: Adding regular expressions to graph reachability and pattern queries. Front. Comput. Sci. 6(3), 313\u2013338 (2012).","journal-title":"Front. Comput. Sci."},{"key":"401_CR13","doi-asserted-by":"crossref","unstructured":"Florescu, D., Levy, A., Suciu, D.: Query containment for conjunctive queries with regular expressions. Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, 139\u2013148 (1998).","DOI":"10.1145\/275487.275503"},{"key":"401_CR14","doi-asserted-by":"crossref","unstructured":"Giugno, R., Shasha, D.: Graphgrep: A fast and universal method for querying graphs. Proceedings of 16th International Conference on Pattern Recognition. IEEE, 112\u2013115 (2002).","DOI":"10.1109\/ICPR.2002.1048250"},{"issue":"1","key":"401_CR15","doi-asserted-by":"crossref","first-page":"449","DOI":"10.14778\/1920841.1920901","volume":"3","author":"WS Han","year":"2010","unstructured":"Han, W.S., Lee, J., Pham, M.D., Yu, J.X.: iGraph: A framework for comparisons of disk-based graph indexing techniques. Proc. VLDB Endowment. 3(1), 449\u2013459 (2010).","journal-title":"Proc. VLDB Endowment"},{"key":"401_CR16","unstructured":"He, H., Singh, A.K.: GraphQL: Query language and access methods for graph databases. Technical Report, Technical Report, Department of Computer Science at University of California, Santa Barbara (2007)."},{"key":"401_CR17","doi-asserted-by":"crossref","unstructured":"Husain, M.F., Khan, L., Kantarcioglu, M., Thuraisingham, B.: Data intensive query processing for large RDF graphs using cloud computing tools. 2010 IEEE 3rd International Conference on Cloud Computing (CLOUD). IEEE, 1\u201310 (2010).","DOI":"10.1109\/CLOUD.2010.36"},{"issue":"4","key":"401_CR18","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/99935.99944","volume":"15","author":"HV Jagadish","year":"1990","unstructured":"Jagadish, H.V.: A compression technique to materialize transitive closure. ACM Trans. Database Syst. 15(4), 558\u2013598 (1990).","journal-title":"ACM Trans. Database Syst."},{"key":"401_CR19","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Wang, H.: Efficiently answering reachability queries on very large directed graphs. Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. ACM, 595\u2013608 (2008).","DOI":"10.1145\/1376616.1376677"},{"issue":"1","key":"401_CR20","first-page":"321","volume":"20","author":"H Kashima","year":"2003","unstructured":"Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. Proc. Twentieth Int. Conf. Mach. Learn. 20(1), 321 (2003).","journal-title":"Proc. Twentieth Int. Conf. Mach. Learn."},{"issue":"6","key":"401_CR21","doi-asserted-by":"crossref","first-page":"2154","DOI":"10.1109\/TIE.2010.2050292","volume":"58","author":"W Lee","year":"2011","unstructured":"Lee, W., Leung, C.K.S., Lee, J.J.H.: Mobile web navigation in digital ecosystems using rooted directed trees. IEEE Trans. Indust. Electron. (TIE). 58(6), 2154\u20132162 (2011).","journal-title":"IEEE Trans. Indust. Electron. (TIE)"},{"issue":"1","key":"401_CR22","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11280-012-0200-6","volume":"17","author":"Z Liu","year":"2014","unstructured":"Liu, Z., Wang, C., Wang, J.: Aggregate Nearest Neighbor Queries in Uncertain Graphs. World Wide WEB J. 17(1), 161\u2013188 (2014).","journal-title":"World Wide WEB J."},{"key":"401_CR23","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: A system for large-scale graph processing. Proceedings of the 2010 International Conference on Management of Data. ACM, 135\u2013146 (2010).","DOI":"10.1145\/1807167.1807184"},{"key":"401_CR24","doi-asserted-by":"crossref","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Transactions on Electronic Computers, 39\u201347 (1960).","DOI":"10.1109\/TEC.1960.5221603"},{"issue":"6","key":"401_CR25","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1137\/S009753979122370X","volume":"24","author":"AO Mendelzon","year":"1995","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. SIAM J. Comput. 24(6), 1235\u20131258 (1995).","journal-title":"SIAM J. Comput"},{"issue":"4","key":"401_CR26","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s11280-013-0212-x","volume":"17","author":"Z Peng","year":"2014","unstructured":"Peng, Z., Wang, C.: Member promotion in social networks via skyline. World Wide WEB J. 17(4), 457\u2013492 (2014).","journal-title":"World Wide WEB J."},{"key":"401_CR27","unstructured":"Prud\u2019hommeaux, E., Seaborne, A.: SPARQL query language for RDF. W3C Recomm. 15 (2008)."},{"key":"401_CR28","doi-asserted-by":"crossref","unstructured":"Ronen, R., Shmueli, O.: SoQL: A language for querying and creating data in social networks. IEEE 25th International Conference on Data Engineering, 2009. ICDE\u201909. IEEE, 1595\u20131602 (2009).","DOI":"10.1109\/ICDE.2009.172"},{"issue":"1\u20133","key":"401_CR29","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(88)90032-1","volume":"58","author":"K Simon","year":"1988","unstructured":"Simon, K.: An improved algorithm for transitive closure on acyclic digraphs. Theor. Comput. Sci. 58(1\u20133), 325\u2013346 (1988).","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"401_CR30","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s11280-013-0204-x","volume":"17","author":"Y Yang","year":"2014","unstructured":"Yang, Y., Yu, J.X., Gao, H., Pei, J., Li, J.: Mining most frequently changing component in evolving graphs. World Wide WEB J. 17(3), 351\u2013376 (2014).","journal-title":"World Wide WEB J."},{"issue":"1","key":"401_CR31","doi-asserted-by":"crossref","first-page":"886","DOI":"10.14778\/1687627.1687727","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou, L., Chen, L., \u00d6zsu, M. T.: Distance-join: Pattern match query in a large graph database. Proc. VLDB Endowment. 2(1), 886\u2013897 (2009).","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-0401-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-016-0401-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0401-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0401-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T18:09:52Z","timestamp":1656958192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-016-0401-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,2]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["401"],"URL":"https:\/\/doi.org\/10.1007\/s11280-016-0401-5","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,2]]}}}