Correlating XML Data Streams Using Tree-Edit Distance Embeddings

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn 22, Issue , 2003, Pages 143-154

  Garofalakis, Minos ^a   Kumar, Amit ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EMBEDDED SYSTEMS; INTERNET; MATHEMATICAL MODELS; QUERY LANGUAGES; RANDOM PROCESSES; TREES (MATHEMATICS); XML;

DATA STREAMS; VECTOR SPACES;

DATA HANDLING;

EID: 1142299759     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773153.773168     Document Type: Conference Paper

References (22)

1. Noga Alon, Phillip B.: Gibbons, Yossi Matias, and Mario Szegedy. "Tracking Join and Self-Join Sizes in Limited Storage". In Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadeplphia, Pennsylvania, May 1999.
2. Noga Alon, Yossi Matias, and Mario Szegedy. "The Space Complexity of Approximating the Frequency Moments". In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pages 20-29, Philadelphia, Pennsylvania, May 1996.
3. Alberto Apostolico and Zvi Galil, editors. "Pattern Matching Algorithms". Oxford University Press, 1997.
4. Ziv Bar-Yossef, T.S. Jayram, Ravi Kumar, D. Sivakumar, and Luca Trevisan. "Counting distinct elements in a data stream". In Proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM'02), Cambridge, Massachusetts, September 2002.
5. Chee-Yong Chan, Pascal Felber, Minos Garofalakis, and Rajeev Rastogi. "Efficient Filtering of XML Documents with XPath Expressions". In Proceedings of the Eighteenth International Conference on Data Engineering, San Jose, California, February 2002.
6. Moses Charikar, Kevin Chen, and Martin Farach-Colton. "Finding Frequent Items in Data Streams". In Proceedings of the International Colloquium on Automata, Languages, and Programming, Malaga, Spain, July 2002.
7. 1 Norm". In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, Canada, November 2002.
8. Graham Cormode, Mayur Datar, Piotr Indyk, and S. Muthukrishnan. "Comparing Data Streams Using Hamming Norms (How to Zero In)". In Proceedings of the 28th International Conference on Very Large Data Bases, Hong Kong, China, August 2002.
9. Graham Cormode and S. Muthukrishnan. "The String Edit Distance Matching Problem with Moves". In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, January 2002.
10. Alin Dobra, Minos Garofalakis, Johannes Gehrke, and Rajeev Rastogi. "Processing Complex Aggregate Queries over Data Streams". In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, Wisconsin, June 2002.
11. 1-Difference Algorithm for Massive Data Streams". In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, New York City, New York, October 1999.
12. Minos Garofalakis and Amit Kumar. "Correlating XML Data Streams Using Tree-Edit Distance Embeddings". Bell Labs Technical Memorandum, March 2003.
13. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, and Martin J. Strauss. "Surfing Wavelets on Streams: One-pass Summaries for Approximate Aggregate Queries". In Proceedings of the 27th International Conference on Very Large Data Bases, Roma, Italy, September 2001.
14. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, and Martin J. Strauss. "How to Summarize the Universe: Dynamic Maintenance of Quantiles". In Proceedings of the 28th International Conference on Very Large Data Bases, Hong Kong, China, August 2002.
15. Michael Greenwald and Sanjeev Khanna. "Space-Efficient Online Computation of Quantile Summaries". In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, Santa Barbara, California, May 2001.
16. Sudipto Guha, H.V. Jagadish, Nick Koudas, Divesh Srivastava, and Ting Yu. "Approximate XML Joins". In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, Wisconsin, June 2002.
17. Piotr Indyk. "Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation". In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 189-197, Redondo Beach, California, November 2000.
18. Piotr Indyk. "Algorithmic Aspects of Geometric Embeddings". In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, Las Vegas, Nevada, October 2001.
19. Richard M. Karp and Michael O. Rabin. "Efficient Randomized Pattern-Matching Algorithms". IBM Journal of Research and Development, 31(2):249-260, March 1987.
20. Donald E. Knuth. "The Art of Computer Programming (Vol. 1 / Fundamental Algorithms)". Reading, Mass.: Addison-Wesley Pub. Co., 1973.
21. Gurmeet Singh Manku and Rajeev Motwani. "Approximate Frequency Counts over Data Streams". In Proceedings of the 28th International Conference on Very Large Data Bases, Hong Kong, China, August 2002.
22. Nitin Thaper, Sudipto Guha, Piotr Indyk, and Nick Koudas. "Dynamic Multidimensional Histograms". In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, Wisconsin, June 2002.