Staircase Join : Teach a Relational DBMS to Watch its (Axis) Steps

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:db838ed3ecad39ee2e3ee7f1fbf0d531

GRUST, Torsten, Maurice van KEULEN, Jens TEUBNER, 2003. Staircase Join : Teach a Relational DBMS to Watch its (Axis) Steps. VLDB. Berlin, Sep 2003. In: Proceedings of the 29th Conference on Very Large Databases (VLDB). VLDB. Berlin, Sep 2003

@inproceedings{Grust2003Stair-6352, title={Staircase Join : Teach a Relational DBMS to Watch its (Axis) Steps}, year={2003}, booktitle={Proceedings of the 29th Conference on Very Large Databases (VLDB)}, author={Grust, Torsten and Keulen, Maurice van and Teubner, Jens} }

Relational query processors derive much of their effectiveness from the awareness of specific table properties like sort order, size, or absence of duplicate tuples. This text applies (and adapts) this successful principle to database-supported XML and XPath processing: the relational system is made tree aware, i.e., tree properties like subtree size, intersection of paths, inclusion or disjointness of subtrees are made explicit. We propose a local change to the database kernel, the staircase join, which encapsulates the necessary tree knowledge needed to improve XPath performance.<br />Staircase join operates on an XML encoding which makes this knowledge available at the cost of simple integer operations (e.g., +;6). We finally report on quite promising experiments with a staircase join enhanced main-memory database kernel. Teubner, Jens Keulen, Maurice van 2011-03-24T16:12:00Z Teubner, Jens application/pdf 2011-03-24T16:12:00Z First publ. in: Proceedings of the 29th Conference on Very Large Databases (VLDB), Berlin, Sept. 2003 2003 Keulen, Maurice van Grust, Torsten deposit-license Grust, Torsten eng Staircase Join : Teach a Relational DBMS to Watch its (Axis) Steps

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Staircase_Join_2003.pdf 112

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto