Skip to main content
SpringerLink
Log in

Towards Approximate SQL – Infobright’s Approach

  • Conference paper
Book cover Rough Sets and Current Trends in Computing (RSCTC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6086))

Included in the following conference series:

Abstract

We discuss various ideas how to implement execution of approximate SQL statements within Infobright database engine. We first outline the engine’s architecture, which is designed entirely to work with standard SQL. We then discuss several possible extensions towards approximate querying and point out at some analogies with the principles of the theory of rough sets. Finally, we present the results of experiments obtained at the prototype level, both with respect to the speed of query execution and the accuracy of approximate answers.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beyer, K.S., Haas, P.J., Reinwald, B., Sismanis, Y., Gemulla, R.: On synopses for distinct-value estimation under multiset operations. In: SIGMOD, pp. 199–210 (2007)

    Google Scholar 

  2. Bruno, N., Chaudhuri, S., Gravano, L.: Top-k Selection Queries over Relational Databases: Mapping Strategies and Performance Evaluation. ACM Trans. Database Syst. 27(2) (2002)

    Google Scholar 

  3. Cannataro, M., Talia, D.: The knowledge grid. Commun. ACM 46(1), 89–93 (2003)

    Article  Google Scholar 

  4. Chakrabarti, K., Garofalakis, M.N., Rastogi, R., Shim, K.: Approximate query processing using wavelets. In: VLDB, pp. 199–223 (2001)

    Google Scholar 

  5. Chaudhuri, S., Das, G., Narasayya, V.R.: Optimized stratified sampling for approximate query processing. ACM Trans. Database Syst. 32(2) (2007)

    Google Scholar 

  6. Cuzzocrea, A.: Top-Down Compression of Data Cubes in the Presence of Simultaneous Multiple Hierarchical Range Queries. In: An, A., Matwin, S., Raś, Z.W., Ślęzak, D. (eds.) ISMIS 2008. LNCS (LNAI), vol. 4994, pp. 361–374. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Deligiannakis, A., Kotidis, Y., Vassalos, V., Stoumpos, V., Delis, A.: Another outlier bites the dust: Computing meaningful aggregates in sensor networks. In: ICDE, pp. 988–999 (2009)

    Google Scholar 

  8. Ganti, V., Lee, M.-L., Ramakrishnan, R.: ICICLES: Self-Tuning Samples for Approximate Query Answering. In: VLDB, pp. 176–187 (2000)

    Google Scholar 

  9. Gibbons, P.B., Matias, Y., Poosala, V.: Fast incremental maintenance of approximate histograms. ACM Trans. Database Syst. 27(3), 261–298 (2002)

    Article  Google Scholar 

  10. Hellerstein, J.M., Haas, P.J., Wang, H.J.: Online Aggregation. In: SIGMOD, pp. 171–182 (1997)

    Google Scholar 

  11. Hu, Y., Sundara, S., Srinivasan, J.: Supporting time-constrained SQL queries in Oracle. In: VLDB, pp. 1207–1218 (2007)

    Google Scholar 

  12. Kersten, M.L.: The database architecture jigsaw puzzle. In: ICDE, pp. 3–4 (2008)

    Google Scholar 

  13. Naouali, S., Missaoui, R.: Flexible query answering in data cubes. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol. 3589, pp. 221–232. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Nguyen, H.S., Nguyen, S.H.: Fast split selection method and its application in decision tree construction from large databases. Int. J. Hybrid Intell. Syst. 2(2), 149–160 (2005)

    MATH  Google Scholar 

  15. Pawlak, Z., Skowron, A.: Rudiments of rough sets. Inf. Sci. 177(1), 3–27 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Pedrycz, W.: From fuzzy sets to shadowed sets: Interpretation and computing. Int. J. Intell. Syst. 24(1), 48–61 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  17. Pedrycz, W., Skowron, A., Kreinovich, V. (eds.): Handbook of Granular Computing. Wiley, Chichester (2008)

    Google Scholar 

  18. Quafafou, M.: alpha-RST: a generalization of rough set theory. Inf. Sci. 124(1-4), 301–316 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  19. Sarawagi, S.: Information Extraction. Foundations and Trends in Databases 1(3), 261–377 (2008)

    Article  Google Scholar 

  20. Ślęzak, D., Eastwood, V.: Data warehouse technology by Infobright. In: SIGMOD, pp. 841–845 (2009)

    Google Scholar 

  21. Ślęzak, D., Kowalski, M.: Intelligent Data Granulation on Load: Improving Infobright’s Knowledge Grid. In: Lee, Y.-h., Kim, T.-h., Fang, W.-c., Ślęzak, D. (eds.) FGIT 2009. LNCS, vol. 5899, pp. 12–25. Springer, Heidelberg (2009)

    Google Scholar 

  22. Ślęzak, D., Sakai, H.: Automatic Extraction of Decision Rules from Non-deterministic Data Systems: Theoretical Foundations and SQL-Based Implementation. In: DTA, pp. 151–162 (2009)

    Google Scholar 

  23. Ślęzak, D., Wróblewski, J., Eastwood, V., Synak, P.: Brighthouse: an analytic data warehouse for ad-hoc queries. PVLDB 1(2), 1337–1345 (2008)

    Google Scholar 

  24. Wojnarski, M., Apanowicz, C., Eastwood, V., Ślęzak, D., Synak, P., Wojna, A., Wróblewski, J.: Method and system for data compression in a relational database. US Patent Application 2008/0071818 A1 (2008)

    Google Scholar 

  25. Ziarko, W.: Probabilistic approach to rough sets. Int. J. Approx. Reasoning 49(2), 272–284 (2008)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw, Banacha 2, 02-097, Warsaw, Poland

    Dominik Ślȩzak & Marcin Kowalski

  2. Infobright Inc., Poland, Krzywickiego 34 pok. 219, 02-078, Warsaw, Poland

    Dominik Ślȩzak & Marcin Kowalski

Authors
  1. Dominik Ślȩzak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcin Kowalski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Marcin Szczuka

  2. ICS, Warsaw University of Technology,,  

    Marzena Kryszkiewicz

  3. Department of Applied Computer Science, University of Winnipeg, R3B 2E9, Winnipeg, Manitoba, Canada

    Sheela Ramanna

  4. Dept. of Computer Science, The University of Wales, Aberystwyth, UK

    Richard Jensen

  5. Harbin Institute of Technology, PO Box 458, 150006, Harbin, China

    Qinghua Hu

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ślȩzak, D., Kowalski, M. (2010). Towards Approximate SQL – Infobright’s Approach. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds) Rough Sets and Current Trends in Computing. RSCTC 2010. Lecture Notes in Computer Science(), vol 6086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13529-3_67

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13529-3_67

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13528-6

  • Online ISBN: 978-3-642-13529-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation