{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:43:49Z","timestamp":1762271029267},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354727"},{"type":"electronic","value":"9783540354734"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780991_13","type":"book-chapter","created":{"date-parts":[[2006,9,26]],"date-time":"2006-09-26T13:48:17Z","timestamp":1159278497000},"page":"141-152","source":"Crossref","is-referenced-by-count":17,"title":["Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries"],"prefix":"10.1007","author":[{"given":"Benny","family":"Kimelfeld","sequence":"first","affiliation":[]},{"given":"Yehoshua","family":"Sagiv","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM\u00a030(3), 479\u2013513 (1983)","journal-title":"J. ACM"},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/0210059","volume":"10","author":"P.A. Bernstein","year":"1981","unstructured":"Bernstein, P.A., Goodman, N.: Power of natural semijoins. SIAM J. Comput.\u00a010(4), 751\u2013771 (1981)","journal-title":"SIAM J. Comput."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Carey, M.J., Kossmann, D.: On saying \u201cenough already!\u201d in SQL. In: SIGMOD, pp. 219\u2013230 (1997)","DOI":"10.1145\/253260.253302"},{"key":"13_CR4","unstructured":"Carey, M.J., Kossmann, D.: Reducing the braking distance of an SQL query engine. In: VLDB, pp. 158\u2013169 (1998)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: STOC, pp. 77\u201390 (1977)","DOI":"10.1145\/800105.803397"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, S., Sagiv, Y.: An incremental algorithm for computing ranked full disjunctions. In: PODS (2005)","DOI":"10.1145\/1065167.1065180"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1006\/jcss.1998.1600","volume":"58","author":"R. Fagin","year":"1999","unstructured":"Fagin, R.: Combining fuzzy information from multiple systems. J. Comput. Syst. Sci.\u00a058(1), 83\u201399 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R. Fagin","year":"2003","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci.\u00a066(4), 614\u2013656 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR9","unstructured":"Habich, D., Lehner, W., Hinneburg, A.: Optimizing multiple top-k queries over joins. In: SSDBM, pp. 195\u2013204 (2005)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Koudas, N., Papakonstantinou, Y.: PREFER: A system for the efficient execution of multi-parametric ranked queries. In: SIGMOD (2001)","DOI":"10.1145\/375663.375690"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. In: VLDB, pp. 754\u2013765 (2003)","DOI":"10.1016\/B978-012722442-8\/50072-0"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters\u00a027, 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"E.L. Lawler","year":"1972","unstructured":"Lawler, E.L.: A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science\u00a018, 401\u2013405 (1972)","journal-title":"Management Science"},{"key":"13_CR14","unstructured":"Natsev, A., Chang, Y.C., Smith, J.R., Li, C.S., Vitter, J.S.: Supporting incremental join queries on ranked inputs. In: VLDB, pp. 281\u2013290 (2001)"},{"key":"13_CR15","unstructured":"Yannakakis, M.: Algorithms for acyclic database schemes. In: VLDB, pp. 82\u201394 (1981)"},{"key":"13_CR16","unstructured":"Yen, J.Y.: Another algorithm for finding the k shortest loopless network paths. In: Proc. 41st Mtg. Operations Research Society of America, vol. 20, p. B\/185 (1972)"}],"container-title":["Lecture Notes in Computer Science","Next Generation Information Technologies and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780991_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:19Z","timestamp":1619507839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780991_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354727","9783540354734"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11780991_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}