{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T18:40:19Z","timestamp":1764873619113},"reference-count":0,"publisher":"VLDB Endowment","issue":"13","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,9,1]]},"DOI":"10.14778\/3275366.3275368","type":"journal-article","created":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T14:21:40Z","timestamp":1539872500000},"page":"2183-2195","source":"Crossref","is-referenced-by-count":3,"title":["A concave path to low-overhead robust query processing"],"prefix":"10.14778","volume":"11","author":[{"given":"Srinivas","family":"Karthik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayant R.","family":"Haritsa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sreyash","family":"Kenkre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinayaka","family":"Pandit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"5777","container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","deposited":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T14:21:42Z","timestamp":1539872502000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3275366.3284964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,1]]},"references-count":0,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2018,9,1]]}},"URL":"https:\/\/doi.org\/10.14778\/3275366.3275368","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,9,1]]}}}