{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:10:35Z","timestamp":1779174635175,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"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":[[2019,6,25]]},"DOI":"10.1145\/3299869.3319882","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T17:41:43Z","timestamp":1560879703000},"page":"1463-1480","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Efficiently Answering Regular Simple Path Queries on Large Labeled Networks"],"prefix":"10.1145","author":[{"given":"Sarisht","family":"Wadhwa","sequence":"first","affiliation":[{"name":"IIT Delhi, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anagh","family":"Prasad","sequence":"additional","affiliation":[{"name":"IIT Delhi, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sayan","family":"Ranu","sequence":"additional","affiliation":[{"name":"IIT Delhi, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amitabha","family":"Bagchi","sequence":"additional","affiliation":[{"name":"IIT Delhi, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srikanta","family":"Bedathur","sequence":"additional","affiliation":[{"name":"IIT Delhi, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1627"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090249"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2467795"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3167892.3167895"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303996"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/38714.38749"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767858"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00118-1"},{"key":"e_1_3_2_1_9_1","unstructured":"George HL Fletcher Jeroen Peters and Alexandra Poulovassilis. 2016. Efficient regular path query evaluation using path indexes. In EDBT . OpenProceedings. org 636--639.  George HL Fletcher Jeroen Peters and Alexandra Poulovassilis. 2016. Efficient regular path query evaluation using path indexes. In EDBT . OpenProceedings. org 636--639."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807183"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31235-9_12"},{"key":"e_1_3_2_1_12_1","first-page":"1","article-title":"Evaluation and Enumeration Problems for Regular Path Queries","volume":"19","author":"Martens Wim","year":"2018","unstructured":"Wim Martens and Tina Trautner . 2018 a. Evaluation and Enumeration Problems for Regular Path Queries . In ICDT . 19 : 1 -- 19 :21. Wim Martens and Tina Trautner. 2018a. Evaluation and Enumeration Problems for Regular Path Queries. In ICDT . 19:1--19:21.","journal-title":"ICDT ."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc ICDT '18","author":"Martens Wim","year":"2018","unstructured":"Wim Martens and Tina Trautner . 2018 b. Evaluation and Enumeration Problems for Regular Path Queries . In Proc ICDT '18 . Article 19, bibinfonumpages21 pages. Wim Martens and Tina Trautner. 2018b. Evaluation and Enumeration Problems for Regular Path Queries. In Proc ICDT '18. Article 19, bibinfonumpages21 pages."},{"key":"e_1_3_2_1_14_1","volume-title":"Surv. Comb","author":"McDiarmid C.","unstructured":"C. McDiarmid . 1989. On the method of bounded differences .. In Surv. Comb . Cambridge University Press , 148--188. C. McDiarmid. 1989. On the method of bounded differences.. In Surv. Comb. Cambridge University Press, 148--188."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979122370X"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735703.2735707"},{"key":"e_1_3_2_1_17_1","volume-title":"ICDE '19","author":"Sengupta Neha","year":"2019","unstructured":"Neha Sengupta , Amitabha Bagchi , Maya Ramanath , and Srikanta Bedathur . 2019 . ARROW: Approximating Reachability using Random-walks Over Web-scale Graphs. (2019). To appear in Proc . ICDE '19 . Neha Sengupta, Amitabha Bagchi, Maya Ramanath, and Srikanta Bedathur. 2019. ARROW: Approximating Reachability using Random-walks Over Web-scale Graphs. (2019). To appear in Proc. ICDE '19."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983778"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/363347.363387"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035955"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882944"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.003"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2019 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3319882","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3319882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:22Z","timestamp":1750207402000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3319882"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":22,"alternative-id":["10.1145\/3299869.3319882","10.1145\/3299869"],"URL":"https:\/\/doi.org\/10.1145\/3299869.3319882","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}