{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:39Z","timestamp":1750220739744,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,14]]},"DOI":"10.1145\/3391274.3393638","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:15:20Z","timestamp":1590452120000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["QSGG"],"prefix":"10.1145","author":[{"given":"Stefan","family":"B\u00f6ttcher","sequence":"first","affiliation":[{"name":"Institute of Computer Science, Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rita","family":"Hartel","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Peeters","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Computing simulations on finite and infinite graphs.,\" in Proceedings of IEEE 36th Annual Foundations of Computer Science","author":"Henzinger M. R.","year":"1995","unstructured":"M. R. Henzinger , T. A. Hinzinger and P. W. Kopke , \" Computing simulations on finite and infinite graphs.,\" in Proceedings of IEEE 36th Annual Foundations of Computer Science , 1995 . M. R. Henzinger, T. A. Hinzinger and P. W. Kopke, \"Computing simulations on finite and infinite graphs.,\" in Proceedings of IEEE 36th Annual Foundations of Computer Science, 1995."},{"key":"e_1_3_2_1_2_1","volume-title":"k2-trees for compact web graph representations,\" in String processing and Information retrieval","author":"Brisaboa N.","year":"2009","unstructured":"N. Brisaboa , S. Ladra and G. Navarro , \" k2-trees for compact web graph representations,\" in String processing and Information retrieval , 2009 . N. Brisaboa, S. Ladra and G. Navarro, \"k2-trees for compact web graph representations,\" in String processing and Information retrieval, 2009."},{"key":"e_1_3_2_1_3_1","volume-title":"Efficient compression of web graphs,\" in nternational Computing and Combinatorics Conference","author":"Asano Y.","year":"2008","unstructured":"Y. Asano , Y. Miyawaki and T. Nishizeki , \" Efficient compression of web graphs,\" in nternational Computing and Combinatorics Conference , 2008 . Y. Asano, Y. Miyawaki and T. Nishizeki, \"Efficient compression of web graphs,\" in nternational Computing and Combinatorics Conference, 2008."},{"key":"e_1_3_2_1_4_1","volume-title":"Efficient set operations over k2-trees,\" in DCC","author":"Brisaboa N. R.","year":"2015","unstructured":"N. R. Brisaboa , G. de Bernardo , G. Guti\u00e9rrez , S. Ladra , M. R. Penabad and B. A. Troncoso , \" Efficient set operations over k2-trees,\" in DCC , 2015 . N. R. Brisaboa, G. de Bernardo, G. Guti\u00e9rrez, S. Ladra, M. R. Penabad and B. A. Troncoso, \"Efficient set operations over k2-trees,\" in DCC, 2015."},{"key":"e_1_3_2_1_5_1","volume-title":"Offline Dictionary-Based Compression,\" in DCC","author":"Larsson N. J.","year":"1999","unstructured":"N. J. Larsson and A. Moffat , \" Offline Dictionary-Based Compression,\" in DCC , 1999 . N. J. Larsson and A. Moffat, \"Offline Dictionary-Based Compression,\" in DCC, 1999."},{"volume-title":"XML tree structure compression using RePair,\" Inf. Syst","author":"Lohrey M.","key":"e_1_3_2_1_6_1","unstructured":"M. Lohrey , S. Maneth and R. Mennicke , \" XML tree structure compression using RePair,\" Inf. Syst ., vol. 38 , no. 8, p. 2013, 1150--1167. M. Lohrey, S. Maneth and R. Mennicke, \"XML tree structure compression using RePair,\" Inf. Syst., vol. 38, no. 8, p. 2013, 1150--1167."},{"key":"e_1_3_2_1_7_1","volume-title":"Syst.","author":"Maneth S.","year":"2018","unstructured":"S. Maneth and F. Peternek , \" Grammar-based graph compression,\" in Inf . Syst. , 2018 . S. Maneth and F. Peternek, \"Grammar-based graph compression,\" in Inf. Syst., 2018."},{"key":"e_1_3_2_1_8_1","volume-title":"Real-time traversal in grammar-based compressed files,\" in DCC","author":"Gasieniec L.","year":"2005","unstructured":"L. Gasieniec , R. Kolpakov , I. Potapov and P. Sant , \" Real-time traversal in grammar-based compressed files,\" in DCC , 2005 . L. Gasieniec, R. Kolpakov, I. Potapov and P. Sant, \"Real-time traversal in grammar-based compressed files,\" in DCC, 2005."},{"key":"e_1_3_2_1_9_1","first-page":"2082","author":"Lohrey M.","year":"2018","unstructured":"M. Lohrey , S. Maneth and C. P. Reh , \"Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees,\" Algorithmica , p. 2082 -- 2105 , 2018 . M. Lohrey, S. Maneth and C. P. Reh, \"Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees,\" Algorithmica, p. 2082--2105, 2018.","journal-title":"\"Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees,\" Algorithmica"},{"key":"e_1_3_2_1_10_1","volume-title":"Constant Delay Traversal of Grammar-Compressed Graphs with Bounded Rank,\" in DCC","author":"Maneth S.","year":"2018","unstructured":"S. Maneth and F. Peternek , \" Constant Delay Traversal of Grammar-Compressed Graphs with Bounded Rank,\" in DCC , 2018 . S. Maneth and F. Peternek, \"Constant Delay Traversal of Grammar-Compressed Graphs with Bounded Rank,\" in DCC, 2018."},{"key":"e_1_3_2_1_11_1","volume-title":"Speeding up algorithms on compressed web graphs,\" in WSDM","author":"Karande C.","year":"2009","unstructured":"C. Karande , K. Chellapilla and R. Andersen , \" Speeding up algorithms on compressed web graphs,\" in WSDM , 2009 . C. Karande, K. Chellapilla and R. Andersen, \"Speeding up algorithms on compressed web graphs,\" in WSDM, 2009."},{"key":"e_1_3_2_1_12_1","volume-title":"Query preserving graph compression,\" in ACM SIGMOD International Conference on Management of Data","author":"Fan W.","year":"2012","unstructured":"W. Fan , J. Li , X. Wang and Y. Wu , \" Query preserving graph compression,\" in ACM SIGMOD International Conference on Management of Data , 2012 . W. Fan, J. Li, X. Wang and Y. Wu, \"Query preserving graph compression,\" in ACM SIGMOD International Conference on Management of Data, 2012."},{"key":"e_1_3_2_1_13_1","volume-title":"Querying massive graph data: A compress and search approach,\" in Future Generation Computer Systems","author":"Nabti C.","year":"2017","unstructured":"C. Nabti and H. Seba , \" Querying massive graph data: A compress and search approach,\" in Future Generation Computer Systems , 2017 . C. Nabti and H. Seba, \"Querying massive graph data: A compress and search approach,\" in Future Generation Computer Systems, 2017."},{"key":"e_1_3_2_1_14_1","volume-title":"Scalable Pattern Matching over Compressed Graphs via Dedensification,\" in KDD","author":"Maccioni A.","year":"2016","unstructured":"A. Maccioni and D. J. Abadi , \" Scalable Pattern Matching over Compressed Graphs via Dedensification,\" in KDD , 2016 . A. Maccioni and D. J. Abadi, \"Scalable Pattern Matching over Compressed Graphs via Dedensification,\" in KDD, 2016."}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Portland Oregon","acronym":"SIGMOD\/PODS '20"},"container-title":["Proceedings of The International Workshop on Semantic Big Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3391274.3393638","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3391274.3393638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:37Z","timestamp":1750199917000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3391274.3393638"}},"subtitle":["query simulation in grammar-compressed graphs"],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":14,"alternative-id":["10.1145\/3391274.3393638","10.1145\/3391274"],"URL":"https:\/\/doi.org\/10.1145\/3391274.3393638","relation":{},"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"2020-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}