Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 26, Issue 2, 1997, Pages 289-300

  Korn, Flip ^a   Jagadish, H V ^b   Faloutso, Christos ^c  

^a University of Maryland ^*  (United States)

^b AT AND T LABS RESEARCH   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; DATA STRUCTURES; ERROR CORRECTION; INFORMATION MANAGEMENT; STORAGE ALLOCATION (COMPUTER);

DATA WAREHOUSES;

DATABASE SYSTEMS;

EID: 0031166708     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/253262.253332     Document Type: Article

References (29)

1. Rakesh Agrawal, Christos Faloutsos, and Arun Swami. Efficient similarity search in sequence databases. In Fourth Int. Conf., on Foundations of Data Organization and Algorithms (FODO), pages 69-84, Evanston, Illinois, October 1993. also available through anonymous ftp, from olympos.cs.umd.edu: ftp/pub/TechReports/fodo.ps.
2. Richard A. Becker, John M. Chambers, and Allan R. Wilks. The New S Language. Wadsworth & Brooks/Cole Advanced Books & Software, Pacific Grove, CA, 1988.
3. R.O. Duda and P.E. Hart. Pattern Classification and Scene Analysis. Wiley, New York, 1973.
4. Susan T. Dumais. Latent semantic indexing (lsi) and trec-2. In D. K. Harman, editor, The Second Text Retrieval Conference (TREC-2), pages 105-115, Gaithersburg, MD, March 1994. NIST. Special publication 500-215.
5. Susan Eggers and Arie Shoshani. Efficient access of compressed data. In Proceedings of the 6th VLDB Conference, volume 6, pages 205-211, 1980.
6. Martin Ester, Hans-Peter Kriegel, and Xiaowei Xu. Knowledge discovery in large spatial databases: Focusing techniques for efficient class identification. Proc. of 4th International Symposium on Large Spatial Databases, 1995.
7. Christos Faloutsos. Searching Multimedia Databases by Content. Kluwer Academic Inc., 1996. ISBN 0-7923-9777-0.
8. J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Technical Report No. MSR-TR-95-22, Microsoft, 1995.
9. John A. Hartigan. Clustering Algorithms. John Wiley & Sons, 1975.
10. Ted Johnson and Dennis Shasha. Hierarchical split cube forests for decision support. Technical report, Draft, September 1996.
11. I.T. Jolliffe. Principal Component Analysis. Springer Verlag, 1986.
12. J. Li, D. Rotem, and H. Wong. A new compression method with fast searching on large databases. In Proceedings of the 13th VLDB Conference, volume 13, pages 311-318, Brighton, England, 1987.
13. F. Murtagh. A survey of recent advances in hierarchical clustering algorithms. The Computer Journal, 26(4):354-359, 1983.
14. Raymond T. Ng and Jiawei Han. Efficient and effective clustering methods for spatial data mining. Proc. of VLDB Conf., pages 144-155, September 1994.
15. William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery. Numerical Recipes in C. Cambridge University Press, 1992. 2nd Edition.
16. Lawrence Rabiner and Biing-Hwang Juang. Fundamentals of Speech Recognition. Prentice Hall, 1993.
17. Lawrence Richard Rabiner and Bernard Gold. Theory and Application of Digital Signal Processing. Prentice-Hall, Englewood Cliffs, N.J., 1975.
18. Edie Rasmussen. Clustering algorithms. In William B. Frakes and Ricardo Baeza-Yates, editors, Information Retrieval: Data Structures and Algorithms, pages 419-442. Prentice Hall, 1992.
19. Mary Beth Ruskai, Gregory Beylkin, Ronald Coifman, Ingrid Daubechies, Stephane Mallat, Yves Meyer, and Louise Raphael. Wavelets and Their Applications. Jones and Bartlett Publishers, Boston, MA, 1992.
20. G. Salton E.A. Fox, and H. Wu. Extended boolean information retrieval. CACM, 26(11):1022-1036, November 1983.
21. Manfred Schroeder. Fractals, Chaos, Power Laws: Minutes From an Infinite Paradise. W.H. Freeman and Company, New York, 1991.
22. D.G. Severance and G.M. Lohman. Differential files: Their application to the maintenance of large databases. ACM TODS, 1(3):256-267, September 1976.
23. James A. Storer. Data Compression: Methods and Theory. Computer Science Press, Inc., 1988.
24. Gilbert Strang. Linear Algebra and its Applications. Academic Press, 1980. 2nd edition.
25. M. Turk and A. Pentland. Eigenfaces for recognition. Journal of Cognitive Neuroscience, 3(1):71-86, 1991.
26. C.J. Van-Rijsbergen. Information Retrieval. Butterworths, London, England, 1979. 2nd edition.
27. Andreas S. Weigend and Neil A. Gerschenfeld. Time Series Prediction: Forecasting the Future and Understanding the Past. Addison Wesley, 1994.
28. T. Zhang, R. Ramakrishnan, and M. Livny. Birch: An efficient data clustering method for very large databases. In SIGMOD '96, pages 103-114, Montreal, Canada, June 1996.
29. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. Information Theory, IT-23(3):337-343, May 1977.