Efficient and Effective Query Answering for Trajectory Cuboids
- Cite this paper as:
- Masciari E. (2011) Efficient and Effective Query Answering for Trajectory Cuboids. In: Christiansen H., De Tré G., Yazici A., Zadrozny S., Andreasen T., Larsen H.L. (eds) Flexible Query Answering Systems. FQAS 2011. Lecture Notes in Computer Science, vol 7022. Springer, Berlin, Heidelberg
Trajectory data streams are huge amounts of data pertaining to time and position of moving objects generated by different sources continuously using a wide variety of technologies (e.g., RFID tags, GPS, GSM networks). Mining such amounts of data is challenging, since the possibility to extract useful information from this peculiar kind of data is crucial in many application scenarios such as vehicle traffic management, hand-off in cellular networks, supply chain management. Moreover, spatial data streams poses interesting challenges both for their proper definition and acquisition, thus making the mining process harder than for classical point data. In this paper, we address the problem of trajectory data streams On Line Analytical Processing, that revealed really challenging as we deal with data (trajectories) for which the order of elements is relevant. We propose an end to end framework in order to make the querying step quite effective. We performed several tests on real world datasets that confirmed the efficiency and effectiveness of the proposed techniques.
Unable to display preview. Download preview PDF.