<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Conference Paper</dc:product_type><dc:title>Reachability Queries with Transfer Decay</dc:title><dc:creator>Strzheletska, Elena V.; Tsotras, Vassilis J.</dc:creator><dc:corporate_author/><dc:editor>null</dc:editor><dc:description>A spatiotemporal reachability query identifies whether a physical item (or information, virus etc.) could have been transferred from the source moving object OS to the target moving object OT during a time interval I (either directly, or through a chain of intermediate transfers). Previous work on spatiotemporal reachability queries, assumes the transferred information remains the same. This paper introduces a novel reachability query under the scenario of information decay. Such queries arise when the value of information (virus load etc.) that travels through the chain of intermediate objects decreases with each transfer. To address such queries efficiently over large spatiotemporal datasets, we introduce the RICCdecay algorithm. An experimental evaluation shows the efficiency of the proposed algorithm over previous approaches.</dc:description><dc:publisher/><dc:date>2021-06-01</dc:date><dc:nsf_par_id>10296183</dc:nsf_par_id><dc:journal_name>The IEEE International Conference on Mobile Data Management, MDM</dc:journal_name><dc:journal_volume/><dc:journal_issue/><dc:page_range_or_elocation>175 to 180</dc:page_range_or_elocation><dc:issn/><dc:isbn/><dc:doi>https://doi.org/10.1109/MDM52706.2021.00036</dc:doi><dcq:identifierAwardId>1831615</dcq:identifierAwardId><dc:subject/><dc:version_number/><dc:location/><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>