Skip to main content

Handling Queries with a FILTER Clause

  • Chapter
  • First Online:
  • 191 Accesses

Part of the book series: SpringerBriefs in Applied Sciences and Technology ((BRIEFSPOLIMI))

Abstract

This chapter extends the ACQUA proposal presented in Chap. 3. It presents ACQUA.F, a new maintenance policy for an extended class of queries: the one that joins streaming data with the distributed data, and contains a filter constrain on distributed data. In addition, it explains how to combine this policy with the one proposed in the previous chapter. Finally, a set of experimental evaluations shows how the proposed policies guarantee reactiveness while keeping the replica fresh.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Notes

  1. 1.

    100 ms is the average response time of the REST APIs of Twitter that returns the information of a user given his/her ID. For more information see https://dev.twitter.com/rest/reference/get/users/lookup.

  2. 2.

    http://www.w3.org/TR/sparql11-federated-query/.

  3. 3.

    The wording smoothly changes over time means if \(?x=98\) in the previous evaluation and \(?x=101\) in the current evaluation, in next evaluation it is more likely that \(?x=99\) than jumping to \(?x=1000\).

  4. 4.

    The value of the Filtering Threshold is chosen to guarantee that no one of the original time-series crosses it.

  5. 5.

    Later, in the next chapter, it is found that determining the band a priori is not straightforward.

References

  1. Barbieri DF, Braga D, Ceri S, Valle ED, Grossniklaus M (2010) Querying rdf streams with c-sparql. ACM SIGMOD Record 39(1):20–26

    Google Scholar 

  2. Calbimonte JP, Jeung H, Corcho O, Aberer K (2012) Enabling query technologies for the semantic sensor web. Int J Semant Web Inf Syst 8:43–63

    Google Scholar 

  3. Dell’Aglio D, Calbimonte JP, Della Valle E, Corcho O (2015) Towards a unified language for rdf stream query processing. In: International semantic web conference. Springer, Cham, pp 353–363

    Google Scholar 

  4. Dell’Aglio D, Della Valle E, Calbimonte JP, Corcho O (2014) RSP-QL semantics: a unifying query model to explain heterogeneity of RDF stream processing systems. Int J Semant Web Inf Syst 10(4):17–44

    Google Scholar 

  5. Le-Phuoc D, Dao-Tran M, Parreira JX, Hauswirth M (2011) A native and adaptive approach for unified processing of linked streams and linked data. In: The Semantic Web–ISWC 2011. Springer, Berlin, pp 370–388

    Google Scholar 

  6. McGill R et al (1978) Variations of box plots. Am Statist 32(1):12–16

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shima Zahmatkesh .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Zahmatkesh, S., Della Valle, E. (2020). Handling Queries with a FILTER Clause. In: Relevant Query Answering over Streaming and Distributed Data. SpringerBriefs in Applied Sciences and Technology(). Springer, Cham. https://doi.org/10.1007/978-3-030-38339-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-38339-8_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-38338-1

  • Online ISBN: 978-3-030-38339-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics