{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:16:52Z","timestamp":1742980612976,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319105178"},{"type":"electronic","value":"9783319105185"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-10518-5_9","type":"book-chapter","created":{"date-parts":[[2014,8,16]],"date-time":"2014-08-16T12:10:11Z","timestamp":1408191011000},"page":"109-120","source":"Crossref","is-referenced-by-count":3,"title":["An Empirical Approach to Query-Subquery Nets with Tail-Recursion Elimination"],"prefix":"10.1007","author":[{"given":"Son Thanh","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linh Anh","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley (1995)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","volume":"10","author":"C. Beeri","year":"1991","unstructured":"Beeri, C., Ramakrishnan, R.: On the power of magic. J. Log. Program.\u00a010, 255\u2013299 (1991)","journal-title":"J. Log. Program."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Cao, S.T.: On the efficiency of Query-Subquery Nets: an experimental point of view. In: Proceedings of SoICT 2013, pp. 148\u2013157. ACM (2013)","DOI":"10.1145\/2542050.2542085"},{"key":"9_CR4","unstructured":"Cao, S.T.: An implementation of the QSQN-TRE evaluation methods (2014), http:\/\/mimuw.edu.pl\/~sonct\/QSQNTRE14.zip"},{"key":"9_CR5","series-title":"AISC","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-06569-4_21","volume-title":"Advanced Computational Methods for Knowledge Engineering","author":"S.T. Cao","year":"2014","unstructured":"Cao, S.T., Nguyen, L.A.: An Improved Depth-First Control Strategy for Query-Subquery Nets in evaluating queries to Horn knowledge bases. In: van Do, T., Thi, H.A.L., Nguyen, N.T. (eds.) Advanced Computational Methods for Knowledge Engineering. AISC, vol.\u00a0282, pp. 281\u2013296. Springer, Heidelberg (2014)"},{"key":"9_CR6","first-page":"152","volume":"13","author":"S.T. Cao","year":"2014","unstructured":"Cao, S.T., Nguyen, L.A., Szalas, A.: The Web ontology rule language OWL\u00a02 RL+ and Its extensions. T. Computational Collective Intelligence\u00a013, 152\u2013175 (2014)","journal-title":"T. Computational Collective Intelligence"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s40595-013-0009-y","volume":"1","author":"S.T. Cao","year":"2014","unstructured":"Cao, S.T., Nguyen, L.A., Szalas, A.: WORL: a nonmonotonic rule language for the Semantic Web. Vietnam J. Computer Science\u00a01(1), 57\u201369 (2014)","journal-title":"Vietnam J. Computer Science"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Freire, J., Swift, T., Warren, D.S.: Taking I\/O seriously: Resolution reconsidered for disk. In: Naish, L. (ed.) Proc. of ICLP 1997, pp. 198\u2013212. MIT Press (1997)","DOI":"10.7551\/mitpress\/4299.003.0020"},{"issue":"4","key":"9_CR9","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/2362355.2362360","volume":"13","author":"E. Madali\u0144ska-Bugaj","year":"2012","unstructured":"Madali\u0144ska-Bugaj, E., Nguyen, L.A.: A generalized QSQR evaluation method for Horn knowledge bases. ACM Trans. on Computational Logic\u00a013(4), 32 (2012)","journal-title":"ACM Trans. on Computational Logic"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-34630-9_25","volume-title":"Computational Collective Intelligence. Technologies and Applications","author":"L.A. Nguyen","year":"2012","unstructured":"Nguyen, L.A., Cao, S.T.: Query-Subquery Nets. In: Nguyen, N.-T., Hoang, K., J\u0119drzejowicz, P. (eds.) ICCCI 2012, Part I. LNCS, vol.\u00a07653, pp. 239\u2013248. Springer, Heidelberg (2012)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Nguyen, L.A., Cao, S.T.: Query-Subquery Nets (2012), http:\/\/arxiv.org\/abs\/1201.2564","DOI":"10.1007\/978-3-642-34630-9_25"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, R., Srivastava, D., Sudarshan, S.: Efficient bottom-up evaluation of logic programs. In: Vandewalle, J. (ed.) The State of the Art in Computer Systems and Software Engineering. Kluwer Academic Publishers (1992)","DOI":"10.1007\/978-1-4615-3506-5_11"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/232616.232628","volume":"21","author":"K.A. Ross","year":"1996","unstructured":"Ross, K.A.: Tail recursion elimination in deductive databases. ACM Trans. Database Syst.\u00a021(2), 208\u2013237 (1996)","journal-title":"ACM Trans. Database Syst."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-16492-8_66","volume-title":"Third International Conference on Logic Programming","author":"H. Tamaki","year":"1986","unstructured":"Tamaki, H., Sato, T.: OLD resolution with tabulation. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol.\u00a0225, pp. 84\u201398. Springer, Heidelberg (1986)"},{"key":"9_CR15","unstructured":"Vieille, L.: Recursive axioms in deductive databases: The query\/subquery approach. In: Proceedings of Expert Database Conf., pp. 253\u2013267 (1986)"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","volume":"69","author":"L. Vieille","year":"1989","unstructured":"Vieille, L.: Recursive query processing: The power of logic. Theor. Comput. Sci.\u00a069(1), 1\u201353 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Zhou, N.-F., Sato, T.: Efficient fixpoint computation in linear tabling. In: Proceedings of PPDP 2003, pp. 275\u2013283. ACM (2003)","DOI":"10.1145\/888251.888277"}],"container-title":["Advances in Intelligent Systems and Computing","New Trends in Database and Information Systems II"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10518-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T15:02:51Z","timestamp":1717254171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-10518-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319105178","9783319105185"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10518-5_9","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}