{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:45Z","timestamp":1740122745369,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,11,30]],"date-time":"2018-11-30T00:00:00Z","timestamp":1543536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,11,30]],"date-time":"2018-11-30T00:00:00Z","timestamp":1543536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2017R1A2B4012559"],"award-info":[{"award-number":["NRF-2017R1A2B4012559"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning","doi-asserted-by":"publisher","award":["IITP-2018-2016-0-00314"],"award-info":[{"award-number":["IITP-2018-2016-0-00314"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10732-018-9402-0","type":"journal-article","created":{"date-parts":[[2018,11,30]],"date-time":"2018-11-30T08:16:12Z","timestamp":1543565772000},"page":"149-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Estimating searching cost of regular path queries on large graphs by exploiting unit-subqueries"],"prefix":"10.1007","volume":"28","author":[{"given":"Van-Quyet","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Quyet-Thang","family":"Huynh","sequence":"additional","affiliation":[]},{"given":"Kyungbaek","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,30]]},"reference":[{"key":"9402_CR1","doi-asserted-by":"crossref","unstructured":"Abul-Basher, Z.: Multiple-query optimization of regular path queries. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 1426\u20131430. IEEE (2017)","DOI":"10.1109\/ICDE.2017.205"},{"issue":"2","key":"9402_CR2","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ipl.2008.01.003","volume":"107","author":"J Almeida","year":"2008","unstructured":"Almeida, J., Zeitoun, M.: Description and analysis of a bottom-up DFA minimization algorithm. Inf. Process. Lett. 107(2), 52\u201359 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9402_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/2389241.2389250","volume":"37","author":"P Barcel\u00f3","year":"2012","unstructured":"Barcel\u00f3, P., Libkin, L., Lin, A.W., Wood, P.T.: Expressive languages for path queries over graph-structured data. ACM Trans. Database Syst. 37(4), 31 (2012)","journal-title":"ACM Trans. Database Syst."},{"key":"9402_CR4","doi-asserted-by":"crossref","unstructured":"Barcel\u00f3\u00a0Baeza, P.: Querying graph databases. In: Proceedings of the 32nd ACM SIGMOD\u2013SIGACT\u2013SIGAI Symposium on Principles of Database Systems, pp 175\u2013188. ACM (2013)","DOI":"10.1145\/2463664.2465216"},{"key":"9402_CR5","doi-asserted-by":"crossref","unstructured":"Bast, H., B\u00e4urle, F., Buchhold, B., Hau\u00dfmann, E.: Easy access to the freebase dataset. In: Proceedings of the 23rd International Conference on World Wide Web. ACM, pp. 95\u201398 (2014)","DOI":"10.1145\/2567948.2577016"},{"key":"9402_CR6","doi-asserted-by":"crossref","unstructured":"Bastian, M., Heymann, S., Jacomy, M., et al.: Gephi: an open source software for exploring and manipulating networks. In: ICWSM, vol. 8, pp. 361\u2013362 (2009)","DOI":"10.1609\/icwsm.v3i1.13937"},{"key":"9402_CR7","doi-asserted-by":"crossref","unstructured":"Bollacker, K., Evans, C., Paritosh, P., Sturge, T., Taylor, J.: Freebase: a collaboratively created graph database for structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 1247\u20131250. ACM (2008)","DOI":"10.1145\/1376616.1376746"},{"key":"9402_CR8","doi-asserted-by":"crossref","unstructured":"Calvanese, D., De\u00a0Giacomo, G., Lenzerini, M., Vardi, M.Y.: Rewriting of regular expressions and regular path queries. In: Proceedings of the Eighteenth ACM SIGMOD\u2013SIGACT\u2013SIGART Symposium on Principles of Database Systems, pp. 194\u2013204. ACM (1999)","DOI":"10.1145\/303976.303996"},{"key":"9402_CR9","doi-asserted-by":"crossref","unstructured":"Cong, G., Fan, W., Kementsietsidis, A.: Distributed query evaluation with performance guarantees. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, pp. 509\u2013520. ACM (2007)","DOI":"10.1145\/1247480.1247537"},{"key":"9402_CR10","doi-asserted-by":"crossref","unstructured":"Consens, M.P., Mendelzon, A.O.: Graphlog: a visual formalism for real life recursion. In: Proceedings of the ninth ACM SIGACT\u2013SIGMOD\u2013SIGART Symposium on Principles of Database Systems, pp. 404\u2013416. ACM (1990)","DOI":"10.1145\/298514.298591"},{"key":"9402_CR11","doi-asserted-by":"crossref","unstructured":"Cruz, I.F., Mendelzon, A.O., Wood, P.T.: A graphical query language supporting recursion. In: ACM SIGMOD Record, vol. 16, pp. 323\u2013330. ACM (1987)","DOI":"10.1145\/38714.38749"},{"key":"9402_CR12","doi-asserted-by":"crossref","unstructured":"Davoust, A., Esfandiari, B.: Processing regular path queries on arbitrarily distributed data. In: OTM Confederated International Conferences On the Move to Meaningful Internet Systems, pp. 844\u2013861. Springer (2016)","DOI":"10.1007\/978-3-319-48472-3_53"},{"issue":"11","key":"9402_CR13","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.14778\/2350229.2350248","volume":"5","author":"W Fan","year":"2012","unstructured":"Fan, W., Wang, X., Wu, Y.: Performance guarantees for distributed reachability queries. Proc. VLDB Endow. 5(11), 1304\u20131316 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"9402_CR14","unstructured":"Fernandez, M., Suciu, D.: Optimizing regular path expressions using graph schemas. In: Proceedings, 14th International Conference on Data Engineering, 1998, pp. 14\u201323. IEEE (1998)"},{"key":"9402_CR15","unstructured":"Fletcher, G.H., Peters, J., Poulovassilis, A.: Efficient regular path query evaluation using path indexes. In: Proceedings of the 19th International Conference on Extending Database Technology (EDBT), pp. 636\u2013639 (2016)"},{"key":"9402_CR16","unstructured":"Goldman, R., Widom, J.: Dataguides: enabling query formulation and optimization in semistructured databases. In: VLDB\u201997, Proceedings of 23rd International Conference on Very Large Data Bases, 25\u201329 Aug 1997, Athens, Greece, pp. 436\u2013445 (1997). http:\/\/www.vldb.org\/conf\/1997\/P436.PDF. Accessed 23 Aug 2017"},{"key":"9402_CR17","doi-asserted-by":"crossref","unstructured":"Grahne, G., Thomo, A.: An optimization technique for answering regular path queries. In: WebDB (Selected Papers), pp. 215\u2013225. Springer (2000)","DOI":"10.1007\/3-540-45271-0_14"},{"key":"9402_CR18","doi-asserted-by":"crossref","unstructured":"Grahne, G., Thomo, A.: Query containment and rewriting using views for regular path queries under constraints. In: Proceedings of the Twenty-Second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 111\u2013122. ACM (2003)","DOI":"10.1145\/773153.773165"},{"key":"9402_CR19","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co., Inc. Boston, MA, USA, (2006)"},{"key":"9402_CR20","doi-asserted-by":"crossref","unstructured":"Konstas, I., Stathopoulos, V., Jose, J.M..: On social networks and collaborative recommendation. In: Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 195\u2013202. ACM (2009)","DOI":"10.1145\/1571941.1571977"},{"key":"9402_CR21","doi-asserted-by":"crossref","unstructured":"Koschmieder, A., Leser, U.: Regular path queries on large graphs. In: Scientific and Statistical Database Management, pp. 177\u2013194. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-31235-9_12"},{"issue":"4","key":"9402_CR22","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/371578.371598","volume":"32","author":"D Kossmann","year":"2000","unstructured":"Kossmann, D.: The state of the art in distributed query processing. ACM Comput. Surv. 32(4), 422\u2013469 (2000)","journal-title":"ACM Comput. Surv."},{"key":"9402_CR23","unstructured":"Le\u00a0Anh, V., Kiss, A.: Efficient processing regular queries in shared-nothing parallel database systems using tree-and structural indexes. In: ADBIS Research Communications (2007)"},{"key":"9402_CR24","doi-asserted-by":"crossref","unstructured":"Libkin, L., Vrgo\u010d, D.: Regular path queries on graphs with data. In: Proceedings of the 15th International Conference on Database Theory, pp. 74\u201385. ACM (2012)","DOI":"10.1145\/2274576.2274585"},{"issue":"10","key":"9402_CR25","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1109\/JSAC.2014.2358839","volume":"32","author":"T Liu","year":"2014","unstructured":"Liu, T., Liu, A.X., Shi, J., Sun, Y., Guo, L.: Towards fast and optimal grouping of regular expressions via DFA size estimation. IEEE J. Sel. Areas Commun. 32(10), 1797\u20131809 (2014)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"11","key":"9402_CR26","doi-asserted-by":"publisher","first-page":"e0165864","DOI":"10.1371\/journal.pone.0165864","volume":"11","author":"D Liu","year":"2016","unstructured":"Liu, D., Huang, Z., Zhang, Y., Guo, X., Su, S.: Efficient deterministic finite automata minimization based on backward depth information. PloS ONE 11(11), e0165864 (2016)","journal-title":"PloS ONE"},{"key":"9402_CR27","unstructured":"Mahdisoltani, F., Biega, J., Suchanek, FM.: Yago3: a knowledge base from multilingual Wikipedias. In: CIDR (2013)"},{"issue":"6","key":"9402_CR28","doi-asserted-by":"publisher","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."},{"key":"9402_CR29","doi-asserted-by":"crossref","unstructured":"Nguyen-Van, Q., Tung, LD., Hu, Z.: Minimizing data transfers for regular reachability queries on distributed graphs. In: Proceedings of the Fourth Symposium on Information and Communication Technology, pp. 325\u2013334. ACM (2013)","DOI":"10.1145\/2542050.2542092"},{"issue":"2","key":"9402_CR30","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1089\/cmb.2006.13.133","volume":"13","author":"J Scott","year":"2006","unstructured":"Scott, J., Ideker, T., Karp, R.M., Sharan, R.: Efficient algorithms for detecting signaling pathways in protein interaction networks. J. Comput. Biol. 13(2), 133\u2013144 (2006)","journal-title":"J. Comput. Biol."},{"key":"9402_CR31","doi-asserted-by":"crossref","unstructured":"Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: a core of semantic knowledge. In: Proceedings of the 16th International Conference on World Wide Web, pp. 697\u2013706. ACM (2007)","DOI":"10.1145\/1242572.1242667"},{"issue":"1","key":"9402_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/507234.507235","volume":"27","author":"D Suciu","year":"2002","unstructured":"Suciu, D.: Distributed query evaluation on semistructured data. ACM Trans. Database Syst. 27(1), 1\u201362 (2002)","journal-title":"ACM Trans. Database Syst."},{"key":"9402_CR33","unstructured":"Tri\u00dfl, S.: Cost-based optimization of graph queries. In: Proceedings of the SIGMOD\/PODS PhD Workshop on Innovative Database Research (IDAR) (2007)"},{"key":"9402_CR34","unstructured":"Tri\u00dfl, S., Leser, U.: Estimating result size and execution times for graph queries. In: ADBIS (Local Proceedings), pp. 11\u201320 (2010)"},{"key":"9402_CR35","doi-asserted-by":"crossref","unstructured":"Tung, L.D., Nguyen-Van, Q., Hu, Z.: Efficient query evaluation on distributed graphs with Hadoop environment. In: Proceedings of the Fourth Symposium on Information and Communication Technology, pp. 311\u2013319. ACM (2013)","DOI":"10.1145\/2542050.2542086"},{"key":"9402_CR36","doi-asserted-by":"crossref","unstructured":"Yakovets, N., Godfrey, P., Gryz, J.: Query planning for evaluating SPARQL property paths. In: Proceedings of the 2016 International Conference on Management of Data, pp. 1875\u20131889. ACM (2016)","DOI":"10.1145\/2882903.2882944"},{"key":"9402_CR37","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Patterns of temporal variation in online media. In: Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, pp. 177\u2013186. ACM (2011)","DOI":"10.1145\/1935826.1935863"},{"issue":"1","key":"9402_CR38","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowl. Inf. Syst. 42(1), 181\u2013213 (2015)","journal-title":"Knowl. Inf. Syst."},{"issue":"6","key":"9402_CR39","doi-asserted-by":"publisher","first-page":"397","DOI":"10.2174\/1389202911314060004","volume":"14","author":"J Zahiri","year":"2013","unstructured":"Zahiri, J., Hannon Bozorgmehr, J., Masoudi-Nejad, A.: Computational prediction of protein\u2013protein interaction networks: algorithms and resources. Curr. Genomics 14(6), 397\u2013414 (2013)","journal-title":"Curr. Genomics"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9402-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-018-9402-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9402-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T19:14:06Z","timestamp":1694114046000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-018-9402-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,30]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["9402"],"URL":"https:\/\/doi.org\/10.1007\/s10732-018-9402-0","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2018,11,30]]},"assertion":[{"value":"13 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}