A New Structure for Accelerating XPath Location Steps
暂无分享,去创建一个
[1] Hans-Peter Kriegel,et al. Managing Intervals Efficiently in Object-Relational Databases , 2000, VLDB.
[2] Yaokai Feng,et al. Efficient Evaluation of Partially-Dimensional Range Queries Using Adaptive R*-tree , 2006, DEXA.
[3] Torsten. Grust,et al. Accelerating XPath location steps , 2002, SIGMOD '02.
[4] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[5] Michael J. Franklin,et al. A Fast Index for Semistructured Data , 2001, VLDB.
[6] 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).
[7] Dan Suciu,et al. Index Structures for Path Expressions , 1999, ICDT.
[8] S. Boag,et al. XQuery 1.0 : An XML query language, W3C Working Draft 12 November 2003 , 2003 .
[9] David J. DeWitt,et al. On supporting containment queries in relational database management systems , 2001, SIGMOD '01.
[10] Scott Boag,et al. XQuery 1.0 : An XML Query Language , 2007 .
[11] Roy Goldman,et al. DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases , 1997, VLDB.
[12] Quanzhong Li,et al. Indexing and Querying XML Data for Regular Path Expressions , 2001, VLDB.
[13] Torsten Grust,et al. Accelerating XPath evaluation in any RDBMS , 2004, TODS.
[14] Ioana Manolescu,et al. The XML benchmark project , 2001 .
[15] Paul F. Dietz,et al. Two algorithms for maintaining order in a list , 1987, STOC.
[16] Hanan Samet,et al. Distance browsing in spatial databases , 1999, TODS.