Skip to main content
SpringerLink
Log in

25\(+\) Years of Query Processing - From a Single, Stored Data Set to Big Data (and Beyond)

  • Chapter
  • First Online:
A Comprehensive Guide Through the Italian Database Research Over the Last 25 Years

Part of the book series: Studies in Big Data ((SBD,volume 31))

  • 2006 Accesses

Abstract

From the late 1970s, the database research community has devoted huge efforts in devising more and more effective and efficient solutions for processing queries against data. In this chapter, we retrace some of challenges that have been faced in the last 25 years to enable data to be effectively and efficiently queried and how the notions of queries and query processing themselves have evolved during these five lusters.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. D. Abadi et al., The Beckman report on database research. Commun. ACM 59(2), 92–99 (2016)

    Article  Google Scholar 

  2. D. Abadi et al, The design of the borealis stream processing engine, in CIDR (2005), pp. 277–289

    Google Scholar 

  3. S. Acharya et al. Join synopses for approximate query answering, in SIGMOD Conference (1999), pp. 275–286

    Google Scholar 

  4. C.C. Aggarwal, Data Streams: Models and Algorithms (Springer, Berlin, 2006)

    MATH  Google Scholar 

  5. S. Agrawal et al., Automated ranking of database query results, in CIDR (2003)

    Google Scholar 

  6. S. Amer-Yahia, S. Cho, D. Srivastava, Tree pattern relaxation, in EDBT (2002), pp. 496–513

    Google Scholar 

  7. S. Amer-Yahia et Al. Structure and content scoring for XML, in VLDB (2005), pp. 361–372

    Google Scholar 

  8. R. Avnur, J.M. Hellerstein, Eddies: continuously adaptive query processing, in SIGMOD Conference (2000), pp. 261–272

    Google Scholar 

  9. B. Babcock, M. Datar, R. Motwani, Load shedding for aggregation queries over data streams, in ICDE (2004), pp. 350–361

    Google Scholar 

  10. S. Babu, P. Bizarro, Adaptive query processing in the looking glass, in CIDR (2005), pp. 238–249

    Google Scholar 

  11. S. Babu et al. Adaptive ordering of pipelined stream filters, in SIGMOD Conference (2004), pp. 407–418

    Google Scholar 

  12. S. Babu, J. Widom, Continuous queries over data streams. ACM SIGMOD Rec. 30(3), 109–120 (2001)

    Article  Google Scholar 

  13. D. Barbará et al., The New Jersey data reduction report. IEEE Data Eng. Bull. 20(4), 3–45 (1997)

    Google Scholar 

  14. C.K. Baru et al., Xml-based information mediation with MIX, in SIGMOD Conference (1999), pp. 597–599

    Google Scholar 

  15. T. Berners-Lee et al., The semantic web. Sci. Am. 284(5), 28–37 (2001)

    Article  Google Scholar 

  16. C. Bizer, T. Heath, T. Berners-Lee, Linked data - the story so far. Semantic Services, Interoperability and Web Applications: Emerging Concepts (2009), pp. 205–227

    Google Scholar 

  17. V. Borkar, M.J. Carey, C.Li, Inside big data management: ogres, onions, or parfaits? in EDBT (ACM, 2012), pp. 3–14

    Google Scholar 

  18. S. Börzsönyi, D. Kossmann, K. Stocker, The skyline operator, in ICDE (2001), pp. 421–430

    Google Scholar 

  19. L. Bouganim et al., A dynamic query processing architecture for data integration systems. IEEE Data Eng. Bull. 23(2), 42–48 (2000)

    Google Scholar 

  20. B. Catania, F. De Fino, G. Guerrini, Recurring retrieval needs in diverse and dynamic dataspaces: issues and reference framework, in GraphQ Workshop, associated with EDBT (2017)

    Google Scholar 

  21. B. Catania, L. Jain, Advanced query processing, Volume 1: issues and trends. Intelligent Systems Reference Library, vol. 36 (Springer, 2013)

    Google Scholar 

  22. S. Chandrasekaran et al., TelegraphCQ: continuous dataflow processing for an uncertain world, in CIDR (2003)

    Google Scholar 

  23. S. Chaudhuri, V. Ganti, R. Kaushik, A primitive operator for similarity joins in data cleaning, in ICDE, vol. 5 (2006)

    Google Scholar 

  24. S. Chaudhuri, D. Umeshwar, An overview of data warehousing and OLAP technology. ACM, SIGMOD Rec. 26(1), 65–74 (1997)

    Article  Google Scholar 

  25. J. Chen, D et al., NiagaraCQ: a scalable continuous query system for internet databases, in SIGMOD Conference (2000), pp. 379–390

    Google Scholar 

  26. J. Considine et al., Robust approximate aggregation in sensor data management systems. ACM Trans. Database Syst. 34(1) (2009)

    Google Scholar 

  27. A. Corbellini et al., Persisting big-data: the NoSQL landscape. Inf. Syst. 63, 1–23 (2017)

    Article  Google Scholar 

  28. J. Dean, S. Ghemawat, MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107–113 (2008)

    Article  Google Scholar 

  29. A. Deshpande, Z.G. Ives, V. Raman, Adaptive query processing. Found. Trends Databases 1(1), 1–140 (2007)

    Article  MATH  Google Scholar 

  30. W. Fan, J. Huai, Querying big data: bridging theory and practice. J. Comput. Sci. Technol. 29(5), 849–869 (2014)

    Article  MathSciNet  Google Scholar 

  31. M. Franklin, A. Halevy, D. Maier, From databases to dataspaces: a new abstraction for information management. ACM SIGMOD Rec. 34(4), 27–33 (2005)

    Article  Google Scholar 

  32. M. Garofalakis, J. Gehrke, R. Rastogi, Data Stream Management: Processing High-Speed Data Streams (Springer, Berlin, 2007)

    Google Scholar 

  33. P.B. Gibbons, Y. Matias, Synopsis data structures for massive data sets, in External Memory Algorithms (American Mathematical Society, 1999), pp. 39–70

    Google Scholar 

  34. A.Y. Halevy, A. Rajaraman, J.J. Ordille, Data integration: the teenage years, in VLDB (2006), pp. 9–16

    Google Scholar 

  35. A. Harth et al., Data summaries for on-demand queries over linked data, in WWW (ACM, 2010), pp. 411–420

    Google Scholar 

  36. O. Hartig, M.T. Özsu, Linked data query processing, in ICDE (IEEE, 2014), pp. 1286–1289

    Google Scholar 

  37. T. Heath, C. Bizer, Linked Data: Evolving the Web into a Global Data Space. Synthesis Lectures on the Semantic Web (Morgan & Claypool Publishers, 2011)

    Google Scholar 

  38. I.F. Ilyas, G. Beskales, M.A. Soliman, A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 40(4) 2008

    Google Scholar 

  39. E. Ioannou et al., On-the-fly entity-aware query processing in the presence of linkage. PVLDB 3(1–2), 429–438 (2010)

    Google Scholar 

  40. Z.G. Ives et al., An adaptive query execution system for data integration, in SIGMOD Conference (1999), pp. 299–310

    Google Scholar 

  41. Z.G. Ives, A.Y. Halevy, D.S. Weld, Adapting to source properties in processing data integration queries, in SIGMOD Conference (2004), pp. 395–406

    Google Scholar 

  42. Y. Jiao, Maintaining stream statistics over multiscale sliding windows. ACM Trans. Database Syst. 31, 1305–1334 (2006)

    Article  Google Scholar 

  43. V. Kantere et al., Query relaxation across heterogeneous data sources, in SIGMOD Conference (2015), pp. 473–482

    Google Scholar 

  44. J. Koh et al., MapReduce skyline query processing with partitioning and distributed dominance tests. Inf. Sci. 375, 114–137 (2017)

    Article  Google Scholar 

  45. N. Koudas et al., Relaxing join and selection queries, in VLDB (2006), pp. 199–210

    Google Scholar 

  46. N. Koudas, D. Srivastava, Approximate joins: concepts and techniques, in VLDB, vol. 1363 (2005)

    Google Scholar 

  47. S. Madden et al., Continuously adaptive continuous queries over streams, in SIGMOD Conference (2002), pp. 49–60

    Google Scholar 

  48. I. Manolescu, D. Florescu, D. Kossmann, Answering XML queries on heterogeneous data sources, in VLDB (2001), pp. 241–250

    Google Scholar 

  49. Y. Mass et al., IQ: the case for iterative querying for knowledge, in CIDR (2011), pp. 38–44

    Google Scholar 

  50. C. Mishra, N. Koudas, Interactive query refinement, in EDBT (2009), pp. 862–873

    Google Scholar 

  51. P. Missier et al., Data quality support to on-the-fly data integration using adaptive query processing, in SEBD (2009), pp. 213–220

    Google Scholar 

  52. R. Motwani et al., Query processing, approximation, and resource management in a data stream management system, in CIDR (2003)

    Google Scholar 

  53. A. Poulovassilis, P. Selmer, P.T. Wood, Approximation and relaxation of semantic web path queries. J. Web Sem. 40, 1–21 (2016)

    Article  Google Scholar 

  54. B. Quilitz, U. Leser, Querying distributed RDF data sources with SPARQL, in ESWC (Springer, 2008), pp. 524–538

    Google Scholar 

  55. E.A. Rundensteiner et al., CAPE: continuous query engine with heterogeneous-grained adaptivity, in VLDB (2004), pp. 1353–1356

    Google Scholar 

  56. Y.N. Silva, W.G. Aref, M.H. Ali, The similarity join database operator, in ICDE (2010), pp. 892–903

    Google Scholar 

  57. N. Tatbul et al., Load shedding in a data stream manager, in VLDB (2003), pp. 309–320

    Google Scholar 

  58. J. Umbrich et al., Comparing data summaries for processing live queries over linked data. World Wide Web 14(5–6), 495–544 (2011)

    Article  Google Scholar 

  59. M.H. ur Rehman et al., Big data reduction methods: a survey. Data Sci. Eng. 1(4), 265–284 (2016)

    Google Scholar 

  60. T. Urhan, M.J. Franklin, L. Amsaleg, Cost based query scrambling for initial delays, in SIGMOD Conference (1998), pp. 130–141

    Google Scholar 

  61. K. Yi et al., Small synopses for group-by query verification on outsourced data streams. ACM Trans. Database Syst. 34(3) (2009)

    Google Scholar 

  62. X. Zhou et al., Query relaxation using malleable schemas, in SIGMOD Conference (2007), pp. 545–556

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Genoa, Genoa, Italy

    Barbara Catania & Giovanna Guerrini

Authors
  1. Barbara Catania
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giovanna Guerrini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Barbara Catania .

Editor information

Editors and Affiliations

  1. University of Calabria, Rende, Italy

    Sergio Flesca

  2. University of Calabria, Rende, Italy

    Sergio Greco

  3. ICAR-CNR, Rende, Italy

    Elio Masciari

  4. University of Calabria, Rende, Italy

    Domenico Saccà

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Cite this chapter

Catania, B., Guerrini, G. (2018). 25\(+\) Years of Query Processing - From a Single, Stored Data Set to Big Data (and Beyond). In: Flesca, S., Greco, S., Masciari, E., Saccà, D. (eds) A Comprehensive Guide Through the Italian Database Research Over the Last 25 Years. Studies in Big Data, vol 31. Springer, Cham. https://doi.org/10.1007/978-3-319-61893-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-61893-7_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-61892-0

  • Online ISBN: 978-3-319-61893-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation