BORA: Routing and Aggregation for Distributed Processing of Spatio-Temporal Range Queries

Trajcevski, Goce; Scheuermann, Peter; Cruz, Isabel F.

doi:10.1109/mdm.2007.15

Cited by 9 publications

(10 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A recent work that addresses the problem of efficient aggregation of answers for distributed processing of range queries is presented in [47]. This work assumes grid-like distribution of database servers.…”

Section: Distributed Systemsmentioning

confidence: 99%

A meta-index for querying distributed moving object database servers

Rodríguez

2010

Information Systems

View full text Add to dashboard Cite

Section: Distributed Systemsmentioning

confidence: 99%

A meta-index for querying distributed moving object database servers

Rodríguez

2010

Information Systems

View full text Add to dashboard Cite

“…However, in this paper, we address the latter class of queries only. An algorithm for processing range queries in a SP-MOD is given in [15]. As stated above, trajectory-based queries refer to the trajectory segment of a single MO.…”

Section: System Modelmentioning

confidence: 99%

“…In [15] Trajcevski et al present BORA for processing spatio-temporal range queries, i.e. coordinate-based queries.…”

Section: Related Workmentioning

confidence: 99%

“…If the queried region is small compared to the servers' service regions, then the query has to be routed to few servers only. An algorithm for efficient distributed processing of range queries has been proposed lately in [15]. On the other hand, for a trajectory-based query, the set of servers that store the queried data not only depends on the query parameters and the spatial partitioning but also on the actual route of the queried trajectory.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Scalable processing of trajectory-based queries in space-partitioned moving objects databases

Lange

Dürr

Rothermel

2008

Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

View full text Add to dashboard Cite

Space-partitioned Moving Objects Databases (SP-MODs) allow for the scalable, distributed management of large sets of mobile objects' trajectories by partitioning the trajectory data to a network of database servers.Processing a spatio-temporal query q therefore requires efficiently routing q to the servers storing the affected trajectory segments. With a coordinate-based query -like a spatio-temporal range query -the relevant servers are directly determined by the queried range. However, with trajectory-based queries -like retrieving the distance covered by a certain object during a given time interval -the relevant servers depend on actual movement of the queried object. Therefore, efficient routing mechanisms for trajectorybased queries are an important challenge in SP-MODs.In this paper, we present the Distributed Trajectory Index (DTI) that allows for such efficient query routing by creating an overlay network for each trajectory. We further present an enhanced index called DTI+S. It accelerates the processing of queries on aggregates of dynamic attributes, like the maximum speed during a time interval, by augmenting DTI with summaries of trajectory segments. Our simulations with a network of 1000 database servers show that DTI+S can reduce the overall processing time by more than 98%.

show abstract

“…Range queries [19,27] are one of the most popular coordinate-based queries in the context of location-based services (LBS). They return data relative to a consumer-specified Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.…”

Section: Introductionmentioning

confidence: 99%

Moving range queries in distributed complex event processing

Koldehofe

Ottenwälder

Rothermel

et al. 2012

Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems

View full text Add to dashboard Cite

Up to now, correlations in complex event processing (CEP) systems are detected by a well defined set of operators, whose configuration is determined ahead of deployment time. Although CEP operators involve location specific attributes, state of the art systems are heavily constrained in detecting situations where the interest in a situation changes depending on the consumer's location, e.g., with the movement of mobile devices.This paper adopts the concept of range queries to CEP systems. We propose a mobility-aware event delivery semantics and present a corresponding execution model, which accounts for mobility driven selection of primary event streams to the CEP system. By utilizing the properties of this execution model, we derive an algorithm that establishes low cost and coordinated reconfiguration of CEP operators in a distributed system. The algorithm minimizes the amount of information that needs to be streamed between operators and avoids additional delays as a result of a reconfiguration of CEP operators. We present an analysis of the algorithm's properties and evaluate the efficiency of the proposed reconfiguration algorithm.

show abstract

BORA: Routing and Aggregation for Distributed Processing of Spatio-Temporal Range Queries

Abstract: Abstract

Cited by 9 publications

References 23 publications

A meta-index for querying distributed moving object database servers

A meta-index for querying distributed moving object database servers

Scalable processing of trajectory-based queries in space-partitioned moving objects databases

Moving range queries in distributed complex event processing

Contact Info

Product

Resources

About