Cache-conscious automata for XML filtering

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2005, Pages 878-889

  He, Bingsheng ^a   Luo, Qiong ^a   Choi, Byron ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA-INTENSIVE SYSTEMS; HARDWARE CACHE BEHAVIOR; XML FILTERS;

AUTOMATION; DATA STRUCTURES; QUERY LANGUAGES;

XML;

EID: 28444439834     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2005.31     Document Type: Conference Paper

References (24)

1. A. Ailamaki, D. J. DeWitt, M. D. Hill, and M. Skounakis. Weaving relations for cache performance. VLDB, 2001.
2. M. Altinel and M. J. Franklin. Efficient filtering of XML documents for selective dissemination of information. VLDB, 2000.
3. C.-Y. Chan, P. Felber, M. Garofalakis, and R. Rastogi. Efficient filtering of XML documents with XPath expressions. In VLDB Journal, Special Issue on XML, Volume 11, Issue 4, 2002.
4. S. Chatterjee, V. V. Jain, A. R. Lebeck, S. Mundhra, and M. Thottethodi. Nonlinear array layouts for hierarchical memory systems. 13th International Conference on Super-Computing, 1999.
5. S. Chen, A. Ailamaki, P. B. Gibbons, and T. C. Mowry. Improving hash join performance through prefetching. ICDE, 2004.
6. S. Chen, P. B. Gibbons, T. C. Mowry, and G. Valentin. Fractal prefetching B+-trees: Optimizing both cache and disk performance. SIGMOD, 2001.
7. J. Clark and S. DeRose. XML path language (XPath) - version 1.0. http://www.w3.org/TR/xpath.
8. Y. Diao, M. Altinel, M. J. Franklin, H. Zhang, and P. Fischer. Path sharing and predicate evaluation for high-performance xml filtering. TODS, December 2003.
9. Y. Diao, P. Fischer, M. J. Franklin, and R. To. Yfilter: Efficient and scalable filtering of XML documents. ICDE, 2002.
10. T. J. Green, G. Miklau, M. Onizuka, and D. Suciu. Processing XML streams with deterministic automata. ICDT, 2002.
11. R. A. Hankins and J. M. Patel. Data morphing: An adaptive and cache-conscious storage technique. VLDB, 2002.
12. M. D. Hill and A. J. Smith. Evaluating associativity in cpu caches. IEEE Transactions on Computers 38(12): 1612-1630, 1989.
13. G. A. Kiraz. Compressed storage of sparse finite-state transducers. Workshop on Implementing Automata, 1999.
14. N. Klarlund and T. Rauhe. BDD algorithms and cache misses. Technical report, BRICS Report Series RS-96-5, University of Aarhus, 1996.
15. I. C. Laboratory. PAPI: Performance application programming interface, http://icl.cs.utk.edu/projects/papi/.
16. S. Manegold, P. Boncz, and M. Kersten. Generic database cost models for hierarchical memory systems. VLDB, 2002.
17. V. L. Maout. ASTL: Automaton Standard Template Library. http://www-igm.univ-mlv.fr/lemaout/.
18. T. S. P. Organization. Sax: Simple API for XML. http://www.saxproject. org.
19. J. Rao and K. A. Ross. Cache conscious indexing for decision-support in main memory. VLDB, 1999.
20. J. Rao and K. A. Ross. Making B+ trees cache conscious in main memory. SIGMOD, 2000.
21. A. Shatdal, C. Kant, and J. F. Naughton. Cache conscious algorithms for relational query processing. VLDB, 1994.
22. B. W. Watson. Practical optimizations for automata. Second International Workshop on Implementating Automata, 1997.
23. D. Wood. Theory of Computation. John Wiley, New York, NY, 1987.
24. J. Zhou and K. A. Ross. Buffering access to memoryresident index structure. VLDB, 2003.