{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:19:36Z","timestamp":1775283576515,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,13]],"date-time":"2011-06-13T00:00:00Z","timestamp":1307923200000},"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":[[2011,6,13]]},"DOI":"10.1145\/1989284.1989322","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T14:45:32Z","timestamp":1308062732000},"page":"271-282","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Rewrite rules for search database systems"],"prefix":"10.1145","author":[{"given":"Ronald","family":"Fagin","sequence":"first","affiliation":[{"name":"IBM Research - Almaden, San Jose, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Kimelfeld","sequence":"additional","affiliation":[{"name":"IBM Research - Almaden, San Jose, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunyao","family":"Li","sequence":"additional","affiliation":[{"name":"IBM Research - Almaden, San Jose, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sriram","family":"Raghavan","sequence":"additional","affiliation":[{"name":"IBM India Research Lab, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shivakumar","family":"Vaithyanathan","sequence":"additional","affiliation":[{"name":"IBM Research - Almaden, San Jose, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00207-8"},{"key":"e_1_3_2_1_2_1","first-page":"367","volume-title":"TREC","author":"Bear J.","year":"1997","unstructured":"J. Bear , D. J. Israel , J. Petit , and D. L. Martin . Using information extraction to improve document retrieval . In TREC , pages 367 -- 377 , 1997 . J. Bear, D. J. Israel, J. Petit, and D. L. Martin. Using information extraction to improve document retrieval. In TREC, pages 367--377, 1997."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(87)90030-X"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90026-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/4933.4942"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807121"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31862-0_26"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212012"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/132407.132429"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/132407.132409"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70590-1_11"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142591"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90087-2"},{"key":"e_1_3_2_1_14_1","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"Knuth D.","year":"1970","unstructured":"D. Knuth and P. Bendix . Simple word problems in universal algebra . In J. Leech, editor, Computational Problems in Abstract Algebra , pages 263 -- 297 . Pergamon Press , 1970 . D. Knuth and P. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263--297. Pergamon Press, 1970."},{"key":"e_1_3_2_1_15_1","volume-title":"Theorie der Endlichen und Unendlichen Graphen: Kombinatorische Topologie der Streckenkomplexe. Akad","author":"K\u00f6nig D.","year":"1936","unstructured":"D. K\u00f6nig . Theorie der Endlichen und Unendlichen Graphen: Kombinatorische Topologie der Streckenkomplexe. Akad . Verlag , Leipzig , 1936 . D. K\u00f6nig. Theorie der Endlichen und Unendlichen Graphen: Kombinatorische Topologie der Streckenkomplexe. Akad. Verlag, Leipzig, 1936."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00021-X"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1519103.1519105"},{"key":"e_1_3_2_1_18_1","volume-title":"Mathematics Department, Louisiana Tech","author":"Lankford D. S.","year":"1979","unstructured":"D. S. Lankford . On proving term rewriting systems are Noetherian. Technical report , Mathematics Department, Louisiana Tech . University , Ruston , 1979 . D. S. Lankford. On proving term rewriting systems are Noetherian. Technical report, Mathematics Department, Louisiana Tech. University, Ruston, 1979."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/132407.132421"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/646451.692933"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/601858.601869"},{"key":"e_1_3_2_1_22_1","first-page":"73","volume-title":"Proceedings of COLING: Companion volume: Posters","author":"Pang B.","year":"2008","unstructured":"B. Pang and L. Lee . Using very simple statistics for review search: An exploration . In Proceedings of COLING: Companion volume: Posters , pages 73 -- 76 , 2008 . B. Pang and L. Lee. Using very simple statistics for review search: An exploration. In Proceedings of COLING: Companion volume: Posters, pages 73--76, 2008."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/160688.160713"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497502"},{"key":"e_1_3_2_1_25_1","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term Rewriting Systems","year":"2003","unstructured":"Terese. Term Rewriting Systems , volume 55 of Cambridge Tracts in Theoretical Computer Science . Cambridge University Press , 2003 . Terese. Term Rewriting Systems, volume 55 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2003."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242639"}],"event":{"name":"SIGMOD\/PODS '11: International Conference on Management of Data","location":"Athens Greece","acronym":"SIGMOD\/PODS '11","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989284.1989322","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989284.1989322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:01Z","timestamp":1750244761000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989284.1989322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,13]]},"references-count":26,"alternative-id":["10.1145\/1989284.1989322","10.1145\/1989284"],"URL":"https:\/\/doi.org\/10.1145\/1989284.1989322","relation":{},"subject":[],"published":{"date-parts":[[2011,6,13]]},"assertion":[{"value":"2011-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}