Technological advances have created an unprecedented availability of inexpensive sensors able to stream environmental data in real-time. However, we still seek appropriate data management technology capable of handling this onslaught of sampling in previously unavailable spatial and temporal density. Data stream engines (DSEs) are state of the art data management tools that have update throughput rates of up to 500k tuples/s. In previous work we have shown that DSEs can be extended to generate smooth representations of continuous spatio-temporal fields sampled by up to 250K sensors on-the-fly in near real-time, creating a new representation every second. In this paper we investigate a spatio-temporal stream operator framework that can efficiently execute predicate operators over such spatio-temporal fields. Typical predicates are e.g. "find all sub-areas in a field that are below or above a certain threshold value". We present the requirements, the approach taken, and our results along with a performance evaluation.
{"title":"Evaluating stream predicates over dynamic fields","authors":"J. Whittier, Qinghan Liang, Silvia Nittel","doi":"10.1145/2676552.2676553","DOIUrl":"https://doi.org/10.1145/2676552.2676553","url":null,"abstract":"Technological advances have created an unprecedented availability of inexpensive sensors able to stream environmental data in real-time. However, we still seek appropriate data management technology capable of handling this onslaught of sampling in previously unavailable spatial and temporal density. Data stream engines (DSEs) are state of the art data management tools that have update throughput rates of up to 500k tuples/s. In previous work we have shown that DSEs can be extended to generate smooth representations of continuous spatio-temporal fields sampled by up to 250K sensors on-the-fly in near real-time, creating a new representation every second. In this paper we investigate a spatio-temporal stream operator framework that can efficiently execute predicate operators over such spatio-temporal fields. Typical predicates are e.g. \"find all sub-areas in a field that are below or above a certain threshold value\". We present the requirements, the approach taken, and our results along with a performance evaluation.","PeriodicalId":272840,"journal":{"name":"Proceedings of the 5th ACM SIGSPATIAL International Workshop on GeoStreaming","volume":"67 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126773247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mark McKenney, R. Frye, Zachary Benchley, Logan Maughan
A temporal coverage operation computes the duration that a moving object covers a spatial area. We extend this notion into temporal coverage aggregates, in which the spatial area covered for a maximum or minimum amount of time by a moving region, or set of moving regions, is discovered.
{"title":"Temporal coverage aggregates over moving region streams","authors":"Mark McKenney, R. Frye, Zachary Benchley, Logan Maughan","doi":"10.1145/2676552.2676555","DOIUrl":"https://doi.org/10.1145/2676552.2676555","url":null,"abstract":"A temporal coverage operation computes the duration that a moving object covers a spatial area. We extend this notion into temporal coverage aggregates, in which the spatial area covered for a maximum or minimum amount of time by a moving region, or set of moving regions, is discovered.","PeriodicalId":272840,"journal":{"name":"Proceedings of the 5th ACM SIGSPATIAL International Workshop on GeoStreaming","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134279975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Proceedings of the 5th ACM SIGSPATIAL International Workshop on GeoStreaming","authors":"","doi":"10.1145/2676552","DOIUrl":"https://doi.org/10.1145/2676552","url":null,"abstract":"","PeriodicalId":272840,"journal":{"name":"Proceedings of the 5th ACM SIGSPATIAL International Workshop on GeoStreaming","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124853086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：