The week's pick
Random Articles
Reseach Article
Survey on Comparative Analysis of Queries over Historical Time Series
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 106 - Number 6 |
| Year of Publication: 2014 |
| Authors: Suganya Devi R, D Manjula |
10.5120/18527-9722
|
Suganya Devi R, D Manjula . Survey on Comparative Analysis of Queries over Historical Time Series. International Journal of Computer Applications. 106, 6 ( November 2014), 34-37. DOI=10.5120/18527-9722
Abstract
Most search engine queries are time dependent in retrieving the results. Time series analysis plays an important role in predicting the status of the query, at every time stamp to retrieve efficiently. Studies have shown that different approaches are used for different queries over time series. Generally they are broadly classified into two types of queries; exact match queries and pattern existence queries. Some applications need the existence of any one of the queries and while others may need both. Numerous methods have been employed to answer both the queries. Analyzing all these methods, the paper tries to survey some improved methods and have experimentally tested their effectiveness. Besides, it also studies some future directions on historical time series queries.
References
- Hao Wang, Yilun Cai, Yin Yang, Shiming Zhang, and Nikos Mamoulis, "Durable Queries over Historical Time Series," IEEE Computer Society 2014
- V. Athitsos, P. Papapetrou, M. Potamias, G. Kollios, and D. Gunopulos, "Approximate Embedding-Based Subsequence Matching of Time Series," Proc. ACM SIGMOD Int'l Conf. Management of Data, 2008.
- Q. Chen, L. Chen, X. Lian, Y. Liu, and J. X. Yu, "Indexable PLA for Efficient Similarity Search," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB), 2007.
- C. Faloutsos, M. Ranganathan, and Y. Manolopoulos, "Fast Subsequence Matching in Time-Series Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, 1994.
- R. H. Guting, T. Behr, and J. Xu, "Efficient K-Nearest Neighbor Search on Moving Object Trajectories," VLDB J. , vol. 19, pp. 687- 714, 2010.
- A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD Int'l Conf. Management of Data, 1984.
- I. F. Ilyas, G. Beskales, and M. A. Soliman, "A Survey of Top-K Query Processing Techniques in Relational Database Systems," ACM Computing Surveys, vol. 40, no. 4, pp. 11:1-11:58, 2008.
- J. Jestes, J. M. Phillips, F. Li, and M. Tang, "Ranking Large Temporal Data," Proc. VLDB Endowment, vol. 5, pp. 1412-1423, 2012.
- B. Jiang and J. Pei, "Online Interval Skyline Queries on Time Series," Proc. IEEE Int'l Conf. Data Eng. (ICDE), 2009.
- E. Keogh, "Exact Indexing of Dynamic Time Warping," Proc. 28th Int'l Conf. Very Large Data Bases (VLDB), 2002.
- M. L. Lee, W. Hsu, L. Li, and W. H. Tok, "Consistent Top-K Queries over Time," Proc. 14th Int'l Conf. Database Systems for Advanced Applications (DASFAA), 2009.
- F. Li, K. Yi, and W. Le, "Top-k Queries on Temporal Data," VLDB J. , vol. 19, pp. 715-733, 2010.
- L. H. U, N. Mamoulis, K. Berberich, and S. Bedathur, "Durable Top-K Search in Document Archives," Proc. ACM SIGMOD Int'l Conf. Management of Data, 2010.
- X. Yu, K. Q. Pu, and N. Koudas, "Monitoring K-Nearest Neighbor Queries over Moving Objects," Proc. Int'l Conf. Data Eng. (ICDE), 2005.
Index Terms
Keywords