Skip to main content

Modifying Queries Strategy for Graph-Based Speculative Query Execution for RDBMS

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12043))

Abstract

The paper relates to parallel speculative method that supports query execution in relational database systems. The speculative algorithm is based on a dynamic analysis of input query stream in databases serviced in SQLite. A middleware called the Speculative Layer is introduced, which based on a specific graph representation of query streams chooses the Speculative Queries to be executed. The paper briefly presents the structure of the Speculative Layer and graph modeling method. Then an extended version of speculative algorithm is presented which assumes an increased number of modifying queries in input query stream. Each modifying query present in the analysed query stream endangers already executed Speculative Queries with possibly invalid data and blocks their further use. We propose more sophisticated modifying queries analysis which aims in reducing the number of Speculative Queries which have to be deleted and thus decreases the necessary data manipulations. Experimental results are presented based on the proposed algorithms assessment using a real testbed database serviced in SQLite.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Hristidis, V., Papakonstantinou, Y.: Algorithms and applications for answering ranked queries using ranked views. VLDB J. 13(1), 49–70 (2004)

    Article  Google Scholar 

  2. Liles Jr., E.A., Wilner, B.: Branch prediction mechanism. IBM Tech. Discl. Bull. 22(7), 3013–3016 (1979)

    Google Scholar 

  3. Smith, J.E.: A study of branch prediction strategies. In: ISCA Conference Proceedings, New York, pp. 135–148 (1981)

    Google Scholar 

  4. Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Addison Wesley, Harlow (2003)

    MATH  Google Scholar 

  5. Kaeli, D., Yew, P.: Speculative Execution in High Performance Computer Architectures. Chapman Hall/CRC, Boca Raton (2005)

    Book  Google Scholar 

  6. Padua, D.: Encyclopedia of Parallel Computing A-D. Springer, Boston (2011)

    Book  Google Scholar 

  7. Polyzotis, N., Ioannidis, Y.: Speculative query processing. In: CIDR Conference Proceedings, Asilomar, pp. 1–12 (2003)

    Google Scholar 

  8. Karp, R.M., Miller, R.E., Winograd, S.: The organization of computations for uniform recurrence equations. J. ACM 14(3), 563–590 (1967)

    Article  MathSciNet  Google Scholar 

  9. Barish, G., Knoblock, C.A.: Speculative plan execution for information gathering. Artif. Intell. 172(4–5), 413–453 (2008)

    Article  Google Scholar 

  10. Barish, G., Knoblock, C.A.: Speculative execution for information gathering plans. In: AIPS Conference Proceedings, Toulouse, pp. 184–193 (2002)

    Google Scholar 

  11. Reddy, P.K., Kitsuregawa, M.: Speculative locking protocols to improve performance for distributed database systems. IEEE Trans. Knowl. Data Eng. 16(2), 154–169 (2004)

    Article  Google Scholar 

  12. Ragunathan, T., Krishna, R.P.: Performance Enhancement of Read-only Transactions Using Speculative Locking Protocol. IRISS, Hyderabad (2007)

    Google Scholar 

  13. Ragunathan, T., Krishna, R.P.: Improving the performance of read-only transactions through asynchronous speculation. In: SpringSim Conference Proceedings, Ottawa, pp. 467–474 (2008)

    Google Scholar 

  14. Sasak-Okoń, A.: Speculative query execution in relational databases with graph modelling. In: Proceedings of the FEDCSIS, ACSIS, vol. 8, pp. 1383–1387 (2016)

    Google Scholar 

  15. Sasak-Okoń, A., Tudruj, M.: Graph-Based speculative query execution in relational data-bases. In: ISPDC 2017, July 2017. Innsbruck, Austria, CPS. IEEE Explore (2017)

    Google Scholar 

  16. Sasak-Okoń, 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–313. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-78024-5_27

    Chapter  Google Scholar 

  17. TPC benchmarks (2015). http://www.tpc.org/tpch/default.asp

  18. Koutrika, G., Simitsis, A., Ioannidis, Y.: Conversational Databases: Explaining Structured Queries to Users, Technical Report Stanford InfoLab (2009)

    Google Scholar 

  19. Koutrika, G., Simitsis, A., Ioannidis, Y.: Explaining structured queries in natural language. In: ICDE Conference Proceedings, Long Beach, pp. 333–344 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anna Sasak-Okoń .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sasak-Okoń, A. (2020). Modifying Queries Strategy for Graph-Based Speculative Query Execution for RDBMS. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K. (eds) Parallel Processing and Applied Mathematics. PPAM 2019. Lecture Notes in Computer Science(), vol 12043. Springer, Cham. https://doi.org/10.1007/978-3-030-43229-4_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-43229-4_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-43228-7

  • Online ISBN: 978-3-030-43229-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics