Tree-oriented Query Processing

Tree-Oriented Query Processing is a query processing paradigm in XML databases that operates on the inherent hierarchical structure of XML data by employing tree-based algebraic operations and optimization strategies to efficiently evaluate path expressions and structural queries.

218

Publications

13.4K

Citations

478

Authors

208

Institutions

Publications per year

2017–2026

9

Authors

478

  1. DS
    Divesh Srivastava

    AT&T (United States), United States

    8 publications · 2.4K citations

    8

    h-index

  2. GG
    Georg Gottlob

    TU Wien, Austria

    6 publications · 825 citations

    6

    h-index

  3. CK
    Christoph Koch

    Cornell University, United States

    6 publications · 318 citations

    6

    h-index

  4. LV
    Laks V. S. Lakshmanan

    University of British Columbia, Canada

    5 publications · 508 citations

    5

    h-index

  5. YP
    Yannis Papakonstantinou

    University of California San Diego, United States

    5 publications · 709 citations

    5

    h-index

1–5 of 478

Venues

  1. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 13 publications · 520 citations

    11

    h-index

  2. ACM SIGMOD Record

    8 publications · 299 citations

    8

    h-index

  3. Proceedings of the VLDB Endowment

    PVLDB · 6 publications · 136 citations

    6

    h-index

  4. ACM Transactions on Database Systems

    TODS · 5 publications · 134 citations

    5

    h-index

  5. Journal of Computer and System Sciences

    5 publications · 507 citations

    5

    h-index

1–5