View Item 
    •   Bozen-Bolzano Institutional Archive (BIA)
    • Free University of Bozen-Bolzano (UNIBZ)
    • Publications of the Faculty of Computer Science
    • Conference related Publications - Computer Science
    • View Item
    •   Bozen-Bolzano Institutional Archive (BIA)
    • Free University of Bozen-Bolzano (UNIBZ)
    • Publications of the Faculty of Computer Science
    • Conference related Publications - Computer Science
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Kappa-Join: Efficient Execution of Existential Quantification in XML Query Languages

    Date
    2006
    Author
    Brantner, M
    Helmer, S
    Kanne, CC
    Moerkotte, G
    Metadata
    Show full item record
    Abstract
    XML query languages feature powerful primitives for formulating queries, involving comparison expressions which are existentially quantified. If such comparisons involve several scopes, they are correlated and, thus, become difficult to evaluate efficiently. In this paper, we develop a new ternary operator, called Kappa-Join, for efficiently evaluating queries with existential quantification. In XML queries, a correlation predicate can occur conjunctively and disjunctively. Our decorrelation approach not only improves performance in the conjunctive case, but also allows decorrelation of the disjunctive case. The latter is not possible with any known technique. In an experimental evaluation, we compare the query execution times of the Kappa-Join with existing XPath evaluation techniques to demonstrate the effectiveness of our new operator
    URI
    http://hdl.handle.net/10863/939
    Collections
    • Conference related Publications - Computer Science

    Browse

    All of BIACommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Admin Login
    Privacy | Contact Us | About
    © UniBz