{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:10:11Z","timestamp":1648541411530},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf03037339","type":"journal-article","created":{"date-parts":[[2009,4,21]],"date-time":"2009-04-21T22:55:31Z","timestamp":1240354531000},"page":"131-160","source":"Crossref","is-referenced-by-count":7,"title":["Towards an efficient evaluation of recursive aggregates in deductive databases"],"prefix":"10.1007","volume":"12","author":[{"given":"Alexandre","family":"Lefebvre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"BF03037339_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/103140.103141","volume":"16","author":"S. Abiteboul","year":"1991","unstructured":"Abiteboul, S. and Grumbach, S., \u201cA Rule-Based Language with Functions and Sets,\u201dACM Transactions on Database Systems, 16, 1, pp. 1\u201330, March 1991.","journal-title":"ACM Transactions on Database Systems"},{"key":"BF03037339_CR2","series-title":"Technical Report","volume-title":"Negation by Default and Unstratifiable Logic Programs","author":"N. Bidoit","year":"1988","unstructured":"Bidoit, N. and Froidevaux, C., \u201cNegation by Default and Unstratifiable Logic Programs,\u201dTechnical Report, 437, LRI, Orsay, 1988. To appear in a special issue ofTCS on Research in Deductive Databases."},{"key":"BF03037339_CR3","doi-asserted-by":"crossref","unstructured":"Bidoit, N. and Legay, P., \u201cWELL! An Evaluation Procedure for All Logic Programs,\u201d inProc. of the 3rd Int. Conference on Database Theory (ICDT), Paris, France, December 1990.","DOI":"10.1007\/3-540-53507-1_87"},{"key":"BF03037339_CR4","unstructured":"Balbin, I., Meenakshi, K., and Ramamohanarao, K., \u201cA Query Independent Method for Magic Set Computation on Stratified Databases,\u201d inProc. of the International Conference on Fifth Generation Computer Systems (FGCS), Tokyo, Japan, pp. 711\u2013718, November 1988."},{"key":"BF03037339_CR5","doi-asserted-by":"crossref","unstructured":"Beeri, C. and Ramakrishnan, R., \u201cOn the Power of Magic,\u201d inProc. of the 6th ACM Symposium on Principles of Database Systems (PODS), San Diego, California, March 1987.","DOI":"10.1145\/28659.28689"},{"key":"BF03037339_CR6","unstructured":"Beeri, C., Ramakrishnan, R., Srivastava, D., and Sudarshan, S., \u201cMagic Implementation of Stratified Logic Programs,\u201dTechnical Report, unpublished manuscript, August 1990."},{"key":"BF03037339_CR7","doi-asserted-by":"crossref","unstructured":"Beeri, C., Ramakrishnan, R., Srivastava, D., and Sudarshan, S., \u201cThe Valid Model Semantics for Logic Programs,\u201d inProc. of the 11th ACM Symposium on Principles of Database Systems (PODS), San Diego, California, June 1992.","DOI":"10.1145\/137097.137115"},{"key":"BF03037339_CR8","doi-asserted-by":"crossref","unstructured":"Bry, F., \u201cLogic Programming as Constructivism: A Formalization and Its Application to Databases,\u201d inProc. of the 8th ACM Symposium on Principles of Database Systems (PODS), Philadelphia, Pennsylvania, pp. 34\u201350, March 1989.","DOI":"10.1145\/73721.73725"},{"key":"BF03037339_CR9","doi-asserted-by":"crossref","unstructured":"Bry, F., \u201cQuery Evaluation in Recursive Databases: Bottom-Up and Top-Down Reconciled,\u201d inProc. of the 1st International Conference on Deductive and Object-Oriented Oriented Databases (DOOD), Kyoto, Japan, pp. 95\u2013112, 1989.","DOI":"10.1016\/B978-0-444-88433-6.50010-1"},{"key":"BF03037339_CR10","unstructured":"Brodsky, A. and Sagiv, Y., \u201cOn Termination of Datalog Programs\u201d, inProc. of the 1st International Conference on Deductive and Object-Oriented Databases (DOOD), Kyoto, Japan, pp. 95\u2013112, 1989."},{"key":"BF03037339_CR11","doi-asserted-by":"crossref","unstructured":"Consens, M. P. and Mendelzon, A. O., \u201cLow Complexity Aggregation on GraphLog and Datalog,\u201d inProc. of the 3rd Int. Conference on Database Theory (ICDT), Paris, December 1990.","DOI":"10.1007\/3-540-53507-1_90"},{"key":"BF03037339_CR12","doi-asserted-by":"crossref","unstructured":"Cruz, I. and Norvell, T., \u201cAggregative Closure: An Extension of Transitive Closure,\u201d inProc. IEEE 5th International Conference on Data Engineering, pp. 384\u2013391, February 1989.","DOI":"10.1109\/ICDE.1989.47239"},{"issue":"2","key":"BF03037339_CR13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1145\/151333.151377","volume":"1","author":"S. W. Dietrich","year":"1992","unstructured":"Dietrich, S. W., \u201cShortest Path by Approximation in Logic Programs\u201d,ACM Letters on Programming Languages and Systems, 1, 2, pp. 119\u2013137, June 1992.","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"BF03037339_CR14","doi-asserted-by":"crossref","unstructured":"Freeston, M., \u201cThe BANG File: A New Kind of Grid File,\u201d inProc. of the ACM SIGMOD Conference on Management of Data, San Francisco, California, pp. 260\u2013269, May 1987.","DOI":"10.1145\/38714.38743"},{"key":"BF03037339_CR15","doi-asserted-by":"crossref","unstructured":"Ganguly, S., Greco, S., and Zaniolo, C., \u201cMinimum and Maximum Predicates in Logic Programming\u201d, inProc. of the 10th ACM Symposium on Principles of Database Systems (PODS), Denver, Colorado, May 1991.","DOI":"10.1145\/113413.113427"},{"key":"BF03037339_CR16","unstructured":"Ganguly, S., Greco, S., and Zaniolo, C., \u201cGreedy by Choice,\u201d inProc. of the 11th ACM Symposium on Principles of Database Systems (PODS), San Diego, California, June 1992."},{"issue":"3","key":"BF03037339_CR17","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1145\/322326.322332","volume":"29","author":"A. Klug","year":"1982","unstructured":"Klug, A., \u201cEquivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions\u201d,Journal of the ACM, 29, 3 pp. 699\u2013717, July 1982.","journal-title":"Journal of the ACM"},{"key":"BF03037339_CR18","unstructured":"Kerisit, J. M. and Pugin, J. M., \u201cEfficient Query Answering on Stratified Databases\u201d, inProc. of the International Conference on Fifth Generation Computer Systems (FGCS), Tokyo, Japan, pp. 719\u2013725, November 1988."},{"key":"BF03037339_CR19","unstructured":"Kemp, D. and Stuckey, P., \u201cSemantics of Logic Programs with Aggregates\u201d, inProc. of the International Logic Programming Symposium, 1991."},{"key":"BF03037339_CR20","unstructured":"Kemp, D. B. and Topor, R. W., \u201cCompleteness of a Top-Down Query Evaluation Procedure for Stratified Databases,\u201d inproc. of 5th Int. Conference and Symposium on Logic Programming (R. A. Kowalski and K. A. Bowen, eds.), Seattle, WA, pp. 178\u2013194, August 1988."},{"key":"BF03037339_CR21","unstructured":"Lefebvre, A., \u201cTowards an Efficient Evaluation of Recursive Aggregates in Deductive Databases,\u201d inProc. of the International Conference on Fifth Generation Computer Systems (FGCS), Tokyo, Japan, pp. 915\u2013925, June 1992."},{"key":"BF03037339_CR22","doi-asserted-by":"crossref","unstructured":"Lefebvre, A. and Vieille, L., \u201cOn Deductive Query Evaluation in the DedGin* System,\u201d inProc. of the 1st International Conference on Deductive and Object-Oriented Databases (DOOD), Kyoto, Japan, pp. 95\u2013112, 1989.","DOI":"10.1016\/B978-0-444-88433-6.50015-0"},{"key":"BF03037339_CR23","unstructured":"Mumick, I. S., Pirahesh, H., and Ramakrishnan, R., \u201cThe Magic of Duplicates and Aggregates,\u201d inProc. of the 16th VLDB Conference, Brisbane, Australia, pp. 264\u2013277, August 1990."},{"key":"BF03037339_CR24","doi-asserted-by":"crossref","unstructured":"Naughton, J.F., Ramakrishnan, R., Sagiv, Y., and Ullman, J. D., \u201cEfficient Evaluation of Righ-, Left-, and Multi-Linear Rules,\u201d inProc. of the ACM SIGMOD Conference on Management of Data, Portland, Oregon, pp. 235\u2013242, June 1989.","DOI":"10.1145\/66926.66948"},{"key":"BF03037339_CR25","unstructured":"Phipps, G., \u201cGlue: A Deductive Database Programming Language\u201d, inProc. of the NALCP'90 Workshop on Deductive Databases (Jan Chomicki, ed.), pp. 1\u20136, October 1990. Extended Abstract."},{"key":"BF03037339_CR26","doi-asserted-by":"crossref","unstructured":"Przymusinski, T. C., \u201cEvery Logic Program Has a Natural Stratification and an Iterated Fixed Point Model\u201d, inProc. of the 8th ACM Symposium on Principles of Database Systems (PODS), Philadelphia, Pennsylvania, pp. 11\u201321, March 1989.","DOI":"10.1145\/73721.73723"},{"key":"BF03037339_CR27","doi-asserted-by":"crossref","unstructured":"Rosenthal, A., Heiler, S., Dayal, U., and Manola, F., \u201cTraversal Recursion: A Practical Approach to Supporting Recursive Applications,\u201d inProc. of the ACM SIGMOD Conference on Management of Data, Washington D. C., May 1986.","DOI":"10.1145\/16894.16871"},{"issue":"3","key":"BF03037339_CR28","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF03037407","volume":"4","author":"J. Rohmer","year":"1986","unstructured":"Rohmer, J., Lescoeur, R., and Kerisit, J.-M., \u201cThe Alexander Method: A Technique for the Processing of Recursive Axioms in Deductive Databases\u201d,New Generation Computing, 4, 3, pp. 273\u2013285, 1986.","journal-title":"New Generation Computing"},{"key":"BF03037339_CR29","doi-asserted-by":"crossref","unstructured":"Ross, K., \u201cModular Stratification and Magic Sets for DATALOG Programs with Negation,\u201d inProc. of the 9th ACM Symposium on Principles of Database Systems (PODS), Nashville, Tennessy, pp. 161\u2013171, April 1990.","DOI":"10.1145\/298514.298558"},{"key":"BF03037339_CR30","doi-asserted-by":"crossref","unstructured":"Ross, K. and Sagiv, Y., \u201cMonotonic Aggregation in Deductive Databases,\u201d inProc. of the 11th ACM Symposium on Principles of Database Systems (PODS), San Diego, California, June 1992. Also presented at the ILPS'91 Workshop on Deductive Databases.","DOI":"10.1145\/137097.137852"},{"key":"BF03037339_CR31","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, R., Srivastava, D., and Sudarshan, S., \u201cControlling the Search in Bottom-Up Evaluation\u201d, inProc. of the Joint Int. Conference and Symposium on Logic Programming, Washington D. C., pp. 273\u2013287, November 1992.","DOI":"10.1007\/978-1-4615-3506-5_11"},{"key":"BF03037339_CR32","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, R., Srivastava, D., Sudarshan, S., and Seshadri, P., \u201cImplementation of the CORAL Deductive Database System,\u201d inProc. of the ACM SIGMOD Conference on Management of Data, Washington D. C., May 1993.","DOI":"10.1145\/170035.170067"},{"key":"BF03037339_CR33","doi-asserted-by":"crossref","unstructured":"Seki, H., \u201cOn the Power of Alexander Templates\u201d, inProc. of the 8th ACM Symposium on Principles of Database Systems (PODS), Philadelphia, Pennsylvania, pp. 150\u2013159, March 1989.","DOI":"10.1145\/73721.73737"},{"key":"BF03037339_CR34","unstructured":"Seki, H. and Itoh, H., \u201cA Query Evaluation Method for Stratified Programs under the Extended CWA,\u201d inProc. of 5th Int. Conference and Symposium on Logic Programming (R. A. Kowalski and K. A. Bowen, eds.), Seattle, WA, pp. 195\u2013211, August 1988."},{"key":"BF03037339_CR35","unstructured":"Sudarshan, S. and Ramakrishnan, R., \u201cAggregation and Relevance in Deductive Databases,\u201d inProc. of the 17th VLDB Conference, Barcelona, Spain, September 1991."},{"key":"BF03037339_CR36","unstructured":"Sudarshan, S., Srivastava, D., Ramakrishnan, R., and Beeri, C., \u201cExtending the Well-Founded and Valid Semantics for Aggregation\u201d, inProc. of the International Logic Programming Symposium, Vancouver, British Columbia, October 1993."},{"key":"BF03037339_CR37","doi-asserted-by":"crossref","unstructured":"Sacca, D. and Zaniolo, C., \u201cMagic Counting Methods\u201d, inProc. of the ACM SIGMOD Conference on Management of Data, San Francisco, California, pp. 49\u201359, May 1987.","DOI":"10.1145\/38713.38725"},{"key":"BF03037339_CR38","doi-asserted-by":"crossref","unstructured":"Tamaki, H. and Sato, T., \u201cOLD Resolution with Tabulation\u201d, inProc. of the 3rd Int. Conference on Logic Programming, London, UK, pp. 84\u201398, June 1986.","DOI":"10.1007\/3-540-16492-8_66"},{"key":"BF03037339_CR39","unstructured":"Tsur, S. and Zaniolo, C., \u201cLDL: A Logic-Based Data-Language,\u201d inProc. of the 12th VLDB Conference, Kyoto, Japan, pp. 33\u201341, August 1986."},{"key":"BF03037339_CR40","doi-asserted-by":"crossref","unstructured":"Ullman, J. D., \u201cBottom-Up Beats Top-Down for Datalog,\u201d inProc. of the 8th ACM Symposium on Principles of Database Systems (PODS), Philadelphia, Pennsylvania, pp. 140\u2013149, March 1989.","DOI":"10.1145\/73721.73736"},{"key":"BF03037339_CR41","doi-asserted-by":"crossref","unstructured":"Van Gelder, A., \u201cThe Well-Founded Semantics of Aggregation,\u201d inProc. of the 11th ACM Symposium on Principles of Database Systems (PODS), San Diego, California, June 1992.","DOI":"10.1145\/137097.137854"},{"key":"BF03037339_CR42","doi-asserted-by":"crossref","unstructured":"Van Gelder, A., \u201cFoundations of Aggregation in Deductive Databases\u201d, inProc. of the 3rd International Conference on Deductive and Object-Oriented Databases (DOOD), Phoenix, Arizona, December 1993.","DOI":"10.1007\/3-540-57530-8_2"},{"key":"BF03037339_CR43","unstructured":"Vieille, L., Bayer, P., K\u00fcchenhoff, V., and Lefebvre, A., \u201cEKS-V1, A Short Overview,\u201d inAAAI Workshop on Knowledge Base Management Systems (E. Mays, ed.), Boston, USA, July 1990."},{"key":"BF03037339_CR44","unstructured":"Vieille, L., \u201cRecursive Axioms in Deductive Databases: The Query\/SubQuery Approach\u201d, inProc. 1st Int. Conference on Expert Database Systems (L. Kerschberg, ed.), Charleston, SC, USA, pp. 179\u2013193, April 1986."},{"key":"BF03037339_CR45","unstructured":"Vieille, L., \u201cFrom QSQ towards QoSaQ: Global Optimization of Recursive Queries,\u201d, inProc. 2nd Int. Conference on Expert Database Systems (L. Kerschberg, ed.), Tysons Corner, Virginia, pp. 421\u2013434, April 1988."},{"key":"BF03037339_CR46","doi-asserted-by":"crossref","unstructured":"Vieille, L., \u201cRecursive Query Processing: The Power of Logic\u201d,Theoretical Computer Science,69,1, December 1989.","DOI":"10.1016\/0304-3975(89)90088-1"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037339.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037339\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T20:52:34Z","timestamp":1558558354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF03037339"],"URL":"https:\/\/doi.org\/10.1007\/bf03037339","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}