{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:12:43Z","timestamp":1757311963232,"version":"3.37.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030432287"},{"type":"electronic","value":"9783030432294"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-43229-4_35","type":"book-chapter","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:03:53Z","timestamp":1584576233000},"page":"408-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Modifying Queries Strategy for Graph-Based Speculative Query Execution for RDBMS"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4593-120X","authenticated-orcid":false,"given":"Anna","family":"Sasak-Oko\u0144","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,19]]},"reference":[{"issue":"1","key":"35_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00778-003-0099-8","volume":"13","author":"V Hristidis","year":"2004","unstructured":"Hristidis, V., Papakonstantinou, Y.: Algorithms and applications for answering ranked queries using ranked views. VLDB J. 13(1), 49\u201370 (2004)","journal-title":"VLDB J."},{"issue":"7","key":"35_CR2","first-page":"3013","volume":"22","author":"EA Liles Jr","year":"1979","unstructured":"Liles Jr., E.A., Wilner, B.: Branch prediction mechanism. IBM Tech. Discl. Bull. 22(7), 3013\u20133016 (1979)","journal-title":"IBM Tech. Discl. Bull."},{"key":"35_CR3","unstructured":"Smith, J.E.: A study of branch prediction strategies. In: ISCA Conference Proceedings, New York, pp. 135\u2013148 (1981)"},{"key":"35_CR4","volume-title":"Introduction to Parallel Computing","author":"A Grama","year":"2003","unstructured":"Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Addison Wesley, Harlow (2003)","edition":"2"},{"key":"35_CR5","doi-asserted-by":"publisher","DOI":"10.1201\/9781420035155","volume-title":"Speculative Execution in High Performance Computer Architectures","author":"D Kaeli","year":"2005","unstructured":"Kaeli, D., Yew, P.: Speculative Execution in High Performance Computer Architectures. Chapman Hall\/CRC, Boca Raton (2005)"},{"key":"35_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09766-4","volume-title":"Encyclopedia of Parallel Computing A-D","author":"D Padua","year":"2011","unstructured":"Padua, D.: Encyclopedia of Parallel Computing A-D. Springer, Boston (2011)"},{"key":"35_CR7","unstructured":"Polyzotis, N., Ioannidis, Y.: Speculative query processing. In: CIDR Conference Proceedings, Asilomar, pp. 1\u201312 (2003)"},{"issue":"3","key":"35_CR8","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/321406.321418","volume":"14","author":"RM Karp","year":"1967","unstructured":"Karp, R.M., Miller, R.E., Winograd, S.: The organization of computations for uniform recurrence equations. J. ACM 14(3), 563\u2013590 (1967)","journal-title":"J. ACM"},{"issue":"4\u20135","key":"35_CR9","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.artint.2007.08.002","volume":"172","author":"G Barish","year":"2008","unstructured":"Barish, G., Knoblock, C.A.: Speculative plan execution for information gathering. Artif. Intell. 172(4\u20135), 413\u2013453 (2008)","journal-title":"Artif. Intell."},{"key":"35_CR10","unstructured":"Barish, G., Knoblock, C.A.: Speculative execution for information gathering plans. In: AIPS Conference Proceedings, Toulouse, pp. 184\u2013193 (2002)"},{"issue":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1109\/TKDE.2004.1269595","volume":"16","author":"PK Reddy","year":"2004","unstructured":"Reddy, P.K., Kitsuregawa, M.: Speculative locking protocols to improve performance for distributed database systems. IEEE Trans. Knowl. Data Eng. 16(2), 154\u2013169 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"35_CR12","volume-title":"Performance Enhancement of Read-only Transactions Using Speculative Locking Protocol","author":"T Ragunathan","year":"2007","unstructured":"Ragunathan, T., Krishna, R.P.: Performance Enhancement of Read-only Transactions Using Speculative Locking Protocol. IRISS, Hyderabad (2007)"},{"key":"35_CR13","unstructured":"Ragunathan, T., Krishna, R.P.: Improving the performance of read-only transactions through asynchronous speculation. In: SpringSim Conference Proceedings, Ottawa, pp. 467\u2013474 (2008)"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Sasak-Oko\u0144, A.: Speculative query execution in relational databases with graph modelling. In: Proceedings of the FEDCSIS, ACSIS, vol. 8, pp. 1383\u20131387 (2016)","DOI":"10.15439\/2016F123"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Sasak-Oko\u0144, A., Tudruj, M.: Graph-Based speculative query execution in relational data-bases. In: ISPDC 2017, July 2017. Innsbruck, Austria, CPS. IEEE Explore (2017)","DOI":"10.1109\/ISPDC.2017.14"},{"key":"35_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-78024-5_27","volume-title":"Parallel Processing and Applied Mathematics","author":"A Sasak-Oko\u0144","year":"2018","unstructured":"Sasak-Oko\u0144, A., Tudruj, M.: Graph-based speculative query execution for RDBMS. In: Wyrzykowski, R., Dongarra, J., Deelman, E., Karczewski, K. (eds.) PPAM 2017, Part I. LNCS, vol. 10777, pp. 303\u2013313. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-78024-5_27"},{"key":"35_CR17","unstructured":"TPC benchmarks (2015). \nhttp:\/\/www.tpc.org\/tpch\/default.asp"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Koutrika, G., Simitsis, A., Ioannidis, Y.: Conversational Databases: Explaining Structured Queries to Users, Technical Report Stanford InfoLab (2009)","DOI":"10.1109\/ICDE.2010.5447824"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Koutrika, G., Simitsis, A., Ioannidis, Y.: Explaining structured queries in natural language. In: ICDE Conference Proceedings, Long Beach, pp. 333\u2013344 (2010)","DOI":"10.1109\/ICDE.2010.5447824"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43229-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:09:48Z","timestamp":1584576588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43229-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030432287","9783030432294"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43229-4_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bialystok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ppam.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}