论文信息 - Compression of the Stream Array Data Structure - 字舞流文

Compression of the Stream Array Data Structure

In recent years, many approaches to XML twig pattern query (TPQ) processing have �� !�� "�#� #�� (b) ��

Radim Baca | Martin Pawlas | Radim Bača | Martin Pawlas

[1] Jennifer Widom,et al. Database Systems: The Complete Book , 2001 .

[2] Jignesh M. Patel,et al. Structural joins: a primitive for efficient XML query pattern matching , 2002, Proceedings 18th International Conference on Data Engineering.

[3] Beng Chin Ooi,et al. XR-tree: indexing XML data for efficient structural joins , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[4] Václav Snásel,et al. The Fast Fibonacci Decompression Algorithm , 2007, ArXiv.

[5] David J. DeWitt,et al. On supporting containment queries in relational database management systems , 2001, SIGMOD '01.

[6] Divesh Srivastava,et al. Index structures for matching XML twigs using relational query processors , 2007, Data Knowl. Eng..

[7] Torsten Grust,et al. Staircase Join: Teach a Relational DBMS to Watch its (Axis) Steps , 2003, VLDB.

[8] Divesh Srivastava,et al. Holistic twig joins: optimal XML pattern matching , 2002, SIGMOD '02.

[9] Douglas Comer,et al. Ubiquitous B-Tree , 1979, CSUR.

[10] Chun Zhang,et al. Storing and querying ordered XML using a relational database system , 2002, SIGMOD '02.

[11] Hua-Gang Li,et al. Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents , 2006, VLDB.