Accelerating XPath evaluation in any RDBMS

ACM Transactions on Database Systems

Volumn 29, Issue 1 SPEC. ISS., 2004, Pages 91-131

  Grust, Torsten ^a   Van Keulen, Maurice ^b   Teubner, Jens ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Main memory databases; XML; XML indexing; XPath

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; ENCODING (SYMBOLS); FEEDBACK; HIERARCHICAL SYSTEMS; OPTIMIZATION; PROGRAM COMPILERS; PROGRAM DOCUMENTATION; SEMANTICS; TREES (MATHEMATICS); XML;

DATA EXCHANGE FORMATS; MAIN-MEMORY DATABASES; XML INDEXING; XPATH;

DATABASE SYSTEMS;

EID: 3042554070     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/974750.974754     Document Type: Conference Paper

References (30)

1. ALTINEL, M. AND FRANKLIN, M. J. 2000. Efficient filtering of XML documents for selective dissemination of information. In Proceedings of the 26th International Conference on Very Large Databases (VLDB) (Cairo, Egypt). Morgan-Kaufmann, San Francisco, Calif., 53-64.
2. BERGLUND, A., BOAG, S., CHAMBERLIN, D., FERNANDEZ, M. F., KAY, M., ROBIE, J., AND SIMEON, J. 2002. XML Path Language (XPath) 2.0. Tech. Rep. W3C Working Draft, Version 2.0, World Wide Web Consortium. Aug. http://www.w3.org/TR/ xpath20/.
3. BOAG, S., CHAMBERLIN, D., FERNANDEZ, M., FLORESCU, D., ROBIE, J., AND SIMEON, J. 2002. XQuery 1.0: An XML Query Language. Tech. Rep. W3C Working Draft, World Wide Web Consortium. Aug. http://www.w3.org/TR/xquery.
4. BÖHM, C., BERCHTOLD, S., KHIEGEL, H.-P., AND MICHEL, U. 2000. Multidimensional index structures in relational databases. J. Intel. Inf. Syst. (JIIS) 15, 1, 51-70.
5. BONCZ, P. A. 2002. Monet: A next-generation DBMS kernel for query-intensive applications. Ph.D. dissertation. University of Amsterdam, The Netherlands.
6. BONCZ, P. A. AND KERSTEN, M. L. 1999. MIL primitives for querying a fragmented world. The VLDB J. 8, 2, 101-119.
7. CHEN, Z., JAGADISH, H., KORN, F., KOUDAS, N., MUTHUKRISHNAN, S., No, R., AND SRIVASTAVA, D. 2001. Counting twig matches in a tree. In Proceedings of the 17th International Conference on Data Engineering (ICDE) (Heidelberg, Germany). IEEE Computer Society Press, Los Alamitos, Calif., 595-604.
8. COHEN, E., KAPLAN, H., AND MILO, T. 2002. Labeling dynamic XML trees. In Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) (Madison, Wise.). ACM, New York, 271-121.
9. COOPER, B. F., SAMPLE, N., FRANKLIN, M. J., HJALTASON, G. R., AND SHADMON, M. 2001. A fast index for semistructured data. In Proceedings of the 27th International Conference on Very Large Data Bases (VLDB) (Rome, Italy). Morgan-Kaufmann, San Francisco, Calif., 341-360.
10. DIETZ, P. F. AND SLEATOR, D. D. 1987. Two algorithms for maintaining order in a list. In Conference Record of the 19th Annual ACM Symposium on Theory of Computing (STOC). ACM, New York, 365-372.
11. FERNANDEZ, M., MARSH, J., AND NAGY, M. 2002. XQuery 1.0 and XPath 2.0 Data Model. Tech. Rep. W3C Working Draft, World Wide Web Consortium. Aug. http://www.w3.org/TR/query-datamodel.
12. FLORESCU, D. AND KOSSMANN, D. 1999. A performance evaluation of alternative mapping schemes for storing XML data in a relational database. Tech. Rep. 3680. INRIA, Rocquencourt, France. May.
13. GOLDMAN, R. AND WIDOM, J. 1997. DataGuides: Enabling query formulation and optimization in semistructured databases. In Proceedings of the 23rd International Conference on Very Large Databases (VLDB) (Athens, Greece). Morgan-Kaufmann, San Francisco, Calif., 436-445.
14. GOTTLOB, G., KOCH, C., AND PICHLER, R. 2002. Efficient algorithms for processing XPath queries. In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB) (Hong Kong, China). Morgan-Kaufmann, San Francisco, Calif., 95-106.
15. GRUST, T. 2002. Accelerating XPath location steps. In Proceedings of the 21st International ACM SIGMOD Conference on Management of Data (Madison, Wise.). ACM, New York, 109-120.
16. GRUST, T. AND VAN KEULEN, M. 2003. Tree awareness for relational database kernels: Staircase join. In Intelligent Search on XML, H. Blanken, H.-J. Sehek, and G. Weikum, Eds. Lecture Notes in Computer Science, vol. 2818. Springer-Verlag, Heidelberg, Germany.
17. GUTTMAN, A. 1984. R-trees: A dynamic index structure for spatial searching. In SIGMOD 1984, Proceedings of Annual Meeting (Boston, Mass.). ACM, New York, 47-57.
18. HELLERSTEIN, J. M., NAUGHTON, J. F., AND PFEFFER, A. 1995. Generalized search trees for database systems. In Proceedings of the 21st International Conference on Very Large Databases (VLDB) (Zurich, Switzerland). Morgan-Kaufmann, San Francisco, Calif., 562-573.
19. KAMEL, I. AND FALOUTSOS, C. 1993. On packing R-trees. In Proceedings of the 2nd International Conference on Information and Knowledge Management (CIKM) (Washington B.C.). ACM, New York, 490-499.
20. KAUSHIK, R., BOHANNON, P., NAUQHTON, J. F., AND KORTH, H. K. 2002. Covering indexes for branching path Queries. In Proceedings of the 21st International ACM SIGMOD Conference on Management of Data (Madison, Wise.). ACM, New York, 133-144.
21. KRIEOEL, H.-P, PÖTKE, M., AND SEIDL, T. 2000. Managing intervals efficiently in object-relational databases. In Proceedings of the 26th International Conference on Very Large Databases (VLDB) (Cairo, Egypt). Morgan-Kaufmann, San Francisco, Calif., 407-418.
22. LI, Q. AND MOON, B. 2001. Indexing and querying XML data for regular path expressions. In Proceedings of the 27th International Conference on Very Large Data Bases (VLDB) (Rome, Italy). Morgan-Kaufmann, San Francisco, Calif, 361-370.
23. OLTEANU, D., MEUSS, H., FURCHE, T., AND BRY, F. 2001. Symmetry in XPath. Tech. Rep. PMS-FB-2001-16. Institute of Computer Science, University of Munich, Munich, Germany.
24. ROUSSOPOULOS, N. AND LEIFKER, D. 1985. Direct spatial search on pictorial databases using packed R-trees. In Proceedings of the ACM SIGMOD International Conference on Management of Data (Austin, Tex.). ACM, New York, 17-31.
25. SAX (Simple API for XML). http://sax.sourceforge.net/.
26. SCHMIDT, A., WAAS, F., KERBTEN, M., CAREY, M. J., MANOLESCU, I., AND BUSSE, R. 2002. XMark: A Benchmark for XML Data Management. In Proceedings of the 28th International Conference on Very Large Databases (VLDB) (Honk Kong, China). Morgan-Kaufmann, San Francisco, Calif., 974-985.
27. SHANMUOASUNDARAM, J., TUFTE, K., HE, G., ZHANG, C., DEWITT, D., ANDNAUGHTON, J. 1999. Relational databases for querying XML documents: Limitations and opportunities. In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB) (Edinburgh, Scotland). Morgan-Kaufmann, San Francisco, Calif, 302-314.
28. SUCIU, D. AND MILO, T. 1999. Index structures for path expressions. In Proceedings of the 7th International Conference on Database Theory (ICDT) (Jerusalem, Israel). Lecture Notes in Computer Science, vol. 1540. Springer-Verlag, New York, 277-295.
29. WU, Y., PATEL, J. M., AND JAGADISH, H. 2002. Estimating answer sizes for XML queries. In Proceedings of the 8th International Conference on Extending Database Technology (EDBT) (Prague, Czech Republic). Springer-Verlag, New York, 590-608.
30. ZHANG, C., NAUGHTON, J., DEWITT, D., LUO, Q., AND LOHMAN, G. 2001. On supporting containment queries in relational database management systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data (Santa Barbara, Calif). ACM, New York, 425-436.