DBScholar

Back to papers

Answering Tree Pattern Queries Using Views

Summary: Studies maximal contained rewritings for tree-pattern/XPath queries: schema-free MCRs may require exponentially many patterns, though existence is polynomial-time testable. Under nonrecursive, nonunion schemas, any MCR is a single efficiently computable TP. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
9663
Venue
VLDB
Year
2006
Pagerank
5.2351299e-05
Overall Rank
9,687 | 33.54%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{lakshmanan_vldb06,
        title = {{Answering Tree Pattern Queries Using Views}},
        author = {Lakshmanan, Laks V.S. and Wang, Hui (Wendy) and Zhao, Zheng (Jessica)},
        journal = {PVLDB},
        series = {{VLDB} '06},
        pages = {571--582},
        year = {2006}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,267 Structured Materialized Views for XML Queries 2007 VLDB 5.6597556e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers