{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,2]],"date-time":"2026-08-02T23:47:42Z","timestamp":1785714462926,"version":"3.56.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319743127","type":"print"},{"value":"9783319743134","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-74313-4_4","type":"book-chapter","created":{"date-parts":[[2018,1,17]],"date-time":"2018-01-17T00:17:43Z","timestamp":1516148263000},"page":"43-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Pipelined Bottom-Up Evaluation of Datalog Programs: The Push Method"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Brass","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heike","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,1,18]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.D.: Magic sets and other strange ways to implement logic programs. In: Proceedings of the 5th ACM Symposium on Principles of Database Systems (PODS 1986), pp. 1\u201315. ACM Press (1986)","DOI":"10.1145\/6012.15399"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1007\/3-540-44957-4_71","volume-title":"Computational Logic \u2014 CL 2000","author":"S Brass","year":"2000","unstructured":"Brass, S.: SLDMagic\u2014the real magic (with applications to web queries). In: Lloyd, J., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Palamidessi, C., Pereira, L.M., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 1063\u20131077. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44957-4_71"},{"key":"4_CR3","unstructured":"Brass, S.: Implementation alternatives for bottom-up evaluation. In: Hermenegildo, M., Schaub, T. (eds.) Technical Communications of the 26th International Conference on Logic Programming (ICLP 2010), Leibniz International Proceedings in Informatics (LIPIcs), vol. 7, pp. 44\u201353. Schloss Dagstuhl (2010). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2010\/2582"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-32925-8_7","volume-title":"Datalog in Academia and Industry","author":"S Brass","year":"2012","unstructured":"Brass, S.: Order in Datalog with applications to declarative output. In: Barcel\u00f3, P., Pichler, R. (eds.) Datalog 2.0 2012. LNCS, vol. 7494, pp. 56\u201367. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32925-8_7"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-319-23264-5_14","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"S Brass","year":"2015","unstructured":"Brass, S.: A framework for goal-directed query evaluation with negation. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 151\u2013157. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23264-5_14"},{"key":"4_CR6","unstructured":"Brass, S., Stephan, H.: Bottom-up evaluation of Datalog: preliminary report. In: Schwarz, S., H\u00f6lldobler, S. (eds.) 29th Workshop on (Constraint) Logic Programming (WLP 2015), pp. 21\u201335. HTWK Leipzig (2015). http:\/\/www.imn.htwk-leipzig.de\/WLP2015\/"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/10704567_16","volume-title":"Principles and Practice of Declarative Programming","author":"VS Costa","year":"1999","unstructured":"Costa, V.S.: Optimising bytecode emulation for Prolog. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol. 1702, pp. 261\u2013277. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/10704567_16"},{"key":"4_CR8","unstructured":"Costa, V.S., Rocha, R., Damas, L.: The YAP Prolog system. Theory Pract. Logic Programm. 12(1\u20132), 5\u201334 (2012). https:\/\/www.dcc.fc.up.pt\/~ricroc\/homepage\/publications\/2012-TPLP.pdf"},{"key":"4_CR9","unstructured":"Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: ARTful indexing for main-memory databases. In: Proceedings of the 2013 IEEE International Conference on Data Engineering (ICDE 2013), pp. 38\u201349. IEEE Computer Society (1997). http:\/\/www3.informatik.tu-muenchen.de\/~leis\/papers\/ART.pdf"},{"issue":"3","key":"4_CR10","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Logic 7(3), 499\u2013562 (2006). https:\/\/arxiv.org\/pdf\/cs\/0211004","journal-title":"ACM Trans. Comput. Logic"},{"key":"4_CR11","unstructured":"Liang, S., Fodor, P., Wan, H., Kifer, M.: OpenRuleBench: an analysis of the performance of rule engines. In: Proceedings of the 18th International Conference on World Wide Web (WWW 2009), pp. 601\u2013610. ACM (2009). http:\/\/rulebench.projects.semwebcentral.org\/"},{"key":"4_CR12","unstructured":"Liu, Y.A., Stoller, S.D.: From Datalog rules to efficient programs with time and space guarantees. In: Proceedings of the 5th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP 2003), pp. 172\u2013183. ACM (2003). http:\/\/www3.cs.stonybrook.edu\/~liu\/papers\/Rules-PPDP03.pdf"},{"issue":"9","key":"4_CR13","doi-asserted-by":"crossref","first-page":"539","DOI":"10.14778\/2002938.2002940","volume":"4","author":"T Neumann","year":"2011","unstructured":"Neumann, T.: Efficiently compiling efficient query plans for modern hardware. Proc. VLDB Endow. 4(9), 539\u2013550 (2011). http:\/\/www.vldb.org\/pvldb\/vol4\/p539-neumann.pdf","journal-title":"Proc. VLDB Endow."},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01228880","volume":"3","author":"R Ramakrishnan","year":"1994","unstructured":"Ramakrishnan, R., Srivastava, D., Sudarshan, S., Seshadri, P.: The CORAL deductive system. VLDB J. 3, 161\u2013210 (1994)","journal-title":"VLDB J."},{"key":"4_CR15","unstructured":"Sagonas, K., Swift, T., Warren, D.S.: XSB as an efficient deductive database engine. In: Snodgrass, R.T., Winslett, M. (eds.) Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data (SIGMOD 1994), pp. 442\u2013453 (1994). http:\/\/user.it.uu.se\/~kostis\/Papers\/xsbddb.html"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Scholz, B., Jordan, H., Suboti\u0107, P., Westmann, T.: On fast large-scale program analysis in Datalog. In: Proceedings of the 25th International Conference on Compiler Construction (CC 2016), pp. 196\u2013206. ACM (2016)","DOI":"10.1145\/2892208.2892226"},{"key":"4_CR17","unstructured":"Sch\u00fctz, H.: Tupelweise Bottom-up-Auswertung von Logikprogrammen (Tuple-wise bottom-up evaluation of logic programs). Ph.D. thesis, TU M\u00fcnchen (1993)"},{"key":"4_CR18","unstructured":"Smith, D.A., Utting, M.: Pseudo-naive evaluation. In: Australasian Database Conference, pp. 211\u2013223 (1999). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.177.5047"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74313-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T08:30:05Z","timestamp":1570609805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-74313-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319743127","9783319743134"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74313-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}