{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:12:18Z","timestamp":1648883538605},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems Integration"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1007\/bf02265082","type":"journal-article","created":{"date-parts":[[2005,12,9]],"date-time":"2005-12-09T03:21:42Z","timestamp":1134098502000},"page":"299-327","source":"Crossref","is-referenced-by-count":1,"title":["Querying datalog with arrays: Design and implementation issues"],"prefix":"10.1007","volume":"6","author":[{"given":"S.","family":"Greco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Palopoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Spadafora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02265082_CR1","unstructured":"S. Abiteboul and C. Beeri. On the power of languages for the manipulation of complex objects. INRIA Technical Report 846, May 1988."},{"key":"BF02265082_CR2","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and P. Kanellakis. Object identity as a query language primitive.ACM SIGMOD Conf. 1989, 159\u2013173.","DOI":"10.1145\/67544.66941"},{"key":"BF02265082_CR3","unstructured":"A.V. Aho, J.E. Hopcropt, and J.D. Ullman.The Design and analysis of Computer Algorithms. Addison-Wesley, 1974."},{"key":"BF02265082_CR4","doi-asserted-by":"crossref","unstructured":"A.V. Aho and J.D. Ullman. Universality of Data Retrieval Languages. InProceedings of the Sixth ACM Symposium on Principles of Programming Languages, 1979.","DOI":"10.1145\/567752.567763"},{"key":"BF02265082_CR5","unstructured":"C. Apt. Introduction to Logic Programming. InThe Handbook of Theoretical Computer Science. (van Leuween ed.), 1990."},{"key":"BF02265082_CR6","doi-asserted-by":"crossref","unstructured":"F. Bancilhon, D. Mayer, Y. Sagiv, and J.F. Ullman. Magic sets and other strange ways to implement logic programs. InProceedings of the Fifth ACM Symposium on Principles of Database Systems, 1986, pages 1\u201315.","DOI":"10.1145\/6012.15399"},{"key":"BF02265082_CR7","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/B978-0-934613-40-8.50016-6","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"F. Bancilhon","year":"1988","unstructured":"F. Bancilhon and R. Ramakrisnhan. Performance evaluation of data intensive logic programs. In J. Minker, editor,Foundations of Deductive Databases and Logic Programming, Morgan-Kaufman, Los altos, CA, 1988, pages 439\u2013518."},{"issue":"No 3 & 4","key":"BF02265082_CR8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","volume":"10","author":"C. Beeri","year":"1991","unstructured":"C. Beeri and R. Ramakrisnhan. On the power of magic.Journal of Logic Programming, Vol 10, No 3 & 4, 1991, pages 255\u2013299.","journal-title":"Journal of Logic Programming"},{"key":"BF02265082_CR9","doi-asserted-by":"crossref","unstructured":"P. Bonatti and T. Eiter. Querying disjunctive databases through non-monotonic logics. InProceedings of the Fifth International Conference on Database Theory (ICDT-95), pages 68\u201381, 1995.","DOI":"10.1007\/3-540-58907-4_7"},{"key":"BF02265082_CR10","doi-asserted-by":"crossref","unstructured":"M. Cadoli, T. Eiter and G. Gottlob. Default Logic as a Query Language. InProceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning, Bonn, Germany, pages 99\u2013108, 1994. Full version to appear in IEEE Trans. on Knowledge and Data Engineering.","DOI":"10.1016\/B978-1-4832-1452-8.50106-8"},{"key":"BF02265082_CR11","doi-asserted-by":"crossref","unstructured":"W. F. Clocksin and C. S. Mellish.Prolog-Programming in Logic. Spinger-Verlag, 1987.","DOI":"10.1007\/978-3-642-97005-4"},{"issue":"No. 2","key":"BF02265082_CR12","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/321510.321524","volume":"16","author":"R. A. Paola Di","year":"1969","unstructured":"R. A. Di Paola. The Recursive Unsolvability of the Decision Problem for a Class of Definite Formulas.Journal of ACM, Vol. 16, No. 2, 1969, pages 324\u2013327.","journal-title":"Journal of ACM"},{"key":"BF02265082_CR13","unstructured":"M. Gelfond and V. Lifschitz. The stable model semantics of logic programming. InProc. of the Fifth Intern. Conf. on Logic Programming, pages 1070\u20131080, 1988."},{"issue":"3","key":"BF02265082_CR14","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/69.91061","volume":"3","author":"J. I. Glasgow","year":"1991","unstructured":"J. I. Glasgow, M. A. Jenkins, E. Blevis, and M. P. F\u00e9ret. Logic Programming with Arrays.IEEE Transaction on Knowledge and Data Engineering, 3(3), September 1991, pages 307\u2013319.","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"BF02265082_CR15","unstructured":"S. Greco and C. Zaniolo, Optimization of linear logic programs using counting methods. InProceedings of the Extending Database Technology, 1992, pages 187\u2013220."},{"key":"BF02265082_CR16","doi-asserted-by":"crossref","unstructured":"S. Greco, L. Palopoli and E. Spadafora, Extending Datalog with Arrays. DEIS Technical Report, 1995.","DOI":"10.1016\/0169-023X(95)00027-P"},{"key":"BF02265082_CR17","doi-asserted-by":"crossref","unstructured":"S. Greco, D. Sacc\u00e0, C. Zaniolo. The Pushdown Method for the Optimization of Chain Logic Programs, Proc. Int. Colloquium on Automata, Languages and Programming, 1995.","DOI":"10.1007\/3-540-60084-1_102"},{"issue":"No. 1","key":"BF02265082_CR18","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0022-0000(91)90034-3","volume":"43","author":"R. Haddad","year":"1991","unstructured":"R. Haddad and J. Naughton, A counting algorithm for a cyclic binary query.Journal of Computer and System Science, Vol. 43, No. 1, 1991, 145\u2013169.","journal-title":"Journal of Computer and System Science"},{"key":"BF02265082_CR19","doi-asserted-by":"crossref","unstructured":"R. Krishnamurthy, R. Ramakrishnan, and O. Shmueli. A Framework for Testing Safety and effective Computability of Extended Datalog.Proc. of the 1987 ACM SIGMOD Int. Conf. on Management of Data, 1987, pages 154\u2013163.","DOI":"10.1145\/971701.50219"},{"key":"BF02265082_CR20","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd.Foundations of Logic Programming. Spinger-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"BF02265082_CR21","doi-asserted-by":"crossref","unstructured":"D. Maier, and B. Vance. A call for order.Proc. of the Twelfth ACM Symposium on Principles of Database Systems, 1993, pages 1\u201316.","DOI":"10.1145\/153850.153851"},{"issue":"3 & 4","key":"BF02265082_CR22","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0743-1066(91)90040-V","volume":"10","author":"A. Marchetti-Spaccamela","year":"1991","unstructured":"A. Marchetti-Spaccamela, A. Pelaggi and D. Sacc\u00e0. Comparison of methods for logic query implementation.Journal of Logic Programming, 10 (3 & 4), 1991, pages 333\u2013361.","journal-title":"Journal of Logic Programming"},{"key":"BF02265082_CR23","doi-asserted-by":"crossref","unstructured":"T. More. Axioms and theorems for a theory of array.IBM Journal of Research and Development,17(2), March 1973.","DOI":"10.1147\/rd.172.0135"},{"key":"BF02265082_CR24","volume-title":"A Logic Language for Data and Knowledge Bases","author":"S. Naqvi","year":"1989","unstructured":"S. Naqvi and S. Tsur.A Logic Language for Data and Knowledge Bases. Computer Science Press, New York, 1989."},{"key":"BF02265082_CR25","unstructured":"J. Naughton, R. Ramakrisnhan, Y. Sagiv, and J.F. Ullman. Argument reduction by factoring. InProc. of the 15th Conf. on Very Large data Bases, 1989, pages 173\u2013182."},{"key":"BF02265082_CR26","doi-asserted-by":"crossref","unstructured":"J. Naughton, R. Ramakrisnhan, Y. Sagiv, and J.F. Ullman. Efficient evaluation of right-, left-, and multi-linear rules. InProceedings of the 1988 ACM SIGMOD Int. Conf. on Management of Data, 1989, pages 235\u2013242.","DOI":"10.1145\/66926.66948"},{"key":"BF02265082_CR27","unstructured":"W. Nejdl. Recursive Strategies for Answering Recursive Queries\u2014The RQA\/FQI Strategy. InProc. of the 13th Conf. on Very Large data Bases, 1987, pages 43\u201350."},{"key":"BF02265082_CR28","doi-asserted-by":"crossref","unstructured":"M.S. Paterson, and M.N. Wegman Linear Unification. InJournal of Computer and System Sciences, No. 16, 1978, pages 158\u2013167.","DOI":"10.1016\/0022-0000(78)90043-0"},{"key":"BF02265082_CR29","unstructured":"T. Przymusinski, Perfect model semantics. InProceedings of the 1988 Int. Conf. on Logic Programming, 1988, pages 1081\u20131096."},{"key":"BF02265082_CR30","unstructured":"R. Ramakrishnan, D. Srivastava, and S. Sudarshan. CORAL: Control, Relations and Logic.Proc. of the 18th Int. Conf. of Very Large Data Bases, 1992, pages 238\u2013250."},{"key":"BF02265082_CR31","unstructured":"R. Ramakrishnan, P. Seshadri, D. Srivastava, and S. Sudarshan. The CORAL user manual: A tutotial introduction to CORAL. Manuscript, 1993."},{"key":"BF02265082_CR32","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(86)90015-0","volume":"62","author":"D. Sacc\u00e0","year":"1988","unstructured":"D. Sacc\u00e0 and C. Zaniolo, The generalized counting method of recursive logic queries for databases.Theoretical Computer Science, No. 62, 1988, pages 187\u2013220.","journal-title":"Theoretical Computer Science"},{"key":"BF02265082_CR33","doi-asserted-by":"crossref","unstructured":"O. Shmueli. Decidability and Expressiveness aspects of logic queries.Proc. of the Sixth ACM Symposium on Principles of Database Systems, 1987, pages 237\u2013249.","DOI":"10.1145\/28659.28685"},{"key":"BF02265082_CR34","unstructured":"J.D. Ullman.Principles of Data and Knowledge Bases. Vol. 1 & 2. Academic Press, 1988."},{"key":"BF02265082_CR35","doi-asserted-by":"crossref","unstructured":"S.L. Vandenberg, and D.J. De-Witt. Algebraic support for complex objects with arrays, identity and inheritance.Proc. of the 1991 ACM SIGMOD Int. Conf. on Management of Data, pages 158\u2013167, 1991.","DOI":"10.1145\/115790.115811"},{"issue":"3","key":"BF02265082_CR36","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs.Journal of ACM,38(3):620\u2013650, 1991.","journal-title":"Journal of ACM"},{"key":"BF02265082_CR37","unstructured":"L. Vielle. Database-complete proof procedures based on SLD-resolution, InProceedings of the 1987 Int. Conf. on Logic Programming, 1987, pages 74\u2013103."},{"key":"BF02265082_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","volume":"69","author":"L. Vielle","year":"1989","unstructured":"L. Vielle. Recursive Query processing: The Power of Logic.Theoretical Computer Science. No. 69, 1989, pages 1\u201353.","journal-title":"Theoretical Computer Science"}],"container-title":["Journal of Systems Integration"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02265082.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02265082\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02265082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T12:49:48Z","timestamp":1586609388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02265082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["BF02265082"],"URL":"https:\/\/doi.org\/10.1007\/bf02265082","relation":{},"ISSN":["0925-4676","1573-8787"],"issn-type":[{"value":"0925-4676","type":"print"},{"value":"1573-8787","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}