Efficient similarity query in RFID trajectory databases

Authors:
Yanqiu Wang;Ge Yu;Yu Gu;Dejun Yue;Tiancheng Zhang
Affiliations:
Northeastern University, China;Northeastern University, China;Northeastern University, China;Northeastern University, China;Northeastern University, China
Venue:
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Year:
2010

Citing 12
Cited 0

Using Signature Files for Querying Time-Series Data

PKDD '97 Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery
Shape-Based Similarity Query for Trajectory of Mobile Objects

MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Similarity of event sequences

TIME '97 Proceedings of the 4th International Workshop on Temporal Representation and Reasoning (TIME '97)
Discovering Similar Multidimensional Trajectories

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Efficient set joins on similarity predicates

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Robust and fast similarity search for moving object trajectories

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
RFID data management for effective objects tracking

Proceedings of the 2007 ACM symposium on Applied computing
On the marriage of Lp-norms and edit distance

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A New Trajectory Search Algorithm Based on Spatio-temporal Similarity on Spatial Network

CIT '07 Proceedings of the 7th IEEE International Conference on Computer and Information Technology
Efficient storage scheme and query processing for supply chain management using RFID

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints

Proceedings of the VLDB Endowment
Scalable continuous range monitoring of moving objects in symbolic indoor space

Proceedings of the 18th ACM conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Similarity query is one of the most important operations in trajectory databases and this paper addresses this problem in RFID trajectory databases. Due to the special sensing manner, the model of RFID trajectory is different from the traditional trajectory, leading to the inefficiency of existing techniques. This paper proposes a novel distance function--EDEU(Edit Distance combined with Euclidean Distance), which supports the local time shifting and takes the distance between adjacent logic areas into consideration. We also develop two filter-refinement mechanisms based on Co-occurrence Degree and Length Dispersion Ratio to improve the efficiency of the similarity analysis. Furthermore, we extend our solution to determine the local similarity from the global dissimilarity trajectory pairs. The extensive experiments verify the efficiency of our proposed algorithms.