Database Reference
In-Depth Information
21. Goldin, D. and Kanellakis, P. (1995). On Similarity Queries for Time-Series
Data. In
Proc. of CP '95, Cassis, France
.
22. Goldstein, J. and Ramakrishnan, R. (2000). Contrast Plots and p-Sphere
Trees: Space vs. Time in Nearest Neighbour Searches. In
Proc. of the VLDB,
Cairo
, pp. 429-440.
23. Grumbach, S., Rigaux, P., and Segoufin, L. (2000). Manipulating Interpolated
Data is Easier than you Thought. In
Proc. of the 26th VLDB
, pp. 156-165.
24. Jagadish, H.V., Mendelzon, A.O., and Milo, T. (1995). Similarity-Based
Queries. In
Proc. of the 14th ACMPODS
, pp. 36-45.
25. Kahveci, T. and Singh, A.K. (2001). Variable Length Queries for Time Series
Data. In
Proc. of IEEE ICDE
, pp. 273-282.
26. Keogh, E., Chakrabarti, K., Mehrotra, S., and Pazzani, M. (2001).
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series
Databases. In
Proc. of ACMSIGMOD
, pp. 151-162.
27. Keogh, E. and Pazzani, M. (2000). Scaling up Dynamic Time Warping for
Datamining Applications. In
Proc. 6th Int. Conf. on Knowledge Discovery
and Data Mining, Boston, MA
.
28. Kollios, G., Gunopulos, D., and Tsotras, V. (1999). On Indexing Mobile
Objects. In
Proc. of the 18th ACM Symp. on Principles of Database Systems
(PODS)
, pp. 261-272.
29. Lee, S.-L., Chun, S.-J., Kim, D.-H., Lee, J.-H., and Chung, C.-W. (2000).
Similarity Search for Multidimensional Data Sequences. In
Proc.ofICDE
,
pp. 599-608.
30. Levenshtein, V. (1966). Binary Codes Capable of Correcting Deletions, Inser-
tions, and Reversals. In
Soviet Physics — Doklady 10, 10
, pp. 707-710.
31. Park, S., Chu, W., Yoon, J., and Hsu, C. (2000) Ecient Searches for Similar
Subsequences of Different Lengths in Sequence Databases. In
Proc.ofICDE
,
pp. 23-32.
32. Perng, S., Wang, H., Zhang, S., and Parker, D.S. (2000). Landmarks: A New
Model for Similarity-Based Pattern Querying in Time Series Databases. In
Proc.ofICDE
, pp. 33-42.
33. Pfoser, D., Jensen, C., and Theodoridis, Y. (2000) Novel Approaches in Query
Processing for Moving Objects. In
Proc. of VLDB, Cairo Egypt
.
34. Pfoser, D. and Jensen, C.S. (1999). Capturing the Uncertainty of Moving-
Object Representations.
Lecture Notes in Computer Science
, 1651.
35. Qu, Y., Wang, C., and Wang, X. (1998). Supporting Fast Search in Time
Series for Movement Patterns in Multiple Scales. In
Proc.oftheACMCIKM
,
pp. 251-258.
36. Rafiei, D. and Mendelzon, A. (2000). Querying Time Series Data Based on
Similarity.
IEEE Transactions on Knowledge and Data Engineering
,
12
(5),
675-693.
37. Rice, S.V., Bunke, H., and Nartker, T. (1997). Classes of Cost Functions for
String Edit Distance.
Algorithmica
,
18
(2), 271-280.
38. Sakoe, H. and Chiba, S. (1978). Dynamic Programming Algorithm Optimiza-
tion for Spoken Word Recognition.
IEEE Trans. Acoustics, Speech and Signal
Processing (ASSP)
,
26
(1), 43-49.